International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 109 | Views: 214

M.Tech / M.E / PhD Thesis | Electronics & Communication Engineering | India | Volume 4 Issue 6, June 2015

BER Analysis of Turbo Coded Channel

Dinesh Verma | Manish Kumar [36]

Abstract: Turbo codes are a new class of forward error correcting codes that have proved to give a performance close to the channel capacity as proposed by C. Shannon. A turbo code encoder is formed by the parallel concatenation of two identical recursive convolutional encoders separated by an interleaver. The turbo code decoder utilizes two cascaded decoding blocks where each block in turn shares a priori information produced by the other. The decoding scheme has the benefit to work iteratively such that the overall performance can be improved. In this paper, a performance analysis of turbo codes is carried out. Two decoding techniques, namely, Log maximum a posteriori probability (Log-MAP) algorithm, and the soft output Viterbi algorithm (SOVA), which uses log-likelihood ratio to produce soft outputs are used in the performance analysis. The effect of using different decoding schemes is studied on both punctured and unpunctured codes. Finally, the performance of the two different decoding techniques is compared in terms of bit error rate. Simulations are carried out with the help of MATLAB tools. Results indicate that turbo codes outperform the well-accepted convolutional codes with same constraints, however the best results are given by the unpunctured Log-MAP decoding of turbo codes.

Keywords: Turbo Codes, Interleaver, Log-likelihood Ratio, Iterative Decoding, Log-Maximum a Posteriori Probability Algorithm, Soft Output Viterbi Algorithm

Edition: Volume 4 Issue 6, June 2015,

Pages: 2184 - 2187

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait