Abstract
The Fast Hartley Transform (FHT) is similar to the Cooley-Tukey Fast Fourier Transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use of the FHT, Discrete Cosine Transforms (DOT) and Discrete Fourier Transforms (DFT) can be obtained. The recursive nature of the FHT algorithm derived in this paper enables us to generate the next higher-order FHT from two identical lower-order FHTs. In practice, this recursive relationship offers flexibility in programming different sizes of transforms, while the orderly structure of its signal flow graphs indicates an ease of implementation in VSLI.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
