Engineering topics
Publications and source records attributed to Benedetto, S..
Self-concatenated trellis coded modulation with b(q-1) interleavers is a concatenated coded scheme based on only one rate bq/n convolutional code.
Serial concatenation of an outer binary convolutional code with an inner TCM code over a multidimensional Euclidean constellation through an interleaver, allows to extend the extremely good performance of turbo codes to the case of high spectral efficiency.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
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.
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.
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.
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.
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.
Concatenated coding schemes consist of the combination of two or more simple constituent encoders and interleavers.
Concatenated coding schemes with interleavers consist of the combination of two simple constituent encoders and an interleaver. The parallel concatenation known as.
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.
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.