Abstract
An efficient split algorithm for calculating the one-dimensional discrete Hartley transforms, by using a special partitioning in the frequency domain, is introduced. The partition determines a fast paired transform that splits the 2/sup r/-point unitary Hartley transform into a set of 2/sup r-n/-point odd-frequency Hartley transforms, n=1:r. A proposed method of calculation of the 2/sup r/-point Hartley transform requires 2/sup r-1/(r-3)+2 multiplications and 2/sup r-1/(r+9)-r/sup 2/-3r-6 additions.
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.
