Abstract
Low complexity decoding algorithm is proposed to reduce the complexity of decoding algorithm for nonbinary quasi-cyclic LDPC codes. The algorithm uses methods of logarithm domain and look-up table based on the FFT-QSPA algorithm, avoiding multiplication and division calculations. These calculations make the hardware compute slowly. As a result, the algorithm makes the hardware easier to realize. The parity check matrices with quasi-cyclic form are constructed based on the finite fields, which are benefit for linear encoding based on the feedback shift registers. The letter presents a scheme combined with the constitution, coding and decoding of nonbinary quasi-cyclic LDPC codes with low complexity. The simulation shows that nonbinary quasi-cyclic LDPC codes achieve significant coding gains over RS codes with lower complexity and better performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Davey, M.C., Mackay, D.J.C.: Low-density parity check codes over GF(q). J. IEEE Commun. Lett. 2(6), 165–167 (1998)
Song, H., Cruz, J.R.: Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording. J. IEEE Trans. Magn. 39(3), 1081–1087 (2003)
Declercq, D., Fossorier, M.: Decoding algorithms for nonbinary LDPC codes over GF(q). J. IEEE Trans. Commun. 55(4), 633–643 (2007)
Zeng, L., Lan, L., Tai, Y.Y., et al.: Construction of Nonbinary Quasi-Cyclic LDPC Codes:A Finite Field Approach. J. IEEE Trans. Commun. 56(4), 545–554 (2008)
Song, S., Zhou, B., Lin, S., et al.: A Unified Approach to the Construction of Binary and Nonbinary Quasi-Cyclic LDPC Codes Based on Finite Fields. J. IEEE Trans. Commun. 57(1), 84–93 (2009)
Zhou, B., Kang, J., Tai, Y.Y., Lin, S.: High Performance Non-Binary Quasi-Cyclic LDPC Codes on Euclidean Geometries. J. IEEE Trans. Commun. 57(5), 1298–1311 (2009)
Kou, Y., Lin, S., Fossorier, M.P.C.: Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results. J. IEEE Trans. Inform. Theory 47(7), 2711–2735 (2001)
Dou, G., Gao, J., Liu, B.: Fast algorithm of coding and decoding of quasi-cyclic LDPC code and the DSP implement (04), 323–327 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, XF., Li, W., Huang, L. (2011). Low Complexity Decoding Algorithm for Nonbinary LDPC Codes. In: Zhou, Q. (eds) Theoretical and Mathematical Foundations of Computer Science. ICTMF 2011. Communications in Computer and Information Science, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24999-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-24999-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24998-3
Online ISBN: 978-3-642-24999-0
eBook Packages: Computer ScienceComputer Science (R0)