Porównaj metody

	Kod czasoprzestrzenny Alamoutiego	Kodowanie turbo z dekodowaniem iteracyjnym
Dziedzina	Telekomunikacja	Telekomunikacja
Rodzina	Process / pipeline	Process / pipeline
Rok powstania	1998	1993
Twórca	Siavash Alamouti	Claude Berrou, Alain Glavieux, and Punya Thitimajshima
Typ	space-time coding scheme	iterative error-correcting code
Źródło pierwotne	Alamouti, S. M. (1998). A simple transmit diversity technique for wireless communications. IEEE Journal on Selected Areas in Communications, 16(8), 1451-1458.	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.
Inne nazwy	space-time coding, transmit diversity	iterative decoding, concatenated codes
Pokrewne	5	5
Podsumowanie	The Alamouti code is an elegant space-time coding scheme that provides full transmit diversity using two antennas and a simple linear receiver. Introduced by Siavash Alamouti in 1998, it requires no channel state information at the transmitter, achieves the same bit-error rate as a single-antenna system with receiver diversity, and uses linear processing for decoding. The Alamouti code has become the de facto standard for transmit diversity in cellular systems and is adopted in LTE, WiFi, and many 5G protocols.	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.