arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1911.12945eess.SP
收藏

带限信号的时间编码:伪逆重构和时变无乘法器FIR滤波

Time encoding of bandlimited signals: reconstruction by pseudo-inversion and time-varying multiplierless FIR filtering

Nguyen T. Thao, Dominik Rzepka

摘要:

我们提出了一个完全重新设计的时间编码机(TEM)由Lazar和Tóth介绍的带限信号重建的框架。由于TEM的编码部分包括在已知时间间隔上获得带限输入的积分值,因此理论上相当于在输入上应用已知的线性算子。然后,我们接近的一般问题的信号重建的伪逆这个运营商。我们执行这个任务的数值和迭代使用凸集投影(POCS)。该算法可以在离散时间中精确地实现,由于使用了松弛系数,乘法都被简化为2的有符号幂的缩放。同时,该算法实现了类似于Lazar和Tóth的收敛速度。对于实时处理,我们提出了一种近似的时变FIR实现,它避免了将输入分成块。最后,我们对算法在数据噪声下的半收敛性进行了初步分析。

英文摘要:

We propose an entirely redesigned framework of bandlimited signal reconstruction for the time encoding machine (TEM) introduced by Lazar and Tóth. As the encoding part of TEM consists in obtaining integral values of a bandlimited input over known time intervals, it theoretically amounts to applying a known linear operator on the input. We then approach the general question of signal reconstruction by pseudo-inversion of this operator. We perform this task numerically and iteratively using projections onto convex sets (POCS). The algorithm can be implemented exactly in discrete time with multiplications that are all reduced to scaling by signed powers of two, thanks to the use of relaxation coefficients. Meanwhile, the algorithm achieves a rate of convergence similar to that of Lazar and Tóth. For real-time processing, we propose an approximate time-varying FIR implementation, which avoids the splitting of the input into blocks. We finally propose some preliminary analysis of semi-convergence of the algorithm under data noise.

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

↑