Abstract
The latest advancements in low-density parity-check (LDPC) codes have been resulted in reducing the decoding complexity. Hence, these codes have excelled over turbo codes, BCH codes, and linear block codes in terms of evaluating the performance in higher decoding rate; hence, these decodable codes are the trending topic in coding theory of signals. Construction of LDPC codes is being elaborated in this proposed paper which further helps to study decoding and encoding of these binary and non-binary low-density parity-check codes, respectively. In this proposed design architecture, we have considered the SBF and MLDD algorithms employed here utilize reliability estimation to improve error performance and it has advantages over bit flipping (BF) algorithms. This algorithm can be improved with still more security level by having a trade-off between performance and data transmission. It can also be enhanced by implementing it in real-time applications for data decoding and correction, for smaller-size datum.
References
Gallager, R.G.: Low density parity check codes. IRE Trans. Inf. Theory IT-8, 21–28 (1962)
MacKay, D.J.C., Neal, R.M.: Near Shannon limits performance of low density parity check codes. Electron. Lett. 32(18), 1645–1646 (1996)
MacKay, D.J.C.: Good error correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory (1997)
MacKay, D.J.C.: Gallager codes those are better than turbo codes. In: Proceedings of 36th Allerton Conference on Communication, Control, and Computing (1998)
Zhang, J., Fossorier, M.P.C.: A modified weighted bit-flipping decoding of low-density parity-check codes. IEEE Commun. Lett. 8(3), 165–167 (2004)
Chen, J., Dholakia, A., Eleftheriou, E., Fossorier, M.P.C., Hu, X.-Y.: Reduced-complexity decoding of LDPC codes. IEEE Trans. Commun. 53(8), 1288–1299 (2005)
Palanki, R., Fossorier, M.P.C., Yedidia, J.S.: Iterative decoding of multiple-step majority logic decodable codes. IEEE Trans. Commun. 55(6), 1099–1102 (2007)
Savin, V.: Min-max decoding for non-binary LDPC codes. In: Proceedings of IEEE ISIT, pp. 960–964 (2008)
Cho, J., Sung, W.: High-performance and low-complexity decoding of high-weight LDPC codes. J. Korea Inf. Commun. Soc. 34(5), 498–504 (2009). (in Korean)
Zhang, C., Wang, Z., Sha, J., Li, L., Lin, J.: Flexible LDPC decoder design for multi-Gb/s applications. IEEE Trans. Circuits Syst. I, Reg. Papers 57(1), 116–124 (2010)
Zhang, X., Siegel, P.H.: Quantized min-sum decoders with low error floor for LDPC codes. In: IEEE International Symposium on Information Theory, pp. 2871–2875, (2012)
Kou, Y., Lin, S., Fossorier, M.: Low density parity check code based on finite geometries: a rediscovery and more. IEEE Trans. Inf. Theory (1999)
Fossorier, M.P.C., Mihaljevic, M., Imai, H.: Reduced complexity iterative decoding of low-density parity check codes based on belief propagation. IEEE Trans. Commun. 47(5), 673–680 (1999)
Kschischang, F.R., Frey, B.J., Loeliger, H.-A.: Factor graphs and the sum–product algorithm. IEEE Trans. Inf. Theory 47(2), 498–519 (2001)
Chinna Babu, J., Chinnapu Reddy, C., Giri Prasad, M.N.: Comparison of technologies for the implementation of SBF decoder for geometric LDPC codes. Ind. J. Sci. Tech. 9(30), (2016)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Chinna Babu, J., Chinnapu Reddy, C., Giri Prasad, M. (2018). Comparison of Various Decoding Algorithms for EG-Low Density Parity Check Codes. In: Konkani, A., Bera, R., Paul, S. (eds) Advances in Systems, Control and Automation. Lecture Notes in Electrical Engineering, vol 442. Springer, Singapore. https://doi.org/10.1007/978-981-10-4762-6_58
Download citation
DOI: https://doi.org/10.1007/978-981-10-4762-6_58
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-4761-9
Online ISBN: 978-981-10-4762-6
eBook Packages: EngineeringEngineering (R0)