Referenced Items are not available for this document.
The Fourier transform can be generalized into the fractional Fourier transform (FRFT), linear canonical transform (LCT), and simplified fractional Fourier transform (SFRFT). They extend the utilities of original Fourier transform, and can solve many problems that can not be solved well by original Fourier transform. We generalize the cosine transform. We derive the fractional cosine transform (FRCT), canonical cosine transform (CCT), and simplified fractional cosine transform (SFRCT). We show that they are very similar to the FRFT, LCT, and SFRFT, but they are much more efficient for dealing with the even, real even functions. For digital implementation, FRCT and CCT can save 1/2 of the real number multiplications, and SFRCT can save 3/4. We also discuss their applications, such as optical system analysis and space-variant pattern recognition
Published in:
Acoustics, Speech, and Signal Processing, 2001. Proceedings. (ICASSP '01). 2001 IEEE International Conference on
(Volume:6
)
Date of Conference: 2001
- Page(s):
- 3545 - 3548 vol.6
- Meeting Date :
- 07 May 2001-11 May 2001
- ISSN :
- 1520-6149
- Print ISBN:
- 0-7803-7041-4
- INSPEC Accession Number:
- 7144887
- Conference Location :
- Salt Lake City, UT
- Digital Object Identifier :
- 10.1109/ICASSP.2001.940607
- Product Type:
- Conference Publications
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.
