摘要
最近发表的快速W变换(FWT)是目前计算离散W变换(DWT)的各种算法中效率最高的算法。然而,FWT算法中使用正割做乘子,因而使其应用范围受到一定限制.本文介绍一种使用旋转因子的快速W变换算法.这种算法所需的计算量与FWT一样,因而也是一种高效算法。但是,由于旋转因子是由正弦和余弦构成,因此避免了FWT的缺点。
Among those algorithms for the discrete W transforms (DWT), thefast W transform (FWT) is the most efficient one. However, that FWT usessecant multipliers is a drawback.In this parer,a rotation factor fast algorithmfor W transforms is introduced. The computational complexity of thisalgorithm is identical with that of the F W T. But the drawback of the FWThas been overcome because the rotation factors are composed of sines and cosines.
出处
《信号处理》
CSCD
北大核心
1989年第1期19-25,共7页
Journal of Signal Processing
基金
国家自然科学基金
