正弦型正交变换的递归滑动窗口算法  

Recursive Moving Window Algorithms for the Sinusoidal Orthogonal Transforms

作　　者：杨义先[1] 

机构地区：[1]北京邮电学院信息工程系

出　　处：《北京邮电学院学报》1992年第1期18-24,共7页

基　　金：国家青年自然基金

摘　　要：给出了计算离散 Har(?)ley 变换(DHT 或 DWT-1)和第四类离散 W 变换(DWT-Ⅳ)的新型有效递归算法.新算法的运算结构是全并行的并可实现 DHT 和DWT-Ⅳ的矢量更新.不论变换维数是多少,矢量更新的总耗时都仅相当于作三次加法的时间.新算法特别适宜于联机实时谱分析.此外文末还指出对其它正弦型正交变换(例如:DCT 和 DST 等)不存在类似的有效算法.Effective recusive algorithms to compute the discrete Hartley transform (DHT)(or DWT-Ⅰ)and the fourth version of the discrete W transform(DWT- Ⅳ)are presented in this paper.The computational structures are fully concurrent and allow vectorized updating of DHT and DWT-Ⅳ.The total time requried for the updating could be as low as that of only three multiplications and three addi- tions,regardless of the number of points.The proposed algorithms are especially suited for on-line computations in real-time spectral analysis.In addition,it will be pointed out at the end of this paper that there exist no similar effective algorithms for the other sinusoidal orthogonal transform(e.g DCTs and DSTs).

关 键 词：信号理论 正交矩阵 并行处理 

分 类 号：TN911.7[电子电信—通信与信息系统]