Abstract
RRWBF (Reliability ratio based weighted bit-flipping) algorithm is one of the best hard decision decoding algorithms in performance. Recently several modifications are done to this technique either to improve performance or to lower the complexity. The IERRWBF (Implementation efficient reliability ratio based weighted bit-flipping) is developed targeting decreasing processing time of the decoding process. Low Complex IERRWBF (Low complex implementation efficient reliability ratio based weighted bit-flipping) algorithm is one of the latest algorithms targeting lowering decoding complexity, by decreasing number of iterations required to decode received code words and to solve the problem faced by IERRWBF which is the exponential increase in complexity as maximum number of iterations increases. In this paper we are targeting improving the performance of recent developed algorithm named Low Complex IERRWBF by adding a bootstrap step to the decoding technique which leads to increase in reliability of received bits then the number of decoded bits will be increased leading to improvement in 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
Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)
Kou, Y., Lin, S., Fossorier, M.: Low density parity check codes based on finite geometries: A rediscovery and more. IEEE Trans. Inform. Theory 47, 2711–2736 (2001)
Zhang, J., Fossorier, M.P.C.: A modified weighted bit-flipping decoding of low-density parity-check codes. IEEE Communication Letters 8(3), 165–167 (2004)
Guo, F., Hanzo, L.: Reliability ratio based weighted bit-flipping decoding for low-density parity-check codes. Electronics Letters 40(21), 1356–1358 (2004)
Lee, C.-H., Wolf, W.: Implementation-efficient reliability ratio based weighted bit-flipping decoding for LDPC codes. Electronics Letters 41(13) ( June 23, 2005)
Zeidan, H.R., Elsabrouty, M.M.: Low Complexity Iterative Decoding Algorithm for Low-Density Parity-Check (LDPC) codes. In: Wireless Days. WD 2008. 1st IFIP, pp. 1–5 (2008)
Nouh, A., Banihashemi, A.H.: Bootstrap decoding of low-density parity-check codes. IEEE Comrrtun. Len. 6(9), 391–393 (2002)
Kou, Y., Lin, S., Fossorier, M.P.C.: Low-density parity-check codes based on finite geometries: A rediscovery and new results. IEEE Trans. Inform. Theory 47, 2711–2736 (2001)
MacKay, D. J.: Encyclopedia of Sparse Graph Codes, http://www.inference.phy.cam.ac.uk/mackay/codes/data.htm
Inaba, Y., Ohtsuki, T.: Performance of Low Density Parity Check (LDPC) Bootstrap Decoding Algorithm on a Fast Fading Channel. In: IEEE Vehicular Technology Conference, pp. 333–337 (2004)
Digital video broadcasting (DVB); User guidelines for the second generation system for broadcasting, interactive services, news gathering and other broad-band satellite applications (DVB-S2). European Telecommunications Standards Institute (ETSI), TR 102 376
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Mohamed, A., Elsabrouty, M., El-Ramly, S. (2010). Bootstrapped Low Complexity Iterative Decoding Algorithm for Low Density Parity Check (LDPC) Codes. In: Cai, Y., Magedanz, T., Li, M., Xia, J., Giannelli, C. (eds) Mobile Wireless Middleware, Operating Systems, and Applications. MOBILWARE 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17758-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-17758-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17757-6
Online ISBN: 978-3-642-17758-3
eBook Packages: Computer ScienceComputer Science (R0)