.png){kind=icon}
返回
An Overcomplete Stitching Algorithm for Time Decoding Machines
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSI.2008.920982.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Asynchronous communications
frames
irregular sampling
real-time stitching algorithms
time decoding machines (TDMs)
time encoding machines (TEMs)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.2
论文数:
9.7K
被引数:
2.2W
机构
引用论文
Risk for congenital anomalies associated with different sporadic and daily doses of alcohol consumption during pregnancy: A case–control study妊娠期间与不同散发性和每日饮酒量相关的先天性异常风险: 一项病例对照研究
PREAI
分享收藏分享收藏
Time encoding with an integrate-and-fire neuron with a refractory period具有不应期的积分和激发神经元的时间编码.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容