English
Related papers

Related papers: Time Division Multiplexing: From a Co-Prime Sampli…

200 papers

Conventional sub-Nyquist sampling methods for analog signals exploit prior information about the spectral support. In this paper, we consider the challenging problem of blind sub-Nyquist sampling of multiband signals, whose unknown…

Information Theory · Computer Science 2015-05-13 Moshe Mishali , Yonina C. Eldar

This contribution proposes a two stage strategy to allow for phase retrieval in state of the art sub-Nyquist sampling schemes for sparse multiband signals. The proposed strategy is based on data acquisition via modulated wideband converters…

Information Theory · Computer Science 2015-09-29 Çağkan Yapar , Volker Pohl , Holger Boche

We study a relaxation of the problem of coupling probability distributions -- a list of samples is generated from one distribution and an accept is declared if any one of these samples is identical to the sample generated from the other…

Machine Learning · Computer Science 2026-01-13 Joseph Rowan , Buu Phan , Ashish Khisti

In the first part of the series papers, we set out to answer the following question: given specific restrictions on a set of samplers, what kind of signal can be uniquely represented by the corresponding samples attained, as the foundation…

Information Theory · Computer Science 2021-08-25 Hanshen Xiao , Yaowen Zhang , Guoqiang Xiao

Co-prime arrays with compressed inter-element spacing (CACIS) is one of the generalizations of the co-prime array. The inter-element spacing can be varied in this case. The prototype co-prime arrays and nested arrays are a special case of…

Signal Processing · Electrical Eng. & Systems 2020-07-24 Usham V. Dias

We study dual volume sampling, a method for selecting k columns from an n x m short and wide matrix (n <= k <= m) such that the probability of selection is proportional to the volume spanned by the rows of the induced submatrix. This method…

Machine Learning · Statistics 2017-11-17 Chengtao Li , Stefanie Jegelka , Suvrit Sra

When sampling multiple signals, the correlation between the signals can be exploited to reduce the overall number of samples. In this paper, we study the sampling theory of multiple correlated signals, using correlation to sample them at…

Signal Processing · Electrical Eng. & Systems 2022-10-11 Zhongyi Ni , Feng Ji , Hang Sheng , Hui Feng , Bo Hu

As technology grows, higher frequency signals are required to be processed in various applications. In order to digitize such signals, conventional analog to digital convertors are facing implementation challenges due to the higher sampling…

Information Theory · Computer Science 2014-11-27 Amir Zandieh , Alireza Zareian , Masoumeh Azghani , Farokh Marvasti

Frequency estimation of multiple sinusoids is significant in both theory and application. In some application scenarios, only sub-Nyquist samples are available to estimate the frequencies. A conventional approach is to sample the signals at…

Information Theory · Computer Science 2017-03-21 Shan Huang , Haijian Zhang , Hong Sun , Lei Yu , Liwen Chen

Because optical systems have huge bandwidth and are capable of generating low noise short pulses they are ideal for undersampling multi-band signals that are located within a very broad frequency range. In this paper we propose a new scheme…

Optics · Physics 2009-11-13 Amir Rosenthal , Alex Linden , Moshe Horowitz

A novel compressive-sensing based signal multiplexing scheme is proposed in this paper to further improve the multiplexing gain for multiple input multiple output (MIMO) system. At the transmitter side, a Gaussian random measurement matrix…

Information Theory · Computer Science 2016-04-05 Chanzi Liu , Qingchun Chen , Xiaohu Tang

Efficient sampling of many-dimensional and multimodal density functions is a task of great interest in many research fields. We describe an algorithm that allows parallelizing inherently serial Markov chain Monte Carlo (MCMC) sampling by…

Computation · Statistics 2020-08-10 Vasyl Hafych , Philipp Eller , Oliver Schulz , Allen Caldwell

Sampling problems are promising candidates for demonstrating quantum advantage, and one approach known as quantum-enhanced Markov chain Monte Carlo [Layden, D. et al., Nature 619, 282-287 (2023)] uses quantum samples as a proposal…

Quantum Physics · Physics 2026-04-23 Yuya Kawamata , Yuichiro Nakano , Keisuke Fujii

In this work, we propose a method for determining a non-uniform sampling scheme for multi-dimensional signals by solving a convex optimization problem reminiscent of the sensor selection problem. The resulting sampling scheme minimizes the…

Methodology · Statistics 2017-07-12 Johan Swärd , Filip Elvander , Andreas Jakobsson

Compressive sampling offers a new paradigm for acquiring signals that are compressible with respect to an orthonormal basis. The major algorithmic challenge in compressive sampling is to approximate a compressible signal from noisy samples.…

Numerical Analysis · Mathematics 2014-04-29 D. Needell , J. A. Tropp

Monte Carlo sampling methods often suffer from long correlation times. Consequently, these methods must be run for many steps to generate an independent sample. In this paper a method is proposed to overcome this difficulty. The method…

Computation · Statistics 2007-09-13 Jonathan Weare

An important receiver operation is to detect the presence specific preamble signals with unknown delays in the presence of scattering, Doppler effects and carrier offsets. This task, referred to as "link acquisition", is typically a…

Information Theory · Computer Science 2015-06-11 Xiao Li , Andrea Rueetschi , Anna Scaglione , Yonina C. Eldar

In this paper, a novel technique is proposed to address the joint sampling timing acquisition for baseband and broadband power-line communication (BB-PLC) systems using Orthogonal-Frequency-Division-Multiplexing (OFDM), including the…

Information Theory · Computer Science 2016-11-18 Chen Chen , Yun Chen , Na Ding , Jia-Chin Lin , Xiaoyang Zeng , Defeng , Huang

Markov chain Monte Carlo sampling methods often suffer from long correlation times. Consequently, these methods must be run for many steps to generate an independent sample. In this paper a method is proposed to overcome this difficulty.…

Numerical Analysis · Mathematics 2009-11-13 Jonathan Weare

Compressive sampling has become a widely used approach to construct polynomial chaos surrogates when the number of available simulation samples is limited. Originally, these expensive simulation samples would be obtained at random locations…

Computation · Statistics 2018-07-04 Negin Alemazkoor , Hadi Meidani