Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding

Konstantinos Nikitopoulos; Dan Zhang; I. Wei Lai; Gerd Ascheid

doi:10.1109/LCOMM.2010.04.092230

Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding

Konstantinos Nikitopoulos^*, Dan Zhang, I. Wei Lai, Gerd Ascheid

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

Abstract

In this paper two complexity efficient soft spheredecoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.

Original language	English
Article number	5439349
Pages (from-to)	312-314
Number of pages	3
Journal	IEEE Communications Letters
Volume	14
Issue number	4
DOIs	https://doi.org/10.1109/LCOMM.2010.04.092230
Publication status	Published - 2010 Apr
Externally published	Yes

Keywords

Iterative processing
Multiple-input multiple-output
Soft sphere decoding

ASJC Scopus subject areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Access to Document

10.1109/LCOMM.2010.04.092230

Cite this

@article{a316c4600e00439997f1a809a309bdb8,

title = "Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding",

abstract = "In this paper two complexity efficient soft spheredecoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.",

keywords = "Iterative processing, Multiple-input multiple-output, Soft sphere decoding",

author = "Konstantinos Nikitopoulos and Dan Zhang and Lai, {I. Wei} and Gerd Ascheid",

note = "Funding Information: Manuscript received November 12, 2009. The associate editor coordinating the review of this letter and approving it for publication was S. Buzzi. The authors are with the Institute for Integrated Signal Processing Systems, RWTH Aachen University, D-52074, Aachen, Germany (e-mail: [email protected]). This work has been supported by the UMIC Research Centre, RWTH Aachen University. Digital Object Identifier 10.1109/LCOMM.2010.04.092230",

year = "2010",

month = apr,

doi = "10.1109/LCOMM.2010.04.092230",

language = "English",

volume = "14",

pages = "312--314",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding

AU - Nikitopoulos, Konstantinos

AU - Zhang, Dan

AU - Lai, I. Wei

AU - Ascheid, Gerd

N1 - Funding Information: Manuscript received November 12, 2009. The associate editor coordinating the review of this letter and approving it for publication was S. Buzzi. The authors are with the Institute for Integrated Signal Processing Systems, RWTH Aachen University, D-52074, Aachen, Germany (e-mail: [email protected]). This work has been supported by the UMIC Research Centre, RWTH Aachen University. Digital Object Identifier 10.1109/LCOMM.2010.04.092230

PY - 2010/4

Y1 - 2010/4

N2 - In this paper two complexity efficient soft spheredecoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.

AB - In this paper two complexity efficient soft spheredecoder modifications are proposed for computing the max-log LLR values in iterative MIMO systems, which avoid the costly, typically needed, full enumeration and sorting (FES) procedure during the tree traversal without compromising the max-log performance. It is shown that despite the resulting increase in the number of expanded nodes, they can be more computationally efficient than the typical soft sphere decoders by avoiding the unnecessary complexity of FES.

KW - Iterative processing

KW - Multiple-input multiple-output

KW - Soft sphere decoding

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

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

U2 - 10.1109/LCOMM.2010.04.092230

DO - 10.1109/LCOMM.2010.04.092230

M3 - Article

AN - SCOPUS:77950646726

SN - 1089-7798

VL - 14

SP - 312

EP - 314

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 4

M1 - 5439349

ER -

Complexity-efficient enumeration techniques for soft-input, soft-output sphere decoding

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this