By Topic

Full rate space time codes for large number of transmitting antennas with linear complexity decoding and high performance

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
$33 $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)
Amir Laufer ; The Center of Wireless Communications and Signal Processing Research, ECE, New Jersey Institute of Technology, Newark, NJ 07102, USA ; Yeheskel Bar-Ness

Space time codes (STC) have been shown to be used well with the Multiple Input Multiple Output (MIMO) channel. The Orthogonal STC (OSTC) family of codes is known to achieve full diversity as well as very simple implementation of the Maximum Likelihood (ML) decoder. However, it was proven that with a complex symbol constellation one cannot achieve a full rate code when the number of transmitting antennas is larger than two. Quasi-OSTC can have full rate even for more than two transmitting antennas but with the penalty of decoding complexity which becomes severe if the constellation size is high. In order to tackle these inherent drawbacks of the OSTC/QSTC we propose a new STC code that, when used with a new transmission and decoding methods, achieves full rate while maintaining linear complexity decoding for any number of transmit antennas. Also if the transmitter knows the strongest channel (through minimal feedback) the code also achieves full diversity along with better error rate than the OSTC and the QSTC.

Published in:

Information Theory Workshop, 2009. ITW 2009. IEEE

Date of Conference:

11-16 Oct. 2009