By Topic

Optimal placement of training for 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

3 Author(s)
Adireddy, S. ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA ; Lang Tong ; Viswanathan, H.

The problem of placing training symbols optimally for orthogonal frequency-division multiplexing (OFDM) and single-carrier systems is considered. The channel is assumed to be quasi-static with a finite impulse response of length (L + 1) samples. Under the assumptions that neither the transmitter nor the receiver knows the channel, and that the receiver forms a minimum mean square error (MMSE) channel estimate based on training symbols only, training is optimized by maximizing a tight lower bound on the ergodic training-based independent and identically distributed (i.i.d.) capacity. For OFDM systems, it is shown that the lower bound is maximized by placing the known symbols periodically in frequency. For single-carrier systems, under the assumption that the training symbols are placed in clusters of length α ≥ (2L + 1), it is shown that the lower bound is maximized by a family of placement schemes called QPP-α, where QPP stands for quasi-periodic placement. These placement schemes are formed by grouping the known symbols into as many clusters as possible and then placing these clusters periodically in the packet. For both OFDM and single-carrier systems, the optimum energy tradeoff between training and data is also obtained.

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 8 )