Sammenlign metoder

	Polarkoder med successiv annulleringsafkodning	Turbokodning med iterativ afkodning
Fagområde	Telekommunikation	Telekommunikation
Familie	Process / pipeline	Process / pipeline
Oprindelsesår	2009	1993
Ophavsperson	Erdal Arikan	Claude Berrou, Alain Glavieux, and Punya Thitimajshima
Type	recursive error-correcting code	iterative error-correcting code
Oprindelig kilde	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.	Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error-correcting coding and decoding: Turbo-codes. In Proceedings of the IEEE International Conference on Communications (ICC), 1064-1070.
Aliasser	channel polarization, recursive codes	iterative decoding, concatenated codes
Relaterede	5	5
Resumé	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.	Turbo codes, introduced by Berrou, Glavieux, and Thitimajshima in 1993, are a landmark in channel coding history. They achieve performance within 0.5 dB of the Shannon limit—the theoretical boundary for reliable communication—a feat previously thought impossible with practical complexity. Turbo codes use concatenated convolutional codes with an interleaver and iterative decoding via belief propagation. They were adopted in 3G (UMTS) and remain important in 4G/5G systems alongside LDPC codes.