Computational complexities and relative performance of LDPC codes and turbo codes

This paper addresses the computational requirements and relative performance of low-density parity-check (LDPC) codes and Turbo codes. Detailed complexity analysis and exact formulas giving the required number of calculations are first presented for LDPC codes and Turbo codes, and then Monte Carlo simulations are performed to compare their relative performance at comparable computation cost. The numeral results show that even at moderate block length the optimized irregular LDPC codes can also beat Turbo codes with only 19% computational cost.