مقایسهٔ روش‌ها

	کد بلوکی فضازمان آلاموتی	قضیه ظرفیت کانال شانون
حوزه	مخابرات	مخابرات
خانواده	Process / pipeline	Process / pipeline
سال پیدایش	1998	1948
پدیدآور	Siavash Alamouti	Claude Shannon
نوع	space-time coding scheme	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.	Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423.
نام‌های دیگر	space-time coding, transmit diversity	channel capacity, information theory bound
مرتبط	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.