Parallel decoding of turbo codes using soft output T-algorithms

Turbo codes need to be used with reasonably long blocks of data which invariably lead to encoding delay (latency) and decoding delay of the order of O(N) due to the finite computational speed of the processor. It was shown that if the hardware complexity of W>1 processors was acceptable, then the decoding delay could be reduced to O(N/W) without much performance degradation, by decoding the turbo code in a parallel fashion. We show that the decoding delay could be further reduced if the component decoders use parallel versions of soft output T-algorithms instead of parallel versions of the MAP algorithm.