Valerian Mannoni

Valerian Mannoni

Auto-generated profile, based on publicly available information

Valerian Mannoni

Universit Grenoble Alpes,CEA-LETI,Grenoble,France,F-38000

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 November 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
JRJoachim Rosseel
Joachim Rosseel
VMValerian Mannoni
Valerian Mannoni
IFInbar Fijalkow
Inbar Fijalkow
VSValentin Savin
Valentin Savin
This paper investigates decoder diversity architectures for short low-density parity-check (LDPC) codes, based on recurrent neural network (RNN) models of the belief-propagation (BP) algorithm. We propose a new approach to achieve decoder diversity in the waterfall region, by specializing BP-RNN decoders to specific classes of errors, with absorbing set support. We further combine our approach with an ordered statistics decoding (OSD) post-processing step, which effectively leverages the bit-error rate optimization deriving from the use of the binary cross-entropy loss function. We show that a single specialized BP-RNN decoder combines better than BP with the OSD post-processing step. Moreover, combining OSD post-processing with the diversity brought by the use of multiple BP-RNN decoders, provides an efficient way to bridge the gap to maximum likelihood decoding.

17 February 2018
Verified
Book Chapter
Closed access
PDF file
VMValérian Mannoni
Valérian Mannoni
VBVincent Berg
Vincent Berg
FDFrançois Dehmas
François Dehmas
DNDominique Noguet
Dominique Noguet

30 August 2021
Verified
Conference Paper
Open access
JRJoachim Rosseel
Joachim Rosseel
VMValerian Mannoni
Valerian Mannoni
VSValentin Savin
Valentin Savin
IFInbar Fijalkow
Inbar Fijalkow
This article deals with the decoding of short block length Low Density Parity Check (LDPC) codes. It has already been demonstrated that Belief Propagation (BP) can be adjusted to the short coding length, thanks to its modeling by a Recurrent Neural Network (BP-RNN). To strengthen this adaptation, we introduce a new training method for the BP-RNN. Its aim is to specialize the BP-RNN on error events sharing the same structural properties. This approach is then associated with a new decoder composed of several parallel specialized BP-RNN decoders, each trained on correcting a different type of error events. Our results show that the proposed specialized BP-RNNs working in parallel effectively enhance the decoding capacity for short block length LDPC codes.

4 September 2023
Verified
Conference Paper
Open access
JRJoachim Rosseel
Joachim Rosseel
VMValérian Mannoni
Valérian Mannoni
VSValentin Savin
Valentin Savin
IFInbar Fijalkow
Inbar Fijalkow
This article deals with Ordered Statistics Decoding (OSD) applied to the soft outputs of the Belief Propagation (BP) algorithm. We first model the weighted sum of the a posteriori LLRs across BP decoding iterations into a neuron. The neuron is then trained with the focal loss to compute for each BP decoding failure a set of accumulated Log Likelihood Ratios (LLRs) suited for OSD post-processing. Then, we propose a recursive selection procedure of LLRs sets, for multiple OSD post-processing. This selection is carried out from the sets of a posteriori LLRs calculated at each BP iteration, and from the accumulated LLRs optimized for the OSD, based on their joint probabilities of failure with OSD post-processing. An OSD is then applied to each set of LLRs belonging to the selection. In addition, we propose to reduce the OSD post-processing decoding complexity without significantly degrading its performance. Our results show that this new decoding method provides an effective way to bridge the gap to maximum likelihood decoding for short and long Low Density Parity Check (LDPC) codes.