P. Duhamel

French National Centre for Scientific Research | CNRS · Laboratoire de Signaux et Systèmes

Reliable out-of-distribution (OOD) detection is fundamental to implementing safer modern machine learning (ML) systems. In this paper, we introduce Igeood, an effective method for detecting OOD samples. Igeood applies to any pre-trained neural network, works under various degrees of access to the ML model, does not require OOD samples or assumption...

The image watermarking technique is a reliable method for protecting digital image rights. The most widely used digital imaging format is the JPEG (joint photographic expert’s group). This paper proposes a novel reversible robust watermarking scheme based on the JPEG image. In JPEG image, quantified Discrete Cosine Transform (DCT) coefficients with...

This paper proposes a lossless point cloud (PC) geometry compression method that uses neural networks to estimate the probability distribution of voxel occupancy. First, to take into account the PC sparsity, our method adaptively partitions a point cloud into multiple voxel block sizes. This partitioning is signalled via an octree. Second, we emplo...

This paper proposes a lossless point cloud (PC) geometry compression method that uses neural networks to estimate the probability distribution of voxel occupancy. First, to take into account the PC sparsity, our method adaptively partitions a point cloud into multiple voxel block sizes. This partitioning is signalled via an octree. Second, we emplo...

We propose a practical deep generative approach for lossless point cloud geometry compression, called MSVoxelDNN, and show that it significantly reduces the rate compared to the MPEG G-PCC codec. Our previous work based on autoregressive models (VoxelDNN) has a fast training phase, however, inference is slow as the occupancy probabilities are predi...

This paper presents a learning-based, lossless compression method for static point cloud geometry, based on context-adaptive arithmetic coding. Unlike most existing methods working in the octree domain, our encoder operates in a hybrid mode, mixing octree and voxel-based coding. We adaptively partition the point cloud into multi-resolution voxel bl...

In order to improve the transmission reliability in current wireless communication systems, the Hybrid Automatic ReQuest (HARQ) protocol is employed to manage the unknown time-varying channel. The acknowledgments are fed back with delay on the return link. To fill up the idle time between a transmission and its acknowledgment, parallel HARQ streams...

Hybrid Automatic ReQuest (HARQ) protocol enables reliable communications in wireless systems. Usually, several parallel streams are sent in successive timeslots following a time-sharing approach. Recently, multi-layer HARQ has been proposed by superposing packets within a timeslot. In this paper, we evaluate the potential of this multi-layer HARQ b...

An intra coding algorithm with layer separation is proposed. This algorithm is designed on top of an adopted tool in VVC, called Block DPCM (BDPCM), and benefits from texture information in a neighborhood to derive intensity levels of background and foreground layers. This information is used to reduce large rate of residual in case of incorrect la...

This paper considers wireless communication protocols implementing both cooperation and Hybrid Automatic Repeat reQuest (HARQ). Based on a simple example (one Source, one Relay and one Destination), we propose the use of probabilistic protocols as an alternative to classical, deterministic ones. Starting initially with the Finite State Markov Chain...

Statistical methods protecting sensitive information or the identity of the data owner have become critical to ensure privacy of individuals as well as of organizations. This paper investigates anonymization methods based on representation learning and deep neural networks, and motivated by novel information theoretical bounds. We introduce a novel...

A few years after standardization of the High Efficiency Video Coding (HEVC), now the Joint Video Exploration Team (JVET) group is exploring post-HEVC video compression technologies. In the intra prediction domain, this effort has resulted in an algorithm with 67 internal modes, new filters and tools which significantly improve HEVC. However, the i...

This work studies the performance of a cooperative network which consists of two channel-coded sources, multiple relays, and one destination. To achieve high spectral efficiency, we assume that a single time slot is dedicated to relaying. Conventional network-coded based cooperation (NCC) selects the best relay which uses network coding to serve th...

