Comparar métodos

	Códigos Polares con Decodificación por Cancelación Sucesiva	Múltiple Entrada Múltiple Salida (MIMO)
Campo	Telecomunicaciones	Telecomunicaciones
Familia	Process / pipeline	Process / pipeline
Año de origen	2009	1995
Autor original	Erdal Arikan	Telatar, Foschini, and Gans
Tipo	recursive error-correcting code	spatial multiplexing technique
Fuente seminal	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.
Alias	channel polarization, recursive codes	spatial multiplexing, antenna diversity
Relacionados	5	5
Resumen	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.