English
Related papers

Related papers: Orthogonal Matching Pursuit based Reconstruction f…

200 papers

Two important attributes of analog to digital converters (ADCs) are its sampling rate and dynamic range. The sampling rate should be greater than or equal to the Nyquist rate for bandlimited signals with bounded energy. It is also desired…

Signal Processing · Electrical Eng. & Systems 2021-10-08 Eyar Azar , Satish Mulleti , Yonina C. Eldar

Analog to digital converters (ADCs) act as a bridge between the analog and digital domains. Two important attributes of any ADC are sampling rate and its dynamic range. For bandlimited signals, the sampling should be above the Nyquist rate.…

Signal Processing · Electrical Eng. & Systems 2022-06-30 Eyar Azar , Satish Mulleti , Yonina C. Eldar

Analog-to-digital converters (ADCs) play a vital important role in any devices via manipulating analog signals in a digital manner. Given that the amplitude of the signal exceeds the dynamic range of the ADCs, clipping occurs and the…

Signal Processing · Electrical Eng. & Systems 2024-10-28 Jiang Zhu , Junnan Ma , Zhenlong Liu , Fengzhong Qu , Zheng Zhu , Qi Zhang

Conventional analog-to-digital converters (ADCs) clip when signals exceed their input range. Modulo (unlimited) sampling overcomes this limitation by folding the signal before digitization, but existing recovery methods are either…

Signal Processing · Electrical Eng. & Systems 2025-09-17 Wenyi Yan , Zeyuan Li , Lu Gan , Honqing Liu , Guoquan Li

Recovering signals within limited dynamic range (DR) constraints remains a central challenge for analog-to-digital converters (ADCs). To prevent data loss, an ADCs DR typically must exceed that of the input signal. Modulo sampling has…

Signal Processing · Electrical Eng. & Systems 2025-01-22 Yhonatan Kvich , Shlomi Savariego , Moshe Namer , Yonina C. Eldar

Following the Unlimited Sampling strategy to alleviate the omnipresent dynamic range barrier, we study the problem of recovering a bandlimited signal from point-wise modulo samples, aiming to connect theoretical guarantees with hardware…

Information Theory · Computer Science 2022-04-06 Ayush Bhandari , Felix Krahmer , Thomas Poskitt

Shannon's sampling theorem is one of the cornerstone topics that is well understood and explored, both mathematically and algorithmically. That said, practical realization of this theorem still suffers from a severe bottleneck due to the…

Information Theory · Computer Science 2020-12-02 Ayush Bhandari , Felix Krahmer , Ramesh Raskar

Orthogonal matching pursuit~(OMP) is a commonly used greedy algorithm for recovering sparse signals from compressed measurements. In this paper, we introduce a variant of the OMP algorithm to reduce the complexity of reconstructing a class…

Signal Processing · Electrical Eng. & Systems 2025-11-25 Xinwei Zhao , Jinming Wen , Hongqi Yang , Xiao Ma

Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under…

Information Theory · Computer Science 2020-12-14 Hengkuan Lu , Jian Wang

Sampling shift-invariant (SI) signals with a high dynamic range poses a notable challenge in the domain of analog-to-digital conversion (ADC). It is essential for the ADC's dynamic range to exceed that of the incoming analog signal to…

Signal Processing · Electrical Eng. & Systems 2024-06-18 Yhonatan Kvich , Yonina C. Eldar

In this paper we introduce a new sampling and reconstruction approach for multi-dimensional analog signals. Building on top of the Unlimited Sensing Framework (USF), we present a new folded sampling operator called the multi-dimensional…

Information Theory · Computer Science 2022-09-15 Dorian Florescu , Ayush Bhandari

Orthogonal matching pursuit (OMP) is a widely used greedy algorithm for sparse signal recovery in compressed sensing (CS). Prior work on OMP, however, has only provided reconstruction guarantees under the assumption that the columns of the…

Signal Processing · Electrical Eng. & Systems 2023-03-03 Hamed Masoumi , Michel Verhaegen , Nitin Jonathan Myers

Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension…

Computer Vision and Pattern Recognition · Computer Science 2025-04-28 Huiyuan Yu , Jia He , Maggie Cheng

In this paper, we investigate the relationship between the dynamic range and quantization noise power in modulo analog-to-digital converters (ADCs). Two modulo ADC systems are considered: (1) a modulo ADC which outputs the folded samples…

Signal Processing · Electrical Eng. & Systems 2025-09-03 Neil Irwin Bernardo , Shaik Basheeruddin Shah , Yonina C. Eldar

Direction of Arrival (DOA) estimation of multiple narrow-band coherent or partially coherent sources is a major challenge in array signal processing. Though many subspace- based algorithms are available in literature, none of them tackle…

Information Theory · Computer Science 2018-01-26 Abhishek Aich , P. Palanisamy

The orthogonal matching pursuit (OMP) is one of the mainstream algorithms for sparse data reconstruction or approximation. It acts as a driving force for the development of several other greedy methods for sparse data reconstruction, and it…

Information Theory · Computer Science 2023-03-31 Yun-Bin Zhao , Zhi-Quan Luo

Sampling rate is the bottleneck for spectrum sensing over multi-GHz bandwidth. Recent progress in compressed sensing (CS) initialized several sub-Nyquist rate approaches to overcome the problem. However, efforts to design CS reconstruction…

Information Theory · Computer Science 2011-02-15 Peng Zhang , Robert Qiu

Orthogonal matching pursuit (OMP) is a greedy algorithm widely used for the recovery of sparse signals from compressed measurements. In this paper, we analyze the number of iterations required for the OMP algorithm to perform exact recovery…

Information Theory · Computer Science 2016-02-23 Jian Wang , Byonghyo Shim

Recovery algorithms play a key role in compressive sampling (CS). Most of current CS recovery algorithms are originally designed for one-dimensional (1D) signal, while many practical signals are two-dimensional (2D). By utilizing 2D…

Information Theory · Computer Science 2011-04-27 Yong Fang , Bormin Huang , Jiaji Wu

The Unlimited Sensing Framework (USF) was recently introduced to overcome the sensor saturation bottleneck in conventional digital acquisition systems. At its core, the USF allows for high-dynamic-range (HDR) signal reconstruction by…

Information Theory · Computer Science 2022-02-16 Dorian Florescu , Felix Krahmer , Ayush Bhandari
‹ Prev 1 2 3 10 Next ›