Performance Analysis of Low Complexity Error Correcting Codes
| Autor: | Banaful Paul, Rabiul Islam, Md. Jahidul Alam, Asif Md. Siddique |
|---|---|
| Rok vydání: | 2012 |
| Předmět: |
Block code
Polynomial code Computer science Repetition code Data_CODINGANDINFORMATIONTHEORY Luby transform code Noisy-channel coding theorem Reed–Solomon error correction Fountain code Turbo code Forward error correction Low-density parity-check code Raptor code Computer Science::Information Theory Bch coding Error floor Concatenated error correction code BCJR algorithm Variable-length code Coding theory Serial concatenated convolutional codes Linear code Tornado code Error detection and correction Algorithm Hamming code Decoding methods BCH code Communication channel |
| Zdroj: | International Journal of Computer Applications. 59:1-4 |
| ISSN: | 0975-8887 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|