%0 Journal Article %1 noauthororeditor %A M.Sakthivel, %D 2014 %J International Journal of Computational Science and Information Technology (IJCSITY) %K - Algorithm, Binary Check Code. Density Euclidean Geometry Likelihood Low Maximum Non Parity code, %N 2 %P 1-11 %R 10.5121/ijcsity.2014.2205 %T PERFORMANCE COMPARISON OF EG-LDPC CODES WITH MAXIMUM LIKELIHOOD ALGORITHM OVER NON-BINARY LDPC CODES %U http://airccse.org/journal/ijcsity/papers/2214ijcsity05.pdf %V 2 %X Error correcting coding has become one essential part in nearly all the modern data transmission and storage systems. Low density parity check (LDPC) codes are a class of linear block code has the superior performance closer to the Shannon’s limit. In this paper two error correcting codes from the family of LDPC codes specifically Euclidean Geometry Low Density Parity Check (EG-LDPC) codes and Nonbinary low density parity check (NB-LDPC) codes are compared in terms of power consumption, number of iterations and other parameters. For better performance of EG-LDPC codes, Maximum Likelihood (ML) Algorithm was proposed. NB-LDPC codes can provide better error correcting performance with an average of 10 to 30 iterations but has high decoding complexity which can be improve by EG-LDPC codes with ML algorithm having only three iterations for detecting and correcting errors. One step majority logic decodable (MLD) codes is a subclass of EG-LDPC codes are used to avoid high decoding complexity. The power Consumed by NB-LDPC codes is 2.729W whereas the power consumed by EG-LDPC codes with ML algorithm is 1.148W.

@article{noauthororeditor, abstract = {Error correcting coding has become one essential part in nearly all the modern data transmission and storage systems. Low density parity check (LDPC) codes are a class of linear block code has the superior performance closer to the Shannon’s limit. In this paper two error correcting codes from the family of LDPC codes specifically Euclidean Geometry Low Density Parity Check (EG-LDPC) codes and Nonbinary low density parity check (NB-LDPC) codes are compared in terms of power consumption, number of iterations and other parameters. For better performance of EG-LDPC codes, Maximum Likelihood (ML) Algorithm was proposed. NB-LDPC codes can provide better error correcting performance with an average of 10 to 30 iterations but has high decoding complexity which can be improve by EG-LDPC codes with ML algorithm having only three iterations for detecting and correcting errors. One step majority logic decodable (MLD) codes is a subclass of EG-LDPC codes are used to avoid high decoding complexity. The power Consumed by NB-LDPC codes is 2.729W whereas the power consumed by EG-LDPC codes with ML algorithm is 1.148W.}, added-at = {2019-10-24T11:45:27.000+0200}, author = {M.Sakthivel}, biburl = {https://www.bibsonomy.org/bibtex/27928f1601ac9f973c92643294969151b/anderson_sam}, doi = {10.5121/ijcsity.2014.2205}, interhash = {8a384610672377896bbd9d5ab3c74069}, intrahash = {7928f1601ac9f973c92643294969151b}, journal = {International Journal of Computational Science and Information Technology (IJCSITY)}, keywords = {- Algorithm, Binary Check Code. Density Euclidean Geometry Likelihood Low Maximum Non Parity code,}, month = may, number = 2, pages = {1-11}, timestamp = {2019-10-24T11:45:27.000+0200}, title = {PERFORMANCE COMPARISON OF EG-LDPC CODES WITH MAXIMUM LIKELIHOOD ALGORITHM OVER NON-BINARY LDPC CODES}, url = {http://airccse.org/journal/ijcsity/papers/2214ijcsity05.pdf}, volume = 2, year = 2014 }