Abstract
One presents a proposition for the application of the Hartley transform, where firstly the foundations of the transform and then a fast algorithm (FHT algorithm) are introduced. On the basis of an one-line machine monitoring system the application of the Hartley transform in order analysis is described. In the transformation of a single real data file into the frequency domain the FHT algorithm is approximately thirty percent faster in execution speed than the Fast Fourier Transform algorithm; the Discrete Fourier transform may then be found by a simple combination of the FHT results
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.
