42 citations · 182 across the 15 of their papers we have counts for
15 papers
LDPC Codes from Latin Squares Free of Small Trapping Sets
Dung Viet Nguyen, Shashi Kiran Chilappagari, Michael W. Marcellin +1
This paper is concerned with the construction of low-density parity-check (LDPC) codes with low error floors. Two main contributions are made. First, a new class of structured LDPC…
Structured LDPC Codes from Permutation Matrices Free of Small Trapping Sets
Dung Viet Nguyen, Bane Vasic, Michael Marcellin +1
This paper introduces a class of structured lowdensity parity-check (LDPC) codes whose parity check matrices are arrays of permutation matrices. The permutation matrices are obtain…
Worst Configurations (Instantons) for Compressed Sensing over Reals: a Channel Coding Approach
Shashi Kiran Chilappagari, Michael Chertkov, Bane Vasic
We consider the Linear Programming (LP) solution of the Compressed Sensing (CS) problem over reals, also known as the Basis Pursuit (BasP) algorithm. The BasP allows interpretation…
Multilevel Decoders Surpassing Belief Propagation on the Binary Symmetric Channel
Shiva Kumar Planjery, David Declercq, Shashi Kiran Chilappagari +1
In this paper, we propose a new class of quantized message-passing decoders for LDPC codes over the BSC. The messages take values (or levels) from a finite set. The update rules do…
Instanton-based Techniques for Analysis and Reduction of Error Floors of LDPC Codes
Shashi Kiran Chilappagari, Michael Chertkov, Mikhail G. Stepanov +1
We describe a family of instanton-based optimization methods developed recently for the analysis of the error floors of low-density parity-check (LDPC) codes. Instantons are the mo…
Two-Bit Message Passing Decoders for LDPC Codes Over the Binary Symmetric Channel
Lucile Sassatelli, Shashi Kiran Chilappagari, Bane Vasic +1
In this paper, we consider quantized decoding of LDPC codes on the binary symmetric channel. The binary message passing algorithms, while allowing extremely fast hardware implement…