Reconstruction of Multi-user Binary Subspace Chirps

Loading...
Thumbnail Image
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
Conference article in proceedings
Date
2020-06
Major/Subject
Mcode
Degree programme
Language
en
Pages
6
531-536
Series
2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings, IEEE International Symposium on Information Theory
Abstract
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.
Description
Keywords
Other note
Citation
Pllaha, T, Tirkkonen, O & Calderbank, R 2020, Reconstruction of Multi-user Binary Subspace Chirps . in 2020 IEEE International Symposium on Information Theory, ISIT 2020 - Proceedings ., 9174412, IEEE International Symposium on Information Theory, IEEE, pp. 531-536, IEEE International Symposium on Information Theory, Los Angeles, California, United States, 21/07/2020 . https://doi.org/10.1109/ISIT44484.2020.9174412