Abstract
Very low error rate is necessary for several coding applications like satellite communications, Ethernet transmission, and data storage applications. Therefore, construction of practical tools for anticipating error floors and assessing the success of LDPC codes in the low frame error rate region is necessary. Completely randomly generated codes are good with high probability. The problem that will arise is encoding complexity of such codes is usually rather high as the length of codes increases. We propose an efficient Genetic base algorithm for construction of irregular LDPC codes, which reduces error floor and computational complexity in code design process. Our proposed method is compared with an algorithm in which the codes are generated randomly,. Bit Error Rate (BER), Frame Error Rate (FER) and Computational Complexity are calculated using Matlab platform and compared using both algorithms. Simulations results shows that the codes constructed with proposed method produce low error floors and reduced computational complexity. LDPC Codes based on this design suits for the short block length.
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
Richardson, T.J., Urbanke, R.L.: The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding. IEEE Transactions on Information Theory 47(2), 599–618 (2001)
Asvadi, R., Banihashemi, A.H., Ahmadian-Attari, M.: Lowering the Error Floor of LDPC Codes Using Cyclic Liftings. In: Proceedings of IEEE International Symposium on Information Theory, Austin, TX, pp. 74–728 (June 2010)
Eckford, A.W., Kschischang, F.R., Pasupathy, S.: On Designing Good LDPC Codes for Markov Channels. IEEE Transactions on Information Theory 53(1), 5–21 (2007)
Kim, J., Hur, W., Ramamoorthy, A., McLaughlin, S.W.: Design of Rate-Compatible Irregular LDPC Codes for Incremental Redundancy Hybrid ARQ Systems. In: Proceedings of IEEE International Symposium on Information Theory, Seattle, WA, pp. 1139–1143 (July 2006)
Yadav, K., Srivastava: Improved performance of Irregular LDPC Codes by attaining regularity for AWGN channel. In: Proceedings of SPIT-IEEE Colloquium and International Conference, Mumbai, India, vol. 3, pp. 7–11 (February 2008)
Dolecek, L., Lee, P., Zhang, Z., Anantharam, V., Nikolic, B., Wainwright, M.J.: Predicting Error Floors of Structured LDPC Codes: Deterministic Bounds and Estimates. IEEE International Journal on Selected Areas in Communications 27(6), 908–917 (2009)
Newagy, F.A., Fahmy, Y.A., El-Soudani, M.M.S.: Novel Construction of Short Length LDPC Codes For Simple Decoding. Journal of Theoretical and Applied Information Technology 3(3), 64–69 (2007)
Islam, M.R., Kim, J.: Quasi Cyclic Low Density Parity Check Code for High SNR Data Transfer. Journal of Radio Engineering 19(2), 356–362 (2010)
Johnson, S.J., Weller, S.R.: A Family of Irregular LDPC Codes With Low Encoding Complexity. IEEE Communications Letters 7(2), 79–81 (2003)
Cole, C.A., Hall, E.K., Wilson, S.G., Giallorenzi, T.R.: A General Method for Finding Low Error Rates of LDPC Codes. IEEE Transcations on Information Theory, 1–30 (2006)
Ardakani, M., Kschischang, F.R.: A More Accurate One-Dimensional Analysis and Design of Irregular LDPC Codes. IEEE Transactions on Communications 52(12), 2106–2114 (2004)
Prasartkaew, C., Choomchuay, S.: A Design of Parity Check Matrix for Irregular LDPC Codes. In: International Symposium on Communication and Information Technology, Incheon, Korea (September 2009)
Gunnam, K.K., Choi, G.S., Yeary, M.B., Atiquzzaman, M.: VLSI Architectures for Layered Decoding for Irregular LDPC Codes of WiMax. In: Proceedings of IEEE International Conference on Communications, Glasgow, pp. 4542–4547 (June 2007)
Bhardwaj, V., Pathak, Kumar, A.: Structured LDPC Codes with Linear Complexity Encoding. In: Proceedings of WRI International Conference on Communications and Mobile Computing, vol. 1, pp. 200–203 (2009)
Eckford, A.W., Kschischang, F.R., Pasupathy, S.: Designing Very Good Low-Density Parity-Check Codes for the Gilbert-Elliott Channel. In: Proceedings of 8th Canadian Workshop on Information Theory, Waterloo, pp. 18–21 (2003)
Landner, S., Hehn, T., Milenkovic, O., Huber, J.B.: Two Methods for Reducing the Error-Floor of LDPC Codes. IEEE Transactions on Information Theory 1, 1–50 (2007)
Cole, C.A., Hall, E.K., Wilson, S.G., Giallorenzi, T.R.: Analysis and Design of Moderate Length Regular LDPC Codes with Low error Floors. In: Proceedings of 40th Annual Conference on Information Sciences and Systems, Princeton, NJ, pp. 823–828 (March 2006)
Iliev, T.B., Hristov, G.V., Zahariev, P.Z., Iliev, M.P.: Application and evaluation of the LDPC codes for the next generation communication systems. In: Novel Algorithms and Techniques in Telecommunications, Automation and Industrial Electronics, pp. 532–536. Springer (2008)
Milenkovic, O., Soljanin, E., Whiting, P.: Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles. IEEE Transactions on Information Theory 53(1), 39–55 (2007)
Chen, J., Michael Tanner, R., Zhang, J., Fossorier, M.P.C.: Construction of Irregular LDPC Codes by Quasi-Cyclic Extension. IEEE Transactions on Information Theory 53(4), 1479–1483 (2007)
Zheng, X., Lau, F.C.M., Tse, C.K.: Constructing Short-Length Irregular LDPC Codes with Low Error Floor. IEEE Transactions on Communications 58(10), 2823–2834 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rathod, D.P., Awale, R.N. (2013). An Efficient Genetic Based Algorithm for an Irregular Low Density Parity Check Code with Low Computational Complexity and Low Error Floor. In: Unnikrishnan, S., Surve, S., Bhoir, D. (eds) Advances in Computing, Communication, and Control. ICAC3 2013. Communications in Computer and Information Science, vol 361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36321-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-36321-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36320-7
Online ISBN: 978-3-642-36321-4
eBook Packages: Computer ScienceComputer Science (R0)