Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14292
Title: General multifractional Fourier transform method based on the generalized permutation matrix group
Authors: Ran, Q
Yeung, DS
Tsang, ECC
Wang, Q
Keywords: Fourier transforms
Convergence of numerical methods
Eigenvalues and eigenfunctions
Matrix algebra
Signal processing
Issue Date: 2005
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on signal processing, 2005, v. 53, no. 1, p. 83-98 How to cite?
Journal: IEEE transactions on signal processing 
Abstract: The paper studies the possibility of giving a general multiplicity of the fractional Fourier transform (FRFT) with the intention of combining existing finite versions of the FRFT. We introduce a new class of FRFT that includes the conventional fractional Fourier transforms (CFRFTs) and the weighted-type fractional Fourier transforms (WFRFTs) as special cases. The class is structurally well organized because these new FRFTs, which are called general multifractional Fourier transform (GMFRFTs), are related with one another by the Generalized Permutation Matrix Group (GPMG), and their kernels are related with that of CFRFTs as the finite combination by the recursion of matrix. In addition, we have computer simulations of some GMFRFTs on a rectangular function as a simple application of GMFRFTs to signal processing.
URI: http://hdl.handle.net/10397/14292
ISSN: 1053-587X (print)
1941-0476 (online)
DOI: 10.1109/TSP.2004.837397
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

25
Citations as of Feb 12, 2016

WEB OF SCIENCETM
Citations

20
Last Week
0
Last month
0
Citations as of Jun 21, 2017

Page view(s)

28
Last Week
5
Last month
Checked on Jun 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.