Iteratively decoded space-time trellis codes

Space-time trellis codes (STTC) have been proposed as the constituent codes of turbo codes (D Cui et al., 1999) (W Firmanto et al., 2001). In this article, we propose a similar scheme, the iteratively decoded space-time trellis codes (ISTTC), and derive the performance upper bound on BER. When the S...

Full description

Saved in:
Bibliographic Details
Main Authors: Junghoon Suh, Howlader, M.K.
Format: Conference Proceeding
Language:English
Subjects:
Applied sciences
Bit error rate
Block codes
Coding, codes
Convolutional codes
Exact sciences and technology
Information, signal and communications theory
Iterative decoding
Power system reliability
Radiocommunications
Signal and communications theory
Telecommunications
Telecommunications and information theory
Transmitters
Transmitters. Receivers
Transmitting antennas
Turbo codes
Upper bound
Wireless communication
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Space-time trellis codes (STTC) have been proposed as the constituent codes of turbo codes (D Cui et al., 1999) (W Firmanto et al., 2001). In this article, we propose a similar scheme, the iteratively decoded space-time trellis codes (ISTTC), and derive the performance upper bound on BER. When the STTC are combined with space-time block codes (STTC-STBC), it provides an improved BER over the system with STTC only. Here, we also propose the iteratively decoded STTC-STBC (ISTTC-STBC) to improve both the performance and the rate. It can compensate the reduced transmission rate caused from the iteratively decoded STTC to combine the STBC having more transmitters than the constituent STTC. This paper presents the details of computing the extrinsic information shared between two constituent decoders, design schemes of ISTTC with or without STBC, and their performance results shown via simulation.
ISSN:1525-3511
1558-2612
DOI:10.1109/WCNC.2004.1311798