By Topic

Bounds on the Capacity of OFDM Underspread Frequency Selective Fading Channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Itsik Bergel ; School of Engineering, Bar-Ilan University, Ramat-Gan, Israel ; Sergio Benedetto

The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years. Yet, the noncoherent channel capacity is still unknown for the general case. In this paper, we derive bounds on the capacity of the noncoherent, underspread complex Gaussian, orthogonal frequency division multiplexing, wide sense stationary channel with uncorrelated scattering, under a peak power constraint or a constraint on the second and fourth moments of the transmitted signal. These bounds are characterized only by the system signal-to-noise ratio (SNR) and by a newly defined quantity termed effective coherence time. Intuitively, the effective coherence time can be interpreted as the length of a block in the block-fading model in which a system with the same SNR will achieve the same capacity as in the analyzed channel. Unlike commonly used coherence time definitions, it is shown that the effective coherence time depends on the SNR, and is a nonincreasing function of it. We show that for low SNR, the capacity is proportional to the effective coherence time, while for higher SNR, the coherent channel capacity can be achieved provided that the effective coherence time is large enough.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 10 )