A grouped-iterative framework for MIMO detection

Di You Wu; Lan-Da Van

doi:10.1109/VETECF.2008.123

A grouped-iterative framework for MIMO detection

Di You Wu^*, Lan-Da Van

^*Corresponding author for this work

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

In this paper, we propose one grouped-iterative framework to generate a family of the MIMO detection algorithms. The presented framework not only includes the conventional iterative, grouped, and Chase detection algorithms, but also derives a new low-complexity MIMO detection algorithm. The proposed detection can adjust some parameters to achieve a range of trade-offs between performance and complexity. In (4,4) system with uncoded 16-QAM inputs, one instance of the proposed detection algorithm not only substantially reduces the multiplication complexity by 26.3% but also outperforms the BODF algorithm about 5dB. Another instance of the proposed algorithm can save multiplication complexity by 34% at the penalty of 1 dB loss compared with the B-Chase detector.

Original language	English
Title of host publication	The 68th IEEE Vehicular Technology Conference, VTC 2008-Fall
DOIs	https://doi.org/10.1109/VETECF.2008.123
State	Published - 2008
Event	68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference - Calgary, AB, Canada Duration: 21 Sep 2008 → 24 Sep 2008

Publication series

Name	IEEE Vehicular Technology Conference
ISSN (Print)	1550-2252

Conference

Conference	68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference
Country/Territory	Canada
City	Calgary, AB
Period	21/09/08 → 24/09/08

Access to Document

10.1109/VETECF.2008.123

Cite this

@inproceedings{d1308fd03dce4dbbbacda34d619cda4c,

title = "A grouped-iterative framework for MIMO detection",

abstract = "In this paper, we propose one grouped-iterative framework to generate a family of the MIMO detection algorithms. The presented framework not only includes the conventional iterative, grouped, and Chase detection algorithms, but also derives a new low-complexity MIMO detection algorithm. The proposed detection can adjust some parameters to achieve a range of trade-offs between performance and complexity. In (4,4) system with uncoded 16-QAM inputs, one instance of the proposed detection algorithm not only substantially reduces the multiplication complexity by 26.3% but also outperforms the BODF algorithm about 5dB. Another instance of the proposed algorithm can save multiplication complexity by 34% at the penalty of 1 dB loss compared with the B-Chase detector.",

author = "Wu, {Di You} and Lan-Da Van",

year = "2008",

doi = "10.1109/VETECF.2008.123",

language = "English",

isbn = "9781424417223",

series = "IEEE Vehicular Technology Conference",

booktitle = "The 68th IEEE Vehicular Technology Conference, VTC 2008-Fall",

note = "68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference ; Conference date: 21-09-2008 Through 24-09-2008",

}

TY - GEN

T1 - A grouped-iterative framework for MIMO detection

AU - Wu, Di You

AU - Van, Lan-Da

PY - 2008

Y1 - 2008

N2 - In this paper, we propose one grouped-iterative framework to generate a family of the MIMO detection algorithms. The presented framework not only includes the conventional iterative, grouped, and Chase detection algorithms, but also derives a new low-complexity MIMO detection algorithm. The proposed detection can adjust some parameters to achieve a range of trade-offs between performance and complexity. In (4,4) system with uncoded 16-QAM inputs, one instance of the proposed detection algorithm not only substantially reduces the multiplication complexity by 26.3% but also outperforms the BODF algorithm about 5dB. Another instance of the proposed algorithm can save multiplication complexity by 34% at the penalty of 1 dB loss compared with the B-Chase detector.

AB - In this paper, we propose one grouped-iterative framework to generate a family of the MIMO detection algorithms. The presented framework not only includes the conventional iterative, grouped, and Chase detection algorithms, but also derives a new low-complexity MIMO detection algorithm. The proposed detection can adjust some parameters to achieve a range of trade-offs between performance and complexity. In (4,4) system with uncoded 16-QAM inputs, one instance of the proposed detection algorithm not only substantially reduces the multiplication complexity by 26.3% but also outperforms the BODF algorithm about 5dB. Another instance of the proposed algorithm can save multiplication complexity by 34% at the penalty of 1 dB loss compared with the B-Chase detector.

UR - http://www.scopus.com/inward/record.url?scp=58149116388&partnerID=8YFLogxK

U2 - 10.1109/VETECF.2008.123

DO - 10.1109/VETECF.2008.123

M3 - Conference contribution

AN - SCOPUS:58149116388

SN - 9781424417223

T3 - IEEE Vehicular Technology Conference

BT - The 68th IEEE Vehicular Technology Conference, VTC 2008-Fall

T2 - 68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference

Y2 - 21 September 2008 through 24 September 2008

ER -

A grouped-iterative framework for MIMO detection

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this