Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Daudzkanālu ieejas un daudzkanālu izejas (MIMO)× | Šenona kanāla ietilpības teorēma× | |
|---|---|---|
| Nozare | Telekomunikācijas | Telekomunikācijas |
| Saime | Process / pipeline | Process / pipeline |
| Izcelsmes gads≠ | 1995 | 1948 |
| Autors≠ | Telatar, Foschini, and Gans | Claude Shannon |
| Tips≠ | spatial multiplexing technique | fundamental theoretical bound |
| Pirmavots≠ | Telatar, I. (1999). Capacity of multi-antenna Gaussian channels. European Transactions on Telecommunications, 10(6), 585-595. DOI ↗ | Shannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423. DOI ↗ |
| Citi nosaukumi | spatial multiplexing, antenna diversity | channel capacity, information theory bound |
| Saistītās | 5 | 5 |
| Kopsavilkums≠ | 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. |
| ScholarGateDatu kopa ↗ |
|
|