Searcharxiv⌕ Search

arXiv subjects

Giuseppe Thadeu Freitas de Abreu

Publications and source records attributed to Giuseppe Thadeu Freitas de Abreu.

At least 91 records · Page 5Linked to original sources

Quantum Manifold Optimization: A Design Framework for Future Communications Systems

Inspired by recent developments in various areas of science relevant to quantum computing, we introduce quantum manifold optimization (QMO) as a promising framework for solving constrained optimization problems in next-generation wireless communication systems. We begin by showing how classical wireless design problems - such as pilot design in cell-free (CF)-massive MIMO (mMIMO), beamformer optimization in gigantic multiple input multiple output (MIMO), and reconfigurable intelligent surface (RIS) phase tuning - naturally reside on structured manifolds like the Stiefel, Grassmannian, and oblique manifolds, with the latter novelly formulated in this work. Then, we demonstrate how these problems can be reformulated as trace-based quantum expectation values over variationally-encoded quantum states. While theoretical in scope, the work lays a foundation for a new class of quantum optimization algorithms with broad application to the design of future beyond-sixth-generation (B6G) systems.

eess.SP↗

Chirp-Permuted AFDM for Quantum-Resilient Physical-Layer Secure Communications

We present a novel physical-layer secure communications scheme based on a chirp-permuted variant of the affine frequency division multiplexing (AFDM) waveform recently proposed for sixth-generation (6G) systems, which ensures that eavesdroppers unaware of the correct chirp-permutation face significant challenges in signal detection, even with perfect channel state information (CSI) and co-location with the legitimate user. The security of the proposed scheme is studied in terms of the complexity required to find the correct permutation via classical and quantum search algorithms, analytically shown to be infeasible in both cases due to the factorially-scaling search space, and the probability of breach under the random-guess approach, also shown to be negligible.

eess.SP↗

Joint Channel, Data, and Radar Parameter Estimation for AFDM Systems in Doubly-Dispersive Channels

We propose new schemes for joint channel and data estimation (JCDE) and radar parameter estimation (RPE) in doubly-dispersive channels, such that integrated sensing and communications (ISAC) is enabled by user equipment (UE) independently performing JCDE, and base stations (BSs) performing RPE. The contributed JCDE and RPE schemes are designed for waveforms known to perform well in doubly-dispersive channels, under a unified model that captures the features of either legacy orthogonal frequency division multiplexing (OFDM), state-of-the-art (SotA) orthogonal time frequency space (OTFS), and next-generation affine frequency division multiplexing (AFDM) systems. The proposed JCDE algorithm is based on a Bayesian parametric bilinear Gaussian belief propagation (PBiGaBP) framework first proposed for OTFS and here shown to apply to all aforementioned waveforms, while the RPE scheme is based on a new probabilistic data association (PDA) approach incorporating a Bernoulli-Gaussian denoising, optimized via expectation maximization (EM). Simulation results demonstrate that JCDE in AFDM systems utilizing a single pilot per block significantly outperforms the SotA alternative even if the latter is granted a substantial power advantage. Similarly, the AFDM-based RPE scheme is found to outperform the OTFS-based approach, as well as the sparse Bayesian learning (SBL) technique, regardless of the waveform used.

eess.SP↗

Post-Quantum Wireless-based Key Encapsulation Mechanism via CRYSTALS-Kyber for Resource-Constrained Devices

We consider the problem of adapting a Post-Quantum cryptosystem to be used in resource-constrained devices, such as those typically used in Device-to-Device and Internet of Things systems. In particular, we propose leveraging the characteristics of wireless communications channels to minimize the complexity of implementation of a Post-Quantum public key encryption scheme, without diminishing its security. To that end, we focus on the adaptation of a well-known cryptosystem, namely CRYSTALS-Kyber, so as to enable its direct integration into the lowest layer of the communication stack, the physical layer, defining two new transport schemes for CRYSTALS-Kyber to be used in Device-to-Device communications, both of which are modeled under a wireless channel subject to Additive White Gaussian Noise, using a 4 Quadrature Amplitude Modulation constellation and a BCH-code to communicate CRYSTALSKyber's polynomial coefficients. Simulation results demonstrate the viability of the adapted Kyber algorithm due to its low key error probability, while maintaining the security reductions of the original Kyber by considering the error distribution imposed by the channel on the cipher.

eess.SP↗

A Robust Routing Protocol for 5G Mesh Networks

