Abstract
In this letter, a new metric for fast and efficient performance comparison of iterative sub-optimal decoding algorithms is proposed. It is based on the estimation of a metric between the A-Posteriori Probability (APP) decoded symbol of optimal and suboptimal decoding algorithms. We apply the notion of entropy to evaluate this function. The metric is tested on data sets from the different sub optimal algorithms for the duo binary turbo codes used in WiMax(802.16e) application and a (251,502) Galois Field (26) low density parity check (LDPC) code. Experimental results show that the values of the proposed metric correlate well with the BER performance of the suboptimal implementation of the iterative decoding algorithm.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
