A Reduced-Complexity Tree Search Detection Algorithm for MIMO Systems

被引：6

作者：

Kim, Yongsang ^{[1
]}

Cheun, Kyungwhoon ^{[1
]}

机构：

[1] Pohang Univ Sci & Technol POSTECH, Div Elect & Comp Engn, Pohang 790784, South Korea

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 2009年 / 57卷 / 06期

关键词：

M-algorithm; MIMO systems; tree search detection; CHANNEL; CAPACITY;

D O I：

10.1109/TSP.2009.2015121

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

In this correspondence, we propose a simplified QR-decomposition-M algorithm for coded multiple-input multiple-output systems based on the idea of selective branch extension. The proposed algorithm results in significant complexity reductions without observable performance losses, especially for large modulation orders where complexity reduction is most important.

引用

页码：2420 / 2424

页数：5

共 20 条

[1] Parallel detection algorithm using multiple QR decompositions with permuted channel matrix for SDM/OFDM [J].

Ahn, Chang-Jun .

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2008, 57 (04) :2578-2582

[2] SEQUENTIAL CODING ALGORITHMS - A SURVEY AND COST-ANALYSIS [J].

ANDERSON, JB .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (02) :169-176

[3]

[Anonymous], 2005, 80216D IEEE

[4] Iterative tree search detection for MIMO wireless systems [J].

de Jong, YLC ;

Willink, TJ .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (06) :930-935

[5]

Foschini G., 1996, BELL SYST TECH J, V1, P41

[6] Iterative decoding of binary block and convolutional codes [J].

Hagenauer, J ;

Offer, E ;

Papke, L .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :429-445

[7]

Higuchi K, 2004, GLOB TELECOMM CONF, P2480

[8] Achieving near-capacity on a multiple-antenna channel [J].

Hochwald, BM ;

ten Brink, S .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2003, 51 (03) :389-399

[9]

Inoue K, 2002, APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, P1, DOI 10.1109/APCCAS.2002.1115094

[10]

ITOH K, 1999, P 25 EUR SOL STAT CI, P3

← 1 2 →