Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes

DOI10.1109/TIT.2007.899543MaRDI QIDQ3549022zbMATH OpenFDO

Authors Idan Goldenberg, Igal Sason

Publication date 21 December 2008

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

Full work available at URL https://arxiv.org/abs/cs/0609099

zbMATH Keywords

distance spectrumiterative decodingparallel channelsAccumulate-repeat-accumulate codesinput-output weight enumerator (IOWE)linear codes, maximum-likelihood (ML) decodingmemoryless binary-input output-symmetric (MBIOS) channels

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Cyclic codes (94B15) Bounds on codes (94B65)

Abstract: This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New upper bounds on the maximum-likelihood (ML) decoding error probability are derived. The framework of the second version of the Duman and Salehi (DS2) bounds is generalized to the case of parallel channels, along with the derivation of optimized tilting measures. The connection between the generalized DS2 and the 1961 Gallager bounds, known previously for a single channel, is revisited for the case of parallel channels. The new bounds are used to obtain improved inner bounds on the attainable channel regions under ML decoding. These improved bounds are applied to ensembles of turbo-like codes, focusing on repeat-accumulate codes and their recent variations.

Recommendations

• Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
• Reliable channel regions for good binary codes transmitted over parallel channels
• On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
• Variations on the Gallager bounds, connections, and applications
• Unveiling turbo codes: some results on parallel concatenated coding schemes

Cited in

(8)

• Coding theorems for turbo code ensembles
• Gallager codes for CDMA applications. II: Implementations, complexity, and system capacity
• On improved bounds on the decoding error probability of block codes over interleaved fading channels, with applications to turbo-like codes
• Improved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
• Variations on the Gallager bounds with some applications
• Variations on the Gallager bounds, connections, and applications
• Performance bounds for high rate linear codes over partial-response channels
• Reliable channel regions for good binary codes transmitted over parallel channels

This page was built for publication: Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes

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