电子学报 ›› 2001, Vol. 29 ›› Issue (2): 190-191.

• 论文 • 上一篇    下一篇

各类离散W变换的快速Hartley变换算法

钟广军, 成礼智, 陈火旺   

  1. 国防科技大学,长沙 410073
  • 收稿日期:2000-03-13 修回日期:2000-07-05 出版日期:2001-02-25 发布日期:2001-02-25

Fast Hartley Transform Algorithm for Various Discrete W Transforms

ZHONG Guang-jun, CHENG Li-zhi, CHEN Huo-wang   

  1. National University of Defense Technology,Changsha 410073,China
  • Received:2000-03-13 Revised:2000-07-05 Online:2001-02-25 Published:2001-02-25

摘要: 本文通过建立各类N阶离散W变换(DWTs)到N阶离散Hartley变换(DHT)的转换,得到了一种利用DHT 统一计算各类DWTs的非常简单的快速算法.该算法结构简单,且每一种转换过程总的运算量均低于5N.

关键词: 离散Hartley变换, 离散W变换, 快速算法

Abstract: A simple fast algorithm by DHT to utilize various DWTs,based on structuring a transform between N-order DWTs and N-order DHT,is proposed here.The algorithm is simple in computational structure and the total number of operations for each transform is less than 5N.

Key words: discrete Hartley transform, discrete W transform, fast algorithm

中图分类号: