Reduced-complexity iterative decoding of high-rate turbo codes

This paper presents a new reduction method of both the computational complexity and storage requirements in the nonpunctured turbo decoding. The idea of the proposed algorithm is based on the computational complexity reduction, which is attendant upon the process of add-compare-select in each stage of iterative decoding. Therefore, the proposed method is completely different from all the other reduction algorithms presented before now. We compare the nonpunctured turbo code using the proposed reduction method with the punctured turbo code in terms of performance-complexity tradeoff. Simulation results show that the proposed approach provides an alternative encoding/decoding scheme of the classical punctured turbo coding for the application to high-data-rate wireless communications system