This paper proposes a full-rate cooperative scheme adapted to the slow fading semi-orthogonal multiple access relay channel (MARC). It is assumed that the sources transmit on orthogonal channels and the relay is half duplex transmitting on the same channels as the one of the sources. The sources employ LDPC to encode their messages before transmitt...

Transmit power allocation techniques are very important to manage interference in small-cell networks. While available power allocation algorithms in the literature rely on a predefined routing protocol, we propose in this paper a power-efficient two-step algorithm that allows power allocation and routing to be performed jointly in femto-relay netw...

This paper studies secure communication based on incremental redundancy (INR) secure hybrid automatic retrans-mission request (HARQ) protocol over block-fading wiretap channels. The transmitter has no instantaneous channel state information (CSI) available from either main channel or the eavesdropper channel, hence the coding rates cannot be adapte...

Network Coded Cooperation (NCC) is known to provide full diversity order and high spectral efficiency for uncoded cooperative networks. However, the understanding of NCC applied to signals that have been protected by some Forward Error Correction (FEC) codes is still limited. This letter analyzes the diversity order attainable by NCC with channel c...

In this paper, we study Outage Probability (OP) and diversity order of a M-source and N-relay wireless network that combines Network Coding (NC) and Relay Selection (RS). More specifically, a Decode-and-Forward (DF) relaying protocol is considered and the network-encoding vectors at the relays are assumed to constitute a Maximum Distance Separable...

A recursive/adaptive least squares algorithm (MLRA) is proposed to solve the joint blind channel identification and blind symbol estimation problem. It is based on Deterministic Maximum Likelihood methods (DML) which are pertinent in this field. We prove that when the MLRA converges then it converges towards the global minimum. The MLRA is able to...

This paper deals with synchronization problem in IEEE 802.11a wireless system. In addition to traditional training sequences, the SIGNAL field of the physical frame can be considered as a new source of information. Indeed the receiver is able to predict the SIGNAL unknown parts relying on the knowledge provided by the CSMA/CA protocol during the ne...

This paper addresses altogether time and frequency synchronization in IEEE 802.11a orthogonal frequency division multiplexing (OFDM) wireless communication systems. The proposed algorithms have two main features: (i) they make use of an additional source of information available at IEEE 802.11a physical layer, on top of the usual ones typically ado...

This paper considers the Broadcast Channel with Confidential Message (BCCM) where the sender attempts to send altogether a common message to two receivers and a confidential message to one of them. The achievable rate regions are derived for the power-constrained Gaussian BCCM with finite input alphabet using various transmission strategies. Namely...

Ce papier présente une méthode élégante pour la correction des erreurs impulsives dans les systèmes OFDM. Il existe une analogie entre ces systèmes OFDM et les codes Reed Solomon. Ceci montre que si un signal est envoyé sur un canal contenant un bruit gaussien de faible amplitude et un bruit impulsif alors ce bruit impulsif peut être corrigé par un...

Dans ce papier, nous proposons une structure en cascade pour améliorer l'algorithme de correction de bruit impulsif que nous avons déjà présenté dans [6]. Cette nouvelle structure permet une implantation facile et plus fiable (plusieurs paramètres peuvent être obtenus théoriquement plutôt que par simulation). Nous prouvons également que cet algorit...

This paper analyzes the achievable secrecy throughput in incremental redundancy secure HARQ protocols for communication over block-fading wiretap channels (WTC). The transmitter has no instantaneous channel state information (CSI) but can receive an outdated version of CSI from both legitimate receiver and eavesdropper through reliable multi-bit fe...

This chapter provides an overview of joint source-channel coding and decoding. We first address joint decoding techniques, which exploit the residual redundancy left by source coders in the compressed data stream to correct transmission impairments. Combined with concealment, these techniques may reduce the need for packet retransmissions when they...

