ScholarGate
Asistent

Porovnat metody

Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.

Teorém Shannonovy kapacity kanálu×Ortogonální dělení frekvence (OFDM)×
OborTelekomunikaceTelekomunikace
RodinaProcess / pipelineProcess / pipeline
Rok vzniku19481971
TvůrceClaude ShannonWeinstein and Ebert
Typfundamental theoretical boundmulticarrier modulation scheme
Původní zdrojShannon, C. E. (1948). A mathematical theory of communication. Bell System Technical Journal, 27(3), 379-423. DOI ↗Weinstein, S. B., & Ebert, P. M. (1971). Data transmission by frequency-division multiplexing using the discrete Fourier transform. IEEE Transactions on Communication Technology, 19(5), 628-634. DOI ↗
Další názvychannel capacity, information theory boundmulticarrier modulation
Příbuzné55
Shrnutí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.OFDM is a multicarrier modulation technique that divides a wideband channel into many narrowband orthogonal subcarriers. Introduced by Weinstein and Ebert in 1971, it exploits the duality between time and frequency domains to efficiently use spectrum while mitigating intersymbol interference in frequency-selective channels. OFDM is now the standard for high-speed wireless systems including WiFi, cellular LTE, and digital broadcasting.
ScholarGateDatová sada
  1. v1
  2. 2 Zdroje
  3. PUBLISHED
  1. v1
  2. 2 Zdroje
  3. PUBLISHED

Přejít na hledání Stáhnout prezentaci

ScholarGatePorovnat metody: Shannon Capacity · OFDM. Získáno 2026-06-18 z https://scholargate.app/cs/compare