By Topic

On fast recursive algorithms for V-BLAST with optimal ordered SIC detection

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
$31 $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

2 Author(s)
Yue Shang ; Dept. of Electr. & Comput. Eng., Univ. of Delaware, Newark, DE ; Xia, Xiang-Gen

A fast recursive algorithm for the vertical Bell Laboratories layered space-time (V-BLAST) with the optimal ordered successive interference cancellation (SIC) detection has been proposed by Benesty-Huang-Chen and two improved algorithms have been also recently introduced by Szczecinski-Massicotte and Zhu-Lei-Chin independently. In this letter, our first contribution is to incorporate the existing improvements into the original fast recursive algorithm to provide the fastest known algorithm for the optimal ordered SIC detection of V-BLAST. Subsequently, we propose two new algorithms that result from one further improvement for the fast recursive algorithm. Compared with the fastest known algorithm built from the existing improvements, one new proposed algorithm has a speedup of 1.3 times in both the number of multiplications and the number of additions, and the other new proposed algorithm requires less intermediate variables and saves memories.

Published in:

Wireless Communications, IEEE Transactions on  (Volume:8 ,  Issue: 6 )