• ABHISHEK
• Dr.M.Vanitha

Turbo coding is related with two precise encoders, where the first encoder gets the source data in common request and simultaneously the second encoder gets the interleaved one. The yield is made out of source data and related equality bits in regular and interleaved areas. The equality pieces are normally penetrated so as to raise the code rate to the ideal qualities. Diverse floating-point and fixed-point execution issues of the Log-MAP algorithm for deciphering turbo codes are considered. A hypothetical system is proposed to clarify why the Log-MAP turbo decoders are more open minded toward overestimation of SNR than underestimation. A direct estimation (the Log-Lin algorithm) that takes into consideration proficient ASIC executions and results in negligble execution misfortune in floating-point models is proposed. It is additionally indicated that a Log-Lin algorithm accomplishes a similar exhibition as the Log-MAP algorithm, and that a fixed-point execution of the Log-Lin algorithm with enhanced section and quantization to 6 pieces, brings about lost execution of under 0.05 dB.

LOG-MAP, Fixed Model, Floating Model, turbo decoder, etc.

"MATHEMATICAL ANALYSIS OF LOG-MAP ALGORITHMS WITH SPECIAL REFERENCE TO FIXED AND FLOATING ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 4, page no.631-636, April-2019, Available :http://www.jetir.org/papers/JETIR1904R98.pdf

"MATHEMATICAL ANALYSIS OF LOG-MAP ALGORITHMS WITH SPECIAL REFERENCE TO FIXED AND FLOATING ", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 4, page no. pp631-636, April-2019, Available at : http://www.jetir.org/papers/JETIR1904R98.pdf