ScholarLens Back to search
2004•Unpublished venueRequires access

Iteratively decoded space-time trellis codes

Junghoon Suh, M.K. Howlader

Open publisher page 2 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Space–time block code, Trellis (graph), Space–time trellis code, Block code, Computer science, Algorithm, Decoding methods, Transmission (telecommunications)

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Iteratively decoded space-time trellis codes — Research Paper | ScholarLens