Fast computation of circular convolution of real valued data using prime factor fast hartley transform algorithm

The paper presents both arithmetic and time complexities involved in the implementation of circular convolution of real valued data using various fast Hartley transform (FHT) algorithms. It is observed that the prime factor FHT (PFFHT) algorithm involves less arithmetic complexity and requires significantly less computation time compared with the radix-2 and split radix FHT algorithms for the implementation of circular convolution. Apart from that, the PFFHT offers closer choices for convolution lengths unlike the radix-2 or split radix algorithms.