Iterative tree search detection for MIMO wireless systems

被引：101

作者：

de Jong, YLC ^{[1
]}

Willink, TJ ^{[1
]}

机构：

[1] Commun Res Ctr, Ottawa, ON K2H 8S2, Canada

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2005年 / 53卷 / 06期

关键词：

complexity reduction; iterative detection/decoding; multiple-input multiple-output (MIMO) systems; tree searching;

D O I：

10.1109/TCOMM.2005.849638

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper presents a reduced-complexity soft-input soft-output detection scheme, called iterative tree search detection, for multiple-input multiple-output wireless communication systems employing turbo processing at the receiver. In this scheme, a reduced search space is selected with the aid of the M-algorithm, and QAM signal constellations with block partitionable labels are used in order to make the detection complexity per bit almost independent of the modulation order, as well as asymptotically linear in the number of transmit antennas. Results from computer simulations are presented which demonstrate the capability of the scheme to approach optimal performance at considerably reduced complexity.

引用

页码：930 / 935

页数：6