Abstract
Based on the prime factor decomposition, this paper presents fast algorithms for type-III generalized discrete Hartley transform (GDHT). When N = p*q, where p and q are mutually prime, the length-N GDHT can be decomposed into p length-q type-III GDHT and q length-p type-III discrete cosine transform (DCT). The proposed algorithms achieve a substantial reduction of the number of additions and multiplications and possess a regular computational structure. In particular, a simple index mapping method is proposed to minimize the overall implementation complexity and cost.
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.
