A new split radix fast algorithm for the discrete Hartley transform is
presented. Comparisons with other reported algorithms are made in ter
ms of the number of additions and multiplications. The algorithm is al
so simple and straightforward and can be easily implemented.