Computer Science – Information Theory
Scientific paper
2011-02-23
Computer Science
Information Theory
This paper has been withdrawn by the authors. To be presented at IEEE ICC 2011, Kyoto, Japan. June 2011
Scientific paper
Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a parallel concatenation of two non-binary, time-variant accumulators. The second construction is based on the serial concatenation of a non-binary, time-variant differentiator and of a non-binary, time-variant accumulator, and provides a highly-structured flexible encoding scheme for (dv=2,dc=4) ensemble codes. A cycle graph representation is provided. The proposed codes can be decoded efficiently either as low-density parity-check codes (via belief propagation decoding over the codes bipartite graph) or as turbo codes (via the forward-backward algorithm applied to the component codes trellis). The forward-backward algorithm for symbol maximum a posteriori decoding of the component codes is illustrated and simplified by means of the fast Fourier transform. The proposed codes provide remarkable gains (~ 1 dB) over binary low-density parity-check and turbo codes in the moderate-short block regimes.
Chiani Marco
Liva Gianluigi
Paolini Enrico
Scalise Sandro
No associations
LandOfFree
Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Turbo Codes Based on Time-Variant Memory-1 Convolutional Codes over Fq will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-174523