碰撞节点尖峰序列傅里叶重建的精度
Accuracy of spike-train Fourier reconstruction for colliding nodes
摘要:
我们考虑信号F的傅里叶重构问题,信号F是移位δ函数的线性组合。我们假设F的傅里叶变换在频率间隔[-N,N]上是已知的,具有不超过e > 0的绝对误差。我们给出了在已知节点(即F中的移位δ函数的位置)形成大小h << 1的l个元素簇的情况下F的“最坏情况”重构误差的绝对下界(其对于任何重构方法都是有效的)。使用“抽取”重建算法,我们提供了一个上界的重建误差,基本上是相同的形式作为较低的。粗略地说,我们的主要结果表明,对于e的(2l-1)-st根阶的N*h,集群节点的最坏情况重建误差与h的阶数相同,因此集群节点的内部配置(在最坏情况下)根本无法重建。另一方面,抽取算法以e的21阶根的精度重构F。
英文摘要:
We consider Fourier reconstruction problem for signals F, which are linear combinations of shifted delta-functions. We assume the Fourier transform of F to be known on the frequency interval [-N,N], with an absolute error not exceeding e > 0. We give an absolute lower bound (which is valid with any reconstruction method) for the "worst case" reconstruction error of F in situations where the nodes (i.e. the positions of the shifted delta-functions in F) are known to form an l elements cluster of a size h << 1. Using "decimation" reconstruction algorithm we provide an upper bound for the reconstruction error, essentially of the same form as the lower one. Roughly, our main result states that for N*h of order of (2l-1)-st root of e the worst case reconstruction error of the cluster nodes is of the same order as h, and hence the inside configuration of the cluster nodes (in the worst case scenario) cannot be reconstructed at all. On the other hand, decimation algorithm reconstructs F with the accuracy of order of 2l-st root of e.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。