MGMaxime Guillaud

Maxime Guillaud

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Maxime Guillaud has a total of 102 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Secure Communication in Gaussian Multiple Access Wiretap Channels: A Deep Learning and Friendly Jamming Approach

    by Sankalp, Lata, Gaurang Sondur, Mahendra K. Shukla, Om Jee Pandey, Maxime Guillaud

    The use of deep learning (DL) in communication systems shows great promise, particularly through DL-based physical-layer techniques with autoencoders (AEs) for end-to-end learning. This paper presents an AE-based DL framework to enhance physical-layer security in scenarios where multiple transmitters communicate with the receiver under eavesdropping threats, specifically within a Gaussian multiple-access wiretap channel. A key feature is a friendly jammer that emits a high-power Gaussian signal to disrupt eavesdroppers. The proposed framework is particularly relevant for security-critical applications such as wireless health monitoring systems, where safeguarding sensitive data is paramount. We assess secrecy performance by analyzing the symbol error rate among users in the presence of both an eavesdropper and a jammer. Simulation results show that our DL-based Gaussian jamming strategy significantly improves secrecy performance, effectively safeguarding communications from eavesdropping. This study highlights the potential of DL techniques to enhance communication security in complex multi-user environments.


  • Open Access

    When Random Tensors meet Random Matrices

    by Mohamed El Amine Seddik, Maxime Guillaud, Romain Couillet

    Relying on random matrix theory (RMT), this paper studies asymmetric order-$d$ spiked tensor models with Gaussian noise. Using the variational definition of the singular vectors and values of (Lim, 2005), we show that the analysis of the considered model boils down to the analysis of an equivalent spiked symmetric \textit{block-wise} random matrix, that is constructed from \textit{contractions} of the studied tensor with the singular vectors associated to its best rank-1 approximation. Our approach allows the exact characterization of the almost sure asymptotic singular value and alignments of the corresponding singular vectors with the true spike components, when $\frac{n_i}{\sum_{j=1}^d n_j}\to c_i\in (0, 1)$ with $n_i$'s the tensor dimensions. In contrast to other works that rely mostly on tools from statistical physics to study random tensors, our results rely solely on classical RMT tools such as Stein's lemma. Finally, classical RMT results concerning spiked random matrices are recovered as a particular case.

  • Constant Weight Codes With Gabor Dictionaries and Bayesian Decoding for Massive Random Access

    by Patrick Agostini, Zoran Utkovski, Alexis Decurninge, Maxime Guillaud, Sławomir Stańczak

    This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on Gabor frames. The decoder applies an extension of approximate message passing (AMP) by iteratively exchanging soft information between an AMP module that accounts for the dictionary structure, and a second inference module that utilizes the structure of the involved constant-weight code. We apply the encoding structure to (i) the unsourced random access setting, where all users employ a common dictionary, and (ii) to the “sourced” random access setting with user-specific dictionaries. When applied to a fading scenario, the communication scheme essentially operates non-coherently, as channel state information is required neither at the transmitter nor at the receiver. We observe that in regimes of practical interest, the proposed scheme compares favorably with state-of-the art schemes, in terms of the (per-user) energy-per-bit requirement, as well as the number of active users that can be simultaneously accommodated in the system. Importantly, this is achieved with a considerably smaller size of the transmitted codewords, potentially yielding lower latency and bandwidth occupancy, as well as lower implementation complexity.


  • Joint Constellation Design for Noncoherent MIMO Multiple-Access Channels

    by Khac-Hoang Ngo, Sheng Yang, Maxime Guillaud, Alexis Decurninge

    We consider the joint constellation design problem for the noncoherent multiple-input multiple-output multiple-access channel (MAC). By analyzing the noncoherent maximum-likelihood detection error, we propose novel design criteria so as to minimize the error probability. As a baseline approach, we adapt several existing design criteria for the point-to-point channel to the MAC. Furthermore, we propose new design criteria. Our first proposed design metric is the dominating term in nonasymptotic lower and upper bounds on the pairwise error probability exponent. We give a geometric interpretation of the bound using Riemannian distance in the manifold of Hermitian positive definite matrices. From an analysis of this metric at high signal-to-noise ratio, we obtain further simplified metrics. For any given set of constellation sizes, the proposed metrics can be optimized over the set of constellation symbols. Motivated by the simplified metric, we propose a simple constellation construction consisting in partitioning a single-user constellation. We also provide a generalization of our previously proposed construction based on precoding individual constellations of lower dimensions. For a fixed joint constellation, the design metrics can be further optimized over the per-user transmit power, especially when the users transmit at different rates. Considering unitary space-time modulation, we investigate the option of building each individual constellation as a set of truncated unitary matrices scaled by the respective transmit power. Numerical results show that our proposed metrics are meaningful, and can be used as objectives to generate constellations through numerical optimization that perform better, for the same transmission rate and power constraint, than a common pilot-based scheme and the constellations optimized with existing metrics.


  • Open Access

    How to Identify and Authenticate Users in Massive Unsourced Random Access

    by Radosław Kotaba, Anders E. Kalør, Petar Popovski, Israel Leyva-Mayorga, Beatriz Soret, Maxime Guillaud, Luis G. Ordóñez

    Identification and authentication are two basic functionalities of traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is massive and relatively small packets are transmitted, the overhead of including such field becomes restrictive. In unsourced random access (U-RA), the packets do not include any address field for the user, which maximizes the number of useful bits that are transmitted. However, by definition an U-RA protocol does not provide user identification. This paper presents a scheme that builds upon an underlying U-RA protocol and solves the problem of user identification and authentication. In our scheme, the users generate a message authentication code (MAC) that provides these functionalities without violating the main principle of unsourced random access: the selection of codewords from a common codebook is i.i.d. among all users.

  • How to Identify and Authenticate Users in Massive Unsourced Random Access

    by Radoslaw Kotaba, Anders E. Kalor, Petar Popovski, Israel Leyva-Mayorga, Beatriz Soret, Maxime Guillaud, Luis G. Ordonez

    Identification and authentication are two essential features for traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is massive and relatively small packets are transmitted, the overhead of including such field becomes restrictive. In unsourced random access (U-RA), the packets do not include any address field for the user, which maximizes the number of useful bits that are transmitted. However, by definition an U-RA protocol does not provide user identification. This paper presents a scheme that builds upon an underlying U-RA protocol and solves the problem of user identification and authentication. In our scheme, the users generate a message authentication code (MAC) that provides these functionalities without violating the main principle of unsourced random access: the selection of codewords from a common codebook is i.i.d. among all users.


  • Triplet-Based Wireless Channel Charting: Architecture and Experiments

    by Paul Ferrand, Alexis Decurninge, Luis G. Ordonez, Maxime Guillaud

    Channel charting is a data-driven baseband processing technique consisting in applying self-supervised machine learning techniques to channel state information (CSI), with the objective of reducing the dimension of the data and extracting the fundamental parameters governing its distribution. We introduce a novel channel charting approach based on triplets of samples. The proposed algorithm learns a meaningful similarity metric between CSI samples on the basis of proximity in their respective acquisition times, and simultaneously performs dimensionality reduction. We present an extensive experimental validation of the proposed approach on data obtained from a commercial Massive MIMO system; in particular, we evaluate to which extent the obtained channel chart is similar to the user location information, although it is not supervised by any geographical data. Finally, we propose and evaluate variations in the channel charting process, including the partially supervised case where some labels are available for part of the dataset.


  • Open Access

    On Full-Duplex Radios With Modulo-ADCs

    by Luis G. Ordonez, Paul Ferrand, Melissa Duarte, Maxime Guillaud, Ganghua Yang

    Wireless full-duplex (FD) transceivers have become more commonplace in the recent years, enabled by improvements in hardware as well as in signal processing algorithms dedicated to self-interference (SI) mitigation. A key design target for any FD radio is to limit the analog-to-digital converter (ADC) quantization noise affecting the signal of interest (SoI), which results from the difference in dynamic range between the SI and the SoI at the input of the ADC. Indeed, when using conventional ADCs, since the SI power is much larger than that of the SoI, the SI spans most of the ADC’s dynamic range and the SoI becomes distorted by a large quantization noise. Reducing the power of the SI before the ADC, for example via analog domain SI cancellation, is so far the only means to mitigate this undesired effect. In this paper we consider the use of so-called modulo ADCs as a new tool to reduce the quantization noise that affects the SoI in the presence of SI. We demonstrate theoretically and numerically that by substituting the conventional ADCs with modulo-ADCs, which fold the analog input signal before analog-to-digital conversion, and by using appropriately designed analog gain control and digital-domain SI cancellation, one can reduce the quantization noise that affects the SoI. As such, the work in this paper provides a new technique for counteracting the detrimental effect of SI in analog-to-digital conversion and, thus, provides a new route to be explored in order to enhance the performance of FD radios.


  • Top Cited Papers
    Open Access

    Convergent Communication, Sensing and Localization in 6G Systems: An Overview of Technologies, Opportunities and Challenges

    by Carlos De Lima, Didier Belot, Rafael Berkvens, Andre Bourdoux, Davide Dardari, Maxime Guillaud, Minna Isomursu, Elena-Simona Lohan, Yang Miao, Andre Noll Barreto, et al.

    Herein, we focus on convergent 6G communication, localization and sensing systems by identifying key technology enablers, discussing their underlying challenges, implementation issues, and recommending potential solutions. Moreover, we discuss exciting new opportunities for integrated localization and sensing applications, which will disrupt traditional design principles and revolutionize the way we live, interact with our environment, and do business. Regarding potential enabling technologies, 6G will continue to develop towards even higher frequency ranges, wider bandwidths, and massive antenna arrays. In turn, this will enable sensing solutions with very fine range, Doppler, and angular resolutions, as well as localization to cm-level degree of accuracy. Besides, new materials, device types, and reconfigurable surfaces will allow network operators to reshape and control the electromagnetic response of the environment. At the same time, machine learning and artificial intelligence will leverage the unprecedented availability of data and computing resources to tackle the biggest and hardest problems in wireless communication systems. As a result, 6G will be truly intelligent wireless systems that will provide not only ubiquitous communication but also empower high accuracy localization and high-resolution sensing services. They will become the catalyst for this revolution by bringing about a unique new set of features and service capabilities, where localization and sensing will coexist with communication, continuously sharing the available resources in time, frequency, and space. This work concludes by highlighting foundational research challenges, as well as implications and opportunities related to privacy, security, and trust.