DeepAI AI Chat
Log In Sign Up

Binary Subspace Chirps

by   Tefjol Pllaha, et al.

We describe in details the interplay between binary symplectic geometry and quantum computation, with the ultimate goal of constructing highly structured codebooks. The Binary Chirps (BCs) are Complex Grassmannian Lines in N = 2^m dimensions used in deterministic compressed sensing and random/unsourced multiple access in wireless networks. Their entries are fourth roots of unity and can be described in terms of second order Reed-Muller codes. The Binary Subspace Chirps (BSSCs) are a unique collection of BCs of ranks ranging from r=0 to r = m, embedded in N dimensions according to an on-off pattern determined by a rank r binary subspace. This yields a codebook that is asymptotically 2.38 times larger than the codebook of BCs, has the same minimum chordal distance as the codebook of BCs, and the alphabet is minimally extended from {± 1,± i} to {± 1,± i, 0}. Equivalently, we show that BSSCs are stabilizer states, and we characterize them as columns of a well-controlled collection of Clifford matrices. By construction, the BSSCs inherit all the properties of BCs, which in turn makes them good candidates for a variety of applications. For applications in wireless communication, we use the rich algebraic structure of BSSCs to construct a low complexity decoding algorithm that is reliable against Gaussian noise. In simulations, BSSCs exhibit an error probability comparable or slightly lower than BCs, both for single-user and multi-user transmissions.


page 1

page 2

page 3

page 4


Reconstruction of Multi-user Binary Subspace Chirps

We consider codebooks of Complex Grassmannian Lines consisting of Binary...

Binary Subspace Codes in Small Ambient Spaces

Codes in finite projective spaces equipped with the subspace distance ha...

On Compressed Sensing of Binary Signals for the Unsourced Random Access Channel

Motivated by applications in unsourced random access, this paper develop...

Coded Demixing for Unsourced Random Access

Unsourced random access (URA) is a recently proposed multiple access par...

Abelian Noncyclic Orbit Codes and Multishot Subspace Codes

In this paper we characterize the orbit codes as geometrically uniform c...

Divisible linear rank metric codes

A subspace of matrices over 𝔽_q^e^m× n can be naturally embedded as a su...

Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks

We provide a precise framework to study subspace codes for non-coherent ...