Tracking Forecast Memories in stochastic decoders

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.

[1]  Shie Mannor,et al.  Stochastic decoding of LDPC codes , 2006, IEEE Communications Letters.

[2]  Shie Mannor,et al.  Fully Parallel Stochastic LDPC Decoders , 2008, IEEE Transactions on Signal Processing.

[3]  A. Blanksby,et al.  A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.

[4]  Bo Zhu,et al.  Stochastic Decoding of Linear Block Codes With High-Density Parity-Check Matrices , 2008, IEEE Transactions on Signal Processing.

[5]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[6]  Vincent C. Gaudet,et al.  Iterative decoding using stochastic computation , 2003 .

[7]  Frank R. Kschischang,et al.  Block-Interlaced LDPC Decoders With Reduced Interconnect Complexity , 2008, IEEE Transactions on Circuits and Systems II: Express Briefs.

[8]  A. J. Blanksby,et al.  A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.

[9]  Shie Mannor,et al.  An Area-Efficient FPGA-Based Architecture for Fully-Parallel Stochastic LDPC Decoding , 2007, 2007 IEEE Workshop on Signal Processing Systems.

[10]  Radford M. Neal,et al.  Near Shannon limit performance of low density parity check codes , 1996 .