Abstract-Given a multiple-input multiple-output (MIMO) channel, feedback from the receiver can be used to specify a transmit precoding matrix, which selectively activates the strongest channel modes. Here we analyze the performance of Random Vector Quantization (RVQ), in which the precoding matrix is selected from a random codebook containing independent, isotropically distributed entries. We assume that channel elements are i.i.d. and known to the receiver, which relays the optimal (rate-maximizing) precoder codebook index to the transmitter using B bits. We first derive the large system capacity of beamforming (rank-one precoding matrix) as a function of B, where large system refers to the limit as B and the number of transmit and receive antennas all go to infinity with fixed ratios. RVQ for beamforming is asymptotically optimal, i.e., no other quantization scheme can achieve a larger asymptotic rate. We subsequently consider a precoding matrix with arbitrary rank, and approximate the asymptotic RVQ performance with optimal and linear receivers (matched filter and Minimum Mean Squared Error (MMSE)). Numerical examples show that these approximations accurately predict the performance of finite-size systems of interest. Given a target spectral efficiency, numerical examples show that the amount of feedback required by the linear MMSE receiver is only slightly more than that required by the optimal receiver, whereas the matched filter can require significantly more feedback.Index Terms-Beamforming, large system analysis, limited feedback, Multi-Input Multi-Output (MIMO), precoding, vector quantization.
We examine the capacity of beamforming over a single-user, multi-antenna 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 2 B 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/ log L. 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/ log 2 Nt).Index Terms-Block fading, channel capacity, channel estimation, limited feedback, multiple-input multiple-output (MIMO).
We study the capacity of a single-user channel with multiple antennas and limited feedback. The receiver has perfect channel knowledge, and can relay B bits, which specify a beamforming vector, to the transmitter. We show that a Random Vector Quantization scheme is asymptotically optimal, and give a simple expression for the associated capacity.
We consider the quantization of a transmit beamforming vector in multiantenna channels and of a signature vector in code division multiple access (CDMA) systems. Assuming perfect channel knowledge, the receiver selects for a transmitter the vector that maximizes the performance from a random vector quantization (RVQ) codebook, which consists of independent isotropically distributed unit-norm vectors. The quantized vector is then relayed to the transmitter via a rate-limited feedback channel. The RVQ codebook requires an exhaustive search to locate the selected entry. To reduce the search complexity, we apply generalized Lloyd or k-dimensional (kd)-tree algorithms to organize RVQ entries into a tree. In examples shown, the search complexity of tree-structured (TS) RVQ can be a few orders of magnitude less than that of the unstructured RVQ for the same performance. We also derive the performance approximation for TS-RVQ in a large system limit, which predicts the performance of a moderate-size system very well.Index Terms-Signature quantization, tree-structured codebook, CDMA, MIMO, random vector quantization, generalized Lloyd algorithm, kd tree.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.