Results 1 - 10 of 13,973

Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes

by Sergio Benedetto, Guido Montorsi , 1995
"... A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits to ..."
Abstract - Cited by 314 (6 self) - Add to MetaCart
A parallel concatenated coding scheme consists of two simple constituent systematic encoders linked by an interleaver. The input bits to the first encoder are scrambled by the interleaver before entering the second encoder. The codeword of the parallel concatenated code consists of the input bits

Iterative Decoding Trajectories of Parallel Concatenated Codes

by Stephan Ten Brink - Proc. 3rd IEEE/ITG Conference on Source and Channel Coding , 2000
"... Mutual information transfer charac-teristics for soft in/soft out decoders are proposed as a tool to better understand the convergence behavior of iterative decoding schemes. The exchange of extrin-sic information is visualized as a decoding trajectory in the Extrinsic Information Transfer Chart. Th ..."
Abstract - Cited by 37 (2 self) - Add to MetaCart
. This al-lows the prediction of turbo cliff position and bit er-ror rate after an arbitrary number of iterations. The influence of code memory, generator polynomials as well as different constituent codes on the convergence behavior is studied for parallel concatenated codes. I.

Optimal Puncturing for Multiple Parallel Concatenated Codes

by Fredrik Brännström, Lars K. Rasmussen
"... Abstract — Optimal puncturing ratios for parallel concatenated codes with two or more constituent codes are found using extrinsic information transfer functions. These ratios minimize the signal-to-noise ratio convergence threshold and provide additional degrees of freedom for constructing codes wit ..."
Abstract - Cited by 2 (1 self) - Add to MetaCart
Abstract — Optimal puncturing ratios for parallel concatenated codes with two or more constituent codes are found using extrinsic information transfer functions. These ratios minimize the signal-to-noise ratio convergence threshold and provide additional degrees of freedom for constructing codes

New Bandwidth Efficient Parallel Concatenated Coding

by Benedetto Montorsi' Dipartimento, D. Divsalar, G. Montorsi, F. Pollara
"... We propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2 bits/see/Hz with 8PSK and 16QAM signal constellations. For parallel Part of the research described in ..."
Abstract - Add to MetaCart
We propose a new solution to parallel concatenation of trellis codes with multilevel amplitude/phase modulations and a suitable iterative decoding structure. Examples are given for throughputs 2 bits/see/Hz with 8PSK and 16QAM signal constellations. For parallel Part of the research described

Multiple parallel concatenated codes with optimal puncturing and energy distribution

by Fredrik Brännström - in Proc. IEEE Int. Conf. Commun.(ICC ’05), Seoul, Korea , 2005
"... Abstract — In this paper we show how to find optimal energy distribution together with optimal puncturing ratios for parallel concatenated codes with two or more constituent codes. The energy distribution and the puncturing ratios are optimal in terms of minimizing the average signal-to-noise ratio ..."
Abstract - Cited by 7 (5 self) - Add to MetaCart
Abstract — In this paper we show how to find optimal energy distribution together with optimal puncturing ratios for parallel concatenated codes with two or more constituent codes. The energy distribution and the puncturing ratios are optimal in terms of minimizing the average signal-to-noise ratio

Transactions Papers Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes

by Stephan Ten Brink
"... Abstract—Mutual information transfer characteristics of soft in/soft out decoders are proposed as a tool to better understand the convergence behavior of iterative decoding schemes. The exchange of extrinsic information is visualized as a decoding trajectory in the extrinsic information transfer cha ..."
Abstract - Add to MetaCart
chart (EXIT chart). This allows the prediction of turbo cliff position and bit error rate after an arbitrary number of iterations. The influence of code memory, code polynomials as well as different constituent codes on the convergence behavior is studied for parallel concatenated codes. A code search

Optimal Puncturing Ratios and Energy Distribution for Multiple Parallel Concatenated Codes

by Lars K. Rasmussen, Alex J. Grant
"... Extrinsic information transfer (EXIT) charts have been used extensively for designing concatenated coding schemes with iterative decoding. The area between the two transfer curves has been shown to approximate the gap to channel capacity. A curve-fitting procedure on EXIT charts was previously sugge ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
suggested for designing low density parity check codes. In this paper, we develop a similar approach for shaping the EXIT charts of multiple parallel concatenated codes (MPCCs) with two or more constituent codes. Random puncturing and unequal energy distributions across parallel coding streams provide

Design of parallel concatenated convolutional codes

by Sergio Benedetto, Senior Member, Guido Montorsi - IEEE Transactions on Communications , 1996
"... Abstract-. ’ parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords of the para ..."
Abstract - Cited by 130 (10 self) - Add to MetaCart
Abstract-. ’ parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the first encoder are scrambled by the interleaver before entering the second encoder. The codewords

Near Shannon limit error-correcting coding and decoding

by Claude Berrou, Alain Glavieux, Punya Thitimajshima , 1993
"... Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes and the associated ..."
Abstract - Cited by 1776 (6 self) - Add to MetaCart
Abstract- This paper deals with a new class of convolutional codes called Turbo-codes, whose performances in terms of Bit Error Rate (BER) are close to the SHANNON limit. The Turbo-Code encoder is built using a parallel concatenation of two Recursive Systematic Convolutional codes

Good Error-Correcting Codes based on Very Sparse Matrices

by David J.C. MacKay , 1999
"... We study two families of error-correcting codes defined in terms of very sparse matrices. "MN" (MacKay--Neal) codes are recently invented, and "Gallager codes" were first investigated in 1962, but appear to have been largely forgotten, in spite of their excellent properties. The ..."
Abstract - Cited by 750 (23 self) - Add to MetaCart
but also for any channel with symmetric stationary ergodic noise. We give experimental results for binary-symmetric channels and Gaussian channels demonstrating that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved; indeed
Results 1 - 10 of 13,973