Abstract

The authors investigated the implementation aspects of the fast Hartley transform (FHT) in both software and hardware. They describe the modifications required to convert existing fast Fourier transform (FFT) programs to execute FHTs, showing the ease with which these modifications can be implemented. They compare execution time and memory storage requirements of both transforms and present power spectrum calculation and convolution as illustrative examples to compare the performances of the two transform techniques. They also give a comparative survey of the performances of various microprocessors and digital signal processors in FFT and FHT computation. >

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 call

Disclaimer: 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.