摘要
该文提出了一种基于动态规划的时变小波包分解算法。利用此算法进行小波包分解可以解决以往分解算法如单树算法无法进行时频分解而双树算法只能进行二叉树分解的问题。通过对时变自回归模型的分解仿真实验,表明在处理时变信号方面,此分解算法比其它算法更具有灵活性。
Based on dynamic programming, a time-varying wavelet packets decomposition algorithm is proposed. Using this algorithm, the problems, that the single tree algorithm cannot adapt to nonstationary signals and the double tree algorithm has strict binary restriction, are solved. Simulation results varify that this algorithm is more flexible than the others in time-varying signal processing.
出处
《电子与信息学报》
EI
CSCD
北大核心
2001年第11期1077-1082,共6页
Journal of Electronics & Information Technology
关键词
小波包
动态规划
时频分解
自回归模型
Wavelet packets, Dynamic programming, Time-frequency decomposition
