English
Related papers

Related papers: A Constrained Random Demodulator for Sub-Nyquist S…

200 papers

This paper deals with the problem of robust matrix completion -- retrieving a low-rank matrix and a sparse matrix from the compressed counterpart of their superposition. Though seemingly not an unresolved issue, we point out that the…

Information Theory · Computer Science 2024-10-10 Yinjian Wang

This paper investigates total variation minimization in one spatial dimension for the recovery of gradient-sparse signals from undersampled Gaussian measurements. Recently established bounds for the required sampling rate state that uniform…

Information Theory · Computer Science 2022-04-12 Martin Genzel , Maximilian März , Robert Seidel

A key problem in constrained random verification (CRV) concerns generation of input stimuli that result in good coverage of the system's runs in targeted corners of its behavior space. Existing CRV solutions however provide no formal…

Logic in Computer Science · Computer Science 2020-08-18 Supratik Chakraborty , Aditya A. Shrotri , Moshe Y. Vardi

With the advent of massive data outputs at a regular rate, admittedly, signal processing technology plays an increasingly key role. Nowadays, signals are not merely restricted to physical sources, they have been extended to digital sources…

Information Theory · Computer Science 2015-07-28 Yi Lu

The success of the compressed sensing paradigm has shown that a substantial reduction in sampling and storage complexity can be achieved in certain linear and non-adaptive estimation problems. It is therefore an advisable strategy for…

Information Theory · Computer Science 2014-08-27 Peter Jung , Philipp Walk

Optical communication systems, which operate at very high rates, are often limited by the sampling rate bottleneck. The optical wideband regime may exceed analog to digital converters (ADCs) front-end bandwidth. Multi-channel sampling…

Information Theory · Computer Science 2017-10-11 Omri Lev , Tal Wiener , Deborah Cohen , Yonina C. Eldar

This paper presents a randomized algorithm for computing the near-optimal low-rank dynamic mode decomposition (DMD). Randomized algorithms are emerging techniques to compute low-rank matrix approximations at a fraction of the cost of…

Numerical Analysis · Mathematics 2019-11-28 N. Benjamin Erichson , Lionel Mathelin , Steven L. Brunton , J. Nathan Kutz

In this work we study the topic of high-resolution adaptive sampling of a given deterministic signal and establish a connection with classic approaches to high-rate quantization. Specifically, we formulate solutions for the task of optimal…

Information Theory · Computer Science 2018-04-20 Yehuda Dar , Alfred M. Bruckstein

This paper studies a Shannon-theoretic version of the generalized distribution preserving quantization problem where a stationary and memoryless source is encoded subject to a distortion constraint and the additional requirement that the…

Information Theory · Computer Science 2015-07-10 Naci Saldi , Tamás Linder , Serdar Yüksel

Time-frequency analysis has been applied successfully in many fields. However, the traditional methods, like short time Fourier transform and Cohen distribution, suffer from the low resolution or the interference of the cross terms. To…

Signal Processing · Electrical Eng. & Systems 2018-04-17 Yingpin Chen , Zhenming Peng , Ali Gholami , Jingwen Yan , Shu Li

Subsampled blind deconvolution is the recovery of two unknown signals from samples of their convolution. To overcome the ill-posedness of this problem, solutions based on priors tailored to specific application have been developed in…

Information Theory · Computer Science 2015-11-23 Kiryung Lee , Yanjun Li , Marius Junge , Yoram Bresler

Shannon's sampling theorem provides a link between the continuous and the discrete realms stating that bandlimited signals are uniquely determined by its values on a discrete set. This theorem is realized in practice using so called…

Information Theory · Computer Science 2017-11-10 Ayush Bhandari , Felix Krahmer , Ramesh Raskar

The selective frequency damping (SFD) method is an alternative to classical Newton's method to obtain unstable steady-state solutions of dynamical systems. However this method has two main limitations: it does not converge for arbitrary…

Fluid Dynamics · Physics 2015-10-28 Bastien E. Jordi , Colin J. Cotter , Spencer J. Sherwin

Traditional radar sensing typically involves matched filtering between the received signal and the shape of the transmitted pulse. Under the confinement of classic sampling theorem this requires that the received signals must first be…

Information Theory · Computer Science 2013-07-09 Eliahu Baransky , Gal Itzhak , Idan Shmuel , Noam Wagner , Eli Shoshan , Yonina C. Eldar

Notions and limits from standard time series analysis must be modified when treating series which are measured irregularly and contain long gaps. Classical Nyquist criterion to estimate frequency range which is potentially recoverable must…

Instrumentation and Methods for Astrophysics · Physics 2009-04-27 Jaan Pelt

This work considers distributed sensing and transmission of sporadic random samples. Lower bounds are derived for the reconstruction error of a single normally or uniformly-distributed finite-dimensional vector imperfectly measured by a…

Information Theory · Computer Science 2015-11-20 Ayşe Ünsal , Raymond Knopp

We present a transformer-based speech-declipping model that effectively recovers clipped signals across a wide range of input signal-to-distortion ratios (SDRs). While recent time-domain deep neural network (DNN)-based declippers have…

Audio and Speech Processing · Electrical Eng. & Systems 2024-09-20 Younghoo Kwon , Jung-Woo Choi

Numerous applications in signal processing have benefited from the theory of compressed sensing which shows that it is possible to reconstruct signals sampled below the Nyquist rate when certain conditions are satisfied. One of these…

Multimedia · Computer Science 2012-03-27 Cagdas Bilen , Yao Wang , Ivan Selesnick

Sub-sampling can acquire directly a passband within a broad radio frequency (RF) range, avoiding down-conversion and low-phase-noise tunable local oscillation (LO). However, sub-sampling suffers from band folding and self-image…

Instrumentation and Detectors · Physics 2017-07-29 Wenhui Hao , Yitang Dai , Feifei Yin , Yue Zhou , Jianqiang Li , Jian Dai , Wangzhe Li , Kun Xu

We show that to lower the sampling rate in a spread spectrum communication system using Direct Sequence Spread Spectrum (DSSS), compressive signal processing can be applied to demodulate the received signal. This may lead to a decrease in…

Information Theory · Computer Science 2012-10-11 Karsten Fyhn , Thomas Arildsen , Torben Larsen , Søren Holdt Jensen