Performance limits of compound codes with symbol-based iterative decoding

MaRDI QIDQ2741418zbMATH OpenFDO

Authors H. Sawaya, Sandrine Vialle, Joseph Boutros, Gilles Zémor

Publication date 14 October 2001

zbMATH Keywords

probability density functionperformance limitconcatenated codesbinary convolutional codescompound codeparallel turbo codessignal-to-noise ratio limitsymbol-based iterative decoding

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Analyzing the turbo decoder using the Gaussian approximation
• Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
• Convergence behavior of iteratively decoded parallel concatenated codes
• Unveiling turbo codes: some results on parallel concatenated coding schemes
• Graph-based iterative decoding algorithms for parity-concatenated trellis codes

Cites work

• scientific article; zbMATH DE number 3251924 (Why is no real title available?)
• A recursive approach to low complexity codes
• Good error-correcting codes based on very sparse matrices
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• The capacity of low-density parity-check codes under message-passing decoding

This page was built for publication: Performance limits of compound codes with symbol-based iterative decoding

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