Dynamics and performance analysis of analog iterative decoding for low-density parity-check (LDPC) codes

Conventional iterative decoding with flooding or parallel schedule can be formulated as a fixed-point problem solved iteratively by a successive substitution (SS) method. In this paper, we investigate the dynamics of a continuous-time (asynchronous) analog implementation of iterative decoding, and show that it can be approximated as the application of the well-known successive relaxation (SR) method for solving the fixed-point problem. We observe that SR with the optimal relaxation factor can considerably improve the error-rate performance of iterative decoding for short low-density parity-check (LDPC) codes, compared with SS. Our simulation results for the application of SR to belief propagation (sum-product) and min-sum algorithms demonstrate improvements of up to about 0.7 dB over the standard SS for randomly constructed LDPC codes. The improvement in performance increases with the maximum number of iterations, and by accordingly reducing the relaxation factor. The asymptotic result, corresponding to an infinite maximum number of iterations and infinitesimal relaxation factor, represents the steady-state performance of analog iterative decoding. This means that under ideal circumstances, continuous-time (asynchronous) analog decoders can outperform their discrete-time (synchronous) digital counterparts by a large margin. Our results also indicate that with the assumption of a truncated Gaussian distribution for the random delays among computational modules, the error-rate performance of the analog decoder, particularly in steady state, is rather independent of the variance of the distribution. The proposed simple model for analog decoding, and the associated performance curves, can be used as an "ideal analog decoder" benchmark for performance evaluation of analog decoding circuits.

[1]  C. Kelley.  Iterative Methods for Linear and Nonlinear Equations , 1987 .

[2]  Jan M. Rabaey,et al.  Digital Integrated Circuits: A Design Perspective , 1995 .

[3]  Edgar Sanchez-Sinencio,et al.  Floating-gate analog implementation of the additive soft-input soft-output decoding algorithm , 2003 .

[4]  Marc P. C. Fossorier,et al.  Iterative reliability-based decoding of low-density parity check codes , 2001, IEEE J. Sel. Areas Commun..

[5]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[6]  P. Moqvist,et al.  Turbo-decoding as a numerical analysis problem , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[7]  D. Young,et al.  A Survey of Numerical Mathematics , 1988 .

[8]  Joachim Hagenauer,et al.  WA 21.5 An Analog 0.25∝m BiCMOS Tailbiting MAP Decoder , 2000 .

[9]  G. Dahlquist.  A special stability problem for linear multistep methods , 1963 .

[10]  R.R. Harrison,et al.  CMOS analog MAP decoder for (8,4) Hamming code , 2004, IEEE Journal of Solid-State Circuits.

[11]  Amir H. Banihashemi,et al.  On implementation of min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes , 2005, IEEE Transactions on Communications.

[12]  Jinghu Chen,et al.  Near optimum universal belief propagation based decoding of low-density parity check codes , 2002, IEEE Trans. Commun..

[13]  Jinghu Chen,et al.  Density evolution for two improved BP-Based decoding algorithms of LDPC codes , 2002, IEEE Communications Letters.

[14]  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.

[15]  Niclas Wiberg,et al.  Codes and Decoding on General Graphs , 1996 .

[16]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[17]  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.

[18]  J. Lambert.  Numerical Methods for Ordinary Differential Systems: The Initial Value Problem , 1991 .

[19]  Amir H. Banihashemi,et al.  Full cmos min-sum analog iterative decoder , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[20]  M. Moerz,et al.  An analog 0.25 /spl mu/m BiCMOS tailbiting MAP decoder , 2000, 2000 IEEE International Solid-State Circuits Conference. Digest of Technical Papers (Cat. No.00CH37056).

[21]  P.G. Gulak,et al.  A 13.3Mb/s 0.35/spl mu/m CMOS analog turbo decoder IC with a configurable interleaver , 2003, 2003 IEEE International Solid-State Circuits Conference, 2003. Digest of Technical Papers. ISSCC..

[22]  Thomas J. Richardson,et al.  The geometry of turbo-decoding dynamics , 2000, IEEE Trans. Inf. Theory.

[23]  Vincent C. Gaudet,et al.  Decoder IC with a Configurable Interleaver , 2003 .

[24]  Carver Mead,et al.  Analog VLSI and neural systems , 1989 .

[25]  A. Neviani,et al.  A 0.35-/spl mu/m CMOS analog turbo decoder for the 40-bit rate 1/3 UMTS channel code , 2005, IEEE Journal of Solid-State Circuits.

[26]  Amir H. Banihashemi,et al.  Iterative decoding in analog CMOS , 2003, GLSVLSI '03.

[27]  Amir H. Banihashemi,et al.  Improving belief propagation on graphs with cycles , 2004, IEEE Communications Letters.

[28]  Amir H. Banihashemi,et al.  A heuristic search for good low-density parity-check codes at short block lengths , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[29]  H. Loeliger,et al.  Probability propagation and decoding in analog VLSI , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[30]  Joachim Hagenauer,et al.  Decoding and Equalization with Analog Non-linear Networks , 1999, Eur. Trans. Telecommun..