arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.00900cs.ITcs.CEmath.IT
收藏

Fourier基最优包络逼近及其在TV白空间中的应用

Optimal Envelope Approximation in Fourier Basis with Applications in TV White Space

Animesh Kumar

摘要:

本文引入了平滑连续变量信号的低通包络逼近。当给定信号必须始终近似为较大值时(例如在TV空白保护区域中),包络近似是必要的。在这项工作中,一个接近最佳的近似算法,找到一个信号的包络,同时最小化的均方成本函数,详细说明。稀疏(低通)信号近似的线性傅立叶级数的基础上获得。这种近似算法的工作原理是将包络特性从无限多个点离散到大量(但有限)点。结果表明,这种近似算法是近最优的,可以通过使用有效的凸优化程序在文献中得到解决。最后提供了模拟结果,以获得更多的见解分析结果。

英文摘要:

Lowpass envelope approximation of smooth continuous-variable signals are introduced in this work. Envelope approximations are necessary when a given signal has to be approximated always to a larger value (such as in TV white space protection regions). In this work, a near-optimal approximate algorithm for finding a signal's envelope, while minimizing a mean-squared cost function, is detailed. The sparse (lowpass) signal approximation is obtained in the linear Fourier series basis. This approximate algorithm works by discretizing the envelope property from an infinite number of points to a large (but finite) number of points. It is shown that this approximate algorithm is near-optimal and can be solved by using efficient convex optimization programs available in the literature. Simulation results are provided towards the end to gain more insights into the analytical results presented.

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

↑