This paper deals with synchronization problem in IEEE 802.11a wireless system. In addition to traditional training sequences, the SIGNAL field of the physical frame can be considered as a new source of information. Indeed the receiver is able to predict the SIGNAL unknown parts relying on the knowledge provided by the CSMA/CA protocol during the ne...

This paper presents a joint protocol-channel decoding techniques to improve the estimation quality of the type of a packet corrupted by transmission errors. It exploits the redundancy present in the protocol stack to determine the packet type which is the most probable a posteriori. An optimal and a suboptimal estimation algorithm are presented. Th...

This paper investigates the maximization of the secrecy-achievable rate region for the Gaussian broadcast channel with confidential message (BCCM) using finite input constellations. The maximization is done jointly over symbol positions and their joint probabilities. The secrecy-achievable rate regions are given for various broadcast strategies whi...

Video compression has been investigated by means of analysis-synthesis, and more particularly by means of inpainting. The first part of our approach has been to develop the inpainting of DCT coefficients in an image. This has shown good results for image compression without overpassing todays compression standards like JPEG. We then looked at integ...

The invention relates to a method for quantifying components, wherein certain components are each determined based on a plurality of audio signals and can be calculated by the application of a linear conversion on the audio signals, said method comprising: determining a quantification function to be applied to the components by testing a condition...

This paper studies Gaussian Two-Way Relay Channel where two communication nodes exchange messages with each other via a relay. It is assumed that all nodes operate in half duplex mode without any direct link between the communication nodes. A compress-and-forward relaying strategy using nested lattice codes is first proposed. Then, the proposed sch...

