Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
From MaRDI portal
Abstract: We address the problem of reconstructing a multi-band signal from its sub-Nyquist point-wise samples. To date, all reconstruction methods proposed for this class of signals assumed knowledge of the band locations. In this paper, we develop a non-linear blind perfect reconstruction scheme for multi-band signals which does not require the band locations. Our approach assumes an existing blind multi-coset sampling method. The sparse structure of multi-band signals in the continuous frequency domain is used to replace the continuous reconstruction with a single finite dimensional problem without the need for discretization. The resulting problem can be formulated within the framework of compressed sensing, and thus can be solved efficiently using known tractable algorithms from this emerging area. We also develop a theoretical lower bound on the average sampling rate required for blind signal reconstruction, which is twice the minimal rate of known-spectrum recovery. Our method ensures perfect reconstruction for a wide class of signals sampled at the minimal rate. Numerical experiments are presented demonstrating blind sampling and reconstruction with minimal sampling rate.
Cited in
(30)- From linear system of equations to artificial intelligence -- the evolution journey of computer tomographic image reconstruction algorithms
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Group sparse recovery via group square-root elastic net and the iterative multivariate thresholding-based algorithm
- Near-optimal bounds for signal recovery from blind phaseless periodic short-time Fourier transform
- sampling based automatic modulation classifier
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- A deterministic sparse FFT for functions with structured Fourier sparsity
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- Spectral compressive sensing
- Optimal quadrature formulas for the Sobolev space H^1
- Estimation of block sparsity in compressive sensing
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Sub-Nyquist sampling and reconstruction model of LFM signals based on blind compressed sensing in FRFT domain
- Block sparse signal recovery via minimizing the block q-ratio sparsity
- Sparse representation for blind spectrum sensing in cognitive radio: a compressed sensing approach
- Vandermonde matrices with nodes in the unit disk and the large sieve
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- An introduction to compressed sensing
- From compression to compressed sensing
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- On the existence of optimal unions of subspaces for data modeling and clustering
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- Spectrum blind reconstruction and direction of arrival estimation of multi-band signals at sub-Nyquist sampling rates
- A simple Gaussian measurement bound for exact recovery of block-sparse signals
- Dynamical sampling in multiply generated shift-invariant spaces
- Beurling-type density criteria for system identification
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
This page was built for publication: Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571589)
