Asymptotically good LDPC convolutional codes based on protographs

Abstract

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. In this paper, asymptotic methods are used to calculate a lower bound on the free distance for several ensembles of asymptotically good protograph-based LDPC convolutional codes. Further, we show that the free distance to constraint length ratio of the LDPC convolutional codes exceeds the minimum distance to block length ratio of corresponding LDPC block codes.

DOI: 10.1109/ISIT.2008.4595143

Extracted Key Phrases

3 Figures and Tables

Showing 1-10 of 19 references

Distance bounds for periodic LDPC convolutional codes and tail-biting convolutional codes

  • D Truhachev, K Sh, D J Zigangirov, Jr Costello
  • 2008
1 Excerpt

Construction of irregular LDPC convolutional codes with fast decoding

  • A E Pusane, K Sh, D J Zigangirov, Jr Costello
  • 2006
1 Excerpt
Showing 1-10 of 15 extracted citations