Algorithm of efficient computation of generalised discrete Hartley transform based on cyclic convolutions

A general method for efficient computation of four types of discrete Hartley transform using cyclic convolutions is considered. Forming hashing arrays on the basis of simplified arguments of basis transform for synthesis of efficient algorithm is analysed. The hashing arrays in the algorithm define partitioning of the harmonic basis into Hankel submatrices. The examples of four types of discrete Hartley transforms using the proposed method are presented.