Khac-Hoang Ngo

Khac-Hoang Ngo

Auto-generated profile, based on publicly available information

Khac-Hoang Ngo

Department of Electrical Engineering, Linkping University, Linkping, Sweden

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
3 November 2017 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KNKhac-Hoang Ngo
Khac-Hoang Ngo
SYSheng Yang
Sheng Yang
MKMari Kobayashi
Mari Kobayashi
We consider the content delivery problem in a fading multi-input single-output channel with cache-aided users. We are interested in the scalability of the equivalent content delivery rate when the number of users, K, is large. Analytical results show that, using coded caching and wireless multicasting, without channel state information at the transmitter (CSIT), linear scaling of the content delivery rate with respect to K can be achieved in some different ways. First, if the multicast transmission spans over L independent sub-channels, e.g., in quasi-static fading if L = 1, and in block fading or multi-carrier systems if L > 1, linear scaling can be obtained when the product of the number of transmit antennas and the number of subchannels scales logarithmically with K. Second, even with a fixed number of antennas, we can achieve the linear scaling with a threshold-based user selection requiring only one-bit feedbacks from the users. When CSIT is available, we propose a mixed strategy that combines spatial multiplexing and multicasting. Numerical results show that, by optimizing the power split between spatial multiplexing and multicasting, we can achieve a significant gain of the content delivery rate with moderate cache size.

20 December 2019 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
KNKhac-Hoang Ngo
Khac-Hoang Ngo
ADAlexis Decurninge
Alexis Decurninge
MGMaxime Guillaud
Maxime Guillaud
SYSheng Yang
Sheng Yang
In this paper, we propose a practical structured constellation for non-coherent communication with a single transmit antenna over Rayleigh flat and block fading channel without instantaneous channel state information. The constellation symbols belong to the Grassmannian of lines and are defined up to a complex scaling. The constellation is generated by partitioning the Grassmannian of lines into a collection of bent hypercubes and defining a mapping onto each of these bent hypercubes such that the resulting symbols are approximately uniformly distributed on the Grassmannian. With a reasonable choice of parameters, this so-called cube-split constellation has higher packing efficiency, represented by the minimum distance, than the existing structured constellations. Furthermore, exploiting the constellation structure, we propose low-complexity greedy symbol decoder and log-likelihood ratio computation, as well as an efficient way to associate it to a multilevel code with multistage decoding. Numerical results show that the performance of the cube-split constellation is close to that of a numerically optimized constellation and better than other structured constellations. It also outperforms a coherent pilot-based scheme in terms of error probability and achievable data rate in the regime of short coherence time and large constellation size.

24 February 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
KNKhac-Hoang Ngo
Khac-Hoang Ngo
ALAlejandro Lancho
Alejandro Lancho
GDGiuseppe Durisi
Giuseppe Durisi
Alexandre Graell i AmatAlexandre Graell i Amat
Alexandre Graell i Amat
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.

12 June 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Open access
KNKhac-Hoang Ngo
Khac-Hoang Ngo
MGMaxime Guillaud
Maxime Guillaud
ADAlexis Decurninge
Alexis Decurninge
SYSheng Yang
Sheng Yang
PSPhilip Schniter
Philip Schniter
We consider the non-coherent single-input multiple-output (SIMO) multiple access channel with general signaling under spatially correlated Rayleigh block fading. We propose a novel soft-output multi-user detector that computes an approximate marginal posterior of each transmitted signal using only the knowledge about the channel distribution. Our detector is based on expectation propagation (EP) approximate inference and has polynomial complexity in the number of users, number of receive antennas and channel coherence time. We also propose two simplifications of this detector with reduced complexity. With Grassmannian signaling, the proposed detectors outperform a state-of-the-art non-coherent detector with projection-based interference mitigation. With pilot-assisted signaling, the EP detector outperforms, in terms of symbol error rate, some conventional coherent pilot-based detectors, including a sphere decoder and a joint channel estimation–data detection scheme. Our EP-based detectors produce accurate approximates of the true posterior leading to high achievable sum-rates. The gains of these detectors are further observed in terms of the bit error rate when using their soft outputs for a turbo channel decoder.

1 August 2022 in IEEE Open Journal of the Communications Society
Verified
Journal Article
Open access
GGGürkan Gür
Gürkan Gür
AKAnshuman Kalla
Anshuman Kalla
CAChamitha de Alwis
Chamitha de Alwis
Quoc-Viet PhamQuoc-Viet Pham
Quoc-Viet Pham
KNKhac-Hoang Ngo
Khac-Hoang Ngo
PPPawani Porambage
Pawani Porambage
Multi-access Edge Computing (MEC) is a novel edge computing paradigm that moves cloudbased processing and storage capabilities closer to mobile users by implementing server resources in the access nodes. MEC helps fulfill the stringent requirements of 5G and beyond networks to offer anytimeanywhere connectivity for many devices with ultra-low delay and huge bandwidths. Information-Centric Networking (ICN) is another prominent network technology that builds on a content-centric network architecture to overcome host-centric routing/operation shortcomings and to realize efficient pervasive and ubiquitous networking. It is envisaged to be employed in Future Internet including Beyond 5G (B5G) networks. The consolidation of ICN with MEC technology offers new opportunities to realize that vision and serve advanced use cases. However, various integration challenges are yet to be addressed to enable the wide-scale co-deployment of ICN with MEC in future networks. In this paper, we discuss and elaborate on ICN MEC integration to provide a comprehensive survey with a forward-looking perspective for B5G networks. In that regard, we deduce lessons learned from related works (for both 5G and B5G networks). We present ongoing standardization activities to highlight practical implications of such efforts. Moreover, we render key B5G use cases and highlight the role for ICN MEC integration for addressing their requirements. Finally, we layout research challenges and identify potential research directions. For this last contribution, we also provide a mapping of the latter to ICN integration challenges and use cases.

7 July 2022 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
KNKhac-Hoang Ngo
Khac-Hoang Ngo
SYSheng Yang
Sheng Yang
MGMaxime Guillaud
Maxime Guillaud
ADAlexis Decurninge
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.