Research Article
Performance Analysis of Low Complexity Error Correcting Codes
|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 59 - Issue 14 |
| Published: December 2012 |
| Authors: Banaful Paul, Asif Md. Siddique, Rabiul Islam, Md. Jahidul Alam |
10.5120/9613-4246
|
Banaful Paul, Asif Md. Siddique, Rabiul Islam, Md. Jahidul Alam . Performance Analysis of Low Complexity Error Correcting Codes. International Journal of Computer Applications. 59, 14 (December 2012), 1-4. DOI=10.5120/9613-4246
@article{ 10.5120/9613-4246,
author = { Banaful Paul,Asif Md. Siddique,Rabiul Islam,Md. Jahidul Alam },
title = { Performance Analysis of Low Complexity Error Correcting Codes },
journal = { International Journal of Computer Applications },
year = { 2012 },
volume = { 59 },
number = { 14 },
pages = { 1-4 },
doi = { 10.5120/9613-4246 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2012
%A Banaful Paul
%A Asif Md. Siddique
%A Rabiul Islam
%A Md. Jahidul Alam
%T Performance Analysis of Low Complexity Error Correcting Codes%T
%J International Journal of Computer Applications
%V 59
%N 14
%P 1-4
%R 10.5120/9613-4246
%I Foundation of Computer Science (FCS), NY, USA
Abstract
From Shannon limit it is known that, for a particular bandwidth and noise characteristics, there exists a maximum rate at which data can be transmitted with arbitrarily small number of errors. Coding schemes are utilized to improve the data transmission efficiency. The paper aims to represent the comparative performance analysis of Low Density Parity Check (LDPC) codes and Bose-Chaudhuri-Hocquenghem (BCH) codes in transmitting data over noisy channel for different parameters. The performance of LDPC block codes is simulated for different decoding schemes and code rates. Performance analysis of LDPC codes is also shown for regular and irregular codes. For fixed error correcting capability, the BCH coding scheme is further simulated for different code length with increasing code length. The simulated output is worthwhile to analyze the performance of a communication system before the physical implementation of the system.
References
- Claude E. Shannon, "A mathematical theory of communication", Bell System Technical Journal, 1948.
- Eyas El-Qawasmeh, Maytham Safar, Talal Kanan,"Investigation of Golay Code (24, 12, 8) structure in improving search techniques", The international Arab Journal of Information Technology, Vol. 8, No. 3, July 2011.
- Mahmoud A. Smadi, "Performance analysis of BPSK system with hard decision (63, 36) BCH code", Journal of Theoretical and Applied Information Technology.
- R. Gallager, "Low density parity-check codes", IRE trans, Information Theory, pp. 21-28. January 1962.
- D. Mackay, "Good error correcting codes based on very sparse matrices, "IEEE Trans. Information Theory, pp 399- 431, March 1999.
- Hank Wallace, "Error Detection and Correction Using the BCH Code" (2001). http://www. aqdi. com/bch. pdf
- M. Mesbahul Alam, A. Z. M. Touhidul Islam and S. EnayetUllah,"Performance of a concatenated LDPC encoded OFDM system on text message transmission, International Journal of Research and Reviews in Computer science (IJRRCS), 3, June, 2011.
- NanaTraore, Shashi Kant, Tobias Lindstrom Jensen, "Message passing algorithm and Linear Programming and decoding for LDPC and Linear Block codes" .
Index Terms
Keywords