ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

Shannon Capacity×تقنية الإدخال المتعدد والإخراج المتعدد (MIMO)×
المجالالاتصالاتالاتصالات
العائلةProcess / pipelineProcess / pipeline
سنة النشأة19481995
صاحب الطريقةClaude ShannonTelatar, Foschini, and Gans
النوعfundamental theoretical boundspatial multiplexing technique
المصدر التأسيسيShannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423. DOI ↗Telatar, I. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 10(6), 585-595. DOI ↗
الأسماء البديلةchannel capacity, information theory boundspatial multiplexing, antenna diversity
ذات صلة55
الملخص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.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.
ScholarGateمجموعة البيانات
  1. v1
  2. 2 المصادر
  3. PUBLISHED
  1. v1
  2. 2 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Shannon Capacity · MIMO. استُرجع بتاريخ 2026-06-18 من https://scholargate.app/ar/compare