Porovnat metody

	Turbo kódování s iterativním dekódováním	Multiple-Input Multiple-Output (MIMO)
Obor	Telekomunikace	Telekomunikace
Rodina	Process / pipeline	Process / pipeline
Rok vzniku	1993	1995
Tvůrce	Claude Berrou, Alain Glavieux, and Punya Thitimajshima	Telatar, Foschini, and Gans
Typ	iterative error-correcting code	spatial multiplexing technique
Původní zdroj	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.	Telatar, I. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 10(6), 585-595.
Další názvy	iterative decoding, concatenated codes	spatial multiplexing, antenna diversity
Příbuzné	5	5
Shrnutí	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.	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.