Performance Analysis on Decoding Algorithms of Turbo Codes

Noor Shahida, Mohd Kasim and Siti Normi, Zabri @ Suhaimi and Siti Rosmaniza, Ab Rashid and Yap, David Fok Weng (2010) Performance Analysis on Decoding Algorithms of Turbo Codes. Project Report. UTeM, Melaka, Malaysia. (Submitted)

PDF (Full Text) Performance_Analysis_on_Decoding_Algorithms_of_Turbo_Codes_-_Noor_Shahida_binti_Mohd_Kasim.pdf - Submitted Version Restricted to Registered users only Download (5MB)

Abstract

Turbo codes are a new class of forward error correcting codes that have proved to give a performance close to the Shannon's Limit. Turbo codes have been invented in 1993, therefore coding theorist and researchers further tried to improve the performance of these codes. A Turbo encoder is formed by the constituent concatenation of identical recursive convolutional encoders and interleaver. The turbo code decoder utilizes cascaded decoding components to share a priori information. The decoding algorithms have the benefit to work iteratively such that the overall performance can be improved. The performance of Turbo codes depends on its architectural components and the decoding algorithms. In this paper, the performance of Turbo codes is analyzing in terms of bit error rate (BER) and bit energy to noise ratio spectral density (Et/N0 ). This paper focuses on Log-Maximum A Posteriori (LogMAP) and Soft Output Viterbi Algorithm (SOY A) decoding algorithms applied in Turbo codes iterative decoding. The comparison of the two decoding algorithms is discourse. Finally, the parameters that influenced the Turbo codes performance are investigated. The number of iterations, frame size, puncturing effects and generator matrices are varied in MATLAB simulations to determine the effects in performance of Turbo Codes.

Actions (login required)

View Item