Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding

DOI10.1109/TIT.2007.892778zbMATH Open1205.94067OpenAlexW1968626661MaRDI QIDQ3548205FDOQ3548205

Authors: Joseph B. Soriaga, Henry David Pfister, Paul Siegel 

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.2007.892778

Recommendations

• Binary intersymbol interference channels: gallager codes, density evolution, and code performance bounds
• scientific article; zbMATH DE number 2154519
• Constrained coding for binary channels with high intersymbol interference
• On multilevel codes and iterative multistage decoding
• On the symmetric information rate of two-dimensional finite-state ISI channels

zbMATH Keywords

coset codesdensity evolutioninformation ratesmultilevel codingmultistage decodingmagnetic recordingBahl-Cocke-Jelinek-Raviv (BCJR) algorithmfinite-state channelsintersymbol interference (ISI) channelslow-density paritycheck (LDPC) codes

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Cited In (3)

• On the Maximum Achievable Sum-Rate With Successive Decoding in Interference Channels
• Interference Decoding for Deterministic Channels
• On the Achievable Rate Regions for Interference Channels With Degraded Message Sets

This page was built for publication: Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding

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