Sparsity in time-frequency representations

DOI10.1007/S00041-009-9086-9zbMATH Open1185.42039arXiv0711.2503OpenAlexW2136152309MaRDI QIDQ967573FDOQ967573

Authors: Götz E. Pfander, Holger Rauhut 

Publication date: 30 April 2010

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

Abstract: We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an $S$-sparse Gabor representation in $mathbb{C}^n$ with respect to a random unimodular window can be recovered by Basis Pursuit with high probability provided that $SleqCn/log(n)$. Our results are applicable to the channel estimation problem in wireless communications and they establish the usefulness of a class of measurement matrices for compressive sensing.

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

Recommendations

• Sparse time frequency representations and dynamical systems
• Sparse time-frequency representation of nonlinear and nonstationary data
• Sparse Bayesian representation in time-frequency domain
• Reduced Interference Sparse Time-Frequency Distributions for Compressed Observations
• On the uniqueness of sparse time-frequency representation of multiscale data
• Sparse time-frequency decomposition for multiple signals with same frequencies
• Sparse time-frequency decomposition based on dictionary adaptation
• Sparse Sinusoidal Signal Representation for Speech and Music Signals
• Adaptive data analysis via sparse time-frequency representation

Mathematics Subject Classification ID

Convex programming (90C25) Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Random matrices (algebraic aspects) (15B52)

Cites Work

• Title not available (Why is that?)
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Atomic Decomposition by Basis Pursuit
• Stable recovery of sparse overcomplete representations in the presence of noise
• 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
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Compressed sensing
• Foundations of time-frequency analysis
• On Sparse Representations in Arbitrary Redundant Bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Adaptive greedy approximations
• An introduction to frames and Riesz bases
• Grassmannian frames with applications to coding and communication
• On sparse reconstruction from Fourier and Gaussian measurements
• Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
• Linear independence of Gabor systems in finite dimensional vector spaces
• Title not available (Why is that?)
• Compressed Sensing and Redundant Dictionaries
• Complex sequences with low periodic correlations (Corresp.)
• Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
• Random sampling of sparse trigonometric polynomials
• On the conditioning of random subdictionaries
• Uncertainty in time-frequency representations on finite Abelian groups and applications
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• High-Resolution Radar via Compressed Sensing
• A discrete model for the efficient analysis of time-varying narrowband communication channels
• Identification of Matrices Having a Sparse Representation
• Title not available (Why is that?)
• Gabor analysis over finite Abelian groups

Cited In (24)

• Compressive Sensing
• Remote sensing via \(\ell_1\)-minimization
• Cornerstones of sampling of operator theory
• Theoretical frame properties of wave-packet matrices over prime fields
• Sparse channel separation using random probes
• A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
• Beyond coherence: Recovering structured time-frequency representations
• Sparse reconstruction of Hardy signal and applications to time-frequency distribution
• The Faber-Krahn inequality for the short-time Fourier transform
• On uncertainty principles in the finite dimensional setting
• Time-Frequency Energy Distributions Meet Compressed Sensing
• Sampling of operators
• A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
• Sparse Bayesian representation in time-frequency domain
• Title not available (Why is that?)
• Donoho-Logan large sieve principles for modulation and polyanalytic Fock spaces
• Sparse time-frequency representation based on multiwindow discrete Gabor transform
• Time filters and spurious acoustics in artificial compression methods
• Super-resolution for doubly-dispersive channel estimation
• The restricted isometry property for time-frequency structured random matrices
• Improved bounds for sparse recovery from subsampled random convolutions
• Suprema of chaos processes and the restricted isometry property
• Sparse signal recovery using a new class of random matrices
• Constructing tight Gabor frames using CAZAC sequences

Uses Software

• PDCO

This page was built for publication: Sparsity in time-frequency representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q967573)