By Topic

Reduced Complexity Stack-Based Limited Tree Searching Algorithm for V-BLAST Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Namjeong Lee ; School of Engineering, Information and Communications University, Korea. Email: yell06@icu.ac.kr ; Keonkook Lee ; Jongsub Cha ; Joonhyuk Kang
more authors

The vertical Bell Labs layered space-time (V-BLAST) 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 near-optimal 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

Published in:

MILCOM 2006 - 2006 IEEE Military Communications conference

Date of Conference:

23-25 Oct. 2006