Self-Concatenated Codes with Self-Iterative Decoding for Power and Bandwidth Efficiency
Explore the source record for details and available documents.
SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Explore the source record for details and available documents.
Not Available
Explore the source record for details and available documents.
The density evolution method is used to analyze the performance and optimize the structure of parallel and serial turbo codes, and generalized serial concatenations of mixtures of different outer and inner codes. Design examples are given for mixture codes.
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 codewords bits, and an inner encoder whose input words are the permuted outer codewords.
Concatenated coding schemes with interleavers consist of the combination of two simple constituent encoders and an interleaver. The parallel concatenation known as.
Explore the source record for details and available documents.
Explore the source record for details and available documents.
Self-concatenated trellis coded modulation with b(q-1) interleavers is a concatenated coded scheme based on only one rate bq/n convolutional code.
We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code, or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on complexity. We define a partial ordering on trellises: if a trellis is optimum with respect to this partial ordering, it has the desirable property that it simultaneously minimizes all of the complexity measures examined. We examine properties of such optimal trellises and give examples of optimal permutations of codes, most notably the (48,24,12) quadratic residue code.
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.
The Consultative committee for Space Data STandards (CCSDS) recommends that space communication links employ a concatenated error-correcting channel-coding system in which the inner code is a convolutional (7, 2/2) code and the outer code is a (255,223) Reed-Solomon code.