UNO: Unlimited Sampling Meets One-Bit Quantization

被引:7
|
作者
Eamaz, Arian [1 ]
Mishra, Kumar Vijay [2 ]
Yeganegi, Farhang [1 ]
Soltanalian, Mojtaba [1 ]
机构
[1] Univ Illinois, Dept Elect & Comp Engn, Chicago, IL 60607 USA
[2] US DEVCOM Army Res Lab, Adelphi, MD 20783 USA
基金
美国国家科学基金会;
关键词
Quantization (signal); Signal reconstruction; Signal processing algorithms; Receivers; Signal resolution; Sigma-delta modulation; Sensors; Kaczmarz algorithm; one-bit quantization; PnP-ADMM; modulo ADCs; unlimited sampling; SIGMA-DELTA QUANTIZATION; DITHER; IDEAL; RETRIEVAL; SELECTION; RECOVERY; MATRICES; LASSO;
D O I
10.1109/TSP.2024.3356253
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recent results in one-bit sampling provide a framework for a relatively low-cost, low-power sampling, at a high rate by employing time-varying sampling threshold sequences. Another recent development in sampling theory is unlimited sampling, which is a high-resolution technique that relies on modulo ADCs to yield an unlimited dynamic range. In this paper, we leverage the appealing attributes of the two afore mentioned techniques to propose a novel unlimited one-bit(UNO) sampling approach. In this framework, the information on the distance between the input signal value and the threshold is stored and utilized to accurately reconstruct the one-bit sampled signal. We then utilize this information to accurately reconstruct the signal from its one-bit samples via the randomized Kaczmarz algorithm (RKA). In the presence of noise, we employ the recent plug-and-play (PnP) priors technique with alternating direction method of multipliers (ADMM) to exploit integration of state-of-the-art regularizers in the reconstruction process. Numerical experiments with RKA and PnP-ADMM-based reconstruction illustrate the effectiveness of our proposed UNO, including its superior performance compared to the one-bit Sigma Delta sampling
引用
收藏
页码:997 / 1014
页数:18
相关论文
共 50 条
  • [41] Covariance recovery for one-bit sampled stationary signals with time-varying sampling thresholds
    Eamaz, Arian
    Yeganegi, Farhang
    Soltanalian, Mojtaba
    SIGNAL PROCESSING, 2023, 206
  • [42] One-Bit Time-Resolved Imaging
    Bhandari, Ayush
    Conde, Miguel Heredia
    Loffeld, Otmar
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2020, 42 (07) : 1630 - 1641
  • [43] Approximation with One-Bit Polynomials in Bernstein Form
    C. Sinan Güntürk
    Weilin Li
    Constructive Approximation, 2023, 57 : 601 - 630
  • [44] DOA Estimation on One-Bit Quantization Observations through Noise-Boosted Multiple Signal Classification
    Pan, Yan
    Zhang, Li
    Xu, Liyan
    Duan, Fabing
    SENSORS, 2024, 24 (14)
  • [45] Gridless Maximum Likelihood One-Bit Direct Position Determination
    Li, Pan
    Li, Jianfeng
    Zhang, Xiaofei
    Wu, Qihui
    IEEE SIGNAL PROCESSING LETTERS, 2024, 31 : 3099 - 3103
  • [46] One-Bit Compressive Sensing With Norm Estimation
    Knudson, Karin
    Saab, Rayan
    Ward, Rachel
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (05) : 2748 - 2758
  • [47] ONE-BIT SPARSE ARRAY DOA ESTIMATION
    Liu, Chun-Lin
    Vaidyanathan, P. P.
    2017 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2017, : 3126 - 3130
  • [48] Reduced Complexity Precoding for One-Bit Signaling
    Tabeshnezhad, Azadeh
    Swindlehurst, A. Lee
    Svensson, Tommy
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2021, 70 (02) : 1967 - 1971
  • [49] Approximation with One-Bit Polynomials in Bernstein Form
    Guentuerk, C. Sinan
    Li, Weilin
    CONSTRUCTIVE APPROXIMATION, 2023, 57 (02) : 601 - 630
  • [50] On the Performance of One-Bit DoA Estimation via Sparse Linear Arrays
    Sedighi, Saeid
    Mysore, Bhavani Shankar R.
    Soltanalian, Mojtaba
    Ottersten, Bjorn
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 : 6165 - 6182