跟踪偏微分方程的线性规划方法
A linear programming approach to the tracking of partials
摘要:
提出了一种利用线性规划跟踪正弦啁啾信号的新方法。结果表明,Mcaulay和Quatieri的经典算法是贪婪的,对于长搜索具有指数复杂度,而基于Viterbi算法的算法具有阶乘复杂度.一个线性规划(LP)制定找到最好的$L$路径在一个格子中描述和它的复杂性被证明是低于以前的方法。最后,它表明,新的LP制定优于经典算法在高噪声水平的正弦啁啾的跟踪。
英文摘要:
A new approach to the tracking of sinusoidal chirps using linear programming is proposed. It is demonstrated that the classical algorithm of McAulay and Quatieri is greedy and exhibits exponential complexity for long searches, while approaches based on the Viterbi algorithm exhibit factorial complexity. A linear programming (LP) formulation to find the best $L$ paths in a lattice is described and its complexity is shown to be less than previous approaches. Finally it is demonstrated that the new LP formulation outperforms the classical algorithm in the tracking of sinusoidal chirps in high levels of noise.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。