Low-complexity decoding via reduced dimension maximum-likelihood search

Jun Won Choi, Byonghyo Shim, Andrew C. Singer, Nam Ik Cho

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i.e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) 10 -1 ∼ 10 -4 while limiting performance loss to within 1 dB from ML detection.

Original languageEnglish
Pages (from-to)1780-1793
Number of pages14
JournalIEEE Transactions on Signal Processing
Volume58
Issue number3 PART 2
DOIs
Publication statusPublished - 2010 Mar 1

Fingerprint

Maximum likelihood
Decoding
Quadrature amplitude modulation
Vector spaces
Bit error rate

Keywords

  • Dimension reduction
  • List tree search
  • Maximumlikelihood (ML) decoding
  • Minimum mean square error (MMSE)
  • Multiple input multiple output (MIMO)
  • Sphere decoding
  • Stack algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Signal Processing

Cite this

Low-complexity decoding via reduced dimension maximum-likelihood search. / Choi, Jun Won; Shim, Byonghyo; Singer, Andrew C.; Cho, Nam Ik.

In: IEEE Transactions on Signal Processing, Vol. 58, No. 3 PART 2, 01.03.2010, p. 1780-1793.

Research output: Contribution to journalArticle

Choi, Jun Won ; Shim, Byonghyo ; Singer, Andrew C. ; Cho, Nam Ik. / Low-complexity decoding via reduced dimension maximum-likelihood search. In: IEEE Transactions on Signal Processing. 2010 ; Vol. 58, No. 3 PART 2. pp. 1780-1793.
@article{06633c18dfd44c8aa05a9d9f14d1f826,
title = "Low-complexity decoding via reduced dimension maximum-likelihood search",
abstract = "In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i.e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) 10 -1 ∼ 10 -4 while limiting performance loss to within 1 dB from ML detection.",
keywords = "Dimension reduction, List tree search, Maximumlikelihood (ML) decoding, Minimum mean square error (MMSE), Multiple input multiple output (MIMO), Sphere decoding, Stack algorithm",
author = "Choi, {Jun Won} and Byonghyo Shim and Singer, {Andrew C.} and Cho, {Nam Ik}",
year = "2010",
month = "3",
day = "1",
doi = "10.1109/TSP.2009.2036482",
language = "English",
volume = "58",
pages = "1780--1793",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3 PART 2",

}

TY - JOUR

T1 - Low-complexity decoding via reduced dimension maximum-likelihood search

AU - Choi, Jun Won

AU - Shim, Byonghyo

AU - Singer, Andrew C.

AU - Cho, Nam Ik

PY - 2010/3/1

Y1 - 2010/3/1

N2 - In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i.e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) 10 -1 ∼ 10 -4 while limiting performance loss to within 1 dB from ML detection.

AB - In this paper, we consider a low-complexity detection technique referred to as a reduced dimension maximum-likelihood search (RD-MLS). RD-MLS is based on a partitioned search which approximates the maximum-likelihood (ML) estimate of symbols by searching a partitioned symbol vector space rather than that spanned by the whole symbol vector. The inevitable performance loss due to a reduction in the search space is compensated by 1) the use of a list tree search, which is an extension of a single best searching algorithm called sphere decoding, and 2) the recomputation of a set of weak symbols, i.e., those ignored in the reduced dimension search, for each strong symbol candidate found during the list tree search. Through simulations on-quadrature amplitude modulation (QAM) transmission in frequency nonselective multi-input-multioutput (MIMO) channels, we demonstrate that the RD-MLS algorithm shows near constant complexity over a wide range of bit error rate (BER) 10 -1 ∼ 10 -4 while limiting performance loss to within 1 dB from ML detection.

KW - Dimension reduction

KW - List tree search

KW - Maximumlikelihood (ML) decoding

KW - Minimum mean square error (MMSE)

KW - Multiple input multiple output (MIMO)

KW - Sphere decoding

KW - Stack algorithm

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

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

U2 - 10.1109/TSP.2009.2036482

DO - 10.1109/TSP.2009.2036482

M3 - Article

AN - SCOPUS:79956257703

VL - 58

SP - 1780

EP - 1793

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 3 PART 2

ER -