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

Authors:
Chung-An Shen;Ahmed M. Eltawil
Affiliations:
Electrical Engineering and Computer Science Department, University of California, Irvine, CA;Electrical Engineering and Computer Science Department, University of California, Irvine, CA
Venue:
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Year:
2010

Citing 8
Cited 0

Lattice basis reduction: improved practical algorithms and solving subset sum problems

Mathematical Programming: Series A and B
Relaxed K-best MIMO signal detector design and VLSI implementation

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Design and implementation of a sort-free K-best sphere decoder

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory
A unified framework for tree search decoding: rediscovering the sequential decoder

IEEE Transactions on Information Theory
From theory to practice: an overview of MIMO space-time coded wireless systems

IEEE Journal on Selected Areas in Communications
Algorithm and implementation of the K-best sphere decoding for MIMO detection

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.