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

Chung An Shen, Ahmed M. Eltawil

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations


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 languageEnglish (US)
Title of host publication2010 7th IEEE Consumer Communications and Networking Conference, CCNC 2010
StatePublished - Apr 29 2010
Externally publishedYes


Dive into the research topics of 'An adaptive reduced complexity K-best decoding algorithm with early termination'. Together they form a unique fingerprint.

Cite this