The Journal of Korean Institute of Communications and Information Sciences (한국통신학회논문지)

The Korean Institute of Commucations and Information Sciences (한국통신학회)
권호 표지
DOI QR코드

DOI QR Code

Combined Horizontal-Vertical Serial BP Decoding of GLDPC Codes with Binary Cyclic Codes

이진 순환 부호를 쓰는 GLDPC 부호의 수평-수직 결합 직렬 복호

  • Received : 2014.09.18
  • Accepted : 2014.10.06
  • Published : 2014.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

It is well known that serial belief propagation (BP) decoding for low-density parity-check (LDPC) codes achieves faster convergence without any increase of decoding complexity per iteration and bit error rate (BER) performance loss than standard parallel BP (PBP) decoding. Serial BP (SBP) decoding, such as horizontal SBP (H-SBP) decoding or vertical SBP (V-SBP) decoding, updates check nodes or variable nodes faster than standard PBP decoding within a single iteration. In this paper, we propose combined horizontal-vertical SBP (CHV-SBP) decoding. By the same reasoning, CHV-SBP decoding updates check nodes or variable nodes faster than SBP decoding within a serialized step in an iteration. CHV-SBP decoding achieves faster convergence than H-SBP or V-SBP decoding. We compare these decoding schemes in details. We also show in simulations that the convergence rate, in iterations, for CHV-SBP decoding is about $\frac{1}{6}$ of that for standard PBP decoding, while the convergence rate for SBP decoding is about $\frac{1}{2}$ of that for standard PBP decoding. In simulations, we use recently proposed generalized LDPC (GLDPC) codes with binary cyclic codes (BCC).

Keywords

References

  1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
  2. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999. https://doi.org/10.1109/18.748992
  3. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, 2001. https://doi.org/10.1109/18.910578
  4. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, 2001. https://doi.org/10.1109/18.910577
  5. J. Pearl, Probabilistic reasoning in intelligent systems: networks of plausible inference, San Mateo, Morgan Kaufmann, CA, 1988.
  6. J. Zhang and M. Fossorier, "Shuffled iterative decoding," IEEE Trans. Commun., vol. 53, pp. 209-213, Feb. 2005. https://doi.org/10.1109/TCOMM.2004.841982
  7. J. Zhang, Y. Wang, and M. Fossorier, "Replica shuffled iterative decoding," in Proc. IEEE Int. Symp. Inf. Theory, pp. 454-458, Adelaide, Australia, Sept. 2005.
  8. X. Liu, J. Cai, and L. Wu, "Improved decoding algorithm of serial belief propagation with a stop updating criterion for LDPC codes and applications in patterned media storage," IEEE Trans. Magnetics, vol. 49, no. 2, pp. 829-836, Feb. 2013. https://doi.org/10.1109/TMAG.2012.2208468
  9. Y. Ueng, B. Yang, C. Yang, H. Lee, and J. Yang, "An efficient multi-standard LDPC decoder design using hardware-friendly shuffled decoding," IEEE Trans. Circuits and Systems I, vol. 60, no. 3, pp. 743-756, Mar. 2013. https://doi.org/10.1109/TCSI.2012.2215746
  10. D. Hocevar, "A reduced complexity decoder architecture via layered decoding of LDPC codes," in Proc. Signal Processing Systems (SIPS), pp. 107-112, Austin, Texas, USA, Oct. 2004.
  11. M. M. Mansour and N. R. Shanbhag, "High-throughput LDPC decoders," IEEE Trans. Very Large Scale Integration Systems(VLSI), vol. 11, pp. 976-996, 2003. https://doi.org/10.1109/TVLSI.2003.817545
  12. Y. Ueng, C. Leong, C. Yang, C. Cheng, K. Liao, and S. Chen, "An efficient layered decoding architecture for nonbinary QC-LDPC codes," IEEE Trans. Circuits and Systems I, vol. 59, no. 2, pp. 385-398, Feb. 2012. https://doi.org/10.1109/TCSI.2011.2163889
  13. K. Chung, "Generalised low-density paritycheck codes with binary cyclic codes as component codes," IET commun. vol. 6, no. 12, pp. 1710-1715, 2012. https://doi.org/10.1049/iet-com.2011.0816
  14. M. Lentmaier and K. Zigangirov, "On generalized low-density paritycheck codes based on Hamming component codes," IEEE Commun. Lett., vol. 3, no. 8, pp. 248-250, Aug. 1999. https://doi.org/10.1109/4234.781010
  15. I. Djordjevic, L. Xu, T. Wang, and M. Cvijetic, "GLDPC codes with Reed-Muller component codes suitable for optical communications," IEEE Commun. Lett., vol. 12, no. 9, pp. 684-686, Sept. 2008. https://doi.org/10.1109/LCOMM.2008.080590
  16. N. Miladinovic and M. Fossorier, "Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels," in Proc. IEEE GLOBECOM, p. 6, St. Louis, Missouri, USA, Nov. 2005.
  17. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. 20, pp. 284-287, 1974.