A New Codebook Design for Analog Beamforming in Millimeter-wave Communication
arXiv:1902.00838
Abstract
In this study, we analyze the codebook design used for analog beamforming. Analog beamforming and combining suffer from a subspace sampling limitation, that is, the receiver cannot directly observe the channel coefficients; instead, the receiver observes a noisy version of their weighted combination. To resolve this, the transmitter and the receiver usually collaborate to determine the best beamformer combiner pair during the beam-sweeping process. This is done by evaluating a limited number of codewords chosen from a pre-defined codebook. In this study, we propose a new framework inspired by the generalized Lloyd algorithm to design analog beamforming codebooks that optimize various performance metrics including the average beamforming gain, the outage, and the average data rate. The flexibility of our framework enables us to design beamforming codebooks for any array shapes including uniform linear and planar arrays. The other practical complexity in analog beamforming is the low resolution of the phase shifters. Therefore, we have extended our algorithm to create quantized codebooks that outperform the existing codebooks in literature. We have also provided extensive simulations to verify the superiority of our proposed codebook as compared with the existing codebooks.
References in corpus (13)
- Massive MIMO for Next Generation Wireless Systems
- Spatially Sparse Precoding in Millimeter Wave MIMO Systems
- Channel Estimation and Hybrid Precoding for Millimeter Wave Cellular Systems
- Alternating Minimization Algorithms for Hybrid Precoding in Millimeter Wave MIMO Systems
- Massive MIMO: Ten Myths and One Critical Question
- Millimeter Wave Beamforming for Wireless Backhaul and Access in Small Cell Networks
- Frequency Selective Hybrid Precoding for Limited Feedback Millimeter Wave Systems
- Hybrid Precoder and Combiner Design with Low Resolution Phase Shifters in mmWave MIMO Systems
- Generating User-friendly Explanations for Loan Denials using GANs
- Partition Pruning: Parallelization-Aware Pruning for Deep Neural Networks
- On the Age of Information in Erasure Channels with Feedback
- Investigating Robustness and Interpretability of Link Prediction via Adversarial Modifications
- Compact Factorization of Matrices Using Generalized Round-Rank