A split radix algorithm of discrete Hartley transform

The article presents an improved split radix fast algorithm of the discrete Hartley transform which reduces the number of multiplications required by a previously reported split radix algorithm. In comparison with others, the new algorithm uses a minimum number of arithmetic operations, i.e. reducing the total number of multiplications and additions.<>