Reconstruction of Multi-user Binary Subspace Chirps

05/16/2020
by   Tefjol Pllaha, et al.
0

We consider codebooks of Complex Grassmannian Lines consisting of Binary Subspace Chirps (BSSCs) in N = 2^m 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 on-off 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/24/2021

Binary Subspace Chirps

We describe in details the interplay between binary symplectic geometry ...
research
04/06/2018

Binary Subspace Codes in Small Ambient Spaces

Codes in finite projective spaces equipped with the subspace distance ha...
research
10/10/2009

Microstructure reconstruction using entropic descriptors

A multi-scale approach to the inverse reconstruction of a pattern's micr...
research
05/21/2022

A graphical representation of binary linear codes

A binary [n,k]-linear code 𝒞 is a k-dimensional subspace of 𝔽_2^n. For x...
research
07/23/2014

Subspace Learning From Bits

Networked sensing, where the goal is to perform complex inference using ...
research
05/05/2023

On MSR Subspace Families of Lines

A minimum storage regenerating (MSR) subspace family of 𝔽_q^2m is a set ...
research
10/24/2022

Different Tunes Played with Equal Skill: Exploring a Unified Optimization Subspace for Delta Tuning

Delta tuning (DET, also known as parameter-efficient tuning) is deemed a...

Please sign up or login with your details

Forgot password? Click here to reset