activity
20232026
most citedExploiting Pilot Mixtures in Coded Random Access

6 citations · 6 across the 9 of their papers we have counts for

collaborators

10 papers

cs.IT2026

Short-Boundary Signaling for Asynchronous Grant-Free Control-to-Control Communications

Massimo Battaglioni, Dania De Crescenzo, Edoardo Carnevali +1

In asynchronous grant-free access, receivers must detect variable-length transmissions and identify their start and end. Existing decoder-aided receivers use start and tail sequenc…

cs.IT2026

A Deep Learning-based Receiver for Asynchronous Grant-Free Random Access in Control-to-Control Networks

Massimo Battaglioni, Edoardo Carnevali, Dania De Crescenzo +3

In this paper, we study grant-free, asynchronous control-to-control (C2C) communications in an indoor scenario with a shared wireless channel. Each communication node transmits com…

eess.SP2026

Complex Approximate Message Passing with Non-separable Denoising

Vishnu Teja Kunde, Alessandro Mirri, Jean-Francois Chamberland +1

Approximate Message Passing (AMP) is a general framework for iterative algorithms, originally developed for compressed sensing and later extended to a wide range of high-dimensiona…

eess.SP2025

Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access

Alessandro Mirri, Vishnu Teja Kunde, Enrico Paolini +1

This article addresses the problem of multiple preamble detection in random access systems based on orthogonal time frequency space (OTFS) signaling. This challenge is formulated a…

eess.SP2025

A Grant-free Coded Random Access Scheme for Near-field Communications

Enrico Testi, Giulia Torcolacci, Nicolò Decarli +2

The industrial Internet of things (IIoT) is revolutionizing industrial processes by facilitating massive machine-type communications among countless interconnected devices. To effi…

eess.SP2025

Zak-OTFS Based Coded Random Access for Uplink mMTC

Alessandro Mirri, Venkatesh Khammammetti, Beyza Dabak +3

This paper proposes a grant-free coded random access (CRA) scheme for uplink massive machine-type communications (mMTC), based on Zak-orthogonal time frequency space (Zak-OTFS) mod…

eess.SP2025

A Neural Network-aided Low Complexity Chase Decoder for URLLC

Enrico Testi, Enrico Paolini

Ultra-reliable low-latency communications (URLLC) demand decoding algorithms that simultaneously offer high reliability and low complexity under stringent latency constraints. Whil…

eess.SP2025

Doppler Estimation and Compensation Techniques in LoRa Direct-to-Satellite Communications

Jamil Farhat, Gianni Pasolini, Enrico Paolini +2

Within the LPWAN framework, the LoRa modulation adopted by LoRaWAN technology has garnered significant interest as a connectivity solution for IoT applications due to its ability t…

eess.SP2024

Blind User Activity Detection for Grant-Free Random Access in Cell-Free mMIMO Networks

Muhammad Usman Khan, Enrico Testi, Marco Chiani +1

Cell-free massive MIMO (CF-mMIMO) networks have recently emerged as a promising solution to tackle the challenges arising from next-generation massive machine-type communications.…

cs.IT2023★ 6 cited

Exploiting Pilot Mixtures in Coded Random Access

Lorenzo Valentini, Elena Bernardi, Enrico Paolini

The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices.…