Abstract
Discrete Hartley transform (DHT) is an important tool in digital signal processing. In this paper, based on our previous work of performing DHT via linear sums of discrete moments, we have made development to eliminate multiplications in discrete Hartley transforms by performing appropriate bit operations and shift in binary system, which can be implemented by integer additions of fixed points. An efficient and regular systolic array is designed to implement it, and the complexity analysis is also given. Different to other fast Hartley transforms, our algorithm can deal with arbitrary length signals and get high precision. The approach is also applicable to multi-dimensional DHT and DHT inverses.
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.
