Abstract
In the correspondence, a fair comparative analysis of algorithms for the fast Hartley transform (FHT) and the real valued fast Fourier transform (RVFFT) is presented. The complexity analysis and run-time comparisons are conducted and explained simultaneously. The complexity analysis shows great similarity between RVFFT and FHT. The run-time comparisons also show negligible differences, with some small advantages to RVFFT. The influence of the compiler on the execution time may be more significant than the choice of the algorithm. Also, a new and more accurate model for the prediction of execution time of the algorithm is proposed. >
Sign-in/Register to access full text options 
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.
