sis 15(4): e5

Research Article

Hierarchical Codebook Design for Massive MIMO

Download1146 downloads
  • @ARTICLE{10.4108/sis.2.4.e5,
        author={Xin Su and Shichao Yu and Jie Zeng and Yujun Kuang},
        title={Hierarchical Codebook Design for Massive MIMO},
        journal={EAI Endorsed Transactions on Scalable Information Systems},
        volume={2},
        number={4},
        publisher={ICST},
        journal_a={SIS},
        year={2015},
        month={2},
        keywords={Massive MIMO, Kerdock codebook, Fourier-based perturbation, adaptive selection},
        doi={10.4108/sis.2.4.e5}
    }
    
  • Xin Su
    Shichao Yu
    Jie Zeng
    Yujun Kuang
    Year: 2015
    Hierarchical Codebook Design for Massive MIMO
    SIS
    ICST
    DOI: 10.4108/sis.2.4.e5
Xin Su1, Shichao Yu1,2, Jie Zeng1,*, Yujun Kuang2
  • 1: Tsinghua National Laboratory for Information Science and Technology, Tsinghua University, Beijing, China
  • 2: University of Electronic Science and Technology of China (UESTC), Chengdu, China
*Contact email: zengjie@tsinghua.edu.cn

Abstract

The Research of Massive MIMO is an emerging area, since the more antennas the transmitters or receivers equipped with, the higher spectral efficiency and link reliability the system can provide. Due to the limited feedback channel, precoding and codebook design are important to exploit the performance of massive MIMO. To improve the precoding performance, we propose a novel hierarchical codebook with the Fourier-based perturbation matrices as the subcodebook and the Kerdock codebook as the main codebook, which could reduce storage and search complexity due to the finite a lphabet. Moreover, t o f urther r educe t he search complexity and feedback overhead without noticeable performance degradation, we use an adaptive selection algorithm to decide whether to use the subcodebook. Simulation results show that the proposed codebook has remarkable performance gain compared to the conventional Kerdock codebook, without significant increase in feedback overhead and search complexity.