大规模MIMO技术是下一代移动通信(5G)的关键技术,而预编码算法是大规模MIMO系统的核心技术,成为了当前的研究重点。通过建立大规模MIMO系统模型,依次对最大比传输(MRT)预编码、迫零(ZF)预编码和基于Neumann级数(NS)的预编码进行理论分析,并仿真对比它们的复杂度、容量和误码率性能。仿真结果表明:MRT预编码的复杂度最低,但是其容量和误码率性能最差;NS预编码的复杂度比ZF预编码低,但是其容量和误码率性能可以达到接近于ZF预编码的性能。
Massive MIMO is regarded as one of the key techniques for the next generation communication(5G) systems. In order to acquire better performance of massive MIMO, the performances of different precoding algorithms for downlink massive MIMO system are analyzed and compared. In this paper, MRT (Maximum Ratio Transmission) precoding, ZF (Zero-Forcing) precoding, and NS (Neumann Series) precoding are compared, and the computational complexity, capacity and BER of these prcoding schemes analyzed, and finally the performances at different SNRs acquired. Simulation results indicate that the computational complexity of MRT precoding is the lowest, but its capacity and BER are the worst and NS precoding can achieve the exact capacity-approaching performance of the ZF precoding with lower computational complexity.