This study focuses on (traditional and unsourced) multiple-access
commun...
We propose a new method for separating superimposed sources using
diffus...
A bilateral (i.e., upper and lower) bound on the mean-square error under...
In this work we demonstrate how a lack of synchronization can in fact be...
We study the single-channel source separation problem involving orthogon...
We propose a numerically efficient method for evaluating the random-codi...
We present finite-blocklength achievability bounds for the unsourced
A-c...
We study the potential of data-driven deep learning methods for separati...
We study the problem of single-channel source separation (SCSS), and foc...
We present a general framework for the characterization of the packet er...
To account for the massive uncoordinated random access scenario, which i...
We consider a communication problem in which the receiver must first det...
In this paper, we adapt to cell-free Massive MIMO (multiple-input
multip...
We extend the seminal work by Polyanskiy (2017) on massive uncoordinated...
The fast adoption of Massive MIMO for high-throughput communications was...
We consider the transmission of short packets over a bidirectional
commu...
This paper presents saddlepoint approximations of state-of-the-art conve...