A Novel Fast Algorithm for Discrete Hartley Transform of Type-Ⅲ base on the Split-Radix and First-Order Moments

摘要

This paper introduces and evaluates a new algorithm for the computation of type-Ⅲ discrete Hartley transforms (DHT) of length N = 2~n. The length-N type-Ⅲ discrete Hartley transforms can be decomposed into several length-16 type-Ⅲ discrete Hartley transforms based on the radix-2 fast algorithm, and the length-16 type-Ⅲ discrete Hartley transforms can be computed by first- order moments. It can save a lot of arithmetic operations and the computational complexity of the algorithms is lower than some existing methods. Moreover, this algorithm can be easily implemented.