We consider a novel routing protocol suitable for ad-hoc networks with dynamically changing topologies, such as DECT 2020 NR (NR+) systems, which often lead to missing links between the nodes and thus, incomplete or inefficient routes. A key point of the proposed protocol is the combination of network discovery and matrix completion techniques, which allow the nodes to establish communication paths efficiently and reliably. Additionally, multihop localization is performed to estimate the location of the nodes without needing to broadcast each node's geographical position, thus preserving privacy during the routing process and enabling nodes in the network to independently find potentially missing paths in a decentralized manner instead of flooding the whole network. Simulation results illustrate the good performance of the proposed technique in terms of the average number of hops of the obtained routes in different scenarios, with different network densities and amounts of incompleteness.

cs.NI↗

Enabling Massive Index Modulation Systems via Combinatorics-Free Detection

Index modulation (IM) is one of the key enabling technologies for beyond fifth generation (B5G) and sixth generation (6G) wireless systems, attracting attention for its inherent energy and spectral efficiency resulting from conveying information through the indexation of the resources utilized in during signal transmission. However, a remaining critical bottleneck for large-scale IM is the consequently infeasible detection complexity of combinatoric order. Therefore in this article, in order to maximally reap the advantages of IM in large scenarios, we propose a novel message passing (MP) decoder designed under the Gaussian belief propagation (GaBP) framework exploiting a novel unit vector decomposition (UVD) of IM signals with purpose-derived novel probability distributions. The proposed method enjoys a low decoding complexity that is independent of previously prohibitive combinatorial factors, while still approach-ing the performance of unfeasible state-of-the-art (SotA) search-based methods. The effectiveness of the proposed approach is demonstrated via complexity analysis and numerical results for the exemplary piloted generalized quadrature spatial modulation (GQSM) systems of truly massive sizes (up to 96 antennas).

eess.SP↗

Belief Propagation-based Rotation and Translation Estimation for Rigid Body Localization

We propose a novel solution to the rigid body localization (RBL) problem, in which the three-dimensional (3D) rotation and translation is estimated by only utilizing the range measurements between the wireless sensors on the rigid body and the anchor sensors. The proposed framework first constructs a linear Gaussian belief propagation (GaBP) algorithm to estimate the absolute sensor positions utilizing the range-based received signal model, which is used for the reconstruction of the RBL transformation model, linearized with a small-angle approximation. In light of the reformulated system, a second bivariate GaBP is designed to directly estimate the 3D rotation angles and translation distances, with an interference cancellation (IC) refinement to improve the angle estimation performance. The effectiveness of the proposed method is verified via numerical simulations, highlighting the superior performance of the proposed method against the state-of-the-art (SotA) techniques for the position, rotation, and translation estimation performance.

eess.SP↗

From OTFS to AFDM: A Comparative Study of Next-Generation Waveforms for ISAC in Doubly-Dispersive Channels

Next-generation wireless systems will offer integrated sensing and communications (ISAC) functionalities not only in order to enable new applications, but also as a means to mitigate challenges such as doubly-dispersive channels, which arise in high mobility scenarios and/or at millimeter-wave (mmWave) and Terahertz (THz) bands. An emerging approach to accomplish these goals is the design of new waveforms, which draw from the inherent relationship between the doubly-dispersive nature of time-variant (TV) channels and the environmental features of scatterers manifested in the form of multi-path delays and Doppler shifts. Examples of such waveforms are the delay-Doppler domain orthogonal time frequency space (OTFS) and the recently proposed chirp domain affine frequency division multiplexing (AFDM), both of which seek to simultaneously combat the detrimental effects of double selectivity and exploit them for the estimation (or sensing) of environmental information. This article aims to provide a consolidated and comprehensive overview of the signal processing techniques required to support reliable ISAC over doubly-dispersive channels in beyond fifth generation (B5G)/sixth generation (6G) systems, with an emphasis on OTFS and AFDM waveforms, as those, together with the traditional orthogonal frequency division multiplexing (OFDM) waveform, suffice to elaborate on the most relevant properties of the trend. The analysis shows that OTFS and AFDM indeed enable significantly improved robustness against inter-carrier interference (ICI) arising from Doppler shifts compared to OFDM. In addition, the inherent delay-Doppler domain orthogonality of the OTFS and AFDM effective channels is found to provide significant advantages for the design and the performance of integrated sensing functionalities.

eess.SP↗

From Theory to Reality: A Design Framework for Integrated Communication and Computing Receivers

