An adaptive reduced complexity K-best decoding algorithm with early termination

Chung An Shen; Ahmed M. Eltawil

doi:10.1109/CCNC.2010.5421739

An adaptive reduced complexity K-best decoding algorithm with early termination

Chung An Shen, Ahmed M. Eltawil

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

13 Scopus citations

Abstract

This paper presents a K-Best decoding algorithm that requires a much smaller K while preserving advantages of the sphere decoding algorithm such as branch pruning and an adaptively updated pruning threshold. The proposed approach results in examining a much smaller set of modulation points with a significantly reduced complexity. Simulations are presented that quantify the BER performance and complexity in terms of the number of visited nodes. The variability in the required operations (hence run-time) due to branch pruning is studied and compared with the sphere decoding algorithm. ©2010 IEEE.

Original language	English (US)
Title of host publication	2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010
DOIs	https://doi.org/10.1109/CCNC.2010.5421739
State	Published - Apr 29 2010
Externally published	Yes

Bibliographical note

Generated from Scopus record by KAUST IRTS on 2019-11-20

Access to Document

10.1109/CCNC.2010.5421739

Cite this

@inproceedings{418ca42279a549d4bf44c1751a1b917a,

title = "An adaptive reduced complexity K-best decoding algorithm with early termination",

abstract = "This paper presents a K-Best decoding algorithm that requires a much smaller K while preserving advantages of the sphere decoding algorithm such as branch pruning and an adaptively updated pruning threshold. The proposed approach results in examining a much smaller set of modulation points with a significantly reduced complexity. Simulations are presented that quantify the BER performance and complexity in terms of the number of visited nodes. The variability in the required operations (hence run-time) due to branch pruning is studied and compared with the sphere decoding algorithm. {\textcopyright}2010 IEEE.",

author = "Shen, {Chung An} and Eltawil, {Ahmed M.}",

note = "Generated from Scopus record by KAUST IRTS on 2019-11-20",

year = "2010",

month = apr,

day = "29",

doi = "10.1109/CCNC.2010.5421739",

language = "English (US)",

isbn = "9781424451760",

booktitle = "2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010",

}

TY - GEN

T1 - An adaptive reduced complexity K-best decoding algorithm with early termination

AU - Shen, Chung An

AU - Eltawil, Ahmed M.

N1 - Generated from Scopus record by KAUST IRTS on 2019-11-20

PY - 2010/4/29

Y1 - 2010/4/29

N2 - This paper presents a K-Best decoding algorithm that requires a much smaller K while preserving advantages of the sphere decoding algorithm such as branch pruning and an adaptively updated pruning threshold. The proposed approach results in examining a much smaller set of modulation points with a significantly reduced complexity. Simulations are presented that quantify the BER performance and complexity in terms of the number of visited nodes. The variability in the required operations (hence run-time) due to branch pruning is studied and compared with the sphere decoding algorithm. ©2010 IEEE.

AB - This paper presents a K-Best decoding algorithm that requires a much smaller K while preserving advantages of the sphere decoding algorithm such as branch pruning and an adaptively updated pruning threshold. The proposed approach results in examining a much smaller set of modulation points with a significantly reduced complexity. Simulations are presented that quantify the BER performance and complexity in terms of the number of visited nodes. The variability in the required operations (hence run-time) due to branch pruning is studied and compared with the sphere decoding algorithm. ©2010 IEEE.

UR - http://ieeexplore.ieee.org/document/5421739/

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

U2 - 10.1109/CCNC.2010.5421739

DO - 10.1109/CCNC.2010.5421739

M3 - Conference contribution

SN - 9781424451760

BT - 2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010

ER -

An adaptive reduced complexity K-best decoding algorithm with early termination

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this