Abstract

An optimized split row algorithm is to be developed to reduce effectively the Bit Error Rate effectively. The usage of LDPC codes, especially in the error correction schemes, is tremendously increasing in the modern era. In the conventional approach, the entire matrix which is computed always leads to computational complexity. As for this, the matrix is split into two equal halves and then error checking is done. In such case, it is difficult to judge which partition has to be taken first. Also, it is necessary to reduce the Bit Error Rate. In this Study a novel technique based on fixing appropriate distance between bits and checking it with a predefined condition. It is also observed that as the number of iterations increases, BER decreases.

Keywords:

BER , error rate , LDPC codes, split row,

References

1. Andrea, L., 2004. An introduction to factor graphs. IEEE Signal Proc. Mag., 79(7): 1-31.
   
2. Castello Jr., D.J. and S. Lin, 2004. Error Control Coding. 2nd Edn., Prentice Hall, Upper Saddle River, NJ, USA.
   
3. Chen, J. and M. Fossorier, 2002. Near optimum universal belief propagation based decoding of low-density parity check codes. IEEE T. Commun., 50: 406-414.
   CrossRef    
4. Chen, L., I. Djurdjevic, S. Lin and J. Xu, 2004. Near shannon-limit quasi-cyclic low density parity checks codes. IEEE T. Commun., 52: 1038-1042.
   CrossRef    
5. Chen, J., A. Dholakia, E. Eleftheriou and M. Fossorier, 2005. Reduced complexity decoding of LDPC codes. IEEE T. Commun., 53: 1288-1299.
   CrossRef    
6. Daisuke, M., H. Kazunori and Y. Ryo, 2014. An LDPC decoder with time-domain analog and digital mixed-signal processing. IEEE J. Solid-St. Circ., 49(1): 73-83.
   
7. Forney, G.D. Jr., 2001. Codes on graphs: Normal realizations. IEEE T. Inform. Theory, 47(2): 520-548.
   CrossRef    
8. Hua, X., A.H. Banihashemi and M. Karimi, 2013. Error rate estimation of low-density parity-check codes decoded by quantized soft-decision iterative algorithms. IEEE T. Commun., 61(2): 474-484.
   CrossRef    
9. Liu, C. and S. Yen, 2008. An ldpc decoder chip based on self-routing network for IEEE 802.16e applications. IEEE J. Solid-St. Circ., 43: 684-694.
   
10. MacKay, D.J.C., 1999. Error correcting codes based on very sparse matrices. IEEE T. Inform. Theory, 45: 399-431.
    CrossRef    
11. MacKay, D.J.C., 2003. Information Theory Inference and Learning Algorithms. 3rd Edn., Cambridge University Press, Cambridge, UK.
    
12. MacKay, D.J.C. and R.M. Neal, 1997. Near Shannon limit performance of low density parity check codes. Electron. Lett., 33(6): 457-458.
    CrossRef    
13. Miyashita, D., R. Yamaki, H. Kobayashi, S. Kousai, Y. Oowaki and Y. Unekawa, 2014. An LDPC decoder with time-domain analog and digital mixed-signal processing. IEEE J. Solid-St. Circ., 49: 73-83.
    
14. Mohsenin, T., D. Truong and B. Baas, 2009a. An improved split-row threshold decoding algorithm for LDPC codes. Proceeding of the IEEE International Conference on Communications (ICC '09). Dresden, pp: 1-5.
    CrossRef    
15. Mohsenin, T., D. Truong and B. Baas, 2009b. Multi-split-row threshold decoding implementations for LDPC codes. Proceeding of the IEEE International Symposium on Circuits and Systems (ISCAS, 2009). Taipei, pp: 2449-2452.
    CrossRef    
16. Tanner, R.M., D. Sridhara, A. Sridharan, T.E. Fuja and D.J. Costello, 2004. LDPC block and convolutional codes based on circulant matrices. IEEE T. Inform. Theory, 50(12): 2966-2984.
    CrossRef    
17. Tinoosh, M. and M.B. Bevan, 2010. A split-decoding message passing algorithm for low density parity check decoders. J. Signal Process. Sys., 61(3): 329-345.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.