Reconstruction of Multi-user Binary Subspace Chirps

Tefjol Pllaha, Olav Tirkkonen, Robert Calderbank

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

8 Citations (Scopus)
132 Downloads (Pure)


We consider codebooks of Complex Grassmannian Lines consisting of Binary Subspace Chirps (BSSCs) in N =2m dimensions. BSSCs are generalizations of Binary Chirps (BCs), their entries are either fourth-roots of unity, or zero. BSSCs consist of a BC in a non-zero subspace, described by an on-off pattern. Exploring the underlying binary symplectic geometry, we provide a unified framework for BSSC reconstruction - both onoff pattern and BC identification are related to stabilizer states of the underlying Heisenberg-Weyl algebra. In a multi-user random access scenario we show feasibility of reliable reconstruction of multiple simultaneously transmitted BSSCs with low complexity.

Original languageEnglish
Title of host publication2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings
Number of pages6
ISBN (Electronic)9781728164328
Publication statusPublished - Jun 2020
MoE publication typeA4 Conference publication
EventIEEE International Symposium on Information Theory - Los Angeles, United States
Duration: 21 Jul 202026 Jul 2020

Publication series

NameIEEE International Symposium on Information Theory
ISSN (Print)2157-8095
ISSN (Electronic)2157-8117


ConferenceIEEE International Symposium on Information Theory
Abbreviated titleISIT
Country/TerritoryUnited States
CityLos Angeles


Dive into the research topics of 'Reconstruction of Multi-user Binary Subspace Chirps'. Together they form a unique fingerprint.

Cite this