Abstract
An efficient radix-3/9 fast Hartley transform (FHT) algorithm is proposed. It shows a great improvement over the previous radix-3 FHT algorithm such that nearly 50% of the number of multiplications is saved. For the computation of real-valued DFTs (discrete Fourier transforms) with sequence lengths which are powers of 3, the proposed radix-3/9 algorithm gives an average of 16.2% reduction in the number of multiplications over the fastest radix-3/9 FFT (fast Fourier transform) algorithm. The improvement is mainly the result of the simplicity of the computing structure of the proposed algorithm and the use of fast length-3 and fast length-9 DHT modules.
| Original language | English |
|---|---|
| Pages (from-to) | 638-641 |
| Number of pages | 4 |
| Journal | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 1 |
| Publication status | Published - 1 Dec 1991 |
| Event | 1991 IEEE International Symposium on Circuits and Systems Part 1 (of 5) - Singapore, Singapore Duration: 11 Jun 1991 → 14 Jun 1991 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Electronic, Optical and Magnetic Materials