东南大学影像科学与技术实验室,江苏,南京,210096
纸质出版:2007
移动端阅览
凌琦, 舒华忠, 李松毅, 等. 任意长度的离散W变换的一种递归算法[J]. 电子学报, 2007,35(10):1949-1953.
LING Qi, SHU Hua-zhong, LI Song-yi, et al. Computation of Discrete W Transform with Arbitrary Length Using Clenshaw’s Recurrence Formula[J]. Acta Electronica Sinica, 2007, 35(10): 1949-1953.
离散W变换(DWT)在数字信号和图像处理领域有着广泛的应用.由于其涉及的计算的复杂性
众多学者提出了诸多DWT的快速算法来降低计算复杂度和硬件复杂度.本文针对任意长度的序列提出一种新的计算DWT的递归方法.我们利用Clenshaw 递归关系式推导了一种可以有效计算II型
III型和IV型DWT系数的递归算法.结果表明
该算法不仅结构简单
而且非常适合采用VLSI来并行实现.
The Discrete W Transforms (DWT) have been widely used in the field of digital signal and image processing.Due to its high computational complexity
many fast algorithms for computing the DWT have been reported in the literature to improve the computational speed and hardware complexity.In this paper
a recursive algorithm for computing the DWT is proposed.By using Clenshaw’s recurrence formula
we derive an efficient method for computing the type-II
-III
and -IV DWT of sequences with general length.The results indicate that the proposed algorithms achieve a simple computational structure which is particularly suitable for parallel VLSI realization.
0
浏览量
824
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621