Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christiane L. Kameni Ngassa

dblp:22/11256 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 93% Information theory · 7%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding › iterative decoding
density evolution
0.212015
Density Evolution and Functional Threshold for the Noisy Min-Sum Decoder · IEEE Trans. Commun. 2015
Coding theory › error-correcting codes
LDPC codes
0.212015
Density Evolution and Functional Threshold for the Noisy Min-Sum Decoder · IEEE Trans. Commun. 2015
Coding theory › error-correcting codes › LDPC codes › LDPC decoding
min-sum decoding
0.212015
Density Evolution and Functional Threshold for the Noisy Min-Sum Decoder · IEEE Trans. Commun. 2015
Information theory › probability theory
threshold phenomena
0.112015
Density Evolution and Functional Threshold for the Noisy Min-Sum Decoder · IEEE Trans. Commun. 2015

Methods — techniques the papers use, named apart from their topics

probabilistic noise models · 0.2monte carlo simulation · 0.2density evolution analysis · 0.2
YearPublicationVenuePosition
2015 Density Evolution and Functional Threshold for the Noisy Min-Sum Decoder
abstract
This paper investigates the behavior of the Min-Sum decoder running on noisy devices. Our aim is to evaluate the robustness of the decoder to computation noise caused by the faulty logic in the processing units. This type of noise represents a new source of errors that may occur during the decoding process. To this end, we first introduce probabilistic models for the arithmetic and logic units of the finite-precision min-sum decoder and then carry out the density evolution analysis of the noisy min-sum decoder. We show that, in some particular cases, the noise introduced by the device can help the min-sum decoder to escape from fixed points attractors and may actually result in an increased correction capacity with respect to the noiseless decoder. We also point out a specific threshold phenomenon, referred to as functional threshold, which accurately describes the convergence behavior of noisy decoders. The behavior of the noisy MS is demonstrated in the asymptotic limit of the code length through a noisy version of density evolution and is also verified in the finite-length case by Monte Carlo simulations.
Christiane L. Kameni Ngassa, Valentin Savin, Elsa Dupraz, David Declercq
IEEE Trans. Commun.1
2013 Min-Sum-based decoders running on noisy hardware
abstract
This paper deals with Low-Density Parity-Check decoders running on noisy hardware. This represents an unconventional paradigm in communication theory, since it is traditionally assumed that the error correction decoder operates on error-free devices and the randomness (in the form of noise and/or errors) exists only in the transmission channel. However, with the advent of nanoelectronics, it starts to be widely accepted that the future generations of circuits and systems will need to reliability compute and solve statistical inferences, by making use of unreliable “noisy” components. It is then critical to properly evaluate the robustness of the existing decoders in the presence of an additional source of noise at the circuit level. To this end, we first introduce a new error model approach and carry out the “noisy” density evolution analysis of the fixed-point Min-Sum decoding. Then, for different parameters of the noisy components of the decoder, we determine the range of the signal-to-noise ratio values for which the decoder is able to achieve a target bit error rate performance. Finally, we evaluate the finite-length performance of the Min-Sum and two other Min-Sum-based decoders running on noisy hardware.
Christiane L. Kameni Ngassa, Valentin Savin, David Declercq
GLOBECOM1