An efficient radix-3/9 fast Hartley transform (FHART) algorithm is proposed. It shows a great improvement over the previous radix-3 FHART algorithm such that nearly 50% of the number of multiplications is saved. For the computation of real-valued discrete Fourier transforms (DFT's) with sequence lengths which are powers of 3, the proposed radix-3/9 algorithm also gives a significant improvement over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm.
ASJC Scopus subject areas
- Signal Processing
- Electrical and Electronic Engineering