Your browser does not support JavaScript!

Efficient algorithm for decoding layered space-time codes

Efficient algorithm for decoding layered space-time codes

For access to this article, please select a purchase option:

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Layered space-time codes have been designed to exploit the capacity advantage of multiple antenna systems in Rayleigh fading environments. A new efficient decoding algorithm based on QR decomposition is presented, which requires only a fraction of computational effort compared to the standard decoding algorithm requiring the multiple calculation of the pseudo inverse of the channel matrix.


    1. 1)
      • Wolniansky, P.W., Foschini, G.J., Golden, G.D., Valenzuela, R.A.: `V-BLAST: an architecture for realizing very high data rates over therich-scattering wireless channel', IEEE Proc. ISSSE-98, September 1998, Pisa, Italy.
    2. 2)
      • G.J. Foschini . Layered space-time architecture for wireless communication in a fadingenvironment when using multiple antennas. Bell Labs Tech. J. , 2 , 41 - 59
    3. 3)
      • Shiu, D., Kahn, J.M.: `Layered space-time codes for wireless communications using multiple transmitantennas', IEEE Proc. Int. Conf. Communications (ICC'99), June 1999, Vancouver, B.C., Canada.
    4. 4)
      • G.J. Foschini , G.D. Golden , A. Valenzuela , P.W. Wolniansky . Simplified processing for high spectral efficiency wireless communicationsemploying multi-element arrays. IEEE J. Sel. Areas Communun. , 11 , 1841 - 1852

Related content

This is a required field
Please enter a valid email address