Reduced latency turbo decoding
Reduced latency versions of iterative decoding of turbo codes are analyzed in this paper. The proposed schemes converge faster than the standard and plain shuffled approaches. EXIT chart is used to analyze the performance of the proposed algorithms. Both theoretical analysis and simulation results show that the new schedules offer better performance/complexity trade-offs.