Feedback in a communications system can enable the transmitter to exploit channel conditions and avoid interference. In the case of a multiple-input multiple-output channel, feedback can be used to specify a precoding matrix at the transmitter, which activates the strongest channel modes. In situations where the feedback is severely limited, important issues are how to quantize the information needed at the transmitter and how much improvement in associated performance can be obtained as a function of the amount of feedback available. We give an overview of some recent work in this area. Methods are presented for constructing a set of possible precoding matrices, from which a particular choice can be relayed to the transmitter. Performance results show that even a few bits of feedback can provide performance close to that with full channel knowledge at the transmitter.
We consider a single-user, point-to-point communication system with M transmit and N receive antennas with independent flat Rayleigh fading between antenna pairs. The mutual information of the multi-input/multi-output (MIMO) channel is maximized when the transmitted symbol vector is a Gaussian random vector with covariance matrix Q. The optimal Q depends on how much channel state information is available at the transmitter. Namely, in the absence of any channel state information, the optimal Q is full-rank and isotropic, whereas with perfect channel knowledge, the optimal Q has columns which are the eigenvectors of the channel, and has rank at most min{M, N}. We assume that the receiver can feed back B bits to the transmitter (per codeword). The feedback bits are used to choose the columns of Q from a random set of i.i.d. vectors. We compute the mutual information as a function of both B and the rank of Q. Our results are asymptotic in the number of antennas, and show how much feedback is needed to achieve a rate, which is close to the capacity with perfect channel knowledge at the transmitter.
26 September 2005 in IEEE Transactions on Information Theory
We study the performance of joint signature-receiver optimization for direct-sequence code-division multiple access (DS-CDMA) with limited feedback. The receiver for a particular user selects the signature from a signature codebook, and relays the corresponding B index bits to the transmitter over a noiseless channel. We study the performance of a random vector quantization (RVQ) scheme in which the codebook entries are independent and isotropically distributed. Assuming the interfering signatures are independent, and have independent and identically distributed (i.i.d.) elements, we evaluate the received signal-to-interference plus noise ratio (SINR) in the large system limit as the number of users, processing gain, and feedback bits B all tend to infinity with fixed ratios. This SINR is evaluated for both the matched filter and linear minimum mean-squared error (MMSE) receivers. Furthermore, we show that this large system SINR is the maximum that can be achieved over any sequence of codebooks. Numerical results show that with the MMSE receiver, one feedback bit per signature coefficient achieves close to single-user performance. We also consider a less complex and suboptimal reduced-rank signature optimization scheme in which the user's signature is constrained to lie in a lower dimensional subspace. The optimal subspace coefficients are scalar-quantized and relayed to the transmitter. The large system performance of the quantized reduced-rank scheme can be approximated, and numerical results show that it performs in the vicinity of the RVQ bound. Finally, we extend our analysis to the scenario in which a subset of users optimize their signatures in the presence of random interference.
18 November 2010 in IEEE Transactions on Information Theory
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).
We study the channel capacity of a point-to-point communication system with multiple antennas and limited feedback. The receiver with per- fect channel knowledge can relay B bits, which specify a beamforming vector, to the transmitter. We show that a Random Vector Quantization scheme is asymp- totically optimal and give a simple expression for the associated capacity. I. Summary We consider a flat Rayleigh fading channel with M trans- mit and N receive antennas. The received vector is given by y = Hvx+w where H is an N ◊M channel matrix whose el- ement is a complex Gaussian random variable with zero mean and unit variance, v is an M ◊ 1 beamforming vector, x is a transmitted symbol with zero mean and unit variance. y is an N ◊ 1 received symbol vector, and w is an AWGN vector with covariance matrix 1 I where I is an identity matrix. The mutual information I(x,y) can be maximized over the beamforming vector v subject to a power constraint kvk 1. With B feedback bits, we can construct a vector quantizer with a codebook V = {v1,··· ,v2B}. Assuming that H is known at the receiver, it chooses vj from V that maximizes I(x,y), and relays the corresponding index back to the trans- mitter. Optimizing the codebook V for finite M and N is quite dicult; however, as ( M,N) ! 1, the eigenvectors of H†H
Channel estimation is a critical component in orthogonal frequency division multiplexing (OFDM) systems for ensuring reliable wireless communication. In this study, we propose a fast super-resolution convolutional neural network (FSRCNN) model for channel estimation, designed to reduce computational complexity while maintaining high estimation accuracy. The proposed FSRCNN model incorporates modifications such as replacing linear interpolation with zero padding and leveraging a new fast CNN architecture to estimate channel coefficients. Our numerical experiments and simulations demonstrate that the FSRCNN model significantly outperforms traditional methods, such as least square (LS) and linear minimum mean square error (LMMSE), in terms of mean square error (MSE) across various signal-to-noise ratios (SNRs). Specifically, the FSRCNN model achieves MSE values comparable to MMSE estimation, particularly at higher SNRs, while maintaining lower computational complexity. At an SNR of 20 dB, the FSRCNN model shows a notable improvement in MSE performance compared to the ChannelNet and LS methods. The proposed model also demonstrates robust performance across different SNR levels, with optimal results observed when the training SNR is close to the operating SNR. These findings validate the effectiveness of the FSRCNN model in providing a low-complexity, high-accuracy alternative for channel estimation, making it suitable for real-time applications and devices with limited computational resources. This advancement holds significant promise for enhancing the reliability and efficiency of current and future wireless communication networks.