Fast radix-3/9 discrete Hartley transform |
| |
| Authors: | Lun DP-K Siu W-C |
| |
| Affiliation: | Dept. of Electr. Eng., Hong Kong Polytech., Kowloon; |
| |
| Abstract: | An efficient algorithm for computing radix-3/9 discrete Hartley transforms (DHTs) is presented. It is shown that the radix-3/9 fast Hartley transform (FHT) algorithm reduces the number of multiplications required by a radix-3 FHT algorithm for nearly 50%. For the computation of real-valued discrete Fourier transforms (DFTs) with sequence lengths that are powers of 3, it is shown that the radix-3/9 FHT algorithm reduces the number of multiplications by 16.2% over the fastest real-valued radix-3/9 fast Fourier transform (FFT) algorithm |
| |
| Keywords: | |
|
|
