6 search results - page 1 / 2 » Asymptotically Good LDPC Convolutional Codes Based on Protog... |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
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 p...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper asymptotic methods are used to form lower bounds on the free distance to constraint length ratio of several ensembles of regular, asymptotically good, protographbased...
AAECC
2006
Springer
13 years 8 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
— Protograph-based LDPC codes have the advantages of a simple design (or search) procedure and highly structured encoders and decoders. These advantages have also been exploited ...
TIT
2010
12 years 11 months ago
2010
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...