Technology Category
Cognitive Modeling & Cognitive Systems: Neural Spike CodingSearch and Optimization: Mixed Discrete/Continuous SearchPlanning, Routing, and Scheduling: Optimization of Spatio-temporal Systems
New Insights into Channel vs Subspace Codes for Large-Scale Beamspace MIMO Channel Sensing
🤖 AI Summary
This work addresses the limitations of conventional channel coding in non-adaptive single-RF-chain massive beamspace MIMO systems, where the inability to support noncoherent decoding degrades sensing performance. The authors formulate channel sensing as a noncoherent decoding problem and, for the first time, derive an exact expression for the subspace distance of binary linear codes under BPSK mapping, revealing a fundamental distinction between Hamming and subspace distances. Building on this insight, they propose a beamspace subspace code based on Golomb ruler-inspired sparse antenna selection, integrated with maximum-likelihood angle estimation and convolutional beamforming. This approach achieves hardware- and sampling-efficient operation while preserving theoretical performance guarantees. Results demonstrate that high-Hamming-distance codes without careful design may yield zero subspace distance and thus fail entirely, whereas the proposed method attains near-optimal subspace distance and robust sensing performance.
Technology Category
Application Category
📝 Abstract
This paper provides novel insights into channel and subspace codes in nonadaptive channel sensing with a single RF chain. Observing that this problem naturally maps to a noncoherent decoding problem, we show that the sensing performance of the maximum likelihood (ML) angle estimator, which does not require knowledge of the typically unknown channel coefficient, is governed by two key terms: the minimum subspace distance and beam gain of the used beamformers. We derive an exact expression for the subspace distance of binary linear channel codes mapped to BPSK, which illuminates the relationship between subspace and Hamming distance, used to design subspace and channel codes, respectively. Our result also reveals why good Hamming distance alone is insufficient for sensing, and shows that well-known families of channel codes such as Reed-Muller codes, yield zero subspace distance and thereby poor sensing performance when used naively without proper codebook pruning. Finally, we introduce so-called beamspace subspace codes based on sparse antenna selection patterns (Golomb rulers), which we show provide near-optimal subspace distance. We demonstrate that this property of judiciously designed sparse arrays can be leveraged together with beamforming gain via convolutional beamspaces, enabling hardware- and sample-efficient channel sensing with theoretical guarantees in large-scale multiantenna communications.
Problem
Research questions and friction points this paper is trying to address.
beamspace MIMO
channel sensing
subspace codes
channel codes
nonadaptive sensing
Innovation
Methods, ideas, or system contributions that make the work stand out.
subspace distance
beamspace MIMO
nonadaptive channel sensing
sparse antenna arrays
Golomb rulers
🔎 Similar Papers
No similar papers found.
