A Comparison Between LDPC Block and Convolutional Codes

LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. However, traditional means of comparing block and convolutional codes tied to the implementation complexity of trellis based decoding are irrelevant for message-passing decoders. In this paper, the authors undertake a comparison of LDPC block and convolutional codes based on several factors: encoding complexity, decoding computational complexity, decoding hardware complexity, decoding memory requirements, decoding delay, and VLSI implementation requirements.

Provided by: University of Alaska Fairbanks Topic: Networking Date Added: Jan 2013 Format: PDF

Find By Topic