一种新的三维离散Hartley变换的分裂基快速算法

A Novel Split-Radix Fast Algorithm for the 3-D Discrete Hartley Transform

离散Hartley变换(Discrete Hartley Transform,DHT)作为实值离散傅立叶变换的一种替代,在信号和图像处理领域已有广泛应用,针对现有三维DHT快速算法均仅能计算长度为2的整数次幂的DHT,本文提出一种适用于更多不同长度三维DHT的分裂基-2/4快速算法,较之将已有最优算法补零计算的方法,该算法有效的降低了计算复杂度.

The discrete Hartley transform has been proposed as an alternative tool suitable for DFT referring real data and has been used in many signal and image processing applications. Because the existed algorithms for three-dimension discrete Hartley transform（3-D DHT）only can compute sequences whose lengths are the m th power of 2（ m is an integer） ,this paper proposes a novel split-radix-2/4 algorithm for the fast computation of 3-D DHT, which provides more flexibility in selecting the sequence length. Moreover, it achieves a large reduction in computational complexity compared to computing by zero padding.