Open Access
Modification Methods for Construction and Performance Analysis of Low-Density Parity-Check Codes over the Markov-Modulated Channels
Gou Hosoya,Hideki Yagi,Shigeichi Hirasawa +2 more
- 01 Jan 2004
TL;DR: By results of simulation, it is shown that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are protected by the distance between elements (DBE).
read more
Abstract: We derive burst error correctable length of the lowdensity parity-check (LDPC) codes by the iterative decoding algorithms. By results of simulation, we show that the decoding performance of iterative decoding algorithms for the LDPC codes over the Markovmodulated binary symmetric channels (MM-BSC) are aected by the distance between elements (DBE). We also show that some column permuted LDPC codes that have larger DBE, have robustness in error performance over the MM-BSC, compared to the original LDPC codes.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient design of non-binary LDPC codes for magnetic recording channels, robust to error bursts
Andrea Marinoni,Pietro Savazzi,Stefano Valle +2 more
- 24 Oct 2008
TL;DR: This work considers an optimized design of q-ary low-density parity-check (LDPC) codes that takes into account their burst error correction capability, and compares different matrix designs in order to choose the best matrix constraints to be maximized in a PEG construction.
13
Patent
Systems Using Low Density Parity Check Codes For Correcting Errors
Richard Leo Galbraith,Bruce Alexander Wilson,Travis Roger Oenning,Mario Blaum,Ksenija Lakovic,Ivana Djurdjevic +5 more
- 11 Mar 2008
TL;DR: In this paper, the parity check bits may comprise no more than four percent of the bits in the codewords of the low-density parity check code, which is the minimum separation of at least 7 between any two ones in each row of a parity-check matrix.
10
GTTI 2008: sessione Trasmissione Numerica Non-binary LDPC codes with good performance on channels afiected by bursty noise
Andrea Marinoni,Pietro Savazzi,Stefano Valle +2 more
- 01 Jan 2008
TL;DR: Two matrix design schemes, based on the main deflnitions of erasure burst proposed in literature, are presented and the performance of generated codes are evaluated on bursty noise channels, in order to highlight the main constraint that has to be taken into account for designing LDPC codes with a good burst error correction capability.
References
•Book
Low-Density Parity-Check Codes
Robert G. Gallager
- 01 Jan 1963
TL;DR: A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.
•Journal Article
Optimal decoding of linear codes for minimizing symbol error rate
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of Markov source observed through a discrete memoryless channel is considered.
6.8K
Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording
Hongxin Song,J.R. Cruz +1 more
TL;DR: This paper reports on the investigation of Q-ary LDPC coded MRCs, both with AWGN and with burst impairments, and presents a new reduced-complexity decoding algorithm for Q-ARY LDPC codes.
Low-Density Parity-Check Codes for Gilbert-Elliott and Markov-Modulated Channels
Andrew W. Eckford
- 01 Jan 2004
TL;DR: This thesis uses LDPC codes in an estimation-decoding scheme for the Gilbert-Elliott (GE) channel and more general Markovmodulated channels, and develops techniques that use density evolution results to more efficiently characterize the space of Markov-modulated parameters.
Finite-length analysis of low-density parity-check codes on the binary erasure channel
TL;DR: In this paper, the exact average bit and block erasure probability for a given regular ensemble of LDPC codes when decoded iteratively was derived for the binary erasure channel (BEC).