Deterministic convolutional compressed sensing matrices
From MaRDI portal
Publication:324274
DOI10.1016/J.FFA.2016.07.002zbMATH Open1364.94175OpenAlexW2484792884MaRDI QIDQ324274FDOQ324274
Authors: Xin Wang, Jun Zhang, Gennian Ge 
Publication date: 10 October 2016
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2016.07.002
Recommendations
- Convolutional Compressed Sensing Using Deterministic Sequences
- Deterministic constructions of compressed sensing matrices
- Compressive sensing by random convolution
- Deterministic construction of compressed sensing matrices from codes
- Deterministic constructions of compressed sensing matrices based on codes
- Compressive sensing and structured random matrices
- Compressed Sensing Matrices From Fourier Matrices
- Deterministic Compressed Sensing Matrices: Construction via Euler Squares and Applications
- Binary Matrices for Compressed Sensing
- Compressed sensing and dictionary learning
sparse recoveryconvolutional compressed sensingmutual incoherencepartial character sumspseudo-random sequence
Cites Work
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- A simple proof of the restricted isometry property for random matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Greed is Good: Algorithmic Results for Sparse Approximation
- Uncertainty principles and ideal atomic decomposition
- On sparse reconstruction from Fourier and Gaussian measurements
- On Exponential Sums in Finite Fields
- Compressed Sensing and Redundant Dictionaries
- Near-ideal model selection by \(\ell _{1}\) minimization
- Counting faces of randomly projected polytopes when the projection radically lowers dimension
- Deterministic constructions of compressed sensing matrices
- Suprema of chaos processes and the restricted isometry property
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Explicit constructions of RIP matrices and related problems
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Compressed Sensing Matrices From Fourier Matrices
- Compressive sensing and structured random matrices
- Structured Compressed Sensing: From Theory to Applications
- Deterministic Sensing Matrices Arising From Near Orthogonal Systems
- Deterministic Construction of Compressed Sensing Matrices via Algebraic Curves
- A Constructive Representation for the Fourier Dual of the Zadoff–Chu Sequences
- Compressive sensing by random convolution
- Title not available (Why is that?)
- An Estimate for Character Sums
- Restricted isometries for partial random circulant matrices
- Convolutional Compressed Sensing Using Deterministic Sequences
- Deterministic Construction of Sparse Sensing Matrices via Finite Geometry
- Polyphase codes with good periodic correlation properties (Corresp.)
- On the conditioning of random subdictionaries
Cited In (5)
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- On the design of deterministic matrices for fast recovery of Fourier compressible functions
- Restricted isometries for partial random circulant matrices
- Super-sparse tri-value circulant measurement matrices design
Uses Software
This page was built for publication: Deterministic convolutional compressed sensing matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q324274)