In this paper, we study the performance of the four{node multiple{access relay channel with binary Network Coding (NC) in various Rayleigh fading scenarios. In particular, two relay protocols, decode-and-forward (DF) and demodulate-and-forward (DMF) are considered. In the first case, channel decoding is performed at the relay before NC and forwardi...

In this paper, maximal achievable rate regions are derived for power-constrained AWGN broadcast channel involving finite constellations and two users. The achievable rate region is studied for various transmission strategies including superposition coding and compared to standard schemes such as time sharing. The maximal achievable rates are obtain...

This paper studies the four-node Multiple Access Relay Channel (MARC) under quasi-static block Rayleigh fading channels and Gaussian noise environment. A relay employs Demodulate–and–Forward (DMF) protocol in order to help two channel-encoded sources to communicate with a destination. The contributions of the paper are threefold: i) we propose a Ne...

Cross-layer error protection strategies couple systematic error correction at the physical layer with adaptive data retransmission at the data-link layer, to mitigate the effects of fast-fading propagation channels. This work, in the form of a case-study, aims to introduce useful tools for the assessment and analysis of the energetic performance of...

In this paper, achievable rates regions are derived for power constrained Gaussian broadcast channel of two users using finite dimension constellations. Various transmission strategies are studied, namely superposition coding (SC) and superposition modulation (SM) and compared to standard schemes such as time sharing (TS). The maximal achievable ra...

A method for recovering transmission errors, comprising: receiving a data packet comprising an error detection code associated to data contained in the packet, wherein the data associated to the error detection code comprises primary data and secondary data, checking the error detection code of the received packet to detect an erroneous state of th...

This paper analyzes the performance of relay networks with channel coding in low and medium Signal to Noise Ratio (SNR) regime. In particular, we study the three-node relay network in the quasi-static Rayleigh fading channel plus additive white Gaussian noise. Estimate-and-forward (EF) relay protocol is used. In order to achieve high spectrum effic...

Two-way relay channel (TWRC) models a cooperative communication situation performing duplex transmission via a relay station. For this channel, we have shown previously that a lattice-based physical layer network coding strategy achieves, at the limit of arbitrarily large dimension, the same rate as that offered by the random coding-based regular c...

This paper considers incremental redundancy hybrid ARQ (HARQ) transmission over independent block-fading channels. The transmitter, having no knowledge of the instantaneous channel state information (CSI) can or - allocate the transmission rate knowing the statistics of the channel, or - adapt the transmissions rates using the outdated CSI, i.e., t...

Time and frequency synchronization in the IEEE 802.11a OFDM (Orthogonal Frequency Division Multiplexing) wireless communication system is addressed in this paper. Usually synchronization algorithms rely only on training sequences specified by the standard. To enhance the synchronization between stations, we propose to extract known information by b...

This paper addresses the time synchronization problem in IEEE 802.11a OFDM wireless systems. To enhance the coarse time syn-chronization mechanism, recent methods exploit not only traditional training sequences as specified by the standard but also additional knowledge available when the Carrier Sense Multiple Access with Collision Avoidance mechan...

Parallel two-way relay channel models a cooperative communication scenario where a relay helps two terminals to exchange their messages over independent Gaussian channels. For the single channel case, we have shown previously that lattice-based physical layer network coding achieves the same rate as compress-and-forward scheme with a random coding...

A generalized information passing strategy is discussed for iterative decoding of turbo-like systems. Both the existence of fixed point and the convergence of the iterative process are analyzed. It is proved that convergence can always be obtained. The added degree of freedom provides advantages over the classical algorithm in terms of convergence...

To meet increasing throughput, delay and reliability demands, future wireless networks will have to rely on increased cooperation both among nodes and among protocol layers in a node. This requires a wide variety of knowledge, from theoretical issues such as graph theory or information theory, to issues at the physical and network layers. A potenti...

Cooperative network coding is considered as a novel technology that integrates cooperative communications with network coding to improve the throughput and robustness of the network. In this paper, a network coding enabled cooperative network with multiple relays is considered, under Rayleigh fading. The outage probability of this network is analyz...

This paper addresses the problem of time synchronization in the IEEE 802.11a OFDM wireless communication system.In addition to the reference sequence usually used in conventional algorithms, recently the SIGNAL field of the physical packet has been exploited to improve the coarse time synchronization. To increase the performance of the fine time sy...

In this paper, we study a network coding in high order Galois Field (GF) compatible with Quadrature Amplitude Modulation (QAM) applied to the multiple-access relay channel (MARC). Our proposal is described in the context of orthogonal Rayleigh fading plus Gaussian noise channels. The proposed decoder takes into account possible decoding errors at t...

This paper proposes an algorithm for the robust reception of compressed HTML files transmitted over a noisy mobile radio channel. Both source encoders and transmission systems are assumed to be standard compliant. The source encoder follows the HTTP1.1 protocol specifications, i.e. the HTML files are encoded by the deflate algorithm, a combination...

In many communication standards, several variable length frames generated by some source coder may be aggregated at a given layer of the protocol stack in the same burst to be transmitted. This decreases the signalization overhead and increases the throughput. However, after a transmission over a noisy channel, Frame Synchronization (FS), i.e., rec...

This paper proposes a novel approach for time synchronization in the IEEE 802.11a communication system. In addition to the conventional use of the 802.11a sequence preamble for synchronization, we exploit the SIGNAL field of the physical packet as a supplementary reference training sequence at the receiver for coarse time synchronization since this...

Channel decoding makes use of redundancy in the coded bits. However, any redundancy in the information bitstream can also improve the decoding process. This paper shows that a careful examination of communication standards (including the headers added by the network layers) exhibits some fields which can be considered as redundant, either based on...

The problem of constellation shaping for broadcast transmission in degraded channels remains a challenge. This is especially so when a single source communicates simultaneously with two receivers using a finite dimension constellation. This paper focuses on a practical situation where unicast service to each user is transmitted over broadcast chann...

In this paper we consider the orthogonal cooperative broadcast channel with a common message. The downlink and cooperation channels are modelled by erasure channels and assumed to be orthogonal. We derive an achievable rate for this channel by using a combination of decode-and-forward and estimate-and-forward and considering both symmetric and asym...

This paper studies the problem of finding the optimal route of a stream between the transmitter and the receiver in an ad hoc network while minimizing the total power consumption. The criterion is the minimum power, and the fact that the stream must reach its destination is used as a constraint. Compared to previous approaches, we introduce more fl...

ICASSP 2012 Tutorial number T-3 (Half Day)

In this paper, we study the three-node multiple-access relay channel under realistic operating conditions. More specifically, in our setup all wireless links are subjected to Rayleigh fading and Gaussian noise, and the relay node can be located at different distances from source and destination nodes. We assume that coded bits are fully-interleaved...

he invention relates to a method for encoding at least one image broken up into blocks, implementing, for at least one current block, a step of transforming (11) said current block from the spatial domain into a transformed domain, outputting a transformed block consisting of a set of coefficients representative of said current block, referred to a...

Clearly, when one searches to build communication systems to mobiles or between mobile terminals with a very high capacity, he implicitly has in mind that some multimedia (high quality sound, still images, video, and more in the near future) has to be transmitted. Speech by itself would not justify such investments. Even when web surfing is conside...

Clearly, when one searches to build communication systems to mobiles or between mobile terminals with a very high capacity, he implicitly has in mind that some multimedia (high quality sound, still images, video, and more in the near future) has to be transmitted. Speech by itself would not justify such investments. Even when web surfing is conside...

We analyze the throughout achievable in transmission over block-fading channels when the instantaneous channel state information (CSI) is not available at the transmitter. Assuming operation with incremental redundancy hybrid ARQ (HARQ), we propose to adapt the transmissions rates using the outdated CSI, i.e., the one experienced by the receiver in...

The situation where the same signal has to be sent to a number of wireless receivers arises more and more often, due to the increasing use of wireless internet including TV. Classically, this is done either by establishing several one to one communications, which is obviously a waste of resources, or by establishing a broadcast service, addressing...

This paper presents an image, then a video, com-pression scheme based on a restoration process applied to a trans-form domain. Most of the method relies on the ability to suppress, then automatically restore some transformed coefficients in a coding scheme. We use a total variation (TV) minimization model in order to voluntarily predict canceled co...

Two way relay channel (TWRC) is being proposed as a competitive strategy for data transmission in cooperative networks. The capacity region of this model has been recently extensively investigated and achievable bounds are derived based on the cut-set theorem and decode and forward relaying strategy. However, capacity limits that have been derived...

This paper analysis the problem of constellation shaping for degraded broadcast channels using a finite dimension con-stellation, where a single source communicates simultane-ously with two receivers. We are interested in a particu-lar situation where the private message to be sent to each user is limited to unity. This corresponds to a very practi...

This paper combines joint protocol-channel (JPC) and joint source-channel (JSC) decoding techniques within a receiver in the context of wireless data transmission. It assumes that demodulation and channel decoding at physical (PHY) layer can provide soft information about the transmitted bits. At each layer of the protocol stack, JPC decoding allow...

This paper combines joint protocol-channel (JPC) and joint source-channel (JSC) decoding techniques within a receiver in the context of wireless data transmission. It assumes that demodulation and channel decoding at physical (PHY) layer can provide soft information about the transmitted bits. At each layer of the protocol stack, JPC decoding allow...

Frame Synchronization (FS) is required in several communication standards in order to recover the individual frames that have been aggregated in a burst. This paper proposes a low-delay and reduced-complexity Sliding Trellis (ST)-based FS technique, compared to our previously proposed trellis-based FS method. Each burst is divided into overlapping...

Iterative decoding is considered in this paper from an optimization point of view. Starting from the optimal maximum likelihood decoding, a (tractable) approximate criterion is derived. The global maximum of the approximate criterion is analyzed: the maximum likelihood solution can be retrieved from the approximate criterion in some particular case...

In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading over all the wireless links, including the source-to-relay channels. Our contribution is twofold: i) first, we develop the quasi-optimal joint network and channel decoder...