We propose a novel flexible and scalable framework to design integrated communication and computing (ICC) -- a.k.a. over-the-air computing (AirComp)-- receivers. To elaborate, while related literature so far has generally focused either on theoretical aspects of ICC or on the design of beamforming (BF) algorithms for AirComp, we propose a framework to design receivers capable of simultaneously detecting communication symbols and extracting the output of the AirComp operation, in a manner that can: a) be systematically generalized to any nomographic function, b) scaled to a massive number of user equipments (UEs) and edge devices (EDs), and c) support the multiple computation streams. For the sake of illustration, we demonstrate the proposed method under a setting consisting of the uplink from multiple single-antenna UEs/EDs simultaneously transmitting communication and computing signals to a single multiple-antenna base station (BS)/access point (AP). The receiver, which seeks to detect all communication symbols and minimize the distortion over the computing signals, requires that only a fraction of the transmit power be allocated to the latter, therefore coming close to the ideal (but unattainable) condition that computing is achieved "for free", without taking resources from the communication system. The design leverages the Gaussian belief propagation (GaBP) framework relying only on element-wise scalar operations, which allows for its use in massive settings, as demonstrated by simulation results incorporating up to 200 antennas and 200 UEs/EDs. They also demonstrate the efficacy of the proposed method under all various loading conditions, with the performance of the scheme approaching fundamental limiting bounds in the under/fully loaded cases.

eess.SP↗

Discrete Aware Matrix Completion via Convexized $\ell_0$-Norm Approximation

We consider a novel algorithm, for the completion of partially observed low-rank matrices in a structured setting where each entry can be chosen from a finite discrete alphabet set, such as in common recommender systems. The proposed low-rank matrix completion (MC) method is an improved variation of state-of-the-art (SotA) discrete aware matrix completion method which we previously proposed, in which discreteness is enforced by an $\ell_0$-norm regularizer, not by replaced with the $\ell_1$-norm, but instead approximated by a continuous and differentiable function normalized via fractional programming (FP) under a proximal gradient (PG) framework. Simulation results demonstrate the superior performance of the new method compared to the SotA techniques as well as the earlier $\ell_1$-norm-based discrete-aware matrix completion approach.

eess.SP↗

Low Complexity Joint Channel Estimation and Data Detection for AFDM Receivers With Oversampling

In this paper, we propose a novel low complexity time domain (TD) oversampling receiver framework under affine frequency division multiplexing (AFDM) waveforms for joint channel estimation and data detection (JCEDD). Leveraging a generalized doubly-dispersive channel model, we first derive the input-output (I/O) relationship for arbitrary waveforms when oversampled in the TD and present the I/O relationship for AFDM as an example. Subsequently, utilizing the multiple sample streams created via the oversampling procedure, we use the parametric bilinear Gaussian belief propagation (PBiGaBP) technique to conduct JCEDD for decoding the transmitted data and estimating the complex channel coefficients. Simulation results verify significant performance improvements both in terms of data decoding and complex channel coefficient estimation with improved robustness against a varying number of pilots over a conventional Nyquist sampling rate receiver.

eess.SP↗

Tone Reservation-Based PAPR Reduction Using Manifold Optimization for OFDM-ISAC Systems

We consider the peak-to-average power ratio (PAPR) reduction challenge of orthogonal frequency division multiplexing (OFDM) systems utilizing tone reservation (TR) under a sensing-enabling constraint, such that the signals placed in the reserved tones (RTs) can be exploited for Integrated Sensing and Communication (ISAC). To that end, the problem is first cast as an unconstrained manifold optimization problem, and then solved via an iterative projected gradient descent algorithm assisted by an approximation of the infinity norm. Simulation results show that the proposed method, while maintaining a level of PAPR reduction similar to state of the art (SotA), not only has lower computational complexity but also outperforms the alternatives in terms of sensing performance.

eess.SP↗

Quantum Speedup of the Dispersion and Codebook Design Problems

We propose new formulations of max-sum and max-min dispersion problems that enable solutions via the Grover adaptive search (GAS) quantum algorithm, offering quadratic speedup. Dispersion problems are combinatorial optimization problems classified as NP-hard, which appear often in coding theory and wireless communications applications involving optimal codebook design. In turn, GAS is a quantum exhaustive search algorithm that can be used to implement full-fledged maximum-likelihood optimal solutions. In conventional naive formulations however, it is typical to rely on a binary vector spaces, resulting in search space sizes prohibitive even for GAS. To circumvent this challenge, we instead formulate the search of optimal dispersion problem over Dicke states, an equal superposition of binary vectors with equal Hamming weights, which significantly reduces the search space leading to a simplification of the quantum circuit via the elimination of penalty terms. Additionally, we propose a method to replace distance coefficients with their ranks, contributing to the reduction of the number of qubits. Our analysis demonstrates that as a result of the proposed techniques a reduction in query complexity compared to the conventional GAS using Hadamard transform is achieved, enhancing the feasibility of the quantum-based solution of the dispersion problem.

quant-ph↗

Blind Bistatic Radar Parameter Estimation for AFDM Systems in Doubly-Dispersive Channels

