论文部分内容阅读
本文给出了二维离散Hartley变换的一个快速算法.本算法在计算过程中按时间抽取逐级进行,不需要中间寄存装置和矩阵转置运算,比[1]的算法,具有更简单的运算结构,易于在计算机中实现。比[2]的向量基算法,在4096×4096点实数列时,可节省32％的乘法运算量,加法运算量稍有减少。
In this paper, a fast algorithm of two-dimensional discrete Hartley transform is given. The algorithm in the calculation process by time extraction step by step, does not require the intermediate storage device and matrix transpose operation than the algorithm [1], with a simpler operation Structure, easy to implement in the computer. Compared with the vector-based algorithm of [2], when the real number sequence is 4096 × 4096 points, the multiplication of 32% can be saved, and the addition amount of operation is slightly reduced.