16 citations · 41 across the 7 of their papers we have counts for
7 papers
Minimum Distances of the QC-LDPC Codes in IEEE 802 Communication Standards
Brian K. Butler
This work applies earlier results on Quasi-Cyclic (QC) LDPC codes to the codes specified in six separate IEEE 802 standards, specifying wireless communications from 54 MHz to 60 GH…
LDPC Code Density Evolution in the Error Floor Region
Brian K. Butler, Paul H. Siegel
This short paper explores density evolution (DE) for low-density parity-check (LDPC) codes at signal-to-noise-ratios (SNRs) that are significantly above the decoding threshold. The…
Numerical Issues Affecting LDPC Error Floors
Brian K. Butler, Paul H. Siegel
Numerical issues related to the occurrence of error floors in floating-point simulations of belief propagation (BP) decoders are examined. Careful processing of messages correspond…
Generalized Sharp Bounds on the Spectral Radius of Digraphs
Brian K. Butler, Paul H. Siegel
The spectral radius ρ(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on ρ(G) that are often tighter and are applicable to a…
Error Floor Approximation for LDPC Codes in the AWGN Channel
Brian K. Butler, Paul H. Siegel
This paper addresses the prediction of error floors of low-density parity-check (LDPC) codes with variable nodes of constant degree in the additive white Gaussian noise (AWGN) chan…
Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes
Brian K. Butler, Paul H. Siegel
Recent work by Divsalar et al. has shown that properly designed protograph-based low-density parity-check (LDPC) codes typically have minimum (Hamming) distance linearly increasing…
On Distance Properties of Quasi-Cyclic Protograph-Based LDPC Codes
Brian K. Butler, Paul H. Siegel
Recent work has shown that properly designed protograph-based LDPC codes may have minimum distance linearly increasing with block length. This notion rests on ensemble arguments ov…