Explicit universal sampling sets in finite vector spaces
Explicit universal sampling sets in finite vector spaces
复制标题
有限向量空间中的显式通用采样集
DOI:
10.1016/j.acha.2016.06.001
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
Morotti
中科院分区:
文献类型:
--
作者:
Morotti
In this paper we construct explicit sampling sets and present reconstruction algorithms for Fourier signals on finite vector spaces G, with| G|= p r for a suitable prime p. The two sampling sets have sizes of order O (p t 2 r 2) and O (p t 2 r 3 log(p)) respectively, where t is the number of large coefficients in the Fourier transform. The algorithms approximate the function up to a small constant of the best possible approximation with t non-zero Fourier coefficients. The fastest of the algorithms has complexity O (p 2 t 2 r 3 log(p)).
DOI:
10.1016/j.endm.2013.07.027
发表时间:
2013
期刊:
Electron. Notes Discret. Math.
影响因子:
--
作者:
Lucia Morotti
通讯作者:
Lucia Morotti
DOI:
10.1117/12.2188541
发表时间:
2015
期刊:
2010 44th Annual Conference on Information Sciences and Systems (CISS)
影响因子:
--
作者:
E. King
通讯作者:
E. King
DOI:
10.1137/110835864
发表时间:
2011
期刊:
ArXiv
影响因子:
--
作者:
James P. Bailey;M. Iwen;Craig V. Spencer
通讯作者:
Craig V. Spencer