An overcomplete stitching algorithm for time decoding machines
An overcomplete stitching algorithm for time decoding machines
复制标题
一种时间解码机的过完备拼接算法
DOI：
10.1109/tcsi.2008.920982
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
L. Tóth
中科院分区：
文献类型：
--
作者：
A. Lazar;E. Simonyi;L. Tóth
我们研究了一类有限维时间解码算法：（1）对时间编码参数不敏感;（2）高效稳定;（3）可以在真实的时间中实现。这些算法是基于这样的观察，即给定有限数量的观察的时间编码信号的恢复具有信号恢复的质量在减小的时间范围内非常高的性质。我们展示了如何获得一个有效的和稳定的方式使用范德蒙制定的恢复算法的时间编码信号的本地表示。一旦从有限数量的可能重叠的观测中获得信号值，就将缩小范围的段缝合在一起。通过分段拼接获得的信号随后被滤波以提高恢复性能。最后，我们评估的算法的复杂性和实时实现的计算要求。
We investigate a class of finite-dimensional time decoding algorithms that: (1) is insensitive with respect to the time-encoding parameters; (2) is highly efficient and stable; and (3) can be implemented in real time. These algorithms are based on the observation that the recovery of time encoded signals given a finite number of observations has the property that the quality of signal recovery is very high in a reduced time range. We show how to obtain a local representation of the time encoded signal in an efficient and stable manner using a Vandermonde formulation of the recovery algorithm. Once the signal values are obtained from a finite number of possibly overlapping observations, the reduced-range segments are stitched together. The signal obtained by segment stitching is subsequently filtered for improved performance in recovery. Finally, we evaluate the complexity of the algorithms and their computational requirements for real-time implementation.