Compressed Sensing Matrices From Fourier Matrices

DOI10.1109/TIT.2014.2375259zbMath1359.94200arXiv1301.0373OpenAlexW2963716738MaRDI QIDQ2978832

Zhiqiang Xu, Guangwu Xu

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.0373

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Signal recovery under cumulative coherence ⋮ A class of deterministic sensing matrices and their application in harmonic detection ⋮ Deterministic convolutional compressed sensing matrices ⋮ Performance analysis of the compressed distributed least squares algorithm ⋮ Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound ⋮ Two new constructions of approximately SIC-POVMs from multiplicative characters ⋮ Cayley sum graphs and their applications to codebooks ⋮ Bounding the restricted isometry constants for a tight frame ⋮ A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials ⋮ Construction of highly redundant incoherent unit norm tight frames as a union of orthonormal bases ⋮ MORE CONSTRUCTIONS OF APPROXIMATELY MUTUALLY UNBIASED BASES ⋮ Analysis of compressed distributed adaptive filters

This page was built for publication: Compressed Sensing Matrices From Fourier Matrices