Improved iterative breadth-first detection algorithms for MIMO wireless systems

作     者：郑武 Song Wentao Zhang Haibin Xu Youyun 

作者机构：Electronic Engineering Department of Shanghai Jiaotong University Shanghai 200240 P.R.China Research and Innovation Center Alcatel-Shanghai Bell Co.Ltd. Shanghai 201206P.R.China 

出 版 物：《High Technology Letters》 (高技术通讯（英文版）)

年 卷 期：2007年第13卷第2期

页      面：184-188页

核心收录：

学科分类：0810[工学-信息与通信工程] 08[工学] 081001[工学-通信与信息系统] 

基　　金：Supported by the National Natural Science Foundation of China (No.60332030  60572157) and the High Technology Research and Development Pro-gramme of China (No.2003AA123310) 

主　　题：concatenated codes MIMO systems BLAST iterative decoder Turbo codes 

摘      要：A reduced-complexity detection algorithm is proposed, which is applied to iterative receivers for multiple-input multiple-output （MIMO） systems. Unlike the exhaustive search over all the possible trans-mitted symbol vectors of the optimum maximum a posteriori probability （MAP） detector, the new algo-rithm evaluates only the symbol vectors that contribute significantly to the soft output of the detector. The algorithm is facilitated by carrying out the breadth-first search on a reconfigurable tree, constructed by computing the symbol reliability of each layer based on zero-forcing criterion and reordering the symbols according to the symbol reliabilities. Simulations are presented and the good performance of the new algo-rithm over a quasi-static Rayleigh channel even for relatively small list sizes are proved.