Variable-breadth K-best detector for MIMO systems

Authors:
Sandra Roger;Alberto Gonzalez;Vicenc Almenar;Antonio M. Vidal
Affiliations:
Universidad Politecnica de Valencia, Valencia, Spain;Universidad Politecnica de Valencia, Valencia, Spain;Universidad Politecnica de Valencia, Valencia, Spain;Universidad Politecnica de Valencia, Valencia, Spain
Venue:
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Year:
2010

Citing 7
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
Programmable processor implementations of K-best list sphere detector for MIMO receiver

Signal Processing
Efficient detection algorithms for MIMO channels: a geometrical approach to approximate ML detection

IEEE Transactions on Signal Processing
On the sphere-decoding algorithm I. Expected complexity

IEEE Transactions on Signal Processing - Part I
Fixing the Complexity of the Sphere Decoder for MIMO Detection

IEEE Transactions on Wireless Communications
Algorithm and implementation of the K-best sphere decoding for MIMO detection

IEEE Journal on Selected Areas in Communications
Soft-output sphere decoding: algorithms and VLSI implementation

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Tree search detection algorithms can provide Maximum-Likelihood detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Furthermore, the performance of MIMO detectors is highly influenced by the channel matrix condition number. In this paper, the impact of the 2-norm condition number in data detection is exploited in order to decrease the complexity of already proposed algorithms. A suboptimal tree search method called K-Best is combined with a channel matrix condition number estimator and a threshold selection method. This approach leads to a variable-breadth K-Best detector with predictable average performance and suitable for hardware implementation. The results show that the proposed scheme has lower complexity, i.e. it is less power consuming, than a fixed K-Best detector of similar performance.