Journal Article10.1109/TMAG.2007.912943
Iterative Decoding Based on Error Pattern Correction
TL;DR: This paper considers a turbo-equalizer system that utilizes the error-pattern correcting code (EPCC) as a building component, and a soft-input soft-output (SISO) decoder for the EPCC is described, and the performance of the proposed turboequalizer is compared with those of the conventional turbo equalizer and a low density parity check (LDPC) code system.
read more
Abstract: The error-pattern correction code is a code specialized to correct dominant error patterns observed at the channel detector output in heavy intersymbol interference channels. In this paper, we consider a turbo-equalizer system that utilizes the error-pattern correcting code (EPCC) as a building component. A soft-input soft-output (SISO) decoder for the EPCC is described, and the performance of the proposed turbo equalizer is compared with those of the conventional turbo equalizer and a low density parity check (LDPC) code system.
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
Design of Protograph LDPC Codes for Partial Response Channels
TL;DR: Two of the proposed codes are superior to the regular column-weight-3 LDPC code and thus they are good alternatives compared to other error-correction codes for use in data storage systems.
62
Finite-Length Extrinsic Information Transfer (EXIT) Analysis for Coded and Precoded ISI Channels
Peiyu Tan,Jing Li +1 more
TL;DR: It is found that short-length channel codes may exhibit distinctively different EXIT behaviors in different rate regions, and it is important to couple the precoder and the channel code.
9
An Iteratively Decodable Tensor Product Code with Application to Data Storage
Hakim Alhussien,Jaekyun Moon +1 more
TL;DR: In this article, a tensor error-pattern correcting code (T-EPCC) is proposed to provide a syndrome decoding table targeting the dominant error events of an inter-symbol interference channel at the output of the Viterbi detector.
7
Two-Dimensional Error-Pattern-Correcting Codes
Sung Whan Yoon,Jaekyun Moon +1 more
TL;DR: The effectiveness of the proposed coding approach is demonstrated versus the maximum-distance-separable (MDS) random-error-correcting code and known 2D burst-Correcting codes for a 2D intersymbol interference (ISI) channel that yields a few dominant, but relatively large error patterns.
6
•Dissertation
Channel matched iterative decoding for magnetic recording systems
AbdelHakim Salem Alhussien
- 01 Apr 2009
TL;DR: This dissertation aims to provide a history of electrical engineering in China and its applications in the 21st Century by describing the development of electric power supplies and their role in the urban environment.
3
References
•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
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
TL;DR: The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered and an optimal decoding algorithm is derived.
5.1K
Class of algorithms for decoding block codes with channel measurement information
TL;DR: It is shown that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved, and computer simulations indicate that even for SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures.
1.2K
Near-optimum decoding of product codes: block turbo codes
TL;DR: An iterative decoding algorithm for any product code built using linear block codes based on soft-input/soft-output decoders for decoding the component codes so that near-optimum performance is obtained at each iteration.
1K
LDPC block and convolutional codes based on circulant matrices
TL;DR: A class of algebraically structured quasi-cyclic low-density parity-check (LDPC) codes and their convolutional counterparts is presented and bounds on the girth and minimum distance of the codes are found, and several possible encoding techniques are described.