DocumentCode
3403579
Title
Reduced Complexity Stack-Based Limited Tree Searching Algorithm for V-BLAST Systems
Author
Lee, Namjeong ; Lee, Keonkook ; Cha, Jongsub ; Kang, Joonhyuk ; Gil, Gyetae
Author_Institution
Sch. of Eng., Inf. & Commun. Univ.
fYear
2006
fDate
23-25 Oct. 2006
Firstpage
1
Lastpage
5
Abstract
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
Keywords
channel coding; matrix decomposition; space-time codes; spectral analysis; tree searching; QR decomposition; QRD; V-BLAST; channel matrix; near-optimal detection algorithm; rich-scattering environment; spectral efficiency; stack-based limited tree searching method; vertical Bell Labs layered space-time architecture; Bit error rate; Computational complexity; Computer architecture; Decision trees; Detection algorithms; Detectors; MIMO; Space technology; System performance; Tree data structures; Multiple-Input Multiple-Output (MIMO); QR decomposition; Stack algorithm; V-BLAST;
fLanguage
English
Publisher
ieee
Conference_Titel
Military Communications Conference, 2006. MILCOM 2006. IEEE
Conference_Location
Washington, DC
Print_ISBN
1-4244-0617-X
Electronic_ISBN
1-4244-0618-8
Type
conf
DOI
10.1109/MILCOM.2006.301996
Filename
4086426
Link To Document