Khac-Hoang Ngo
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
Research Subjects
Khac-Hoang Ngo has a total of 41 co-authors. Here are the top co-authors by number of shared publications:
- Giuseppe Durisi
Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden
6 shared publications - Sheng Yang
Laboratory of Signals and Systems, Centrale-Suplec, CNRS, Universit Paris-Sud, Gif-sur-Yvette, France
5 shared publications - Alexandre Graelli Amat
Department of Electrical Engineering, Chalmers University of Technology, Gothenburg, Sweden
4 shared publications - Maxime Guillaud
INSA Lyon, CITI, UR,3720
4 shared publications - Alexis Decurninge
Mathematical and Algorithmic Sciences Laboratory, Paris Research Center, Huawei Technologies, 92100 Boulogne-Billancourt, France
3 shared publications - Beatriz Soret
Telecommunications Research Institute University of Málaga Málaga Spain
2 shared publications
Latest Publications
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 17463-17478
Distributed MIMO With Over-the-Air Phase Calibration Integrated Into the TDD Flow
Reciprocity-based, joint coherent downlink beamforming from multiple access points (APs) in distributed multiple-input multiple-output (MIMO) with independent local oscillators (LOs) requires the APs to be periodically phase-calibrated (a.k.a. phase-synchronized or phase-aligned). Such phase calibration can be accomplished by bidirectional over-the-air measurements between the APs. In this paper, we show how such over-the-air measurements can be integrated into the time-division duplexing (TDD) flow by appropriately shifting the uplink/downlink switching points of the TDD slot structure, creating short time segments during which APs can measure on one another. We also show how this technique scales to large networks. Furthermore, we analytically characterize the tradeoff between the amount of resources spent on calibration measurements and the resulting spectral efficiency of the system, when conjugate beamforming or zero-forcing beamforming is used. The results demonstrate the feasibility of distributed MIMO with phase-calibration through over-the-air inter-AP measurements integrated into the TDD flow, and the advantage of this design over schemes with dedicated calibration slots.
- 22 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25 (15361276) , 17463-17478
Distributed MIMO With Over-the-Air Phase Calibration Integrated Into the TDD Flow
Reciprocity-based, joint coherent downlink beamforming from multiple access points (APs) in distributed multiple-input multiple-output (MIMO) with independent local oscillators (LOs) requires the APs to be periodically phase-calibrated (a.k.a. phase-synchronized or phase-aligned). Such phase calibration can be accomplished by bidirectional over-the-air measurements between the APs. In this paper, we show how such over-the-air measurements can be integrated into the time-division duplexing (TDD) flow by appropriately shifting the uplink/downlink switching points of the TDD slot structure, creating short time segments during which APs can measure on one another. We also show how this technique scales to large networks. Furthermore, we analytically characterize the tradeoff between the amount of resources spent on calibration measurements and the resulting spectral efficiency of the system, when conjugate beamforming or zero-forcing beamforming is used. The results demonstrate the feasibility of distributed MIMO with phase-calibration through over-the-air inter-AP measurements integrated into the TDD flow, and the advantage of this design over schemes with dedicated calibration slots.
- 4 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Non-coherent wireless communications : fundamental limits and system design
Communications sans fil non-cohérentes : limites fondamentales et conception du système: Dans les communications sans fil sur des canaux à évanouissement, en particulier à antennes multiples, la connaissance instantanée des coefficients de canal, appelés informations d’état de canal (CSI), est essentielle car elle permet d’adapter la transmission et la réception aux conditions actuelles du canal. La communication avec CSI a priori au niveau du récepteur est dite cohérente. En pratique, cependant, le CSI n’est pas disponible avant la communication et doit être estimé à un coût qui ne doit pas être ignoré, en particulier dans un environnement hautement mobile. Ainsi, la communication sans CSI a priori, également appelée communication noncohérente, est un cadre plus pratique et général. Cette thèse contribue à la compréhension des limites théoriques des communications noncohérentes, ainsi qu’à la conception d’un système de communication pratique noncohérent à évanouissement par bloc. Nous considérons trois scénarios: le canal point à point (P2P), le canal à accès multiple (MAC) et le canal de diffusion (BC).Dans la première partie, nous étudions les limites fondamentales des communications noncohérentes en termes de débit de données et de degrés de liberté (DoF) réalisables. Nous considérons un évanouissement par bloc générique dans lequel le canal a une entropie différentielle finie et un second moment fini. Nous établissons d’abord le DoF optimal pour le canal P2P noncohérent à entrées multiples et sorties multiples (MIMO) en utilisant l’approche de la dualité pour borner les informations mutuelles. Deuxièmement, en utilisant une approche de dualité similaire, nous dérivons la région de DoF optimale pour le MAC SIMO à deux utilisateurs, qui peut être obtenue par partage de temps entre des schémas à pilotes simples. Troisième, nous dérivons les régions débit et DoF réalisable pour le BC MIMO noncohérent avec un évanouissement spatialement corrélé en exploitant la diversité de corrélation de transmission, qui est la différence entre la corrélation subie par différents utilisateurs. Ce faisant, nous concevons soigneusement des schémas de transmission basés sur des pilotes et sur le partage de débit, la superposition de produits et une combinaison de ceux-ci pour transmettre efficacement des signaux dans les parties communes et mutuellement exclusives des sous-espaces de corrélation. Dans la deuxième partie, nous concevons la constellation et les schémas de détection efficaces pour les communications noncohérentes sur le canal d’évanouissement de type Rayleigh par bloc. Premièrement, nous proposons une constellation Grassmannienne structurée pour le canal P2P SIMO qui est simple à générer, a une efficacité d’empilement élevée, admet un étiquetage binaire simple mais efficace et permet une détection efficace douce et dure. Deuxièmement, nous étudions la conception de constellation conjointe pour le MAC MIMO. Nous introduisons des critères de conception simples et efficaces afin de minimiser l’erreur de détection conjointe et proposons quelques constructions de constellation simples. Troisièmement, nous proposons un schéma de détection souple multi-utilisateurs noncohérent pour le MAC SIMO à l’évanouissement de Rayleigh corrélé spatialement basé sur l’inférence approximative par propagation d’espérance. Ce schéma présente une complexité polynomiale dans la dimension du canal tout en produisant des marginaux postérieurs approximatifs par utilisateur précis conduisant à des performances d’erreur quasi-optimales.
- 4 April 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Non-coherent wireless communications : fundamental limits and system design
Communications sans fil non-cohérentes : limites fondamentales et conception du système: Dans les communications sans fil sur des canaux à évanouissement, en particulier à antennes multiples, la connaissance instantanée des coefficients de canal, appelés informations d’état de canal (CSI), est essentielle car elle permet d’adapter la transmission et la réception aux conditions actuelles du canal. La communication avec CSI a priori au niveau du récepteur est dite cohérente. En pratique, cependant, le CSI n’est pas disponible avant la communication et doit être estimé à un coût qui ne doit pas être ignoré, en particulier dans un environnement hautement mobile. Ainsi, la communication sans CSI a priori, également appelée communication noncohérente, est un cadre plus pratique et général. Cette thèse contribue à la compréhension des limites théoriques des communications noncohérentes, ainsi qu’à la conception d’un système de communication pratique noncohérent à évanouissement par bloc. Nous considérons trois scénarios: le canal point à point (P2P), le canal à accès multiple (MAC) et le canal de diffusion (BC).Dans la première partie, nous étudions les limites fondamentales des communications noncohérentes en termes de débit de données et de degrés de liberté (DoF) réalisables. Nous considérons un évanouissement par bloc générique dans lequel le canal a une entropie différentielle finie et un second moment fini. Nous établissons d’abord le DoF optimal pour le canal P2P noncohérent à entrées multiples et sorties multiples (MIMO) en utilisant l’approche de la dualité pour borner les informations mutuelles. Deuxièmement, en utilisant une approche de dualité similaire, nous dérivons la région de DoF optimale pour le MAC SIMO à deux utilisateurs, qui peut être obtenue par partage de temps entre des schémas à pilotes simples. Troisième, nous dérivons les régions débit et DoF réalisable pour le BC MIMO noncohérent avec un évanouissement spatialement corrélé en exploitant la diversité de corrélation de transmission, qui est la différence entre la corrélation subie par différents utilisateurs. Ce faisant, nous concevons soigneusement des schémas de transmission basés sur des pilotes et sur le partage de débit, la superposition de produits et une combinaison de ceux-ci pour transmettre efficacement des signaux dans les parties communes et mutuellement exclusives des sous-espaces de corrélation. Dans la deuxième partie, nous concevons la constellation et les schémas de détection efficaces pour les communications noncohérentes sur le canal d’évanouissement de type Rayleigh par bloc. Premièrement, nous proposons une constellation Grassmannienne structurée pour le canal P2P SIMO qui est simple à générer, a une efficacité d’empilement élevée, admet un étiquetage binaire simple mais efficace et permet une détection efficace douce et dure. Deuxièmement, nous étudions la conception de constellation conjointe pour le MAC MIMO. Nous introduisons des critères de conception simples et efficaces afin de minimiser l’erreur de détection conjointe et proposons quelques constructions de constellation simples. Troisièmement, nous proposons un schéma de détection souple multi-utilisateurs noncohérent pour le MAC SIMO à l’évanouissement de Rayleigh corrélé spatialement basé sur l’inférence approximative par propagation d’espérance. Ce schéma présente une complexité polynomiale dans la dimension du canal tout en produisant des marginaux postérieurs approximatifs par utilisateur précis conduisant à des performances d’erreur quasi-optimales.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 22339-22353
Type-Based Unsourced Multiple Access Over Fading Channels in Distributed MIMO With Application to Multi-Target Localization
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 25, 22339-22353
Open AccessType-Based Unsourced Multiple Access Over Fading Channels in Distributed MIMO With Application to Multi-Target Localization
- Open Access
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 381-401
Noncoherent MIMO Communications: Theoretical Foundation, Design Approaches, and Future Challenges
Noncoherent communication is a promising paradigm for future wireless systems where acquiring accurate channel state information (CSI) is challenging or infeasible. It provides methods to bypass the need for explicit channel estimation in practical scenarios such as high-mobility networks, massive distributed antenna arrays, and energy-constrained Internet-of-Things devices. This survey provides a comprehensive overview of noncoherent communication strategies in multiple-input multiple-output (MIMO) systems. We classify noncoherent communication schemes into three main approaches where CSI-free signal recovery is based on subspace detection (i.e., Grassmannian signaling), differential detection, and energy detection. For each approach, we review the theoretical foundation and design methodologies. We also provide comparative insights into their suitability across different channel models and system constraints, highlighting application scenarios where noncoherent methods offer performance and scalability advantages. Furthermore, we discuss practical considerations of noncoherent communication, including compatibility with orthogonal frequency division multiplexing (OFDM), resilience to hardware impairments, and scalability with the number of users. Finally, we provide an outlook on future challenges and research directions in designing robust and efficient noncoherent systems for next-generation wireless networks.
- 26 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 7, 381-401
Open AccessNoncoherent MIMO Communications: Theoretical Foundation, Design Approaches, and Future Challenges
Noncoherent communication is a promising paradigm for future wireless systems where acquiring accurate channel state information (CSI) is challenging or infeasible. It provides methods to bypass the need for explicit channel estimation in practical scenarios such as high-mobility networks, massive distributed antenna arrays, and energy-constrained Internet-of-Things devices. This survey provides a comprehensive overview of noncoherent communication strategies in multiple-input multiple-output (MIMO) systems. We classify noncoherent communication schemes into three main approaches where CSI-free signal recovery is based on subspace detection (i.e., Grassmannian signaling), differential detection, and energy detection. For each approach, we review the theoretical foundation and design methodologies. We also provide comparative insights into their suitability across different channel models and system constraints, highlighting application scenarios where noncoherent methods offer performance and scalability advantages. Furthermore, we discuss practical considerations of noncoherent communication, including compatibility with orthogonal frequency division multiplexing (OFDM), resilience to hardware impairments, and scalability with the number of users. Finally, we provide an outlook on future challenges and research directions in designing robust and efficient noncoherent systems for next-generation wireless networks.
- 5 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (9) , 7288-7303
Timely Status Updates in Slotted ALOHA Networks With Energy Harvesting
We investigate the age of information (AoI) in a scenario where energy-harvesting devices send status updates to a gateway following the slotted ALOHA protocol and receive no feedback. We let the devices adjust the transmission probabilities based on their current battery level. Using a Markovian approach, we derive analytically the average AoI. We further provide an approximate analysis for accurate and easy-to-compute approximations of both the average AoI and the age-violation probability (AVP), i.e., the probability that the AoI exceeds a given threshold. We also analyze the average throughput. Via numerical results, we investigate two baseline strategies: transmit a new update whenever possible to exploit every opportunity to reduce the AoI, and transmit only when sufficient energy is available to increase the chance of successful decoding. The two strategies are beneficial for low and high update-generation rates, respectively. We show that an optimized policy that balances the two strategies outperforms them significantly in terms of both AoI metrics and throughput. Finally, we show the benefit of decoding multiple packets in a slot using successive interference cancellation and adapting the transmission probability based on both the current battery level and the time elapsed since the last transmission.
- 5 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (9) , 7288-7303
Timely Status Updates in Slotted ALOHA Networks With Energy Harvesting
We investigate the age of information (AoI) in a scenario where energy-harvesting devices send status updates to a gateway following the slotted ALOHA protocol and receive no feedback. We let the devices adjust the transmission probabilities based on their current battery level. Using a Markovian approach, we derive analytically the average AoI. We further provide an approximate analysis for accurate and easy-to-compute approximations of both the average AoI and the age-violation probability (AVP), i.e., the probability that the AoI exceeds a given threshold. We also analyze the average throughput. Via numerical results, we investigate two baseline strategies: transmit a new update whenever possible to exploit every opportunity to reduce the AoI, and transmit only when sufficient energy is available to increase the chance of successful decoding. The two strategies are beneficial for low and high update-generation rates, respectively. We show that an optimized policy that balances the two strategies outperforms them significantly in terms of both AoI metrics and throughput. Finally, we show the benefit of decoding multiple packets in a slot using successive interference cancellation and adapting the transmission probability based on both the current battery level and the time elapsed since the last transmission.
- 22 August 2024
- Published by Springer Nature
- p. 180-198
Secure Aggregation Is Not Private Against Membership Inference Attacks
- 22 August 2024
- Published by Springer Nature
- p. 180-198
Secure Aggregation Is Not Private Against Membership Inference Attacks
- 19 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (2) , 907-923
Unsourced Multiple Access With Common Alarm Messages: Network Slicing for Massive and Critical IoT
We investigate the coexistence of massive and critical Internet of Things (IoT) services in the context of the unsourced multiple access (UMA) framework introduced by Polyanskiy (2017), where all users employ a common codebook and the receiver returns an unordered list of decoded codewords. This setup is suitably modified to introduce heterogeneous traffic. Specifically, to model the massive IoT service, we assume that a standard message originates independently from each IoT device as in the standard UMA setup. To model the critical IoT service, we assume the generation of alarm messages that are common for all devices. This setup requires a significant redefinition of the error events, i.e., misdetections and false positives. We further assume that the number of active users in each transmission attempt is random and unknown. We derive a random-coding achievability bound on the misdetection and false positive probabilities of both standard and alarm messages on the Gaussian multiple access channel. Using our bound, we demonstrate that orthogonal network slicing enables massive and critical IoT to coexist under the requirement of high energy efficiency. On the contrary, we show that nonorthogonal network slicing is energy inefficient due to the residual interference from the alarm signal when decoding the standard messages.
- 19 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 72 (2) , 907-923
Unsourced Multiple Access With Common Alarm Messages: Network Slicing for Massive and Critical IoT
We investigate the coexistence of massive and critical Internet of Things (IoT) services in the context of the unsourced multiple access (UMA) framework introduced by Polyanskiy (2017), where all users employ a common codebook and the receiver returns an unordered list of decoded codewords. This setup is suitably modified to introduce heterogeneous traffic. Specifically, to model the massive IoT service, we assume that a standard message originates independently from each IoT device as in the standard UMA setup. To model the critical IoT service, we assume the generation of alarm messages that are common for all devices. This setup requires a significant redefinition of the error events, i.e., misdetections and false positives. We further assume that the number of active users in each transmission attempt is random and unknown. We derive a random-coding achievability bound on the misdetection and false positive probabilities of both standard and alarm messages on the Gaussian multiple access channel. Using our bound, we demonstrate that orthogonal network slicing enables massive and critical IoT to coexist under the requirement of high energy efficiency. On the contrary, we show that nonorthogonal network slicing is energy inefficient due to the residual interference from the alarm signal when decoding the standard messages.
- Open Access
Unsourced Multiple Access with Common Alarm Messages: Network Slicing for Massive and Critical IoT
We investigate the coexistence of massive and critical Internet of Things (IoT) services in the context of the unsourced multiple access (UMA) framework introduced by Polyanskiy (2017), where all users employ a common codebook and the receiver returns an unordered list of decoded codewords. This setup is suitably modified to introduce heterogeneous traffic. Specifically, to model the massive IoT service, a standard message originates independently from each IoT device as in the standard UMA setup. To model the critical IoT service, we assume the generation of alarm messages that are common for all devices. This setup requires a significant redefinition of the error events, i.e., misdetections and false positives. We further assume that the number of active users in each transmission attempt is random and unknown. We derive a random-coding achievability bound on the misdetection and false positive probabilities of both standard and alarm messages on the Gaussian multiple access channel. Using our bound, we demonstrate that orthogonal network slicing enables massive and critical IoT to coexist under the requirement of high energy efficiency. On the contrary, we show that nonorthogonal network slicing is energy inefficient due to the residual interference from the alarm signal when decoding the standard messages.
Open AccessUnsourced Multiple Access with Common Alarm Messages: Network Slicing for Massive and Critical IoT
We investigate the coexistence of massive and critical Internet of Things (IoT) services in the context of the unsourced multiple access (UMA) framework introduced by Polyanskiy (2017), where all users employ a common codebook and the receiver returns an unordered list of decoded codewords. This setup is suitably modified to introduce heterogeneous traffic. Specifically, to model the massive IoT service, a standard message originates independently from each IoT device as in the standard UMA setup. To model the critical IoT service, we assume the generation of alarm messages that are common for all devices. This setup requires a significant redefinition of the error events, i.e., misdetections and false positives. We further assume that the number of active users in each transmission attempt is random and unknown. We derive a random-coding achievability bound on the misdetection and false positive probabilities of both standard and alarm messages on the Gaussian multiple access channel. Using our bound, we demonstrate that orthogonal network slicing enables massive and critical IoT to coexist under the requirement of high energy efficiency. On the contrary, we show that nonorthogonal network slicing is energy inefficient due to the residual interference from the alarm signal when decoding the standard messages.
- Open Access
Joint Communications and Sensing Design for Multi-Carrier MIMO Systems
In conventional joint communications and sensing (JCAS) designs for multi-carrier multiple-input multiple-output (MIMO) systems, the dual-functional waveforms are often optimized for the whole frequency band, resulting in limited communications--sensing performance tradeoff. To overcome the limitation, we propose employing a subset of subcarriers for JCAS, while the communications function is performed over all the subcarriers. This offers more degrees of freedom to enhance the communications performance under a given sensing accuracy. We first formulate the rate maximization under the sensing accuracy constraint to optimize the beamformers and JCAS subcarriers. The problem is solved via Riemannian manifold optimization and closed-form solutions. Numerical results for an 8x4 MIMO system with 64 subcarriers show that compared to the conventional subcarrier sharing scheme, the proposed scheme employing 16 JCAS subcarriers offers 60% improvement in the achievable communications rate at the signal-to-noise ratio of 10 dB. Meanwhile, this scheme generates the sensing beampattern with the same quality as the conventional JCAS design.
Open AccessJoint Communications and Sensing Design for Multi-Carrier MIMO Systems
In conventional joint communications and sensing (JCAS) designs for multi-carrier multiple-input multiple-output (MIMO) systems, the dual-functional waveforms are often optimized for the whole frequency band, resulting in limited communications--sensing performance tradeoff. To overcome the limitation, we propose employing a subset of subcarriers for JCAS, while the communications function is performed over all the subcarriers. This offers more degrees of freedom to enhance the communications performance under a given sensing accuracy. We first formulate the rate maximization under the sensing accuracy constraint to optimize the beamformers and JCAS subcarriers. The problem is solved via Riemannian manifold optimization and closed-form solutions. Numerical results for an 8x4 MIMO system with 64 subcarriers show that compared to the conventional subcarrier sharing scheme, the proposed scheme employing 16 JCAS subcarriers offers 60% improvement in the achievable communications rate at the signal-to-noise ratio of 10 dB. Meanwhile, this scheme generates the sensing beampattern with the same quality as the conventional JCAS design.
- 24 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (7) , 4537-4558
Unsourced Multiple Access With Random User Activity
To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access, where all users employ a common codebook and the receiver decodes up to a permutation of the messages. In this paper, we extend this seminal work to the case where the number of active users is random and unknown a priori . We define a random-access code accounting for both misdetection (MD) and false alarm (FA), and derive a random-coding achievability bound for the Gaussian multiple access channel. Our bound captures the fundamental trade-off between MD and FA probabilities. It suggests that the lack of knowledge of the number of active users entails a small penalty in energy efficiency when the target MD and FA probabilities are high. However, as the target MD and FA probabilities decrease, the energy efficiency penalty becomes more significant. For example, in a typical IoT scenario with framelength 19200 complex channel uses and 25–300 active users in average, the required energy per bit to achieve both MD and FA probabilities below 10 -1 , predicted by our bound, is only 0.5–0.7 dB higher than that predicted by the bound in Polyanskiy (2017) for a known number of active users. This gap increases to 3–4 dB when the target MD probability and/or FA probability is below 10 -3 . Taking both MD and FA into account, we use our bound to benchmark the energy efficiency of slotted-ALOHA with multi-packet reception, of a decoder that simply treats interference as noise, and of some recently proposed unsourced multiple access schemes. Numerical results suggest that, when the target MD and FA probabilities are high, it is effective to estimate the number of active users, then treat this estimate as the true value, and use a coding scheme that performs well for the case of known number of active users. However, this approach becomes energy inefficient when the requirements on MD and FA probabilities are stringent.
- 24 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 69 (7) , 4537-4558
Unsourced Multiple Access With Random User Activity
To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access, where all users employ a common codebook and the receiver decodes up to a permutation of the messages. In this paper, we extend this seminal work to the case where the number of active users is random and unknown a priori . We define a random-access code accounting for both misdetection (MD) and false alarm (FA), and derive a random-coding achievability bound for the Gaussian multiple access channel. Our bound captures the fundamental trade-off between MD and FA probabilities. It suggests that the lack of knowledge of the number of active users entails a small penalty in energy efficiency when the target MD and FA probabilities are high. However, as the target MD and FA probabilities decrease, the energy efficiency penalty becomes more significant. For example, in a typical IoT scenario with framelength 19200 complex channel uses and 25–300 active users in average, the required energy per bit to achieve both MD and FA probabilities below 10 -1 , predicted by our bound, is only 0.5–0.7 dB higher than that predicted by the bound in Polyanskiy (2017) for a known number of active users. This gap increases to 3–4 dB when the target MD probability and/or FA probability is below 10 -3 . Taking both MD and FA into account, we use our bound to benchmark the energy efficiency of slotted-ALOHA with multi-packet reception, of a decoder that simply treats interference as noise, and of some recently proposed unsourced multiple access schemes. Numerical results suggest that, when the target MD and FA probabilities are high, it is effective to estimate the number of active users, then treat this estimate as the true value, and use a coding scheme that performs well for the case of known number of active users. However, this approach becomes energy inefficient when the requirements on MD and FA probabilities are stringent.