A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer code words bits, and an inner encoder whose input words are the permuted outer code words.

concatenated↗

NASA NTRS1998

Analysis, Design and Iterative Decoding of Double Serially Concatenated Codes with Interleavers

A double serially concatenated code with two interleavers consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords.

encoder interleaver permuting algorithm concatenat↗

NASA NTRS1998

Soft-Input Soft-Output Modules for the Construction and Distributed Iterative Decoding of Code Networks

Soft-input soft-output building blocks (modules) are presented to construct and iteratively decode in a distributed fashion code networks, a new concept that includes, and generalizes, various forms of concatenated coding schemes.

iterative decoding turbo codes serial concatenated↗

NASA NTRS1997

Serial Concatenated Trellis Coded Modulation with Iterative Decoding: Design and Performance

In this paper, we propose a novel method to design serial concatenation of an outer convolutional code with an inner trellis code with multi-level amplitude/phase modulations and a suitable bit-by-bit iterative decoding structure.

iterative decoder TCM serially concatenated TCM de↗

NASA NTRS1997

Herative Decoding of Serially Concatenated Codes with Interleavers and Comparison with Turbo Codes

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codewords bits, and an inner encoder whose input words are the permuted outer codewords.

low-complexity iterative decoding simulation compa↗

NASA NTRS1997

Serial and Hybrid Concatenated Codes with Applications

Analytical bounds on the performance of concatenated codes on a tree structure are obtained. Analytical results are applied to examples of parallel concatenation of two codes (turbo codes), serial concatenation of two codes, hybrid concatenation of three codes, and self concatenated codes, over AWGN and fading channels.

AWGN MPSK modulations Rayleigh fading channels↗

NASA NTRS1997

Serial Concatenated Trellis Coded Modulation with Iterative Decoding

We propose a design approach for serial concatenation of an outer convolutional code and an inner trellis code with multilevel amplitude/phase modulations using a bit-by-bit iterative decoding scheme.

Concatenation↗

NASA NTRS1997

Turbo Trellis Coded Modulation with Iterative Decoding for Mobile Satellite Communications

In this paper, analytical bounds on the performance of parallel concatenation of two codes, known as turbo codes, and serial concatenation of two codes over fading channels are obtained.

Parallel↗

NASA NTRS1997

Design of Serially Concatenated Interleaved Codes

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, and an inner encoder whose input words are the permuted outer codewords.

Interleaved Codes Concatenation↗

NASA NTRS1997

Turbo Trellis Coded Modulation With Iterative Decoding for Mobile Satellite Communications

In this paper, analytical bounds on the performance of parallel concatenation of two codes, known as turbo codes, and serial concatenation of two codes over fading channels are obtained. Based on this analysis, design criteria for the selection of component trellis codes for MPSK modulation, and a suitable bit-by-bit iterative decoding structure are proposed. Examples are given for throughput of 2 bits/sec/Hz with 8PSK modulation. The parallel concatenation example uses two rate 4/5 8-state convolutional codes with two interleavers. The convolutional codes' outputs are then mapped to two 8PSK modulations. The serial concatenated code example uses an 8-state outer code with rate 4/5 and a 4-state inner trellis code with 5 inputs and 2 x 8PSK outputs per trellis branch. Based on the above mentioned design criteria for fading channels, a method to obtain he structure of the trellis code with maximum diversity is proposed. Simulation results are given for AWGN and an independent Rayleigh fading channel with perfect Channel State Information (CSI).

Divsalar, D.↗

NASA NTRS1997

A Soft-Input Soft-Output APP Module for Iterative Decoding of Concatenated Codes

Concatenated coding schemes consist of the combination of two or more simple constituent encoders and interleavers.

turbo code↗

NASA NTRS1996

Continuous MAP Algorithms and Their Applications to Decode Parallel and Serial Code Concatenations

Concatenated coding schemes with interleavers consist of the combination of two simple constituent encoders and an interleaver. The parallel concatenation known as.

algorithms decoding parallel code concatenations s↗

NASA NTRS1996

Soft-output decoding algorithms in iterative decoding of turbo codes

In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also given of how to embed the maximum a posteriori algorithms into the iterative decoding of parallel concatenated codes (turbo codes). The performances of the two algorithms are compared on the basis of a powerful rate 1/3 parallel concatenated code. Basic circuits to implement the simplified a posteriori decoding algorithm using lookup tables, and two further approximations (linear and threshold), with a very small penalty, to eliminate the need for lookup tables are proposed.

Benedetto, S.↗

NASA NTRS1996

Soft-Output Decoding Algorithms in Iterative Decoding of Turbo Codes

Benedetto, S.↗