Abstract
The discrete Hartley transform (DHT) is discussed as a tool for the processing of real signals. Fast Hartley transform (FHT) algorithms which compute the DHT in a time proportional to N log/sub 2/ N exist. In many applications, such as interpolation and convolution of signals, a significant number of zeros are padded to the nonzero valued samples before the transform is computed. It is shown that for such situations, significant savings in the number of additions and multiplications can be obtained by pruning the FHT algorithm. The modifications in the FHT algorithm as a result of pruning are developed and implemented in an FHT subroutine. The amount of savings in the operation is determined. >
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.
