By Topic

Optimization of Training and Feedback Overhead for Beamforming Over 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)
Santipach, Wiroonsak ; Dept. of Electr. Eng., Kasetsart Univ., Bangkok, Thailand ; Honig, M.L.

We examine the capacity of beamforming over a single-user, multiantenna link taking into account the overhead due to channel estimation and limited feedback of channel state information. Multi-input-single-output (MISO) and multi-input-multi-output (MIMO) channels are considered subject to block Rayleigh fading. Each coherence block contains L symbols, and is spanned by T training symbols, B feedback bits, and the data symbols. The training symbols are used to obtain a minimum mean squared error estimate of the channel matrix. Given this estimate, the receiver selects a transmit beamforming vector from a codebook containing 2B i.i.d. random vectors, and sends the corresponding B bits back to the transmitter. We derive bounds on the beamforming capacity for MISO and MIMO channels and characterize the optimal (rate-maximizing) training and feedback overhead (T and B) as L and the number of transmit antennas Nt both become large. The optimal Nt is limited by the coherence time, and increases as L/logL. For the MISO channel the optimal T/L and B/L (fractional overhead due to training and feedback) are asymptotically the same, and tend to zero at the rate 1/log Nt. For the MIMO channel the optimal feedback overhead B/L tends to zero faster (as 1/log2 Nt).

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 12 )