A simple taboo-based soft-decision decoding algorithm for expander codes

We present a simple soft-decision decoding algorithm that modifies Sipser and Spielman's (see IEEE Trans, Inform. Theory, vol.42, p.1710-22, Nov. 1996) hard-decision sequential "bit-flipping" algorithm for decoding expander codes. The algorithm incorporates symbol reliability information and a simple "taboo" function that avoids repeated flipping of the same bit. The two algorithms have comparable simplicity, but simulations show that the soft-decision algorithm results in both improved performance and-because fewer decoding iterations are necessary-improved speed.

[1]  Michael Horstein,et al.  Review of 'Low-Density Parity-Check Codes' (Gallager, R. G.; 1963) , 1964, IEEE Transactions on Information Theory.

[2]  Fred W. Glover,et al.  A user's guide to tabu search , 1993, Ann. Oper. Res..

[3]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.