By Topic

Full rate space-time turbo codes for general constellations

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

1 Author(s)
Motwani, R./A/.R. ; Indian Inst. of Technol., Kanpur, India

In this paper, we construct full rate parallel concatenated space-time turbo codes which offer full diversity. The constituent codes of this space-time turbo code are the super-orthogonal space-time trellis codes (SOSTTC (Seshadri et al. (2002)). The iterative decoding of these parallel concatenated codes requires the constituent SOSTTC to be recursive. Hence, we first modify the trellis of the SOSTTC to make the encoders recursive. In order to ensure full rate, puncturing of the outputs of the two constituent SOSTTC codes has to be performed. In order to guarantee full diversity, the rank criterion has to be satisfied. With a recursive encoder trellis construction and uniform puncturing scheme, we construct space-time turbo codes with full diversity at full rate. The constructed space-time turbo codes are for general constellations and for a greater number of transmit antennas as compared to earlier works on space-time turbo codes, wherein the constellation is restricted to BPSK and the number of transmit antennas is restricted to 2 or 3. Simulation results show that the performance of these codes is better than earlier proposed schemes for same bandwidth efficiency.

Published in:

Signal Processing Advances in Wireless Communications, 2003. SPAWC 2003. 4th IEEE Workshop on

Date of Conference:

15-18 June 2003