Proceedings ArticleDOI
Constrained coding techniques for soft iterative decoders
J.L. Fan,John M. Cioffi +1 more
- pp 723-727
Reads0
Chats0
TLDR
A solution is proposed which uses a modified concatenation scheme, in which the positions of the modulation and error-correcting codes are reversed, and improved performance is obtained by iterating with this soft constraint decoder.Abstract:
Soft iterative decoding of turbo codes and low-density parity check codes has been shown to offer significant improvements in performance. To apply soft iterative decoding to digital recorders, where binary modulation constraints are often used, modifications must be made to allow reliability information to be accessible by the decoder. A solution is proposed which uses a modified concatenation scheme, in which the positions of the modulation and error-correcting codes are reversed. In addition, a soft decoder based on the BCJR algorithm is introduced for the modulation constraint, and improved performance is obtained by iterating with this soft constraint decoder.read more
Citations
More filters
Journal ArticleDOI
VLSI architectures for iterative decoders in magnetic recording channels
TL;DR: The requirements for computational hardware and memory are analyzed, and suggestions for reduced-complexity decoding and reduced control logic are provided.
Proceedings ArticleDOI
High throughput low-density parity-check decoder architectures
TL;DR: Two decoding schedules and the corresponding serialized architectures for low-density parity-check (LDPC) decoders are presented and the performance of these decoding schedules is evaluated through simulations on a magnetic recording channel.
Journal ArticleDOI
Enforcing maximum-transition-run code constraints and low-density parity-check decoding
R.M. Todd,J.R. Cruz +1 more
TL;DR: A novel algorithm for imposing the maximum-transition-run (MTR) code constraint in the decoding of low-density parity-check (LDPC) codes over a partial response channel is presented.
Journal ArticleDOI
Hierarchical Distribution Matching for Probabilistically Shaped Coded Modulation
TL;DR: A hierarchical DM (HiDM) scheme, having fully parallelized input–output interfaces and a pipelined architecture that can efficiently perform the DM/invDM without the complex operations of previously proposed methods such as constant composition DM is proposed.
Book
Constrained Coding and Soft Iterative Decoding
TL;DR: Constrained coding and error-control coding are considered in a combined framework that allows the ECC decoder to gain direct access to the probabilities from the channel decoder.
References
More filters
Book
Low-Density Parity-Check Codes
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 ArticleDOI
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.
Journal ArticleDOI
Good error-correcting codes based on very sparse matrices
TL;DR: It is proved that sequences of codes exist which, when optimally decoded, achieve information rates up to the Shannon limit, and experimental results for binary-symmetric channels and Gaussian channels demonstrate that practical performance substantially better than that of standard convolutional and concatenated codes can be achieved.
Book
Turbo coding
Chris Heegard,Stephen B. Wicker +1 more
TL;DR: Turbo Coding as discussed by the authors presents a unified view of the field of turbo error control coding, summarizing recent results in the areas of encoder structure and performance analysis, and introduces new material, including a general theory for the analysis and design of interleavers and a unified framework for decoding algorithms.