Comparison of decoding complexities for LDPC and convolutional self-doubly-orthogonal codes

The complexities of iterative belief propagation decoding techniques for randomly constructed low-density parity-check (LDPC) block codes and nonrecursive convolutional self-doubly-orthogonal codes (CSO2Cs) are analyzed and compared on the basis of their decoding latencies expressed in the number of code symbols. Although, in principle, they have the same computational complexities, the pipeline decoder structure for CSO2Cs has a much smaller implementation complexity than the block decoder structure for LDPC block codes, but at a cost of small loss in the error performance of decoding.