| Improved iterative breadth-first detection algorithms for MIMO wireless systems |
| |
| 作者姓名： | 郑武 Song Wentao Zhang Haibin Xu Youyun |
| |
| 作者单位： | [1]Electronic Engineering Department of Shanghai Jiaotong University, Shanghai 200240, P.R.China [2]Research and Innovation Center, Alcatel-Shanghai Bell Co.Ltd., Shanghai 201206,P.R.China |
| |
| 基金项目： | 国家自然科学基金
,
国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 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.
|
| 关 键 词： | 连续代码组 解码器 涡轮代码组 通信 |
Improved iterative breadth-first detection algorithms for MIMO wireless systems |
| |
| Zheng Wu,Song Wentao,Zhang Haibin,Xu Youyun.Improved iterative breadth-first detection algorithms for MIMO wireless systems[J].High Technology Letters,2007,13(2):184-188. |
| |
| Authors: | Zheng Wu Song Wentao Zhang Haibin Xu Youyun |
| |
| Abstract: | 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 transmitted symbol vectors of the optimum maximum a posteriori probability (MAP) detector, the new algorithm 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 algorithm over a quasi- static Rayleigh channel even for relatively small list sizes are proved. |
| |
| Keywords: | concatenated codes MIMO systems BLAST iterative decoder Turbo codes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
