A fast DSP circuit based on FHT

The discrete Hartley transform (DHT) is a real-valued transform closely related to the discrete Fourier transform (DFT) of a real-valued sequence. Several fast algorithms for the computation of the DHT (FHTs) have been proposed. A new cascade circuit for computing the DHT is presented in two versions, which implement, respectively, the radix-2 decimation-in-time and decimation-in-frequency FHT algorithms. The circuit makes use of CORDIC processors and allows an easy computation of the DFT, the amplitude and phase spectra, and the cyclic convolution and correlation of two sequences. Some architectures to perform such operations are also presented.<
>