We propose a novel method for blind bistatic radar parameter estimation (RPE), which enables integrated sensing and communications (ISAC) by allowing passive (receive) base stations (BSs) to extract radar parameters (ranges and velocities of targets), without requiring knowledge of the information sent by an active (transmit) BS to its users. The contributed method is formulated with basis on the covariance of received signals, and under a generalized doubly-dispersive channel model compatible with most of the waveforms typically considered for ISAC, such as orthogonal frequency division multiplexing (OFDM), orthogonal time frequency space (OTFS) and affine frequency division multiplexing (AFDM). The original non-convex problem, which includes an $\ell_0$-norm regularization term in order to mitigate clutter, is solved not by relaxation to an $\ell_1$-norm, but by introducing an arbitrarily-tight approximation then relaxed via fractional programming (FP). Simulation results show that the performance of the proposed method approaches that of an ideal system with perfect knowledge of the transmit signal covariance with an increasing number of transmit frames.

eess.SP↗

Grover Adaptive Search for Maximum Likelihood Detection of Generalized Spatial Modulation

We propose a quantum-assisted solution for the maximum likelihood detection (MLD) of generalized spatial modulation (GSM) signals. Specifically, the MLD of GSM is first formulated as a novel polynomial optimization problem, followed by the application of a quantum algorithm, namely, the Grover adaptive search. The performance in terms of query complexity of the proposed method is evaluated and compared to the classical alternative via a numerical analysis, which reveals that under fault-tolerant quantum computation, the proposed method outperforms the classical solution if the number of data symbols and the constellation size are relatively large.

eess.SP↗

Enabling Next-Generation V2X Perception: Wireless Rigid Body Localization and Tracking

Vehicle-to-everything (V2X) perception describes a suite of technologies used to enable vehicles to perceive their surroundings and communicate with various entities, such as other road users, infrastructure, or the network/cloud. With the development of autonomous driving, V2X perception is becoming increasingly relevant, as can be seen by the tremendous attention recently given to integrated sensing and communication (ISAC) technologies. In this context, rigid body localization (RBL) also emerges as one important technology which enables the estimation of not only target's positions, but also their shape and orientation. This article discusses the need for RBL, its benefits and opportunities, challenges and research directions, as well as its role in the standardization of the sixth-generation (6G) and beyond fifth generation (B5G) applications.

eess.SP↗

PAPR-optimized OFDM Design for Opportunistic Communications and Sensing

We consider the problem of peak-to-average power ratio (PAPR) reduction in orthogonal frequency division multiplexing (OFDM) systems via optimized sparsification of tone reservation (TR). In particular, we propose a novel TR optimization method in which the minimum number of effectively used peak-reserved tones (PRTs) required to satisfy a prescribed PAPR level is found, leaving the remaining PRTs free to be opportunistically utilized by other functionalities, such as joint communication and sensing (JCAS), index modulation (IM), cognitive radio (CR) and others. The proposed method relies on an l0 norm regularization approach to penalize the number of PRTs, leading to a problem convexized via fractional programming (FP), whose solution is shown to ensure that the prescribed PAPR is achieved with high probability with a smaller number of PRTs than state of the art (SotA) methods. The contribution can be seen as a mechanism to enable the opportunistic integration of adjacent functionalities into existing OFDM-based systems.

eess.SP↗

AFDM vs OTFS: A Comparative Study of Promising Waveforms for ISAC in Doubly-Dispersive Channels

**PLEASE FIND THE FULL EXTENDED ARTICLE "From OTFS to AFDM: A Comparative Study of Next-Generation Waveforms for ISAC in Doubly-Dispersive Channels" (Accepted for publication at the IEEE Signal Processing Magazine - Special Issue on Signal Processing for the Integrated Sensing and Communications Revolution)** This white paper aims to briefly describe a proposed article that will provide a thorough comparative study of waveforms designed to exploit the features of doubly-dispersive channels arising in heterogeneous high-mobility scenarios as expected in the beyond fifth generation (B5G) and sixth generation (6G), in relation to their suitability to integrated sensing and communications (ISAC) systems. In particular, the full article will compare the well-established delay-Doppler domain-based orthognal time frequency space (OTFS) and the recently proposed chirp domain-based affine frequency division multiplexing (AFDM) waveforms. Both these waveforms are designed based on a full delay- Doppler representation of the time variant (TV) multipath channel, yielding not only robustness and orthogonality of information symbols in high-mobility scenarios, but also a beneficial implication for environment target detection through the inherent capability of estimating the path delay and Doppler shifts, which are standard radar parameters. These modulation schemes are distinct candidates for ISAC in B5G/6G systems, such that a thorough study of their advantages, shortcomings, implications to signal processing, and performance of communication and sensing functions are well in order. In light of the above, a sample of the intended contribution (Special Issue paper) is provided below.

eess.SP↗