Abstract
The fixed-point error performance of the various fast Hartley transform (FHT) algorithms have been investigated. Scaling schemes have been proposed for each of the algorithms. However, due to their better error performance, only the decimation-in-time (DIT) FHT algorithms have been examined. The fixed-point error analysis of the radix-4 DIT algorithm is discussed first and is shown to agree closely with the simulation results. These results are then compared with the simulation results for radix-2 and split-radix algorithms. The scaling schemes are then optimised and the simulation results of the three algorithms are compared. It is concluded that the radix-4 DIT algorithm has the best error performance.
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 callMore From: IEE Proceedings - Vision, Image, and Signal Processing
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.
