arXiv · 2607.03611
Two-dimensional Fourier compressed sensing under a fixed readout budget per channel
Abstract
Recovering sparse signals from their subsampled Fourier representation is an important problem in communications, radar, and imaging. In this letter, we focus on reconstructing sparse 2D signals (matrices) under the constraint that only a fixed number of entries can be sampled from each channel, e.g., a row or a column in the Fourier domain. For a specified per-channel readout budget, we derive a lower bound on the mutual coherence of the corresponding compressed sensing matrix. We show that our bound is larger than the classical Welch bound, due to a limited readout budget. We also construct deterministic subsampling patterns that attain this bound for a class of matrix dimensions and readout budgets, and benchmark them against random subsampling through simulations.
Explore related subjects
Keep this discovery
Nitin Jonathan Myers. 2026-07-03. Two-dimensional Fourier compressed sensing under a fixed readout budget per channel. https://arxiv.org/abs/2607.03611
Cite the original work for its findings. Save a collection to share your selection of sources.