43 citations · 64 across the 5 of their papers we have counts for
5 papers
Finite Alphabet Iterative Decoders, Part II: Improved Guaranteed Error Correction of LDPC Codes via Iterative Decoder Diversity
David Declercq, Bane Vasic, Shiva Kumar Planjery +1
Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propaga…
Finite Alphabet Iterative Decoders, Part I: Decoding Beyond Belief Propagation on BSC
Shiva Kumar Planjery, David Declercq, Ludovic Danjean +1
We introduce a new paradigm for finite precision iterative decoding on low-density parity-check codes over the Binary Symmetric channel. The messages take values from a finite alph…
Enhancing the Error Correction of Finite Alphabet Iterative Decoders via Adaptive Decimation
Shiva Kumar Planjery, Bane Vasic, David Declercq
Finite alphabet iterative decoders (FAIDs) for LDPC codes were recently shown to be capable of surpassing the Belief Propagation (BP) decoder in the error floor region on the Binar…
Decimation-Enhanced Finite Alphabet Iterative Decoders for LDPC codes on the BSC
Shiva Kumar Planjery, Bane Vasic, David Declercq
Finite alphabet iterative decoders (FAID) with multilevel messages that can surpass BP in the error floor region for LDPC codes on the BSC were previously proposed. In this paper,…
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…