activity
20172026
most citedCell-Free Massive MIMO for URLLC: A Finite-Blocklength Analysis

52 citations · 178 across the 19 of their papers we have counts for

collaborators
Showing 2022Show all

6 papers · 1 filter

cs.IT2022★ 14 cited

Efficient evaluation of the error probability for pilot-assisted URLLC with Massive MIMO

A. Oguz Kislal, Alejandro Lancho, Giuseppe Durisi +1

We propose a numerically efficient method for evaluating the random-coding union bound with parameter on the error probability achievable in the finite-blocklength regime by a…

cs.IT2022

Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing

Alejandro Lancho, Alexander Fengler, Yury Polyanskiy

We present finite-blocklength achievability bounds for the unsourced A-channel. In this multiple-access channel, users noiselessly transmit codewords picked from a common codebook…

eess.SP2022★ 9 cited

Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals

Alejandro Lancho, Amir Weiss, Gary C. F. Lee +4

We study the potential of data-driven deep learning methods for separation of two communication signals from an observation of their mixture. In particular, we assume knowledge on…

eess.SP2022★ 7 cited

Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation

Gary C. F. Lee, Amir Weiss, Alejandro Lancho +4

We study the problem of single-channel source separation (SCSS), and focus on cyclostationary signals, which are particularly suitable in a variety of application domains. Unlike c…

cs.IT2022★ 52 cited

Cell-Free Massive MIMO for URLLC: A Finite-Blocklength Analysis

Alejandro Lancho, Giuseppe Durisi, Luca Sanguinetti

We present a general framework for the characterization of the packet error probability achievable in cell-free Massive multiple-input multiple output (MIMO) architectures deployed…

cs.IT2022

Unsourced Multiple Access With Random User Activity

Khac-Hoang Ngo, Alejandro Lancho, Giuseppe Durisi +1

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…