Related papers: Sparse Grassmannian Design for Noncoherent Codes v…
We propose a sparse Grassmannian design for precoding codebooks. Due to their sparse structure, our proposed codebooks achieve low peak-to-average power ratio (PAPR), low complexity of precoder multiplication, and low storage cost, while…
This work presents a novel structured family of Grassmannian constellations for multiple-input multiple-output (MIMO) noncoherent communications over Rayleigh block-fading channels, where neither the transmitter nor the receiver has channel…
We propose a new covert communication scheme that operates without pre-sharing side information and channel estimation, utilizing a Gaussian-distributed Grassmann constellation for noncoherent detection. By designing constant-amplitude…
In this letter, we propose an autoencoder (AE) for designing Grassmannian constellations in noncoherent (NC) multiple-input multiple-output (MIMO) systems. To guarantee the properties of Grassmannian constellations, the proposed AE…
This paper proposes a noncoherent low probability of detection (LPD) communication system based on direct sequence spread spectrum (DSSS) and Grassmannian signaling. Grassmannian constellations enhance covertness because they tend to follow…
In this paper, we propose a practical structured constellation for non-coherent communication with a single transmit antenna over Rayleigh flat and block fading channel without instantaneous channel state information. The constellation…
We study a new class of codes for Gaussian multi-terminal source and channel coding. These codes are designed using the statistical framework of high-dimensional linear regression and are called Sparse Superposition or Sparse Regression…
We consider the design of multiuser constellations for a multiple access channel (MAC) with K users, with M antennas each, that transmit simultaneously to a receiver equipped with N antennas through a Rayleigh block-fading channel, when no…
Motivated by hyper-reliable low-latency communication in 6G, we consider error control coding for short block lengths in multi-antenna fading channels. In general, the channel fading coefficients are unknown at both the transmitter and…
Sparse regression codes (SPARCs) are a class of codes that encode information through the superposition of columns of a randomised coding matrix. The combination with an outer non-binary low density parity check (NB-LDPC) code was recently…
Sparse superposition codes were originally proposed as a capacity-achieving communication scheme over the gaussian channel, whose coding matrices were made of i.i.d. gaussian entries.We extend this coding scheme to more generic ensembles of…
Sparsity-based representations have recently led to notable results in various visual recognition tasks. In a separate line of research, Riemannian manifolds have been shown useful for dealing with features and models that do not lie in…
Sparse superposition codes, or sparse regression codes, constitute a new class of codes which was first introduced for communication over the additive white Gaussian noise (AWGN) channel. It has been shown that such codes are…
This paper considers the problem of code design for a channel where communications and radar systems coexist, modeled as having both Additive White Gaussian Noise (AWGN) and Additive Radar Interference (ARI). The issue of how to adapt or…
In this paper, we propose a new structured Grassmannian constellation for noncoherent communications over single-input multiple-output (SIMO) Rayleigh block-fading channels. The constellation, which we call Grass-Lattice, is based on a…
We recently proved threshold saturation for spatially coupled sparse superposition codes on the additive white Gaussian noise channel. Here we generalize our analysis to a much broader setting. We show for any memoryless channel that…
We propose a novel, Gaussian signaling mechanism for low probability of detection (LPD) communication systems with either single or multiple antennas. The new scheme is designed to allow the noncoherent detection of Gaussian-distributed…
We provide a novel framework to study subspace codes for non-coherent communications in wireless networks. To this end, an analog operator channel is defined with inputs and outputs being subspaces of $\mathbb{C}^n$. Then a certain distance…
We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both…
The problem of sparse array design for dual-function radar-communications is investigated. Our goal is to design a sparse array which can simultaneously shape desired beam responses and serve multiple downlink users with the required…