Journal ArticleDOI
Lazy scheduling forLDPC decoding
D. Levin,E. Sharon,S. Litsyn +2 more
Reads0
Chats0
TLDR
A density evolution (DE) approach is developed for optimization of the parameters for choice of the messages to be updated and the resulting method reduces the decoding complexity by about 70-75% compared to the classical belief propagation (BP) scheme.Abstract:
A complexity reducing method for iterative message passing decoding algorithms of low-density parity-check (LDPC) codes is described. It is based on lazy scheduling which involves a partial update of messages in the iterations. A density evolution (DE) approach is developed for optimization of the parameters for choice of the messages to be updated. Combined with an efficient serial scheduling, the resulting method reduces the decoding complexity by about 70-75% compared to the classical belief propagation (BP) scheme, while maintaining the same performanceread more
Citations
More filters
Journal ArticleDOI
Efficient Serial Message-Passing Schedules for LDPC Decoding
TL;DR: A theoretical analysis of serial message passing decoding schedules is presented, showing that the evolution of the computation tree under serial scheduling shows that the tree grows twice as fast in comparison to the flooding schedule's one, indicating that the serial schedule propagates information twice asfast in the code's underlying graph.
Patent
Memory system and control method for the same
Kenji Sakurada,Hironori Uchikawa +1 more
TL;DR: In this paper, a memory system in an embodiment having a host and a memory card, including a plurality of semiconductor memory cells, each cell being configured to store N-bit coded data based on threshold voltage distributions, is presented.
Patent
Low density parity code (ldpc) decoding for memory with multiple log likelihood ratio (llr) decoders
TL;DR: In this paper, a first decoder attempts to decode a representation of a codeword, and if the attempt is unsuccessful, a second decoder tries to decode the representation.
Patent
Interruption criteria for block decoding
TL;DR: In this article, the decoding of a codeword is interrupted upon satisfaction of an interruption criterion that is either an order-dependent interruption criterion or an estimate of mutual information of the codewords and a vector that is used in the decoding iterations.
Patent
Overcoming ldpc trapping sets by decoder reset
TL;DR: In this paper, the decoding of a codeword that encodes K information bits as N>K codewords is updated by exchanging messages between N bit nodes and N-K check nodes of a graph.
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
The capacity of low-density parity-check codes under message-passing decoding
TL;DR: The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.
Patent
Operating techniques for reducing effects of coupling between storage elements of a non-volatile memory operated in multiple data states
TL;DR: In this article, the authors present a NAND type of flash EEPROM, where the memory is operated to minimize the effect of charge coupled between adjacent floating gates, by programming some cells a second time after adjacent cells have been programmed.
Journal ArticleDOI
Near optimum universal belief propagation based decoding of low-density parity check codes
Jinghu Chen,Marc P. C. Fossorier +1 more
TL;DR: A belief-propagation (BP)-based decoding algorithm which utilizes normalization to improve the accuracy of the soft values delivered by a previously proposed simplified BP-based algorithm is proposed.
Patent
Methods and apparatus for decoding ldpc codes
TL;DR: In this paper, a message passing decoding technique for low density parity check (LDPC) codes and long codewords is described, which allows decoding graph structures which are largely comprised of multiple identical copies of a much smaller graph.