the sphere decoding(SD) algorithm can reduces the complexity of the receiver
but it is high that computation complexity of traditional sphere decoding algorithm at low signal to noise ratio. In order to reduce the computation complexity
the influence of the initial search radius on the sphere decoding process is analyzed
and use optimization ability of wolf pack algorithm to obtain the best initial search radius. It can ensure decoding performance and reduce the computation complexity effectively. The simulation results show that the performance of sphere decoding algorithm based on wolf pack algorithm can be the same as that of traditional sphere decoding algorithm
and can reduce the computation complexity at low signal to noise ratio effectively.
关键词
Keywords
references
Boutros J, Viterbi E. Signal space diversity: a power and band width efficient diversity technique for the Rayleigh fading channel[J]. IEEE Transactions on Information Theory, 1998, 44(4): 1453-1467. DOI: 1453
Wu H S, Zhang F M. Wolf pack algorithm for unconstrained global optimization[J]. Mathematical Problems in Engineering, 2014, 46(5): 17. DOI: 17
Qianlei L, Luxi Y. A novel method for initial radius selection of sphere decoding[C]//VTC 2004. Los Angeles: IEEE, 2004.
李金凤. MIMO通信系统中信号检测技术研究[D]. 哈尔滨: 哈尔滨工程大学, 2009.
Fncke U, Phost M. Improved methods for calculating vectors of short length in a lattice, including a complexity analysis[J]. Mathematics of Computation, 1985, 44(4): 463-467. DOI: 463
马振洲. 多元LDPC编码与调制联合优化设计研究[D]. 成都: 电子科技大学, 2009.
Hassibi B, Vikalo H. On the expected complexity of integer least-squares problems[C]//IEEE International Conference on Acoustics, Speech, and Signal Processing. Taipei: IEEE, 2002.