방법 비교

	Alamouti 시공간 블록 부호	섀넌 채널 용량 정리	반복 복호화를 이용한 터보 코딩
분야	통신공학	통신공학	통신공학
계열	Process / pipeline	Process / pipeline	Process / pipeline
기원 연도	1998	1948	1993
창시자	Siavash Alamouti	Claude Shannon	Claude Berrou, Alain Glavieux, and Punya Thitimajshima
유형	space-time coding scheme	fundamental theoretical bound	iterative error-correcting code
원전	Alamouti, S. M. (1998). A simple transmit diversity technique for wireless communications. IEEE Journal on Selected Areas in Communications, 16(8), 1451-1458.	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.	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.
별칭	space-time coding, transmit diversity	channel capacity, information theory bound	iterative decoding, concatenated codes
관련	5	5	5
요약	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.	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.	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.