Cart (Loading....) | Create Account
Close category search window
 

On Communication Over Unknown Sparse Frequency-Selective Block-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
$31 $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)
Kannu, A.P. ; Dept. of Electr. Eng., Indian Inst. of Technol., Chennai, India ; Schniter, P.

This paper considers the problem of reliable communication over discrete-time channels whose impulse responses have length L and exactly SL non-zero coefficients, and whose support and coefficients remain fixed over blocks of N >; L channel uses but change independently from block to block. Here, it is assumed that the channel's support and coefficient realizations are both unknown, although their statistics are known. Assuming Gaussian non-zero-coefficients and noise, and focusing on the high-SNR regime, it is first shown that the ergodic noncoherent channel capacity has pre-log factor 1-(S)/(N) for any L. It is then shown that, to communicate with arbitrarily small error probability at rates in accordance with the capacity pre-log factor, it suffices to use pilot-aided orthogonal frequency-division multiplexing (OFDM) with S pilots per fading block, in conjunction with an appropriate noncoherent decoder. Since the achievability result is proven using a noncoherent decoder whose complexity grows exponentially in the number of fading blocks K, a simpler decoder, based on S+1 pilots, is also proposed. Its ε-achievable rate is shown to have pre-log factor equal to 1-(S+1)/(N) with the previously considered channel, while its achievable rate is shown to have pre-log factor 1-(S+1)/(N) when the support of the block-fading channel remains fixed over time.

Published in:

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

Date of Publication:

Oct. 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.