Low-floor tanner codes via hamming-node or RSCC-Node doping

Authors:
Shadi Abu-Surra;Gianluigi Liva;William E. Ryan
Affiliations:
Electrical and Computer Engineering Department, University of Arizona;Dipartimento di Elettronica, Informatica e Sistemistica, Universita di Bologna;Electrical and Computer Engineering Department, University of Arizona
Venue:
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Year:
2006

Citing 1
Cited 3

On the BCJR trellis for linear block codes

IEEE Transactions on Information Theory

Doubly generalized LDPC codes over the AWGN channel

IEEE Transactions on Communications
Ensemble pseudocodeword weight enumerators for protograph-based generalized LDPC codes

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

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, by which we mean Hamming or recursive systematic convolutional (RSC) code constraints are used together with single-parity-check (SPC) constraints to construct a code’s protograph. We show that the doping of a “good” graph with Hamming or RSC codes is a pragmatic approach that frequently results in a code with a good threshold and very low error-rate floor. We focus on low-rate Tanner codes, in part because the design of low-rate, low-floor LDPC codes is particularly difficult. Lastly, we perform a simple complexity analysis of our Tanner codes and examine the performance of lower-complexity, suboptimal Hamming-node decoders.