Reduced complexity stack-based limited tree searching algorithm for V-BLAST systems

Authors:
Namjeong Lee;Keonkook Lee;Jongsub Cha;Joonhyuk Kang;Gyetae Gil
Affiliations:
School of Engineering, Information and Communications University, Korea;School of Engineering, Information and Communications University, Korea;School of Engineering, Information and Communications University, Korea;School of Engineering, Information and Communications University, Korea;Advanced Technology Laboratory, KT, Korea
Venue:
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Year:
2006

Citing 2
Cited 0

A universal lattice code decoder for fading channels

IEEE Transactions on Information Theory
On maximum-likelihood detection and the search for the closest lattice point

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Vertical Bell Labs Layered Space-Time (VBLAST) architecture is considered as an efficient technology for achieving high spectral efficiency in a rich-scattering environment. In this paper, we propose a computationally efficient nearoptimal detection algorithm for V-BLAST systems. The proposed scheme employs QR decomposition (QRD) of the channel matrix and stack-based limited tree searching method. To reduce computational complexity, especially in low SNRs, the number of branches required for the extension of the tree structure is conditionally chosen according to the channel condition and SNR. The new algorithm requires a fraction of an effort to achieve a near-optimal performance in comparison with other near-optimal detection schemes.