Recursive Relations for Complexities of Fast Hartley Transform Algorithms

Abstract

Recursive relations for the number of non-trivial summations and multiplications required for the various fast Hartley transform algorithms are derived. These relations show that Bracewell's decimation-in-time [3] and Meckelburg and Lipka's decimation-in-frequency [5] algorithms are equally fast and slower than the split radix algorithm due to Pei and Wu[1] and Sorensen et al [2].