Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Efficient Check Node Processing Architectures for Non-binary LDPC Decoding Using Power Representation

  • 229 Accesses

  • 2 Citations

Abstract

When the code length is moderate, non-binary low-density parity-check (NB-LDPC) codes can achieve better error correcting performance than their binary counterparts at the expense of higher decoding complexity. The check node processing is a major bottleneck of NB-LDPC decoding. This paper proposes novel schemes for both the Min-max and the simplified Min-sum check node processing by making use of the cyclical-shift property of the power representation of finite field elements. Compared to previous designs based on the Min-max algorithm with forward-backward scheme, the proposed check node units (CNUs) do not need the complex switching network. Moreover, the multiplications of the parity check matrix entries are efficiently incorporated. For a Min-max NB-LDPC decoder over G F(32), the proposed scheme reduces the CNU area by at least 32 %, and leads to higher clock frequency. Compared to the prior simplified Min-sum based design, the proposed CNU is more regular, and can achieve good throughput-area tradeoff.

This is a preview of subscription content, log in to check access.

Figure 1
Figure 2
Figure 3

References

  1. 1.

    Davey, M., & MacKay, D.J. (1998). Low density parity check codes over GF(q). IEEE Communications Letters, 2, 165–167.

  2. 2.

    Wymeersch, H., Steendam, H., Moeneclaey, M. (2004). Log-domain decoding of LDPC codes over \(GF(q)\). In Proceedings IEEE international conference on communications (pp. 772–776). Paris.

  3. 3.

    Barnault, L., & Declercq, D. (2003). Fast decoding algorithm for LDPC over \(GF(2^{q})\). In proceedings information theory workshop. Paris.

  4. 4.

    Spagnol, C., Popovici, E., Marnane, W. (2009). Hardware implementation of \(GF(2^{m})\) LDPC decoders. IEEE Transactions on Circuits and Systems I, 56(12), 2609–2620.

  5. 5.

    Declercq, D., & Fossorier, M. (2007). Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Transactions on Communications, 55(4), 633–643.

  6. 6.

    Savin, V. (2008). Min-Max decoding for non binary LDPC codes. In Proceedings IEEE international symposia on information theory (pp. 960–964). Toronto.

  7. 7.

    Zhang, X., & Cai, F. (2011). Efficient partial-parallel decoder architecture for quasi-cyclic non-binary LDPC codes. IEEE Transactions on Circuits and Systems I, 58(2), 402–414.

  8. 8.

    Zhang, X., & Cai, F. (2011). Reduced-complexity decoder architecture for non-binary LDPC codes. IEEE Transactions on VLSI Systems, 17(7), 1229–1238.

  9. 9.

    Cai, F., & Zhang, X. (in press). Relaxed min-max decoder architectures for nonbinary low-density parity-check codes. IEEE Transactions on VLSI Systems.

  10. 10.

    Lin, J., Sha, J., Wang, Z., Li, L. (2010). Efficient decoder design for nonbinary quasicyclic LDPC codes. IEEE Transactions on VLSI Systems I, 57(5), 1071–1082.

  11. 11.

    Chen, X., Lin, S., Akella, V. (2012). Efficient con urable decoder architecture for non-binary quasi-cyclic LDPC codes. IEEE Transactions on Circuits and Systems I, 59(1), 188–197.

  12. 12.

    Chen, X., & Wang, C. (2012). High-throughput efficient non-binary LDPC decoder based on the simplified min-sum algorithm. IEEE Transactions on Circuits and Systems I, 59(11), 2784–2794.

  13. 13.

    Wang, C., Chen, X., Li, Z., Yang, S. (2013). A simplified min-sum decoding algorithm for non-binary LDPC codes. IEEE Transactions on Communication, 61(1), 24–32.

  14. 14.

    Cai, F., & Zhang, X. (2012). Efficient check node processing architectures for non-binary LDPC decoding using power representation. In Proceedings IEEE workshop on signal processing systems (pp. 137–142). Quebec.

Download references

Acknowledgments

This material is based upon work supported by the National Science Foundation under Grant No.0846331.

Author information

Correspondence to Fang Cai.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Cai, F., Zhang, X. Efficient Check Node Processing Architectures for Non-binary LDPC Decoding Using Power Representation. J Sign Process Syst 76, 211–222 (2014). https://doi.org/10.1007/s11265-013-0864-x

Download citation

Keywords

  • Non-binary LDPC decoding
  • Power representation
  • VLSI
  • Check node unit architecture
  • Min-max algorithm
  • Simplified Min-sum algorithm