Memoryless scalar quantization for random frames
From MaRDI portal
Publication:2059810
DOI10.1007/s43670-021-00012-4zbMath1479.94091arXiv1804.02839OpenAlexW3172185385MaRDI QIDQ2059810
Kateryna Melnykova, Özgür Yılmaz
Publication date: 14 December 2021
Published in: Sampling Theory, Signal Processing, and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.02839
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) General harmonic expansions, frames (42C15) Sampling theory in information and communication theory (94A20)
Cites Work
- Unnamed Item
- Error bounds for consistent reconstruction: random polytopes and coverage processes
- The lower bound of the PCM quantization error in high dimensions
- An improvement of convergence rate estimates in the Lyapunov theorem
- Lattice quantization error for redundant representations
- Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements
- The restricted isometry property and its implications for compressed sensing
- Sobolev duals in frame theory and Sigma-Delta quantization
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements
- Quantization of compressive samples with stable and robust recovery
- One-bit compressed sensing with non-Gaussian measurements
- Noise-Shaping Quantization Methods for Frame-Based and Compressive Sampling Systems
- One-Bit Compressed Sensing by Linear Programming
- Certifying the Restricted Isometry Property is Hard
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
- Non-asymptotic theory of random matrices: extreme singular values
- The Performance of PCM Quantization Under Tight Frame Representations
- Quantized Compressed Sensing: A Survey
- Quantization and Compressive Sensing
- Sigma-delta (/spl Sigma//spl Delta/) quantization and finite frames
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Dithered quantizers
- Quantized overcomplete expansions in IR/sup N/: analysis, synthesis, and algorithms
- On simple oversampled A/D conversion in L/sup 2/(R)
- On the whiteness of high-resolution quantization errors
- Resilience properties of redundant expansions under additive noise and quantization
- From Compressed Sensing to Compressed Bit-Streams: Practical Encoders, Tractable Decoders
- Quantization and Finite Frames
- Quantized compressive sensing with RIP matrices: the benefit of dithering
- Sigma-Delta quantization of sub-Gaussian frame expansions and its application to compressed sensing
- Universal Rate-Efficient Scalar Quantization
- Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Stabilizing Nonuniformly Quantized Compressed Sensing With Scalar Companders
- White Noise Hypothesis for Uniform Quantization Errors
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
- Sub-Gaussian random variables
- Quantized frame expansions with erasures
This page was built for publication: Memoryless scalar quantization for random frames