arXiv subjects

Fabio Saggese

Publications and source records attributed to Fabio Saggese.

27 records · Page 2Linked to original sources

arXiv2023

Localization-based OFDM framework for RIS-aided systems

Efficient integration of reconfigurable intelligent surfaces (RISs) into the current wireless network standard is not a trivial task due to the overhead generated by performing channel estimation (CE) and phase-shift optimization. In this paper, we propose a framework enabling the coexistence between orthogonal-frequency division multiplexing (OFDM) and RIS technologies. Instead of wasting communication symbols for the CE and optimization, the proposed framework exploits the localization information obtainable by RIS-aided communications to provide a robust allocation strategy for user multiplexing. The results demonstrate the effectiveness of the proposed approach with respect to CE-based transmission methods.

cs.IT↗

arXiv2023

Hybrid Message Passing Algorithm for Downlink FDD Massive MIMO-OFDM Channel Estimation

The design of message passing (MP) algorithms on factor graphs is an effective manner to implement channel estimation (CE) in wireless communication systems, which performance can be further improved by exploiting prior probability models that accurately match the channel characteristics. In this work, we study the CE problem in a downlink massive multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) system. As the prior probability, we propose the Markov chain two-state Gaussian mixture with large variance differences (TSGM-LVD) model to exploit the structured sparsity in the angle-frequency domain of the channel. Existing single and combined MP rules cannot deal with the message computation of the proposed probability model. To overcome this issue, we present a general method to derive the hybrid message passing (HMP) rule, which allows the calculation of messages described by mixed linear and non-linear functions. Accordingly, we design the HMP-TSGM-LVD algorithm under the structured turbo framework (STF). Simulation results demonstrate that the proposed algorithm converges faster and obtains better and more stable performance than its counterparts. In particular, the gain of the proposed approach is maximum (3 dB) in the high signal-to-noise ratio regime, while benchmark approaches experience oscillating behavior due to the improper prior model characterization.

cs.IT↗

arXiv2023

Randomized Control of Wireless Temporal Coherence via Reconfigurable Intelligent Surface

A reconfigurable intelligent surface (RIS) can shape the wireless propagation channel by inducing controlled phase shift variations to the impinging signals. Multiple works have considered the use of RIS by time-varying configurations of reflection coefficients. In this work we use the RIS to control the channel coherence time and introduce a generalized discrete-time-varying channel model for RIS-aided systems. We characterize the temporal variation of channel correlation by assuming that a configuration of RIS' elements changes at every time step. The analysis converges to a randomized framework to control the channel coherence time by setting the number of RIS' elements and their phase shifts. The main result is a framework for a flexible block-fading model, where the number of samples within a coherence block can be dynamically adapted.

cs.IT↗

arXiv2022

Efficient URLLC with a Reconfigurable Intelligent Surface and Imperfect Device Tracking

The use of Reconfigurable Intelligent Surfaces (RIS) technology to extend coverage and allow for better control of the wireless environment has been proposed in several use cases, including Ultra-Reliable Low-Latency Communications (URLLC), communications. However, the extremely challenging latency constraint makes explicit channel estimation difficult, so positioning information is often used to configure the RIS and illuminate the receiver device. In this work, we analyze the effect of imperfections in the positioning information on the reliability, deriving an upper bound to the outage probability. We then use this bound to perform power control, efficiently finding the minimum power that respects the URLLC constraints under positioning uncertainty. The optimization is conservative, so that all points respect the URLLC constraints, and the bound is relatively tight, with an optimality gap between 1.5 and 4.5~dB.

cs.IT↗

arXiv2022

Power Minimization of Downlink Spectrum Slicing for eMBB and URLLC Users

5G technology allows heterogeneous services to share the wireless spectrum within the same radio access network. In this context, spectrum slicing of the shared radio resources is a critical task to guarantee the performance of each service. We analyze a downlink communication serving two types of traffic: enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC). Due to the nature of low-latency traffic, the base station knows the channel state information (CSI) of the eMBB users while having statistical CSI for the URLLC users. We study the power minimization problem employing orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) schemes. Based on this analysis, we propose a lookup table-based approach and a block coordinated descent (BCD) algorithm. We show that the BCD is optimal for the URLLC power allocation. The numerical results show that NOMA leads to lower power consumption than OMA, except when the average channel gain of the URLLC user is very high. For the latter case, the optimal approach depends on the channel condition of the eMBB user. Even when OMA attains the best performance, the gap with NOMA is negligible, showing the capability of NOMA to reduce power consumption in practically every condition.

