Sciweavers

30 search results - page 1 / 6
» Iterative decoding threshold analysis for LDPC convolutional...
Sort
View
TIT
2010
140views Education» more  TIT 2010»
12 years 11 months ago
Iterative decoding threshold analysis for LDPC convolutional codes
Abstract--An iterative decoding threshold analysis for terminated regular LDPC convolutional (LDPCC) codes is presented. Using density evolution techniques, the convergence behavio...
Michael Lentmaier, Arvind Sridharan, Daniel J. Cos...
CORR
2011
Springer
203views Education» more  CORR 2011»
12 years 11 months ago
AWGN Channel Analysis of Terminated LDPC Convolutional Codes
— It has previously been shown that ensembles of terminated protograph-based low-density parity-check (LDPC) convolutional codes have a typical minimum distance that grows linear...
David G. M. Mitchell, Michael Lentmaier, Daniel J....
CORR
2008
Springer
130views Education» more  CORR 2008»
13 years 4 months ago
Asymptotically Good LDPC Convolutional Codes Based on Protographs
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...
David G. M. Mitchell, Ali Emre Pusane, Kamil Sh. Z...
AAECC
2006
Springer
122views Algorithms» more  AAECC 2006»
13 years 8 months ago
Low-Floor Tanner Codes Via Hamming-Node or RSCC-Node Doping
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,...
Shadi Abu-Surra, Gianluigi Liva, William E. Ryan
MCSS
2009
Springer
13 years 9 months ago
Multi-user OFDM Based on Braided Convolutional Codes
Abstract Braided convolutional codes (BCCs) form a class of iteratively decodable convolutional codes that are constructed from component convolutional codes. In braided code divis...
Michael Lentmaier, Marcos B. S. Tavares, Gerhard F...