Abstract
In this research, we have proposed methods for iterative decoding of the LDPC code based on the soft decision, belief propagation, Min-Sum, and its derivatives. We used regular R = 0.5 Matrices because the error correction coding guarantees the robustness of the data against white noise in digital communications. The split-row method facilitates the exploitation of column processing parallelism and greatly simplifies row processors. LDPC irregular tokens have received much attention from advanced standards, such as WIFI and DVB-S2 digital video broadcasting. In this sense, we have implemented the LDPC codes in Matlab-Mex. The results obtained from the simulation show that in the additive Gaussian white channels, the Optimized Min-Sum algorithm gets better performances and is closer to those in the propagation of belief.
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
Similar content being viewed by others
References
Benedetto, S., Montorsi, G.: Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding. IEEE Trans. Inf. Theory 44, 3 (1998)
Chung, S.Y., Forney, G.D., Richardson, T.J., Urbanke, R.: On the design of low-density parity-check codes within 0.0057 dB from the Shannon limit. IEEE Commun. Lett. 5, 58–60 (2001)
Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)
Author, F., Author, S.: Title of a proceedings paper. In: Editor, F., Editor, S. (eds.) Conference 2016. LNCS, vol. 9999, pp. 1–13. Springer, Heidelberg (2016)
Berrou, C., Glavieux, A., Thitimajshima, P.: Near Shannon limit error-correcting coding and decoding: Turbo-codes (1). In: Proceedings of the ICC 1993, vol. 2/3, pp. 1064–1071 (1993)
Forney, G.D.: Codes on graphs: normal realizations. IEEE Trans. Inf. Theory 47(2), 520–548 (2001)
Tanner, R.M.: A recursive approach to low-complexity codes. IEEE Trans. Inf. Theory IT-27, 533–547 (1981)
Noor, I.U.S.: Construction and Performance Evaluation of QC-LDPC Codes
Kou, Y., Lin, S.: Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results,’ Department of Electrical and Computer Engineering, University of California
Fossorier, M.P.C.: Quasicyclic low-density parity-check codes from circulant permutation matrices. IEEE Trans. Inf. Theory 50(8), 1788–1793 (2004)
Wiberg, N.: Codes and decoding on general graphs. Ph.D. thesis, Linkoping University, Sweden (1996)
Zhao, J., Zarkeshvari, F., Banihashemi, A.H.: On implementation of the min-sum algorithm and its modifications for decoding low-density Parity-check (LDPC) codes. IEEE Trans. Comms. 53(4), 549–554
Wu, X., Song, Y., Cui, L., Jiang, M., Zhao, C.: Adaptive-normalized min-sum algorithm. In: 2010 2nd International Conference on Future Computer and Communication (ICFCC), vol. 2, pp. V2-661–V2-663, 21–24 May 2010
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Touati, H., El Alami, R., El Ouakili, H., Morchid, A., Mehdaoui, Y. (2022). Analyses and Improvement Iterative Decoding of Error Correction Codes for LDPC Codes Using Matlab-Mex. In: Motahhir, S., Bossoufi, B. (eds) Digital Technologies and Applications. ICDTA 2022. Lecture Notes in Networks and Systems, vol 454. Springer, Cham. https://doi.org/10.1007/978-3-031-01942-5_50
Download citation
DOI: https://doi.org/10.1007/978-3-031-01942-5_50
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-01941-8
Online ISBN: 978-3-031-01942-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)