One-bit compressive sampling with time-varying thresholds for sparse parameter estimation
Authors:
- 19 September 2016
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
This paper considers the problem of estimating the parameters of a signal using time-varying thresholded noisy one-bit measurements. The problem is shown to be deterministically identifiable under reasonable conditions on the signal and thresholds. A spectral sensing application is considered, and two sparse methods are presented. In addition to the standard ℓ1 norm based approach, a “zero-norm” approximation via the logarithm function is used, and shown to yield sparser estimates in a numerical example.Keywords
This publication has 23 references indexed in Scilit:
- One-bit compressed sensing with non-Gaussian measurementsLinear Algebra and its Applications, 2014
- One‐Bit Compressed Sensing by Linear ProgrammingCommunications on Pure and Applied Mathematics, 2013
- Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse VectorsIEEE Transactions on Information Theory, 2013
- Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming ApproachIEEE Transactions on Information Theory, 2012
- One-Bit Measurements With Adaptive ThresholdsIEEE Signal Processing Letters, 2012
- Robust 1-bit Compressive Sensing Using Adaptive Outlier PursuitIEEE Transactions on Signal Processing, 2012
- Compressed Sensing With Quantized MeasurementsIEEE Signal Processing Letters, 2009
- 1-Bit compressive sensing2008
- Bandwidth-constrained distributed estimation for wireless sensor networks-part II: unknown probability density functionIEEE Transactions on Signal Processing, 2006
- Effects of sampling and quantization on single-tone frequency estimationIEEE Transactions on Signal Processing, 2000