ABSTRACT:

Many wireless communication systems like IS-54, enhanced information rates for the GSM evolution (EDGE), worldwide interoperability for microwave access (WiMAX) and future evolution (LTE) have adopted low-density parity-check (LDPC), tail-biting convolutional, and turbo codes because the forward error correcting codes (FEC) theme for data and overhead channels. So, many efficient algorithms are proposed for decoding these codes. However, the varied decoding approaches for these two families of codes sometimes cause completely different hardware architectures. Since these codes work side by aspect in these new wireless systems, it's a sensible plan to introduce a universal decoder to handle these 2 families of codes. The gift work exploits the parity-check matrix (H) representation of tail-biting convolutional and turbo codes, thus enabling decoding via a unified belief propagation (BP) algorithm. Indeed, the BP algorithm provides a highly effective general methodology for devising low-complexity iterative decoding algorithms for all convolutional code classes along with turbo codes. Whereas a tiny performance loss is observed when decoding turbo codes with BP rather than MAP, this is often offset by the lower complexity of the BP algorithm and therefore the inherent advantage of a unified decoding design.