On the Trade-Off Between Bit Depth and Number of Samples for a Basic Approach to Structured Signal Recovery From <inline-formula> <tex-math notation="LaTeX">b </tex-math> </inline-formula>-

DOI10.1109/TIT.2018.2826459MaRDI QIDQ5375568zbMATH OpenFDO

Authors Martin Slawski, Ping Li

Publication date 14 September 2018

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

Full work available at URL https://doi.org/10.1109/TIT.2018.2826459

Mathematics Subject Classification ID

Quantum measurement theory, state operations, state preparations (81P15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization
• Quantization of compressive samples with stable and robust recovery
• Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements
• The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
• Compressed sensing and -quantization
• Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames
• On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements
• The Sampling Rate-Distortion Tradeoff for Sparsity Pattern Recovery in Compressed Sensing
• On the reconstruction of signals by a finite number of samples
• Quantized Spectral Compressed Sensing: Cramer–Rao Bounds and Recovery Algorithms

This page was built for publication: On the Trade-Off Between Bit Depth and Number of Samples for a Basic Approach to Structured Signal Recovery From <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-

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