Journal ArticleDOI
Reduced complexity iterative decoding of low-density parity check codes based on belief propagation
Reads0
Chats0
TLDR
Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed, which greatly simplifies the decoding complexity of belief propagation.Abstract:
Two simplified versions of the belief propagation algorithm for fast iterative decoding of low-density parity check codes on the additive white Gaussian noise channel are proposed. Both versions are implemented with real additions only, which greatly simplifies the decoding complexity of belief propagation in which products of probabilities have to be computed. Also, these two algorithms do not require any knowledge about the channel characteristics. Both algorithms yield a good performance-complexity trade-off and can be efficiently implemented in software as well as in hardware, with possibly quantized received values.read more
Citations
More filters
Proceedings ArticleDOI
New Memory Load Optimization Approach for Software Implementation of Irregular LDPC Encoder/Decoder
TL;DR: A new model for memory loading of the LDPC parity-check matrix aiming to use only the Level one of cache memory, to take advantage of its high speed latency.
Efficient Algorithms for Stochastic Decoding of LDPC Codes
TL;DR: This dissertation analyzes the characteristics of stochastic decoding and proposes reduced-latency designs for stochastically LDPC decoders to achieve improved performance on various channel models and statistically analyze the behavior of stoChastic LDPC decoding, including randomization in the Stochastic streams and convergence of transition probabilities in iterative decoding process.
Journal ArticleDOI
Blind frame synchronization of Reed–Solomon coded optical transmission systems
TL;DR: A new blind frame synchronization method for optical packet transmission systems using Reed–Solomon codes in hard decision situations by calculating the rank of the syndrome matrix which denotes how many errors occurred in a packet.
Patent
Decoder, reception apparatus, decoding method, and reception method
Yutaka Murakami,Shutai Okamura +1 more
TL;DR: In this article, an encoder, a transmitting device, a coding method and a transmission method with which the transmission amount is reduced and a deterioration in transmission efficiency is suppressed while improving reception quality when QC-LDPC or a like block coding is used.
Journal ArticleDOI
Accumulate Repeat Accumulate Check Accumulate Codes
Ki Jun Jeon,Kwang Soon Kim +1 more
TL;DR: The simulation results confirm the superiority of the proposed ARACA codes in terms of encoding complexity and frame error rate performance, especially at low-rates in an ultra-reliable regime.
References
More filters
Book
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.
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
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.
Journal ArticleDOI
A recursive approach to low complexity codes
TL;DR: It is shown that choosing a transmission order for the digits that is appropriate for the graph and the subcodes can give the code excellent burst-error correction abilities.
Journal ArticleDOI
Near Shannon limit performance of low density parity check codes
TL;DR: The authors report the empirical performance of Gallager's low density parity check codes on Gaussian channels, showing that performance substantially better than that of standard convolutional and concatenated codes can be achieved.