Pipeline decoding of embedded trellis codes: Error-tolerance analysis

MaRDI QIDQ2640575zbMATH OpenFDO

Authors F. A. Taubin, A. N. Trofimov

Publication date 1990

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

error probabilitygaussian channelspipeline decodingtrellis codes

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12) Bounds on codes (94B65) Error probability in coding theory (94B70)

Review text

In this paper the authors undertake an analysis of the decoding procedure of the embedded trellis codes. There have been obtained the superior limits of the error probabilities in decoding for the gaussian channels. It is shown that the decoding algorithm is optimal for a \(E_ b/N_ 0\to \infty\) relation. It is drawn a comparison of the values obtained for \(P_ b\) (the error probability of bit) through the method previously suggested and in accordance with maximum-likelihood detector. A thorough analysis of the notions and parameters characterizing pipeline decoding is done. The authors give numerous illustrative examples for understanding the data presented in this article. Special mention should be made about the conciseness and elegance used in demonstrating the theorems and lemmas.

Recommendations

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 1026585
• scientific article; zbMATH DE number 3859037
• On the performance evaluation of trellis codes
• A trellis-based recursive maximum-likelihood decoding algorithm for binary linear block codes

Cited in

(1)

• Pipeline processing in low-density parity-check codes hardware decoder

This page was built for publication: Pipeline decoding of embedded trellis codes: Error-tolerance analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2640575)