arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1202.2525cs.ITmath.ITmath.STstat.TH
收藏

信息论最优速率下的二次抽样

Subsampling at Information Theoretically Optimal Rates

Adel Javanmard, Andrea Montanari

摘要:

研究了频域稀疏支撑下随机信号的采样问题。香农曾考虑过一个著名的方案,即在等间隔的时间内对信号进行瞬时采样。他证明,只要采样率超过带宽(奈奎斯特速率)的两倍,信号就可以被重构。Candès,Romberg,Tao介绍了一种在随机时间获取信号瞬时样本的方案。他们证明,只要采样率超过信号的频率支持乘以对数因子,信号就可以被唯一且有效地重构。在本文中,我们考虑的信号的概率模型,和采样方案的灵感来自编码理论中的空间耦合的想法。也就是说,我们建议在随机时间采集非瞬时样本。在数学上,这是通过获取一个小的随机子集的Gabor系数。我们的经验表明,该方案实现正确的重建,只要采样率超过信号的频率支持,从而达到信息理论的限制。

英文摘要:

We study the problem of sampling a random signal with sparse support in frequency domain. Shannon famously considered a scheme that instantaneously samples the signal at equispaced times. He proved that the signal can be reconstructed as long as the sampling rate exceeds twice the bandwidth (Nyquist rate). Candès, Romberg, Tao introduced a scheme that acquires instantaneous samples of the signal at random times. They proved that the signal can be uniquely and efficiently reconstructed, provided the sampling rate exceeds the frequency support of the signal, times logarithmic factors. In this paper we consider a probabilistic model for the signal, and a sampling scheme inspired by the idea of spatial coupling in coding theory. Namely, we propose to acquire non-instantaneous samples at random times. Mathematically, this is implemented by acquiring a small random subset of Gabor coefficients. We show empirically that this scheme achieves correct reconstruction as soon as the sampling rate exceeds the frequency support of the signal, thus reaching the information theoretic limit.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