Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes

DOI10.1109/TIT.2005.853312MaRDI QIDQ3546607zbMATH OpenOpenAlexFDO

Authors Fredrik Brannstrom, Lars K. Rasmussen, Alex Grant

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2005.853312

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Convergence behavior of iteratively decoded parallel concatenated codes
• Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
• Concatenated Codes: Serial and Parallel
• Extrinsic information transfer functions: model and erasure channel properties
• Efficient Serial Message-Passing Schedules for LDPC Decoding

Cited in

(3)

• Convergence analysis of turbo decoding of serially concatenated block codes and product codes
• Link-Level Aspects
• System Level Aspects for Single Cell Scenarios

This page was built for publication: Convergence Analysis and Optimal Scheduling for Multiple Concatenated Codes

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