A New Algorithm without Exponential and Logarithmic Computations in Iterative Decoding for Double Binary Convolutional Turbo Code

This paper proposes a new and modified MAP algorithm for double binary convolutional turbo code (DB CTC) based on a new definition of branch metrics. The exponential and logarithmic operations in the convolutional algorithm are not needed in the iterative process after a date pre-processing of the received sequence. Furthermore, computational complexity analysis of branch metrics and performance simulation are also presented to demonstrate the effectiveness of our modified algorithm.