Fast and Efficient Compressive Sensing Using Structurally Random Matrices

DOI10.1109/TSP.2011.2170977zbMath1393.94214arXiv1106.5037MaRDI QIDQ4573433

No author found.

Publication date: 18 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Random matrices (probabilistic aspects) (60B20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Large deviations (60F10) Random matrices (algebraic aspects) (15B52)

Related Items (8)

Signal recovery under cumulative coherence ⋮ An orthogonal method for measurement matrix optimization ⋮ Differential pulse code modulation and motion aligned optimal reconstruction for block-based compressive video sensing using conditional autoregressive-salp swarm algorithm ⋮ Channel estimation for finite scatterers massive multi-user MIMO system ⋮ The restricted isometry property for random block diagonal matrices ⋮ A Class of Cross‐Layer Optimization Design for Congestion and Energy Efficiency with Compressed Sensing in Wireless Sensing Networks ⋮ A Block Compressive Sensing Based Scalable Encryption Framework for Protecting Significant Image Regions ⋮ Deterministic construction of sparse binary matrices via incremental integer optimization

This page was built for publication: Fast and Efficient Compressive Sensing Using Structurally Random Matrices