Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

An Improved Fast Recursive Algorithm for V-BLAST with Optimal Ordered Detections

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
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. In this paper, we first incorporate the existing improvements into the original fast recursive algorithm to give an algorithm that is the fastest known for the optimal SIC detection of V-BLAST. Then, we present a further improvement from which a new algorithm is proposed. Compared with the fastest known algorithm from the existing improvements, this new proposed algorithm has a speedup of 1.3 times in both the number of multiplications and the number of additions.

Published in:

Communications, 2008. ICC '08. IEEE International Conference on

Date of Conference:

19-23 May 2008