Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF(<em>q</em>)

HAN Guojun; LIU Xingcheng; GONG Yi

Article Contents

Article Navigation > Chinese Journal of Electronics > 2013 > 22(3): 609-614

HAN Guojun, LIU Xingcheng, GONG Yi, “Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF(q),” Chinese Journal of Electronics, vol. 22, no. 3, pp. 609-614, 2013,

Citation:

HAN Guojun, LIU Xingcheng, GONG Yi, “Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF(q),” Chinese Journal of Electronics, vol. 22, no. 3, pp. 609-614, 2013,

HAN Guojun, LIU Xingcheng, GONG Yi, “Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF(q),” Chinese Journal of Electronics, vol. 22, no. 3, pp. 609-614, 2013,

Citation:

HAN Guojun, LIU Xingcheng, GONG Yi, “Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF(q),” Chinese Journal of Electronics, vol. 22, no. 3, pp. 609-614, 2013,

PDF( 516 KB)

Layered Dynamic Schedulings for BP Decoding of LDPC Codes over GF(q)

1.
School of Information and Engineering, Guangdong University of Technology, Guangzhou 510006, China;
2.
Department of Electronic and Communications Engineering, Sun Yat-sen University, Guangzhou 510275, China;
3.
School of Mathematics and Computational Science, Sun Yat-sen University, Guangzhou 510275, China

Funds: This work is supported by the National Natural Science Foundation of China (No.61172076, No.61102070, No.60970041, No.61173018), the Science and Technology Plan of Guangzhou City of China (No.2012J4300032).

Received Date: 2012-01-01
Rev Recd Date: 2013-01-01
Publish Date: 2013-06-15

Abstract

Abstract

A Layered dynamic scheduling (LDS) for Belief-propagation (BP) decoding of LDPC codes over GF(q) is presented, which is derived from the dynamic scheduling for the BP decoding of binary LDPC codes. In order to restrain the LDS from cycling in certain checknodes, a life-index for each check-node is adopted and the optimal value of the life-index is analyzed. Furthermore, in consideration of hardware implementation and decoding latency, a strategy, which allows many more checknodes to be updated in parallel, is introduced. Simulations show that the LDS with life-index speeds up the convergence rate and greatly improves the performance of the BP decoding at medium to high signal-to-noise ratio value, and the algorithm employing the LDS with life-index and the new strategy offers good trade-off between the performance and the decoding latency.
- Belief-propagation (BP),
- Dynamic scheduling,
- Low-density parity-check (LDPC) codes,
- Nonbinary,
- Residual

FullText(HTML)

References(16)

References

R.G. Gallager, “Low-density parity-check codes”, IRE Trans. Inform. Theory, Vol.8, No.1, pp.21-28, 1962.

M. Sipser and D.A. Spielman, “Expander codes”, IEEE Trans. Inform. Theory, Vol.42, No.6, pp.1710-1722, 1996.

D.J.C. MacKay and R.M. Neal, “Near Shannon limit performance of low-density parity-check codes”, Electron. Lett., Vol.33, No.6, pp.1645-1646, 1996.

G.D. Forney Jr, “On iterative decoding and the two-way algorithm”, Proc. Int. Symp. on Turbo Codes and Related Topics, pp.12-15, 1997.

F.R. Kschischang and B.J. Frey, “Iterative decoding of compound codes by probability propagation in graphical models”, IEEE J. Select. Areas Commun., Vol.16, No.2, pp.219-230, 1998.

E. Sharon, S. Litsyn and J. Goldberger, “An efficient messagepassing schedule for LDPC decoding”, Proc. 23rd IEEE Convention of Electrical and Electronics Engineers, Tel-Aviv, Israel, pp.223-226, 2004.

J. Zhang and M.P.C. Fossorier, “Shuffled iterative decoding”, IEEE Trans. Commun., Vol.53, No.2, pp.209-213, 2005.

E. Sharon, S. Litsyn and J. Goldberger, “Efficient serial message-passing schedules for LDPC decoding”, IEEE Trans. Inform. Theory, Vol.53, No.11, pp.4076-4091, 2007.

A. Casado, M. Griot and R.D. Wesel, “Informed dynamic scheduling for belief-propagation decoding of LDPC codes”, Proc. IEEE Int. Conf. on Commun, Glasgow, Scotland, pp.932-937, 2007.

G.J. Han and X.C. Liu, “An efficient dynamic schedule for layered belief-propagation decoding of LDPC codes”, IEEE Commun. Lett., Vol.13, No.12, pp.950-952, 2009.

M.C. Davey and D.J.C. MacKay, “Low density parity check codes over GF(q)”, IEEE Commun. Lett., Vol.2, No.6, pp.165167, 1998.

N. Yacov, H. Efraim and H. Kfir, et al., “Parallel vs. sequential belief propagation decoding of LDPC codes over GF(q) and Markov sources”, Physica A, Vol.378, No.2, pp.329-335, 2007.

A. Risso, “Layered LDPC decoding over GF(q) for magnetic recording channel”, IEEE Trans. Magn., Vol.45, No.10, pp.3683-3688, 2009.

L. Barnault and D. Declercq, “Fast decoding algorithm for LDPC over GF(2q)”, Proc. Inf. Theory Workshop, Paris, France, pp.70-73, 2003.

A. Voicila, D. Declercq and F. Verdier, et al., “Low-complexity decoding for non-binary LDPC codes in high order fields”, IEEE Trans. Commun., Vol.58, No.5, pp.1365-1375, 2010.

B. Liu, D. Bai and S. Mei, “Min-sum approximation decoding of LDPC codes with adaptive non-uniform quantization”, Chinese Journal of Electronics, Vol.17, No.3, pp.503-506, 2008.

Relative Articles

Supplements(0)

Cited By

Proportional views