Thumbnail
Access Restriction
Open

Author Mitchell, David G. M. ♦ Pusane, Ali E. ♦ Zigangirov, Kamil Sh ♦ Costello, Jr ♦ Daniel, J.
Source arXiv.org
Content type Text
File Format PDF
Date of Submission 2008-05-02
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Natural sciences & mathematics ♦ Mathematics
Subject Keyword Computer Science - Information Theory ♦ cs ♦ math
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.
Educational Use Research
Learning Resource Type Article


Open content in new tab

   Open content in new tab