collaborators

7 papers

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…