Conference Proceeding

A Markov chain model for Edge Memories in stochastic decoding of LDPC codes

Dept. of Electr. & Comput. Eng., Northeastern Univ., Boston, MA, USA
04/2011; DOI:10.1109/CISS.2011.5766114 In proceeding of: Information Sciences and Systems (CISS), 2011 45th Annual Conference on
Source: IEEE Xplore

ABSTRACT Stochastic decoding is a recently proposed method for decoding Low-Density Parity-Check (LDPC) codes. Stochastic decoding is, however, sensitive to the switching activity of stochastic bits, which can result in a latching problem. Using Edge Memories (EMs) has been proposed as a method to counter the latching problem in stochastic decoding. In this paper, we introduce a Markov chain model for EMs and study state transitions over decoding cycles. The proposed method can be used to determine the convergence and the required number of decoding cycles in stochastic decoding. Moreover, it can help to study the behavior of decoding process and to estimate the decoding time.

0 0
 · 
0 Bookmarks
 · 
69 Views
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: This paper proposes tracking forecast memories (TFMs) as a novel method for implementing re-randomization and decorrelation of stochastic bit streams in stochastic channel decoders. We show that TFMs are able to achieve decoding performance similar to that of the previous methods in the literature (i.e., edge memories or EMs), but they exhibit much lower hardware complexity. TFMs significantly reduce the area requirements of ASIC implementations of stochastic decoders.
    Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on; 05/2009 · 4.63 Impact Factor
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: This paper presents a stochastic algorithm for iterative error control decoding. We show that the stochastic decoding algorithm is an approximation of the sum-product algorithm. When the code's factor graph is a tree, as with trellises, the algorithm approaches maximum a-posteriori decoding. We also demonstrate a stochastic approximations to the alternative update rule known as successive relaxation. Stochastic decoders have very simple digital implementations which have almost no RAM requirements. We present example stochastic decoders for a trellis-based Hamming code, and for a Block Turbo code constructed from Hamming codes.
    03/2005;
  • [show abstract] [hide abstract]
    ABSTRACT: An iterative decoding architecture based on stochastic computational elements is proposed. Simulation results for a simple low-density parity-check code demonstrate near-optimal performance with respect to a maximum likelihood decoder. The proposed method provides an alternative to analogue decoding for high-speed/low-power applications.
    Electronics Letters 03/2003; · 1.04 Impact Factor

Full-text (3 Sources)

View
11 Downloads
Available from
Jul 8, 2013