CPCharly Poulliat

Charly Poulliat

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Charly Poulliat has a total of 62 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Computing the Low-Weight codewords of Punctured and Shortened Pre-Transformed polar Codes

    by Malek Ellouze, Romain Tajan, Camille Leroux, Christophe Jégo, Charly Poulliat

    In this paper, we present a deterministic algorithm to count the low-weight codewords of punctured and shortened pure and pre-transformed polar codes. The method first evaluates the weight properties of punctured/shortened polar cosets. Then, a method that discards the cosets that have no impact on the computation of the low-weight codewords is introduced. A key advantage of this method is its applicability, regardless of the frozen bit set, puncturing/shortening pattern, or pretransformation. Results confirm the method's efficiency while showing reduced computational complexity compared to stateof-the-art algorithms.

    • 7 November 2024
    • Published by HAL in HAL
    Open Access

    Computing the Low-Weight codewords of Punctured and Shortened Pre-Transformed polar Codes

    by Malek Ellouze, Romain Tajan, Camille Leroux, Christophe Jégo, Charly Poulliat

    In this paper, we present a deterministic algorithm to count the low-weight codewords of punctured and shortened pure and pre-transformed polar codes. The method first evaluates the weight properties of punctured/shortened polar cosets. Then, a method that discards the cosets that have no impact on the computation of the low-weight codewords is introduced.A key advantage of this method is its applicability, regardless of the frozen bit set, puncturing/shortening pattern, or pretransformation. Results confirm the method's efficiency while showing reduced computational complexity compared to stateof-the-art algorithms.

  • DSSS Chip-Wise Faster-than-Nyquist Signaling with DPSK for Robust Carrier Synchronization

    by Damien Roque, Stéphanie Bidon, Charly Poulliat

    Direct sequence spread spectrum (DSSS) signals possess strong and undesirable cyclostationary features when used in covert communications. This paper addresses their mitigation via chip-wise faster-than-Nyquist (FTN) signaling and time-varying pseudo-random SNR-optimal spreading sequences. We append a differential phase-shift keying (DPSK) encoder to the DSSS/FTN system to use a non-coherent differential receiver that facilitates carrier synchronization in challenging scenarios involving phase, frequency, and frequency-rate offsets. The proposed DSSS/FTN system proves robust with a bit-error-probability performance close to its traditional DSSS/Nyquist counterpart. Our results pave the way for designing low probability of detection/intercept waveforms without incurring a noticeable extra complexity at the receiver side.


  • Practical Frequency-Domain Decision Feedback Equalization Based on Expectation Propagation

    by Antonio Maria Cipriano, Serdar Şahin, Charly Poulliat

    This work tackles the problem of implementing frequency-domain (FD) Decision Feedback Equalization (DFE) algorithms derived from the Expectation Propagation (EP) framework under strict computational complexity and latency constraints. The EP soft-symbol feedback reliability estimation can be advantageously replaced by an offline pre-calculated function, which not only lowers the complexity of the EP-based FD DFE but also increases its robustness under challenging channels. Secondly, a substantial complexity reduction is obtained by approximating the input-output transfer functions of the EP soft mapper with linear piece-wise functions. The overall performance of the proposed practical receiver has a negligible loss with respect to the original EP-based DFE proposal.


  • Low-Complexity Scheduled Expectation Propagation Based on QRD and SIC

    by Adam Mekhiche, Antonio Maria Cipriano, Charly Poulliat

    This letter presents novel Expectation Propagation (EP) algorithms for Single User (SU) and Multiple Users (MU) Multiple-Input Multiple-Output (MIMO) detection that address the performance loss and slow convergence of classic Scalar EP (SEP) solutions with even lower computational complexity. The proposed algorithms employ QR Decomposition (QRD), optimized EP message scheduling, and Successive Interference Cancellation (SIC) techniques to achieve superior performance and convergence speed comparable to those of Vector Expectation Propagation (VEP). Our results are illustrated through error rate curves and analysis of performance-complexity trade-offs in SU and MU scenarios.


  • Open Access

    Expectation Propagation on Factor Graphs Based on Matrix Decomposition

    by Adam Mekhiche, Antonio Maria Cipriano, Charly Poulliat

    In the context of the Gaussian linear model, recent works have studied factor graph modification using QR decomposition that enables the derivation of scalar Expectation Propagation (EP) based detectors. In this paper, we investigate on new factor graph representations induced by the use of the Golub-Kahan bi-diagonal Decomposition (GKD) and of the Singular Value Decomposition (SVD). New EP messages induced by the GKD or SVD underlying graphs are derived, that can be both scalar or vector messages. Complexity and performance of the resulting algorithms are studied for digital communications applications.


  • SNR-Optimal Spreading Sequences for Chip-Wise Faster-Than-Nyquist Signaling

    by Damien Roque, Charly Poulliat

    This letter proposes signal-to-noise ratio (SNR)-optimal spreading sequences for faster-than-Nyquist (FTN) transmission. The peculiar association of direct sequence spread spectrum with FTN proves relevant to mitigate noticeable cyclostationary features, leading up to covert communications schemes. Considering a matched-filter-based receiver, the proposed SNR-optimal spreading sequences and their closed-form approximations outperform traditional pseudo-random noise sequences by achieving near-interference-free bit-error-probability. Our results pave the way for the design of FTN-specific multiple access techniques while ensuring a low probability of detection/intercept.


  • Open Access

    Some power allocation algorithms for cognitive uplink satellite systems

    by Arthur Louchart, Ehsan Tohidi, Philippe Ciblat, David Gesbert, Eva Lagunas, Charly Poulliat

    Cognitive satellite communication (SatCom) is rapidly emerging as a promising technology to overcome the scarcity of the exclusive licensed band model in order to fulfill the increasing demand for high data rate services. The paper addresses power allocation methods for multi-operator multi-beam uplink satellite communication systems co-existing with a Ka-band terrestrial network, using cognitive radio paradigm. Such a scenario is especially challenging because of (i) the coexisting multiple SatCom operators over the cognitive band need to coordinate the use of their resources under limited inter-operator information exchange, and (ii) nonlinear onboard high power amplifier (HPA) which leads to nonlinear interference between users and beams. In order to tackle the first challenge, we propose distributed power allocation algorithms including the standard Alternate Direction Multiplier Method (ADMM); Regarding the HPA nonlinear impairment, we propose nonlinear-aware power allocation based on Signomial Programming. The proposed solutions outperform state-of-the-art in both cases.


  • EBP-GEXIT Charts for M-Ary AWGN Channel for Generalized LDPC and Turbo Codes

    by Arti Yardi, Tarik Benaddi, Charly Poulliat, Iryna Andriyanova

    The maximum a posteriori (MAP) threshold corresponds to the fundamental limit that one can hope to achieve with the given channel code ensemble. Apart from theoretical interests, finding this limit is also desirable since spatial-coupled code ensembles approach this MAP threshold due to phenomenon termed as threshold saturation. However finding this MAP threshold, in general, is known to be computationally prohibitive. This work proposes a tractable method for estimating the MAP threshold for various families of sparse-graph code ensembles over non-binary complex-input additive white Gaussian noise (AWGN) channel. Towards this, we provide a method to approximate the extended belief propagation generalized extrinsic information transfer (EBP-GEXIT) chart and estimate the MAP threshold by applying the Maxwell construction to it. To illustrate the validity of our method, we study spatial coupling for serially-concatenated turbo-codes and numerically observe threshold saturation of these codes to the MAP thresholds estimated via our method.


  • Satellite Image Compression and Denoising With Neural Networks

    by Vinicius Alves de Oliveira, Marie Chabert, Thomas Oberlin, Charly Poulliat, Mickael Bruno, Christophe Latry, Mikael Carlavan, Simon Henrot, Frederic Falzon, Roberto Camarero

    Earth observation through satellite images is crucial to help economic activities as well as to monitor the impact of human activities on ecosystems. Current satellite systems are subjected to strong computational complexity constraints. Thus, image compression is performed onboard with specifically tailored algorithms while image denoising is performed on the ground. In this letter, we intend to address satellite image compression and denoising with neural networks. The first proposed approach uses a single neural architecture for joint onboard compression and denoising. The second proposed approach sequentially uses a first neural architecture for onboard compression and a second one for on ground denoising. For both approaches, the onboard architectures are lightened as much as possible, following the procedure proposed by Alves de Oliveira et al. (2021). The two approaches are shown to outperform the current satellite imaging system and their respective pros and cons are discussed.