Σύγκριση μεθόδων

	Κώδικας Χώρου-Χρόνου Μπλοκ Alamouti	Πολλαπλών Εισόδων Πολλαπλών Εξόδων (MIMO)	Θεώρημα Χωρητικότητας Καναλιού του Shannon
Πεδίο	Τηλεπικοινωνίες	Τηλεπικοινωνίες	Τηλεπικοινωνίες
Οικογένεια	Process / pipeline	Process / pipeline	Process / pipeline
Έτος προέλευσης	1998	1995	1948
Δημιουργός	Siavash Alamouti	Telatar, Foschini, and Gans	Claude Shannon
Τύπος	space-time coding scheme	spatial multiplexing technique	fundamental theoretical bound
Θεμελιώδης πηγή	Alamouti, S. M. (1998). A simple transmit diversity technique for wireless communications. IEEE Journal on Selected Areas in Communications, 16(8), 1451-1458.	Telatar, I. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 10(6), 585-595.	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.
Εναλλακτικές ονομασίες	space-time coding, transmit diversity	spatial multiplexing, antenna diversity	channel capacity, information theory bound
Συναφείς	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.	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.	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.