cs.IT↗

arXiv2022

A Random Access Protocol for RIS-Aided Wireless Communications

Reconfigurable intelligent surfaces (RISs) are arrays of passive elements that can control the reflection of the incident electromagnetic waves. While RIS are particularly useful to avoid blockages, the protocol aspects for their implementation have been largely overlooked. In this paper, we devise a random access protocol for a RIS-assisted wireless communication setting. Rather than tailoring RIS reflections to meet the positions of users equipment (UEs), our protocol relies on a finite set of RIS configurations designed to cover the area of interest. The protocol is comprised of a downlink training phase followed by an uplink access phase. During these phases, a base station (BS) controls the RIS to sweep over its configurations. The UEs then receive training signals to measure the channel quality with the different RIS configurations and refine their access policies. Numerical results show that our protocol increases the average number of successful access attempts; however, at the expense of increased access delay due to the realization of a training period. Promising results are further observed in scenarios with a high access load.

cs.IT↗

arXiv2021

NOMA Power Minimization of Downlink Spectrum Slicing for eMBB and URLLC Users

Spectrum slicing of the shared radio resources is a critical task in 5G networks with heterogeneous services, through which each service gets performance guarantees. In this paper, we consider a setup in which a Base Station (BS) should serve two types of traffic in the downlink, enhanced mobile broadband (eMBB) and ultra-reliable low-latency communication (URLLC), respectively. Two resource allocation strategies are compared: non-orthogonal multiple access (NOMA) and orthogonal multiple access (OMA). A framework for power minimization is presented, in which the BS knows the channel state information (CSI) of the eMBB users only. Nevertheless, due to the resource sharing, it is shown that this knowledge can be used also to the benefit of the URLLC users. The numerical results show that NOMA leads to a lower power consumption compared to OMA for every simulation parameter under test.

cs.IT↗

arXiv2021

Deep Reinforcement Learning for URLLC data management on top of scheduled eMBB traffic

With the advent of 5G and the research into beyond 5G (B5G) networks, a novel and very relevant research issue is how to manage the coexistence of different types of traffic, each with very stringent but completely different requirements. In this paper we propose a deep reinforcement learning (DRL) algorithm to slice the available physical layer resources between ultra-reliable low-latency communications (URLLC) and enhanced Mobile BroadBand (eMBB) traffic. Specifically, in our setting the time-frequency resource grid is fully occupied by eMBB traffic and we train the DRL agent to employ proximal policy optimization (PPO), a state-of-the-art DRL algorithm, to dynamically allocate the incoming URLLC traffic by puncturing eMBB codewords. Assuming that each eMBB codeword can tolerate a certain limited amount of puncturing beyond which is in outage, we show that the policy devised by the DRL agent never violates the latency requirement of URLLC traffic and, at the same time, manages to keep the number of eMBB codewords in outage at minimum levels, when compared to other state-of-the-art schemes.

eess.SP↗

arXiv2020

Power and subcarrier allocation in multicarrier NOMA-FD systems

In this paper, we study the problem of power and channel allocation for multicarrier non-orthogonal multiple access (NOMA) full duplex (FD) systems. In such a system there are multiple interfering users transmitting over the same channel and the allocation task is a non-convex and extremely challenging problem. The objective of our work is to propose a solution that is close to the theoretic optimum but is of limited complexity. Following a block coordinate descent approach, we propose two algorithms based on the decomposition of the original allocation problem in lower-complexity sub-problems, which can be solved in the Lagrangian dual domain with a great reduction of the computational load. Numerical results show the effectiveness of approach we propose, which outperforms other schemes designed to address NOMA-FD allocation and attains performance similar to the optimal solution with much lower complexity.

eess.SP↗