52 citations · 178 across the 19 of their papers we have counts for
13 papers · 1 filter
Coded Orthogonal Modulation for the Multi-Antenna Multiple-Access Channel
Alexander Fengler, Alejandro Lancho, Yury Polyanskiy
This study focuses on (traditional and unsourced) multiple-access communication over a single transmit and multiple () receive antennas. We assume full or partial channel state…
On the Advantages of Asynchrony in the Unsourced MAC
Alexander Fengler, Alejandro Lancho, Krishna Narayanan +1
In this work we demonstrate how a lack of synchronization can in fact be advantageous in the problem of random access. Specifically, we consider a multiple-access problem over a fr…
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…
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…
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…
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…
On Joint Detection and Decoding in Short-Packet Communications
Alejandro Lancho, Johan Östman, Giuseppe Durisi
We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present…
Cell-free Massive MIMO with Short Packets
Alejandro Lancho, Giuseppe Durisi, Luca Sanguinetti
In this paper, we adapt to cell-free Massive MIMO (multiple-input multiple-output) the finite-blocklength framework introduced by Östman et al. (2020) for the characterization of t…
Massive Uncoordinated Access With Random User Activity
Khac-Hoang Ngo, Alejandro Lancho, Giuseppe Durisi +1
We extend the seminal work by Polyanskiy (2017) on massive uncoordinated access to the case where the number of active users is random and unknown a priori. We define a random-acce…
URLLC with Massive MIMO: Analysis and Design at Finite Blocklength
Johan Östman, Alejandro Lancho, Giuseppe Durisi +1
The fast adoption of Massive MIMO for high-throughput communications was enabled by many research contributions mostly relying on infinite-blocklength information-theoretic bounds.…
Short-Packet Transmission over a Bidirectional Massive MIMO link
Johan Östman, Alejandro Lancho, Giuseppe Durisi
We consider the transmission of short packets over a bidirectional communication link where multiple devices, e.g., sensors and actuators, exchange small-data payloads with a base…
Saddlepoint Approximations for Short-Packet Wireless Communications
Alejandro Lancho, Jöhan Ostman, Giuseppe Durisi +2
In recent years, the derivation of nonasymptotic converse and achievability bounds on the maximum coding rate as a function of the error probability and blocklength has gained atte…
On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength
Alejandro Lancho, Tobias Koch, Giuseppe Durisi
This paper concerns the maximum coding rate at which data can be transmitted over a noncoherent, single-antenna, Rayleigh block-fading channel using an error-correcting code of a g…