A reduced complexity implementation of the Log-Map algorithm for turbo-codes decoding

In this paper, we propose a reduced complexity implementation scheme of the Log-Map algorithm for turbo-codes decoding. By re-arranging the structure of the computation and using adaptive approximation, the computation in the Log-Map algorithm such as the state metric and the log-likelihood ratio calculation could be simplified or reduced adaptively. Simulation results show that more than 45% of the computation can be reduced with almost no performance degradation