The Error Probability of the Fixed-Complexity Sphere Decoder

被引：64

作者：

Jalden, Joakim ^{[1
]}

Barbero, Luis G. ^{[2
]}

Ottersten, Bjorn ^{[3
,4
]}

Thompson, John S. ^{[2
]}

机构：

[1] Royal Inst Technol, Sch Elect Engn, Signal Proc Lab, S-10044 Stockholm, Sweden

[2] Univ Edinburgh, Joint Res Inst Signal & Image Proc, Inst Digital Commun, Edinburgh EH9 3JL, Midlothian, Scotland

[3] Royal Inst Technol, Signal Proc Lab, ACCESS Linnaeus Ctr, S-10044 Stockholm, Sweden

[4] Univ Luxembourg, L-1359 Luxembourg, Luxembourg

来源：

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

基金：

欧洲研究理事会;

关键词：

Diversity order; fixed-complexity sphere decoder (FSD); multiple input-multiple output (MIMO); signal detection; SPATIAL MULTIPLEXING SYSTEMS; TRANSMIT-ANTENNA SELECTION; DIVERSITY ORDER; ALGORITHMS; IMPLEMENTATION; CHANNELS; SEARCH;

D O I：

10.1109/TSP.2009.2017574

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

The fixed-complexity sphere decoder (FSD) has been previously proposed for multiple-input multiple-output (MIMO) detection in order to overcome the two main drawbacks of the sphere decoder (SD), namely its variable complexity and its sequential structure. Although the FSD has shown remarkable quasi-maximum-likelihood (ML) performance and has resulted in a highly optimized real-time implementation, no analytical study of its performance existed for an arbitrary MIMO system. Herein, the error probability of the FSD is analyzed, proving that it achieves the same diversity as the maximum-likelihood detector (MLD) independent of the constellation used. In addition, it can also asymptotically yield ML performance in the high-signal-to-noise ratio (SNR) regime. Those two results, together with its fixed complexity, make the FSD a very promising algorithm for uncoded MIMO detection.

引用

页码：2711 / 2720

页数：10

共 32 条

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

ANDERSON, JB .

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

[2]

[Anonymous], 1998, Proc. URSI ISSSE, DOI DOI 10.1109/ISSSE.1998.738086

[3]

[Anonymous], P INT C FIELD PROGR

[4] Efficient detection algorithms for MIMO channels:: A geometrical approach to approximate ML detection [J].

Artés, H ;

Seethaler, D ;

Hlawatsch, F .

IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2003, 51 (11) :2808-2820

[5] Fixing the complexity of the sphere decoder for MIMO detection [J].

Barbero, Luis G. ;

Thompson, John S. .

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2008, 7 (06) :2131-2142

[6]

Barbero LG, 2006, IEEE ICC, P3082

[7] Fiscal policy and sanitary policy: Evident tensions from the criteria of distribution of the co-participable mass and methods of determination of transference [J].

Barbieri, Nelly Catalina .

SALUD COLECTIVA, 2007, 3 (01) :49-61

[8] VLSI implementation of MIMO detection using the sphere decoding algorithm [J].

Burg, A ;

Borgmann, M ;

Wenk, M ;

Zellweger, M ;

Fichtner, W ;

Bölcskei, H .

IEEE JOURNAL OF SOLID-STATE CIRCUITS, 2005, 40 (07) :1566-1577

[9]

Choi WJ, 2000, IEEE ICC, P1243, DOI 10.1109/ICC.2000.853698

[10] On maximum-likelihood detection and the search for the closest lattice point [J].

Damen, MO ;

El Gamal, H ;

Caire, G .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (10) :2389-2402

← 1 2 3 4 →