Study about Novel Recursive Algorithm for Realization of One-Dimensional Discrete Hartley Transform

Discrete Hartley transform is an important tool in digital signal processing. This paper presents a novel recursive algorithm for realization of one-dimensional discrete Hartley transform of even length. The transform is created by folding the input data once and then utilising the Chebyshev Polynomial. The data throughput of a single folding technique is two times that of traditional approaches. Compared to some other algorithms, the proposed algorithm achieves savings on the number of additions and multiplications. The recursive algorithms are appropriate for VLSI implementation. Multiplications are more time consuming than additions. Since the number of multiplications in the proposed algorithm are considerably less in comparison with some other structures, saving in time can be achieved by the proposed algorithm in its realization.