摘要
离散Hartley变换(DHT)在数字信号处理中逐渐得到广泛的应用。本文推导了计算DHT的一种快速递归算法,给出了一般信号流图,并与DHT的其他快速算法作了比较。
The Discrete Hartley Transform (DHT) has been finding wide applications in digital signal processing. A fast recursive algorithm for computing the DHT is derived in this paper. The general signal flow graph is given and a comparison of this algorithm is made with other fast algorithms for the DHT.
出处
《数据采集与处理》
CSCD
1992年第2期100-108,共9页
Journal of Data Acquisition and Processing
