Capacity of memoryless channels and block-fading channels with designable cardinality-constrained channel state feedback

A coding theorem is proved for memoryless channels when the channel state feedback of finite cardinality can be designed. Channel state information is estimated at the receiver and a function of the estimated channel state is causally fed back to the transmitter. The feedback link is assumed to be noiseless with a finite feedback alphabet, or equivalently, finite feedback rate. It is shown that the capacity can be achieved with a memoryless deterministic feedback and with a memoryless device which select transmitted symbols from a codeword of expanded alphabet according to current feedback. To characterize the capacity, we investigate the optimization of transmission and channel state feedback strategies. The optimization is performed for both channel capacity and error exponents. We show that the design of the optimal feedback scheme is identical to the design of scalar quantizer with modified distortion measures. We illustrate the optimization using Rayleigh block-fading channels. It is shown that the optimal transmission strategy has a general form of temporal water-filling in important cases. Furthermore, while feedback enhances the forward channel capacity more effectively in low-signal-to noise ratio (SNR) region compared with that of high-SNR region, the enhancement in error exponent is significant in both high- and low-SNR regions. This indicates that significant gain due to finite-rate channel state feedback is expected in practical systems in both SNR regions.