Sciweavers

1031 search results - page 62 / 207
» The single-serving channel capacity
Sort
View
VTC
2008
IEEE
120views Communications» more  VTC 2008»
15 years 5 months ago
Near-Capacity Iteratively Decoded Space-Time Block Coding
— Iteratively decoded near-capacity Space-Time Block Coding (STBC) schemes are designed. Recursive unity-rate codes and IRregular Convolutional Codes (IRCCs) are employed for ass...
Soon Xin Ng, Sushanta Das, Jin Wang, Lajos Hanzo
ICC
2007
IEEE
15 years 5 months ago
Accurate Approximations for the Capacity Distribution of OFDM-Based Spatial Multiplexing
Abstract— We derive new analytic approximations to the capacity distribution of frequency-selective Rayleigh fading MIMO channels. The results apply specifically to OFDM-based s...
Matthew R. McKay, Peter J. Smith, Himal A. Surawee...
VTC
2008
IEEE
146views Communications» more  VTC 2008»
15 years 5 months ago
How Typical is the "Typical Urban" channel model?
— Channel models for urban deployments are among the most commonly used in research, standardization, and dimensioning of cellular networks. The time dispersion has ever been an ...
Henrik Asplund, Kjell Larsson, Peter Ökvist
VTC
2007
IEEE
113views Communications» more  VTC 2007»
15 years 5 months ago
Channel Prediction Heuristics for Adaptive Modulation in WLAN
— Channel-adaptive techniques increase the efficiency of wireless communications, as they are efficient in coping with the quality variation of the wireless channels. However, ...
Ana Aguiar, Adam Wolisz
CORR
2008
Springer
104views Education» more  CORR 2008»
14 years 10 months ago
The Case for Structured Random Codes in Network Capacity Theorems
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for pro...
Bobak Nazer, Michael Gastpar