By Topic

Performance Study of Space-Time Communications Systems Based on the VBLAST Algorithm

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

4 Author(s)

Capacity in wireless channels has become the prime aspect in mobile communications. Significant improvements are possible with MIMO channels -the use of multiple antennas at both the transmitter and receiver-. Reception in this type of channels is achieved with space-time coding by jointly designing channel coding, modulation and equalization, allowing an important increase in the throughput of band-limited wireless channels. One of the most important space-time coding systems is the Bell-Labs Layered Space-Time (BLAST) coding technique. Different variants of this algorithm exist focusing on computational complexity reductions. One of these variants is the Vertical BLAST algorithm which has different realizations depending on the way the signal processing at the receiver is performed. In this paper, an analysis of these realizations is presented from a performance-complexity standpoint. These variants are the Singular-Value Decomposition, the Sorted-QR Decomposition and the Least-Square algorithm. It is shown that the latter presents the best performance-complexity trade-off.

Published in:

Electronics, Communications and Computers, 2005. CONIELECOMP 2005. Proceedings. 15th International Conference on

Date of Conference:

28-02 Feb. 2005