David Declercq spends much of his time researching Algorithm, Decoding methods, Low-density parity-check code, Error detection and correction and Theoretical computer science. In general Algorithm study, his work on Error floor, BCJR algorithm and Code word often relates to the realm of Node, thereby connecting several areas of interest. Stability criterion, Graph and Linear programming is closely connected to Communication channel in his research, which is encompassed under the umbrella topic of Decoding methods.
The various areas that David Declercq examines in his Low-density parity-check code study include Discrete mathematics, Belief propagation, Binary number and Concatenated error correction code. His Concatenated error correction code research focuses on Turbo code and how it relates to Serial concatenated convolutional codes and Block code. The concepts of his Error detection and correction study are interwoven with issues in Computational complexity theory and Binary code.
His primary scientific interests are in Low-density parity-check code, Algorithm, Decoding methods, Theoretical computer science and Concatenated error correction code. David Declercq has researched Low-density parity-check code in several fields, including Discrete mathematics, Block code, Binary number, Turbo code and Serial concatenated convolutional codes. His studies deal with areas such as Tanner graph and Combinatorics as well as Discrete mathematics.
His Algorithm research is multidisciplinary, incorporating perspectives in Communication channel and Code. His Decoding methods study typically links adjacent topics like Error detection and correction. The concepts of his Concatenated error correction code study are interwoven with issues in Forward error correction and Linear code.
His main research concerns Decoding methods, Low-density parity-check code, Algorithm, Error detection and correction and Probabilistic logic. His work on Soft-decision decoder and Tanner graph as part of general Decoding methods study is frequently linked to Alphabet, bridging the gap between disciplines. The study incorporates disciplines such as Computation and Computer engineering in addition to Low-density parity-check code.
His Algorithm research integrates issues from Metric and Code. His research in Error detection and correction intersects with topics in List decoding and Computer hardware. His Probabilistic logic study combines topics in areas such as Frame, Computer network and Statistical model.
David Declercq mostly deals with Decoding methods, Algorithm, Low-density parity-check code, Error detection and correction and Throughput. His work deals with themes such as Computer hardware and Parallel computing, which intersect with Decoding methods. His Parallel computing research includes themes of Field-programmable gate array, Surjective function and Soft-decision decoder.
David Declercq integrates several fields in his works, including Algorithm and Node. He undertakes multidisciplinary studies into Low-density parity-check code and Hardware architecture in his work. His studies in Error detection and correction integrate themes in fields like Forward error correction, Probabilistic logic, List decoding and Computer engineering.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Decoding Algorithms for Nonbinary LDPC Codes Over GF $(q)$
D. Declercq;M. Fossorier.
IEEE Transactions on Communications (2007)
Fast decoding algorithm for LDPC over GF(2/sup q/)
L. Barnault;D. Declercq.
information theory workshop (2003)
Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images
C. Poulliat;M. Fossorier;D. Declercq.
IEEE Transactions on Communications (2008)
Low-complexity decoding for non-binary LDPC codes in high order fields
Adrian Voicila;David Declercq;Francois Verdier;Marc Fossorier.
IEEE Transactions on Communications (2010)
Trellis-Based Extended Min-Sum Algorithm for Non-Binary LDPC Codes and its Hardware Structure
Erbao Li;D. Declercq;K. Gunnam.
IEEE Transactions on Communications (2013)
Extended minsum algorithm for decoding LDPC codes over GF(/sub q/
D. Declercq;M. Fossorier.
international symposium on information theory (2005)
BORD: Bayesian optimum radar detector
Emmanuelle Jay;Jean Philippe Ovarlez;David Declercq;Patrick Duvaut.
Signal Processing (2003)
Finite Alphabet Iterative Decoders—Part I: Decoding Beyond Belief Propagation on the Binary Symmetric Channel
Shiva Kumar Planjery;David Declercq;Ludovic Danjean;Bane Vasic.
IEEE Transactions on Communications (2013)
Dynamic-SCFlip Decoding of Polar Codes
Ludovic Chandesris;Valentin Savin;David Declercq.
IEEE Transactions on Communications (2018)
Design of cages with a randomized progressive edge-growth algorithm
A. Venkiah;D. Declercq;C. Poulliat.
IEEE Communications Letters (2008)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of Arizona
École Nationale Supérieure de l'Électronique et de ses Applications
Boğaziçi University
CentraleSupélec
University of Arizona
IMT Atlantique
KU Leuven
University of Minnesota
Rice University
Jet Propulsion Lab
École Nationale Supérieure de l'Électronique et de ses Applications
Publications: 14