34. A Factorization Scheme
for Discrete Hartley Transform Matrices
such as the Discrete Fourier Transform or the Discrete Hartley Transform furnish
an indispensable tool in Signal Processing.
The successful application of transform techniques relies on the existence of the so-called fast transforms.
In this paper some fast algorithms are derived which meet the lower bound on the multiplicative complexity of a DFT/DHT.
The approach is based on the factorization of DHT matrices. New algorithms for short block lengths such as N = 3, 5, 6, 12 and 24 are presented.