New formulation of fast discrete Hartley transform with the minimum number of multiplications

A simple algorithm is proposed to realize a one-dimensional discrete Hartley transform (DHT) with sequence lengths equal to 2^m . This algorithm achieves the same multiplicative complexity as Malvar´s algorithm (1987, 1988) which requires the least number of multiplications reported in the literature. However, the approach gives the advantage of requiring a smaller number of additions compared with the number required in Malvar´s algorithm