Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems

Y Jia; C Andrieu; RJ Piechocki; M Sandell

doi:10.1109/TWC.2008.060813

Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems

Y Jia, C Andrieu, RJ Piechocki, M Sandell

Research output: Contribution to journal › Article (Academic Journal) › peer-review

21 Citations (Scopus)

523 Downloads (Pure)

Abstract

The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectively

Translated title of the contribution	Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems
Original language	English
Pages (from-to)	1052 - 1061
Number of pages	10
Journal	IEEE Transactions on Wireless Communications
Volume	7
Issue number	3
DOIs	https://doi.org/10.1109/TWC.2008.060813
Publication status	Published - Mar 2008

Bibliographical note

Publisher: Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Rose publication type: Journal article

Sponsorship: This work was supported by Toshiba Research Europe Ltd (Bristol), UK

Terms of use: Copyright © 2008 IEEE. Reprinted from IEEE Transactions on Wireless Communications.

This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected].

By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

Keywords

complexity reduction
Gaussian approximation
multilevel modulation
multiple-input multiple-output (MIMO) systems

Access to Document

10.1109/TWC.2008.060813

Jia Trans Wir Comms March 2008Accepted author manuscript, 262 KB

Handle.net

Persistent link

Cite this

@article{ea06fbead5454a629e8460de7238d6ae,

title = "Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems",

abstract = "The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectively",

keywords = "complexity reduction, Gaussian approximation, multilevel modulation, multiple-input multiple-output (MIMO) systems",

author = "Y Jia and C Andrieu and RJ Piechocki and M Sandell",

note = "Publisher: Institute of Electrical and Electronics Engineers, Inc. (IEEE) Rose publication type: Journal article Sponsorship: This work was supported by Toshiba Research Europe Ltd (Bristol), UK Terms of use: Copyright {\textcopyright} 2008 IEEE. Reprinted from IEEE Transactions on Wireless Communications. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. ",

year = "2008",

month = mar,

doi = "10.1109/TWC.2008.060813",

language = "English",

volume = "7",

pages = "1052 -- 1061",

journal = "IEEE Transactions on Wireless Communications",

issn = "1536-1276",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

number = "3",

}

TY - JOUR

T1 - Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems

AU - Jia, Y

AU - Andrieu, C

AU - Piechocki, RJ

AU - Sandell, M

N1 - Publisher: Institute of Electrical and Electronics Engineers, Inc. (IEEE) Rose publication type: Journal article Sponsorship: This work was supported by Toshiba Research Europe Ltd (Bristol), UK Terms of use: Copyright © 2008 IEEE. Reprinted from IEEE Transactions on Wireless Communications. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.

PY - 2008/3

Y1 - 2008/3

N2 - The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectively

AB - The multilevel structure of the N-QAM modulation constellations is exploited to significantly reduce the complexity of the sequential Gaussian approximation (SGA) algorithm for near optimal symbol detection in spatial multiplexing multiple- input multiple-output (MIMO) system. We propose two multilevel SGA algorithms (MSGA) which are based on depth- first search (DFS) and breadth-first search (BFS) respectively. Additionally, an important methodological contribution to this multilevel technique is proposed where the mismatch between the pseudo symbols and the true symbols is taken into consideration for the computation of posterior probabilities of symbol combinations. We justify this from a theoretical perspective as well as with numerical results. Simulation results show that the performance of the two proposed multilevel algorithms can approach that of the optimal a posteriori probability (APP) detector while its total computation cost is at most 81% and 48% of that of the original SGA algorithm for 16QAM and 64QAM modulation MIMO systems with 4 transmit/receive antennas respectively

KW - complexity reduction

KW - Gaussian approximation

KW - multilevel modulation

KW - multiple-input multiple-output (MIMO) systems

U2 - 10.1109/TWC.2008.060813

DO - 10.1109/TWC.2008.060813

M3 - Article (Academic Journal)

SN - 1536-1276

VL - 7

SP - 1052

EP - 1061

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

IS - 3

ER -

Depth-first and breadth-first search based multilevel SGA algorithms for near optimal symbol detection in MIMO systems

Abstract

Bibliographical note

Keywords

Access to Document

Handle.net

Fingerprint

Cite this