পদ্ধতির তুলনা করুন

	সাকসেসিভ ক্যান্সেলেশন ডিকোডিং সহ পোলার কোড	মাল্টিপল-ইনপুট মাল্টিপল-আউটপুট (MIMO)	শ্যেনন চ্যানেল ক্যাপাসিটি থিওরেম
ক্ষেত্র	টেলিযোগাযোগ	টেলিযোগাযোগ	টেলিযোগাযোগ
পরিবার	Process / pipeline	Process / pipeline	Process / pipeline
উদ্ভবের বছর	2009	1995	1948
প্রবর্তক	Erdal Arikan	Telatar, Foschini, and Gans	Claude Shannon
ধরন	recursive error-correcting code	spatial multiplexing technique	fundamental theoretical bound
মৌলিক উৎস	Arikan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051-3073.	Telatar, I. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 10(6), 585-595.	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.
অপর নাম	channel polarization, recursive codes	spatial multiplexing, antenna diversity	channel capacity, information theory bound
সম্পর্কিত	5	5	5
সারসংক্ষেপ	Polar codes, introduced by Erdal Arikan in 2009, are the first constructive family of codes proven to achieve the Shannon capacity of symmetric binary-input memoryless channels. They use recursive construction and successive cancellation decoding, a simple greedy algorithm with theoretical guarantees. Polar codes were adopted in 5G NR for control channel coding and are studied for future 6G systems. Unlike turbo and LDPC codes (which are empirical), polar codes provide rigorous theoretical foundations.	MIMO is a technique that uses multiple transmit and receive antennas to significantly increase channel capacity and reliability. Pioneered theoretically by Telatar (1999) and Foschini & Gans (1998), MIMO exploits multipath propagation—typically a liability in wireless—as an asset by creating independent spatial channels. It is now fundamental to all modern wireless systems including LTE, WiFi-6, and 5G, where it provides both capacity gains through spatial multiplexing and robustness through diversity.	Shannon's channel capacity theorem, published in 1948, establishes the maximum rate at which information can be reliably transmitted over a noisy channel. Expressed as C = B log2(1 + S/N) for additive white Gaussian noise (AWGN), it is a fundamental bound in information theory and communications engineering. Shannon proved that reliable communication is possible at any rate below capacity, and impossible above it. This theorem underpins the design of all modern communication systems and motivates coding theory, modulation, and signal processing techniques.