Referenced Items are not available for this document.
This paper presents fast algorithms for type-II, type-III, and type-IV generalized discrete Hartley transform. In particular, new odd-factor algorithms are derived to support transforms whose sequence length contains multiple odd factors. By jointly using the odd-factor and radix-2 algorithms, fast computation for arbitrarily composite sequence length can be achieved. Compared to other reported algorithms, the proposed ones have a regular computational structure, achieve a substantial reduction of computational complexity, and support a wider range of choices on the sequence length
Published in:
Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on
(Volume:47
,
Issue:
9
)
Date of Publication: Sep 2000
- Page(s):
- 893 - 901
- ISSN :
- 1057-7130
- INSPEC Accession Number:
- 6726398
- Digital Object Identifier :
- 10.1109/82.868457
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 06 August 2002
- Issue Date :
- Sep 2000
- Sponsored by :
- IEEE Circuits and Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
