Referenced Items are not available for this document.
Fast algorithms for computing generalized discrete Hartley transforms in a sliding window are proposed. The algorithms are based on second-order recursive relations between subsequent local transform spectra. New efficient inverse algorithms for signal processing in a sliding window are also presented. The computational complexity of the algorithms is compared with that of known fast discrete Hartley transforms and running recursive algorithms
Published in:
Signal Processing, IEEE Transactions on
(Volume:55
,
Issue:
6
)
Date of Publication: June 2007
- Page(s):
- 2937 - 2944
- ISSN :
- 1053-587X
- INSPEC Accession Number:
- 9472236
- Digital Object Identifier :
- 10.1109/TSP.2007.893960
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 May 2007
- Issue Date :
- June 2007
- Sponsored by :
- IEEE Signal Processing 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.
