Next Article in Journal
A High-Order Numerical Method Based on a Spatial Compact Exponential Scheme for Solving the Time-Fractional Black–Scholes Model
Next Article in Special Issue
Fractional Fourier Series on the Torus and Applications
Previous Article in Journal
Voltage Controller Design for Offshore Wind Turbines: A Machine Learning-Based Fractional-Order Model Predictive Method
Previous Article in Special Issue
Fast Encryption Algorithm Based on Chaotic System and Cyclic Shift in Integer Wavelet Domain
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Discussion on Weighted Fractional Fourier Transform and Its Extended Definitions

1
School of Mathematics and Statistics, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China
2
College of Marxism, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2024, 8(8), 464; https://doi.org/10.3390/fractalfract8080464
Submission received: 22 July 2024 / Revised: 31 July 2024 / Accepted: 3 August 2024 / Published: 7 August 2024

Abstract

The weighted fractional Fourier transform (WFRFT) has always been considered a development of the discrete fractional Fourier transform (FRFT). This paper points out that the WFRFT is a discrete FRFT of eigenvalue decomposition, which will change the consistent understanding of the WFRFT. Extended definitions based on the WFRFT have been proposed and widely used in information processing. This paper proposes a unified framework for extended definitions, and existing extended definitions can serve as special cases of this unified framework. In further analysis, we find that the existing extended definitions are deficient. With the help of a unified framework, we systematically analyze the reasons for the deficiencies. This has great guiding significance for the application of the WFRFT and its extended definitions.

1. Introduction

The fractional Fourier transform (FRFT) can be regarded as a generalization of the Fourier transform (FT). It can not only transform a function from time domain to frequency domain but also to the intermediate domain of any angle. The advantage of doing so is that we can more flexibly choose the angle that is most suitable for observing and analyzing the function. For example, we can use the FRFT to rotate a waveform to the clearest or most ambiguous angle or use the FRFT to rotate a music signal to the easiest or most difficult to identify angle. This characteristic of the FRFT has widened its range of applications. The idea of the FRFT can be traced back to Wiener’s research work in 1929 [1]. It is well known that the characteristic function of the FT is the Hermite–Gauss function, and its eigenvalue is e j n ( π / 2 ) , n Z . Wiener used the FT to construct a transform operator, the characteristic function of which is the same as that of the FT, and the corresponding eigenvalue is e j n α , where α is the fractional multiple of π / 2 . While the transform operator constructed by Wiener is now considered the FRFT, the term FRFT was not used at that time. Subsequent related research is still ongoing [2,3,4]. In 1980, by means of the eigenvalues and eigenfunctions of the FT, Namias first proposed the concept of the FRFT (arbitrary real number) according to the arbitrary power operation of eigenvalues, derived its high-order differential form, and applied it to solve differential equations in quantum mechanics [5]. In this way, the definition of the FRFT is formally determined. With the continuous efforts of researchers, the definition of the FRFT has been further improved, and its physical interpretation and fast discrete algorithm have also been proposed [6,7,8,9]. This leads to strong research interest in this new definition, and the FRFT has become a research hotspot.
In 1995, Shih first proposed the weighted fractional Fourier transform (WFRFT) [10], and its definition is easily extended. Santhanam et al. proposed the discrete FRFT using the rotation angle of the FT [11]. In this paper, our proof shows that it is mathematically equivalent to Shih’s definition. Over the subsequent years, numerous extended definitions have been proposed and extensively used in information security and information processing. Liu et al. proposed the generalized FRFT in 1997, where weighted term parameter k is assigned an integer multiple of 4 and can approach infinity [12,13]. Therefore, the WFRFT can be regarded as a special case of Liu et al.’s definition. Subsequently, Zhu et al. proposed the multifractional Fourier transform (m-FRFT) based on Liu et al.’s definition [14] and applied this algorithm to optical image encryption. This was the first time that the WFRFT had been applied to image encryption after optical encryption with double-random phase encoding [15], which resulted in the development of many image encryption schemes [16,17,18,19,20,21,22,23,24,25]. For example, Tao et al. proposed a multiple parameter fractional Fourier transform (MPFRFT), which is a further extension of Liu et al.’s definition, and this approach was applied to image encryption [16]. The MPFRFT has a larger key space and greatly improves the security of the system. Ran et al. proposed a modified MPFRFT, which has better security [17]. Moreover, similar to the research work [26] of Pei et al., a vector power multiple parameter fractional Fourier transform (VPMPFRFT) was proposed [19] and applied to image encryption to overcome security risks [21]. Recently, we discussed in detail the correlation between the extended definitions of the WFRFT and their security [23].
In signal processing, Ran et al. proposed a new method for analyzing signal sampling and reconstruction using the WFRFT [27,28]. The orthogonal sampling basis of the WFRFT band-limited signal was determined [29,30]. Mei et al. proposed a discrete algorithm that adapts the WFRFT to communication systems and determined modulation and demodulation schemes [31,32]. This further promotes the application of the WFRFT in signal processing. Furthermore, a series of research works were conducted [33,34,35,36,37,38,39,40,41,42,43]; for example, Hui et al. proposed an optimal-order selecting scheme for the 4-WFRFT over doubly selective channels [33]. To ensure the security of the physical layer, the WFRFT system based on a parallel combination spread spectrum was proposed [34,35]. The WFRFT is also used in the design of window filters [36]. Liang et al. proposed a scheme to suppress narrowband interference using the WFRFT domain preprocessing technology [37]. Recently, Li et al. proposed a three-branch transmission scheme using an 8-WFRFT module to improve the bit error rate performance of multiple-input, multiple-output systems with low complexity [40]. The WFRFT is also applied to other research fields, such as image steganography [44], medical image classification [45], breast disease diagnosis [46], and regenerative scanning [47,48].
The wide application of the WFRFT is due to the fact that it is an easy-to-implement discrete FRFT. However, this discrete FRFT is diverse [49,50], and researchers have always classified the WFRFT as an independent discrete algorithm. In this paper, our research shows that the WFRFT is the fractional power of the eigenvalue of the FT. Furthermore, we propose a unified framework; that is, the WFRFT and its extended definitions are special cases of the unified framework. However, we also identify the deficiencies of the extended definitions and analyze the causes of the deficiencies in detail.
The remainder of this paper is organized as follows. The properties and classification of the discrete FRFT are explained in Section 2. The new expressions of the WFRFT and extended definitions are proposed in Section 3. Section 4 proposes a unified framework for the WFRFT. Section 5 discusses the deficiencies of the extended definitions. Finally, the conclusions are presented in Section 6.

2. Discrete Fractional Fourier Transform

The essence of the FT is to represent the signal as the superposition of sinusoidal signals, and the essence of the FRFT is to represent the signal as the superposition of chirp signals. The expression for the FT can be written as follows:
g ( u ) = 1 2 π exp ( i u t ) f ( t ) d t .
Its integral kernel expression is
F π / 2 [ f ( t ) ] = 1 2 π exp ( i u t ) f ( t ) d t .
Its characteristic function expression is
F π / 2 [ ϕ n ( t ) ] = e j n π 2 ϕ n ( u ) .
The characteristic function ϕ n ( t ) = exp ( t 2 / 2 ) H n ( t ) , H n ( t ) = ( 1 ) n e t 2 d n d t n e t 2 . Equation (3) shows that the FT operator acting on the Hermite characteristic function is equivalent to the eigenvalue multiplied by the corresponding characteristic function. Whether the FT is defined in the form of an integral kernel or in the form of a characteristic function, the corresponding operators F π / 2 are the same, where the eigenvalue is e i n π 2 . If the eigenvalues of the FT operator are generalized, that is, the eigenvalue e i n π 2 is changed to e i n α , then we can obtain
F α [ ϕ n ( t ) ] = e i n α ϕ n ( u ) ,
where ( α = p π / 2 ) , and p is an arbitrary real number. Equation (4) has the same characteristic function as the FT. Furthermore, the integral kernel expression of the FRFT is obtained [5,6].
F α [ f ( t ) ] = 1 i cot α 2 π exp ( i cot α 2 t 2 + i cot α 2 u 2 i t u sin α ) f ( t ) d t .
The calculation of the discrete FRFT from Equation (5) is much more complicated than that of the discrete FT, which leads to the diversity of the discrete FRFT. The idealized discrete FRFT needs to satisfy the following criteria:
(a)
Approximation: The discrete FRFT and the continuous FRFT are approximate for signal processing;
(b)
Boundary: F 1 = F , F is the discrete FT operator;
(c)
Unitarity: F p ( F p ) H = I , H denotes conjugate transpose, I is the identity matrix;
(d)
Additivity: F p F q = F p + q ;
(e)
Computation efficiency: The computational complexity of the discrete FRFT should be as low as possible.
In recent years, researchers have proposed a variety of definitions and fast algorithms for the discrete FRFT. Unfortunately, so far, there is no definition that can meet all the above requirements well. At present, the discrete FRFT is divided into three types according to the application requirements [49,50]: (1) sampling type; (2) eigenvalue decomposition type; and (3) weighted type. Our research indicates that the WFRFT is also an eigenvalue decomposition algorithm, which essentially preserves the eigenvector of the FT while the eigenvalues become fractional powers. Next, we will provide a new explanation for the WFRFT and its extended definitions.

3. Weighted Fractional Fourier Transform and Extended Definitions

Researchers have always believed that the WFRFT is an independent discrete FRFT [49,50]. However, the correlation between the WFRFT and the discrete FT has not been clearly explained mathematically. Many extended definitions based on the WFRFT have been proposed, and the inherent connections between these definitions are worth pondering. We will focus on solving these problems in this section.

3.1. Shih’s Weighted Fractional Fourier Transform

In 1995, Shih proposed the WFRFT [10], and in the same year Santhanam et al. also proposed a rotation angle WFRFT [11]. These studies describe different types of FRFT, but our study found that their essence is consistent. Next, we will analyze Shih’s WFRFT in detail. It is defined as follows:
F α [ f ( t ) ] = l = 0 3 A l α f l ( t ) .
Here, f 0 ( t ) = f ( t ) , f 1 ( t ) = F [ f ( t ) ] , f 2 ( t ) = F 2 [ f ( t ) ] , and f 3 ( t ) = F 3 [ f ( t ) ] (F denotes the FT). The weighting coefficient A l α can be expressed as follows:
A l α = cos ( ( α l ) π 4 ) cos ( 2 ( α l ) π 4 ) exp ( 3 ( α l ) i π 4 ) .
We further organize Equation (7) to obtain
A l α = cos ( ( α l ) π 4 ) cos ( 2 ( α l ) π 4 ) exp ( 3 ( α l ) i π 4 ) = 1 2 × [ exp ( ( α l ) π i 4 ) + exp ( ( α l ) π i 4 ) ] × 1 2 × [ exp ( 2 ( α l ) π i 4 ) + exp ( 2 ( α l ) π i 4 ) ] × exp ( 3 ( α l ) i π 4 ) = 1 4 ( 1 + exp ( 2 ( α l ) π i 4 ) + exp ( 4 ( α l ) π i 4 ) + exp ( 6 ( α l ) π i 4 ) ) = 1 4 k = 0 3 exp ( 2 π i 4 ( α l ) k )
Equation (8) can also be written as the result of summation:
A l α = 1 4 1 exp ( 2 π i ( α l ) ) 1 exp ( ( 2 π i ( α l ) ) / 4 ) .
We continue to organize Equation (8) to obtain
A l α = 1 4 k = 0 3 exp ( 2 π i 4 ( α l ) k ) = 1 4 k = 0 3 exp ( 2 π i α k 4 + 2 π i l k 4 ) = 1 4 k = 0 3 exp ( 2 π i l k 4 ) exp ( 2 π i α k 4 ) = I D F T [ exp ( 2 π i α k 4 ) ] k = 0 , 1 , 2 , 3
where l = 0 , 1 , 2 , 3 , and IDFT denotes the inverse discrete FT. Equation (6) can therefore be expressed as follows:
F α [ f ( x ) ] = 1 4 l = 0 3 k = 0 3 exp [ 2 π i k ( α l ) 4 ] f l ( x ) = 1 4 l = 0 3 k = 0 3 exp ( 2 π i k l 4 ) exp ( 2 π i k α 4 ) f l ( x ) = 1 4 I D F T ( B 0 α B 1 α B 2 α B 3 α ) ( F 0 F 1 F 2 F 3 ) f ( x ) = 1 4 ( 1 1 1 1 1 i 1 i 1 1 1 1 1 i 1 i ) ( B 0 α B 1 α B 2 α B 3 α ) ( F 0 F 1 F 2 F 3 ) f ( x ) = 1 4 ( F 0 F 1 F 2 F 3 ) ( 1 1 1 1 1 i 1 i 1 1 1 1 1 i 1 i ) ( B 0 α B 1 α B 2 α B 3 α ) f ( x ) = 1 4 ( Y 0 , Y 1 , Y 2 , Y 3 ) ( B 0 α B 1 α B 2 α B 3 α ) f ( t )
Here, B k α = exp ( 2 π i k α 4 ) ; k = 0 , 1 , 2 , 3 , and
{ Y 0 = I + F + F 2 + F 3 Y 1 = I + i F F 2 i F 3 Y 2 = I F + F 2 F 3 Y 3 = I i F F 2 + i F 3
We know that the discrete FT can be expressed as follows:
F = V D V T ,
where D is the eigenvalue and V is the eigenvector. The eigenvalues of the FT are 1, i, −1, and −i. Then, Equation (13) can also be written as follows:
F = k E 1 ( 1 ) v k v k T + k E 2 ( i ) v k v k T + k E 3 ( 1 ) v k v k T + k E 4 ( i ) v k v k T .
Here, V = [ v 0 , v 1 , , v N 1 ] , v k is the eigenvector and E 1 , E 2 , E 3 , and E 4 represent the set of eigenvectors corresponding to the eigenvalues, respectively. Therefore, we can obtain
F 2 = F F = ( V D V T ) ( V D V T ) = V D 2 V T = k E 1 ( 1 ) 2 v k v k T + k E 2 ( i ) 2 v k v k T + k E 3 ( 1 ) 2 v k v k T + k E 4 ( i ) 2 v k v k T = k E 1 ( 1 ) v k v k T + k E 2 ( 1 ) v k v k T + k E 3 ( 1 ) v k v k T + k E 4 ( 1 ) v k v k T
F 3 = F F F = k E 1 ( 1 ) 3 v k v k T + k E 2 ( i ) 3 v k v k T + k E 3 ( 1 ) 3 v k v k T + k E 4 ( i ) 3 v k v k T = k E 1 ( 1 ) v k v k T + k E 2 ( i ) v k v k T + k E 3 ( 1 ) v k v k T + k E 4 ( i ) v k v k T
F 0 = F 4 = k E 1 ( 1 ) 4 v k v k T + k E 2 ( i ) 4 v k v k T + k E 3 ( 1 ) 4 v k v k T + k E 4 ( i ) 4 v k v k T = k E 1 ( 1 ) v k v k T + k E 2 ( 1 ) v k v k T + k E 3 ( 1 ) v k v k T + k E 4 ( 1 ) v k v k T
The results of Equation (12) are obtained
{ Y 0 = F 0 + F + F 2 + F 3 = k E 1 4 v k v k T Y 1 = F 0 + i F F 2 i F 3 = k E 4 4 v k v k T Y 2 = F 0 F + F 2 F 3 = k E 3 4 v k v k T Y 3 = F 0 i F F 2 + i F 3 = k E 2 4 v k v k T
We know that B k α = exp ( 2 π i k α 4 ) ; k = 0 , 1 , 2 , 3 ,
( B 0 α B 1 α B 2 α B 3 α ) = ( ( 1 ) α ( i ) α ( 1 ) α ( i ) α )
Finally, the WFRFT is represented as follows:
F α = 1 4 ( Y 0 , Y 1 , Y 2 , Y 3 ) ( B 0 α B 1 α B 2 α B 3 α ) = 1 4 ( Y 0 B 0 α + Y 1 B 1 α + Y 2 B 2 α + Y 3 B 3 α ) = k E 1 ( 1 ) α v k v k T + k E 4 ( i ) α v k v k T + k E 3 ( 1 ) α v k v k T + k E 2 ( i ) α v k v k T
We rephrased the definition of Shih. However, there is another representation of the weighted coefficient of Equation (7), as shown in Equation (21):
A l α = cos ( ( α l ) π 4 ) cos ( 2 ( α l ) π 4 ) exp ( 3 ( α l ) i π 4 ) .
This expression is equivalent to the above result, and we will prove it here. Furthermore, we can obtain
A l α = cos ( ( α l ) π 4 ) cos ( 2 ( α l ) π 4 ) exp ( 3 ( α l ) i π 4 ) = 1 2 × [ exp ( ( α l ) π i 4 ) + exp ( ( α l ) π i 4 ) ] × 1 2 × [ exp ( 2 ( α l ) π i 4 ) + exp ( 2 ( α l ) π i 4 ) ] × exp ( 3 ( α l ) i π 4 ) = 1 4 ( 1 + exp ( 2 ( α l ) π i 4 ) + exp ( 4 ( α l ) π i 4 ) + exp ( 6 ( α l ) π i 4 ) ) = 1 4 k = 0 3 exp ( 2 π i 4 ( α l ) k ) = 1 4 k = 0 3 exp ( 2 π i l k 4 + 2 π i α k 4 ) = 1 4 k = 0 3 exp ( 2 π i l k 4 ) exp ( 2 π i α k 4 ) = D F T [ exp ( 2 π i α k 4 ) ] k = 0 , 1 , 2 , 3
where DFT is a discrete FT, and l = 0 , 1 , 2 , 3 . The WFRFT (Equation (6)) can be expressed as follows:
F α [ f ( t ) ] = 1 4 l = 0 3 k = 0 3 exp [ 2 π i k ( α l ) 4 ] f l ( t ) = 1 4 l = 0 3 k = 0 3 exp ( 2 π i k l 4 ) exp ( 2 π i k α 4 ) f l ( t ) = 1 4 D F T ( B 0 α B 1 α B 2 α B 3 α ) ( F 0 F 1 F 2 F 3 ) f ( t ) = 1 4 ( 1 1 1 1 1 i 1 i 1 1 1 1 1 i 1 i ) ( B 0 α B 1 α B 2 α B 3 α ) ( F 0 F 1 F 2 F 3 ) f ( t ) = 1 4 ( F 0 F 1 F 2 F 3 ) ( 1 1 1 1 1 i 1 i 1 1 1 1 1 i 1 i ) ( B 0 α B 1 α B 2 α B 3 α ) f ( t ) = 1 4 ( Y 0 , Y 1 , Y 2 , Y 3 ) ( B 0 α B 1 α B 2 α B 3 α ) f ( t )
where B k α = exp ( 2 π i k α 4 ) ; k = 0 , 1 , 2 , 3 . Let
{ Y 0 = I + F + F 2 + F 3 = k E 1 4 v k v k T Y 1 = I i F F 2 + i F 3 = k E 2 4 v k v k T Y 2 = I F + F 2 F 3 = k E 3 4 v k v k T Y 3 = I + i F F 2 i F 3 = k E 4 4 v k v k T
and
( B 0 α B 1 α B 2 α B 3 α ) = ( ( 1 ) α ( i ) α ( 1 ) α ( i ) α )
Then, Equation (23) can be written as follows:
F α = 1 4 ( Y 0 , Y 1 , Y 2 , Y 3 ) ( B 0 α B 1 α B 2 α B 3 α ) = 1 4 ( Y 0 B 0 α + Y 1 B 1 α + Y 2 B 2 α + Y 3 B 3 α ) = k E 1 ( 1 ) α v k v k T + k E 2 ( i ) α v k v k T + k E 3 ( 1 ) α v k v k T + k E 4 ( i ) α v k v k T
Thus, from the two weighted coefficients of Equations (7) and (21), the expression of the WFRFT is consistent.
Through the above theoretical derivation, we obtain the eigenvalues and eigenvectors of the WFRFT as shown in Equations (20) and (26); that is, the eigenvectors of the FT are retained, and the eigenvalues become fractional powers. Equations (20) and (26) can be further expressed as follows:
F α = V D α V T .
The WFRFT is, in fact, the eigenvalue decomposition type of the discrete FRFT.

3.2. Zhu et al.’s Multifractional Fourier Transform

In 2000, based on existing studies [12,13], Zhu et al. further proposed an extended definition of the WFRFT and applied to image encryption [14]. It is defined as follows:
F M α [ f ( t ) ] = l = 0 M 1 A l α f l ( t ) .
Here, f l ( t ) = F 4 l / M [ f ( t ) ] , and the weighting coefficient A l α is
A l α = 1 M k = 0 M 1 exp [ 2 π i k ( α l ) M ] .
This definition extends from four weighted terms to a more general case. The definition of Zhu et al. can be extended to a series of new definitions, which can be realized only by changing Equation (29). For example, in 2008, Tao et al. proposed the MPFRFT [16], which is defined as follows:
F M α ( M , N ) [ f ( t ) ] = l = 0 M 1 A l ( α , M , N ) f l ( t ) .
Here, f l ( t ) = F 4 l / M [ f ( t ) ] , and the weighting coefficient A l ( α , M , N ) is
A l ( α , M , N ) = 1 M k = 0 M 1 exp { 2 π i M [ ( m k M + 1 ) α ( k + n k M ) l k ] } ,
M = ( m 0 , m 1 , , m M 1 ) M ,   N = ( n 0 , n 1 , , n M 1 ) M .
Subsequently, Ran et al. proposed a modified MPFRFT with better security [17], which is defined as follows:
F M α ( ) [ f ( t ) ] = l = 0 M 1 A l ( α , ) f l ( t ) .
Here, f l ( t ) = F 4 l / M [ f ( t ) ] , and the weighting coefficient A l ( α , ) is
A l ( α , ) = 1 M k = 0 M 1 exp { 2 π i M [ α ( k + r k M ) l k ] } ,
= ( r 0 , r 1 , , r ( M 1 ) ) M .
The value of the parameter can be a real number, which theoretically improves the security of the system for image encryption.
In 2014, Ran et al. further proposed the VPMPFRFT [19], which can be expressed as follows:
F M α ¯ ( ) [ f ( t ) ] = l = 0 M 1 A l ( α ¯ , ) f l ( t ) .
Here, f l ( t ) = F 4 l / M [ f ( t ) ] , and the weighting coefficient A l ( α ¯ , ) is
A l ( α ¯ , ) = 1 M k = 0 M 1 exp { 2 π i M [ α k ( k + r k M ) l k ] } ,
α ¯ = ( α 0 , α 1 , , α M 1 ) M , = ( r 0 , r 1 , , r M 1 ) M .
The change in weighting coefficient can bring us a new definition. These definitions are mainly applied in image encryption to improve security. Next, we analyze the correlation between these definitions.
First, Equation (29) can be written as follows:
A l α = 1 M k = 0 M 1 exp [ 2 π i k ( α l ) M ] = 1 M k = 0 M 1 exp ( 2 π i k l M ) exp ( 2 π i k α M ) = I D F T [ e ( 2 π i α k / M ) ] k = 0 , 1 , 2 , , M 1
Then, we can obtain
( A 0 α A 1 α A M 1 α ) = 1 M ( w 0 × 0 w 0 × 1 w 0 × ( M 1 ) w 1 × 0 w 1 × 1 w 1 × ( M 1 ) w ( M 1 ) × 0 w ( M 1 ) × 1 w ( M 1 ) × ( M 1 ) ) ( B 0 α B 1 α B M 1 α ) ,
where w = e 2 π i / M and B k α = exp ( 2 π i k α M ) , k = 0 , 1 , , M 1 . Therefore, Equation (28) can be expressed as follows:
F M α [ f ( t ) ] = A 0 α f 0 ( t ) + A 1 α f 1 ( t ) + + A M 1 α f M 1 ( t ) = A 0 α F 0 / M [ f ( t ) ] + A 1 α F 4 / M [ f ( t ) ] + + A M 1 α F 4 ( M 1 ) / M [ f ( t ) ] = ( I , F 4 / M , , F 4 ( M 1 ) / M ) ( A 0 α A 1 α A M 1 α ) f ( t ) = 1 M ( I , F 4 / M , , F 4 ( M 1 ) / M ) ( w 0 × 0 w 0 × 1 w 0 × ( M 1 ) w 1 × 0 w 1 × 1 w 1 × ( M 1 ) w ( M 1 ) × 0 w ( M 1 ) × 1 w ( M 1 ) × ( M 1 ) ) ( B 0 α B 1 α B M 1 α ) f ( t )
In this way, Zhu et al.’ s m-FRFT is expressed as Equation (38). When B k α takes different results, we can obtain different extended definitions. Thus, Equation (31) can be rewritten as follows:
A l ( α , M , N ) = 1 M k = 0 M 1 exp { 2 π i M [ ( m k M + 1 ) α ( k + n k M ) l k ] } = 1 M k = 0 M 1 exp ( 2 π i l k M ) exp { 2 π i M [ ( m k M + 1 ) α ( k + n k M ) ] } = I D F T [ exp { 2 π i M [ ( m k M + 1 ) α ( k + n k M ) ] } ] k = 0 , 1 , 2 , , M 1
Here, if we make
B k α = exp [ 2 π i ( m k M + 1 ) α ( n k M + k ) M ] .
Substituting Equation (40) into Equation (38), we can obtain the MPFRFT. Equation (33) can be rewritten as follows:
A l ( α , ) = 1 M k = 0 M 1 exp { 2 π i M [ α ( k + r k M ) l k ] } = 1 M k = 0 M 1 exp ( 2 π i l k M ) exp { 2 π i M [ α ( k + r k M ) ] } = I D F T [ exp { 2 π i M [ α ( k + r k M ) ] } ] k = 0 , 1 , 2 , , M 1
Here, if we make
B k α = exp { 2 π i M [ α ( k + r k M ) ] } .
Substituting Equation (42) into Equation (38), we can obtain the modified MPFRFT. Equation (35) can be rewritten as follows:
A l ( α ¯ , ) = 1 M k = 0 M 1 exp { 2 π i M [ α k ( k + r k M ) l k ] } = 1 M k = 0 M 1 exp ( 2 π i l k M ) exp { 2 π i M [ α k ( k + r k M ) ] } = I D F T [ exp { 2 π i M [ α k ( k + r k M ) ] } ] k = 0 , 1 , 2 , , M 1
Here, if we make
B k α = exp [ 2 π i α k ( r k M + k ) M ] .
Substituting Equation (42) into Equation (38), we can obtain the VPMPFRFT.
In this way, we propose a new expression that can establish relationships between extended definitions.

3.3. Yeh et al.’s Discrete Fractional Fourier Transform

In 2003, Yeh et al. proposed a new computational method for the discrete FRFT [51], which can be defined as follows:
F α = n = 0 N 1 B n , α F n b ,
where b = 4 / N . The weighting coefficients B n , α are computed as follows:
B n , α = I D F T [ e i k ( π / 2 ) α ] k = 1 N 1 e i N ( π / 2 ) ( n b α ) 1 e i ( π / 2 ) ( n b α ) .
Comparing Equation (36), it can be clearly seen that Yeh et al.’s definition is very similar to Zhu et al.’s definition, except that the result of I D F T [ ] is different. There are also extended definitions proposed from Yeh et al.’s definition.
In 2010, Tao et al. modified Yeh et al.’s definition and proposed a fractional-order definition for periodic matrices [52]. If a matrix L satisfies L P = I , then we call L a periodic matrix with period P . Then, its fractional-order definition can be expressed as follows:
L α = n = 0 N 1 C n , α L n ( P / N ) ,
where
C n , α = 1 N 1 e j 2 π ( n α ) 1 e j ( 2 π / N ) ( n α ) .
Equation (48) can be further expressed as follows:
C n , α = 1 N k = 0 N 1 exp [ j ( 2 π / N ) ( n α ) k ] = 1 N k = 0 N 1 exp [ j ( 2 π / N ) n k ] exp [ j ( 2 π / N ) α k ] = I D F T { exp [ j ( 2 π / N ) α k ] } n = 0 , 1 , , N 1
In this way, Equation (49) is very similar to our results above. In 2016, Kang et al. conducted an in-depth analysis of Tao et al.’s definition and proposed a new extended definition [53], which can be expressed as follows:
L α ¯ = n = 0 N 1 C n , α n L n ( P / N ) ,
where
C n , α n = 1 N 1 exp [ j 2 π ( n α n ) ] 1 exp [ j ( 2 π / N ) ( n α n ) ] .
Equation (51) can be further expressed as follows:
C n , α n = 1 N k = 0 N 1 exp [ j ( 2 π / N ) ( n α n ) k ] = 1 N k = 0 N 1 exp [ j ( 2 π / N ) n k ] exp [ j ( 2 π / N ) α n k ] = I D F T { exp [ j ( 2 π / N ) α n k ] } n = 0 , 1 , , N 1
Referring to our work in Section 3.1, we can also provide a new reconstruction, which can be represented as follows:
L α ¯ = n = 0 N 1 C n , α n L n ( P / N ) = ( L 0 , L P / N , , L P ( N 1 ) / N ) ( C 0 , α n C 1 , α n C N 1 , α n ) = 1 N ( L 0 , L P / M , , L P ( N 1 ) / N ) ( w 0 × 0 w 0 × 1 w 0 × ( N 1 ) w 1 × 0 w 1 × 1 w 1 × ( N 1 ) w ( N 1 ) × 0 w ( N 1 ) × 1 w ( N 1 ) × ( N 1 ) ) ( e ( 2 π i α 0 0 / N ) e ( 2 π i α 1 1 / N ) e ( 2 π i α N 1 ( N 1 ) / N ) ) .
where w = e 2 π i / M . Let
{ G 0 = w 0 × 0 L 0 + w 1 × 0 L P N + + w ( N 1 ) × 0 L P ( N 1 ) N G 1 = w 0 × 1 L 0 + w 1 × 1 L P N + + w ( N 1 ) × 1 L P ( N 1 ) N G N 1 = w 0 × ( N 1 ) L 0 + w 1 × ( N 1 ) L P M + + w ( N 1 ) × ( N 1 ) L P ( N 1 ) N
Equation (53) can be expressed as follows:
L α ¯ = n = 0 N 1 G n B n α n ,
where B n α n = exp ( 2 π i α n n / N ) . Therefore, we provide a new expression for Kang et al.’s definition. In this way, many extended definitions [53] can be reformulated.
For Equation (55), when the periodic matrix is the discrete FT and B n α n = exp [ j ( π / 2 ) α n n ] , the result is the MPDFRFT.
For Equation (55), when the periodic matrix is the discrete cosine transform, and B n α n = exp ( j π α n n ) , the result is the multiple parameter discrete fractional cosine transform (MPDFRCT).
For Equation (55), when the periodic matrix is discrete sine transform, and B n α n = exp ( j π α n n ) , the result is the multiple parameter discrete fractional sine transforms (MPDFRST).
For Equation (55), when the periodic matrix is discrete Hartley transform, and B n α n = exp ( j π α n n ) , the result is multiple parameter discrete fractional Hartley transforms (MPDFRHT).
For Equation (55), when the periodic matrix is discrete Hadamard transform, and B n α n = exp ( j π α n n ) , the result is multiple parameter discrete fractional Hadamard transforms (MPDFRHT).
The definitions of Yeh et al. and Tao et al. can also serve as special cases for the new expression. The new expression proposed in this section is very similar to that in Section 3.2, so we provide a unified framework for the extended definitions.

4. Unified Framework

In this section, we will establish a unified framework with the help of the analysis of various extended definitions in Section 3. Let T denote a periodic matrix (strictly speaking, the matrix should be symmetrical) and T P = I ( P is the period of the matrix T , and I denotes the identity matrix). The unified framework can be expressed as follows:
T α ¯ = 1 M ( T 0 , T P / M , , T P ( M 1 ) / M ) ( w 0 × 0 w 0 × 1 w 0 × ( M 1 ) w 1 × 0 w 1 × 1 w 1 × ( M 1 ) w ( M 1 ) × 0 w ( M 1 ) × 1 w ( M 1 ) × ( M 1 ) ) ( B 0 α 0 B 1 α 1 B M 1 α M 1 ) ,
where w = e 2 π i / M , and when B k α k takes different values, we can obtain different definitions.
For example, in the definition of Shih, the periodic matrix is the FT ( T = F ), and the period of the FT matrix P = 4 . When M = 4 , α 0 = α 1 = α 2 = α 3 = α and B k α k = exp ( 2 π i α k 4 ) ; k = 0 , 1 , 2 , 3 , and we obtain the WFRFT of Shih.
Furthermore, if M is an integer greater than 4, α 0 = α 1 = = α M 1 = α and B k α k = exp ( 2 π i α k M ) ; k = 0 , 1 , 2 , , M 1 , and we obtain Zhu et al.‘s m-FRFT [14]. In Zhu et al.’s definition, when B k α k = exp [ 2 π i ( m k M + 1 ) α ( n k M + k ) M ] , we obtain Tao et al.’s MPFRFT [16]. When B k α k = exp { 2 π i M [ α ( r k M + k ) ] } , we obtain Ran et al.’s modified MPFRFT [17]. When B k α k = exp [ 2 π i α k ( r k M + k ) M ] , we obtain Ran et al.’s VPMPFRFT [19].
In Equation (56), when T is the FT matrix, M is an integer greater than 4, α 0 = α 1 = = α M 1 = α and B k α k = exp [ j k ( π / 2 ) α ] . Therefore, we obtain the discrete FRFT of Yeh et al. in Section 3.3. When T is a periodic matrix, α 0 = α 1 = = α M 1 = α , and B k α k = exp [ j ( 2 π / M ) α k ] , we can obtain the definition of Tao et al. If B k α k = exp [ j ( 2 π / M ) α k k ] , then we obtain the definition of Kang et al.
Therefore, the WFRFT and extended definitions in Section 3.1 and Section 3.2 are special cases of the unified framework.

5. Discussion

In this section, we will use the unified framework to provide a detailed proof of the deficiencies of extended definitions as well as discuss and analyze their impact on the algorithm.

5.1. Deficiency of the Extended Definition (I)

Firstly, we determine that the extended definition based on the WFRFT has only four effective weighting terms.
In Section 4, in our proposed unified framework, when α ¯ = α , M = 4 , T = F , B k α = exp ( 2 π i α k 4 ) , and k = 0 , 1 , 2 , 3 , the transform is considered a WFRFT. When M is an integer greater than 4 and B k α = exp ( 2 π i k α M ) , k = 0 , 1 , , M 1 , the extended definition applies. We take M = 5 as an example for analysis, and its expression can be written as follows:
F 5 α [ f ( x ) ] = 1 5 ( F 0 F 4 5 F 16 5 ) ( w 0 × 0 w 0 × 1 w 0 × 4 w 1 × 0 w 1 × 1 w 1 × 4 w 4 × 0 w 4 × 1 w 4 × 4 ) ( B 0 α B 1 α B 4 α ) f ( x ) ,
where w = e 2 π i / 5 and B k α = exp ( 2 π i k α 5 ) ; k = 0 , 1 , , 4 . Equation (57) can also be written as follows:
F α = 1 5 ( Y 0 Y 1 Y 2 Y 3 Y 4 ) ( B 0 α B 1 α B 2 α B 3 α B 4 α ) = 1 5 ( Y 0 B 0 α + Y 1 B 1 α + Y 2 B 2 α + Y 3 B 3 α + Y 4 B 4 α )
Let
{ Y 0 = w 0 × 0 F 0 + w 1 × 0 F 4 5 + + w 4 × 0 F 16 5 Y 1 = w 0 × 1 F 0 + w 1 × 1 F 4 5 + + w 4 × 1 F 16 5 Y 2 = w 0 × 2 F 0 + w 1 × 2 F 4 5 + + w 4 × 2 F 16 5 Y 3 = w 0 × 3 F 0 + w 1 × 3 F 4 5 + + w 4 × 3 F 16 5 Y 4 = w 0 × 4 F 0 + w 1 × 4 F 4 5 + + w 4 × 4 F 16 5
From Equation (20), we know that
{ F 0 = k E 1 ( 1 ) 0 v k v k T + k E 2 ( i ) 0 v k v k T + k E 3 ( 1 ) 0 v k v k T + k E 4 ( i ) 0 v k v k T , F 4 / 5 = k E 1 ( 1 ) 4 / 5 v k v k T + k E 2 ( i ) 4 / 5 v k v k T + k E 3 ( 1 ) 4 / 5 v k v k T + k E 4 ( i ) 4 / 5 v k v k T , F 8 / 5 = k E 1 ( 1 ) 8 / 5 v k v k T + k E 2 ( i ) 8 / 5 v k v k T + k E 3 ( 1 ) 8 / 5 v k v k T + k E 4 ( i ) 8 / 5 v k v k T , F 12 / 5 = k E 1 ( 1 ) 12 / 5 v k v k T + k E 2 ( i ) 12 / 5 v k v k T + k E 3 ( 1 ) 12 / 5 v k v k T + k E 4 ( i ) 12 / 5 v k v k T , F 16 / 5 = k E 1 ( 1 ) 16 / 5 v k v k T + k E 2 ( i ) 16 / 5 v k v k T + k E 3 ( 1 ) 16 / 5 v k v k T + k E 4 ( i ) 16 / 5 v k v k T .
Equation (60) is substituted into Equation (59), and we obtain
{ Y 0 = k E 1 5 v k v k T Y 1 = 0 Y 2 = k E 4 5 v k v k T Y 3 = k E 3 5 v k v k T Y 4 = k E 2 5 v k v k T
Thus, Equation (58) is written as follows:
F α = 1 5 ( Y 0 Y 1 Y 2 Y 3 Y 4 ) ( B 0 α B 1 α B 2 α B 3 α B 4 α ) = 1 5 ( Y 0 B 0 α + Y 1 B 1 α + Y 2 B 2 α + Y 3 B 3 α + Y 4 B 4 α ) = k E 1 B 0 α v k v k T + k E 4 B 2 α v k v k T + k E 3 B 3 α v k v k T + k E 2 B 4 α v k v k T
In Equation (62), there are only four effective weighting terms. Next, we will verify the extended definition of M = 6 , and based on the previous results, we can directly obtain Equation (63),
{ Y 0 = w 0 × 0 F 0 + w 1 × 0 F 4 6 + + w 5 × 0 F 20 6 Y 1 = w 0 × 1 F 0 + w 1 × 1 F 4 6 + + w 5 × 1 F 20 6 Y 2 = w 0 × 2 F 0 + w 1 × 2 F 4 6 + + w 5 × 2 F 20 6 Y 3 = w 0 × 3 F 0 + w 1 × 3 F 4 6 + + w 5 × 3 F 20 6 Y 4 = w 0 × 4 F 0 + w 1 × 4 F 4 6 + + w 5 × 4 F 20 6 Y 5 = w 0 × 5 F 0 + w 1 × 5 F 4 6 + + w 5 × 5 F 20 6
From Equation (20), we know that
{ F 0 = k E 1 ( 1 ) 0 v k v k T + k E 2 ( i ) 0 v k v k T + k E 3 ( 1 ) 0 v k v k T + k E 4 ( i ) 0 v k v k T , F 4 / 6 = k E 1 ( 1 ) 4 / 6 v k v k T + k E 2 ( i ) 4 / 6 v k v k T + k E 3 ( 1 ) 4 / 6 v k v k T + k E 4 ( i ) 4 / 6 v k v k T , F 8 / 6 = k E 1 ( 1 ) 8 / 6 v k v k T + k E 2 ( i ) 8 / 6 v k v k T + k E 3 ( 1 ) 8 / 6 v k v k T + k E 4 ( i ) 8 / 6 v k v k T , F 12 / 6 = k E 1 ( 1 ) 12 / 6 v k v k T + k E 2 ( i ) 12 / 6 v k v k T + k E 3 ( 1 ) 12 / 6 v k v k T + k E 4 ( i ) 12 / 6 v k v k T , F 16 / 6 = k E 1 ( 1 ) 16 / 6 v k v k T + k E 2 ( i ) 16 / 6 v k v k T + k E 3 ( 1 ) 16 / 6 v k v k T + k E 4 ( i ) 16 / 6 v k v k T , F 20 / 6 = k E 1 ( 1 ) 20 / 6 v k v k T + k E 2 ( i ) 20 / 6 v k v k T + k E 3 ( 1 ) 20 / 6 v k v k T + k E 4 ( i ) 20 / 6 v k v k T .
Substituting Equation (64) into Equation (63), we can obtain
{ Y 0 = k E 1 6 v k v k T Y 1 = 0 Y 2 = 0 Y 3 = k E 4 6 v k v k T Y 4 = k E 3 6 v k v k T Y 5 = k E 2 6 v k v k T
In this way, the extension definition is written as follows:
F α = 1 6 ( Y 0 Y 1 Y 2 Y 3 Y 4 Y 5 ) ( B 0 α B 1 α B 2 α B 3 α B 4 α B 5 α ) = 1 6 ( Y 0 B 0 α + Y 1 B 1 α + Y 2 B 2 α + Y 3 B 3 α + Y 4 B 4 α + Y 5 B 5 α ) = k E 1 B 0 α v k v k T + k E 4 B 3 α v k v k T + k E 3 B 4 α v k v k T + k E 2 B 5 α v k v k T
Equation (66) indicates that there are only four effective weighting terms.
Furthermore, we provide proof of the extended definition in its general form. Its expression can be written as follows:
F M α [ f ( t ) ] = 1 M ( I , F 4 M , , F 4 ( M 1 ) M ) ( w 0 × 0 w 0 × 1 w 0 × ( M 1 ) w 1 × 0 w 1 × 1 w 1 × ( M 1 ) w ( M 1 ) × 0 w ( M 1 ) × 1 w ( M 1 ) × ( M 1 ) ) ( B 0 α B 1 α B M 1 α ) f ( t ) . = 1 M ( Y 0 , Y 1 , , Y M 1 ) ( B 0 α B 1 α B M 1 α ) f ( t ) = 1 M k = 0 M 1 Y k B k α f ( t )
where w = e 2 π i / M and B k α = exp ( 2 π i k α M ) ; k = 0 , 1 , , M 1 .
{ Y 0 = w 0 × 0 I + w 1 × 0 F 4 M + + w ( M 1 ) × 0 F 4 ( M 1 ) M Y 1 = w 0 × 1 I + w 1 × 1 F 4 M + + w ( M 1 ) × 1 F 4 ( M 1 ) M Y 2 = w 0 × 2 I + w 1 × 2 F 4 M + + w ( M 1 ) × 2 F 4 ( M 1 ) M Y M 1 = w 0 × ( M 1 ) I + w 1 × ( M 1 ) F 4 M + + w ( M 1 ) × ( M 1 ) F 4 ( M 1 ) M
and
{ F 0 = k E 1 ( 1 ) 0 v k v k T + k E 2 ( i ) 0 v k v k T + k E 3 ( 1 ) 0 v k v k T + k E 4 ( i ) 0 v k v k T , F 4 / M = k E 1 ( 1 ) 4 / M v k v k T + k E 2 ( i ) 4 / M v k v k T + k E 3 ( 1 ) 4 / M v k v k T + k E 4 ( i ) 4 / M v k v k T , F 8 / M = k E 1 ( 1 ) 8 / M v k v k T + k E 2 ( i ) 8 / M v k v k T + k E 3 ( 1 ) 8 / M v k v k T + k E 4 ( i ) 8 / M v k v k T , F 4 ( M 2 ) / M = k E 1 ( 1 ) 4 ( M 2 ) / M v k v k T + k E 2 ( i ) 4 ( M 2 ) / M v k v k T + k E 3 ( 1 ) 4 ( M 2 ) / M v k v k T + k E 4 ( i ) 4 ( M 2 ) / M v k v k T , F 4 ( M 1 ) / M = k E 1 ( 1 ) 4 ( M 1 ) / M v k v k T + k E 2 ( i ) 4 ( M 1 ) / M v k v k T + k E 3 ( 1 ) 4 ( M 1 ) / M v k v k T + k E 4 ( i ) 4 ( M 1 ) / M v k v k T .
Equations (68) and (69) are simplified as follows:
Y k = w 0 × k F 0 + w 1 × k F 4 M + + w ( M 1 ) × k F 4 ( M 1 ) M
and
F 4 l / M = j E 1 ( 1 ) 4 l / M v j v j T + j E 2 ( i ) 4 l / M v j v j T + j E 3 ( 1 ) 4 l / M v j v j T + j E 4 ( i ) 4 l / M v j v j T .
Equation (71) can be further written as follows:
F 4 l / M = ( 1 1 1 1 ) ( j E 1 ( 1 ) 4 l / M v j v j T j E 2 ( i ) 4 l / M v j v j T j E 3 ( 1 ) 4 l / M v j v j T j E 4 ( i ) 4 l / M v j v j T ) .
Substituting Equation (72) into Equation (70), we obtain
Y k = w 0 × k F 0 + w 1 × k F 4 M + + w ( M 1 ) × k F 4 ( M 1 ) M = ( 1 1 1 1 ) ( j E 1 ( 1 ) 0 v j v j T j E 2 ( i ) 0 v j v j T j E 3 ( 1 ) 0 v j v j T j E 4 ( i ) 0 v j v j T ) w 0 × k + ( 1 1 1 1 ) ( j E 1 ( 1 ) 4 / M v j v j T j E 2 ( i ) 4 / M v j v j T j E 3 ( 1 ) 4 / M v j v j T j E 4 ( i ) 4 / M v j v j T ) w 1 × k + + ( 1 1 1 1 ) ( j E 1 ( 1 ) 4 ( M 1 ) / M v j v j T j E 2 ( i ) 4 ( M 1 ) / M v j v j T j E 3 ( 1 ) 4 ( M 1 ) / M v j v j T j E 4 ( i ) 4 ( M 1 ) / M v j v j T ) w ( M 1 ) × k = ( 1 1 1 1 ) ( j E 1 l = 0 M 1 ( 1 ) 4 l / M w l × k v j v j T j E 2 l = 0 M 1 ( i ) 4 l / M w l × k v j v j T j E 3 l = 0 M 1 ( 1 ) 4 l / M w l × k v j v j T j E 4 l = 0 M 1 ( i ) 4 l / M w l × k v j v j T ) = ( 1 1 1 1 ) ( l = 0 M 1 ( 1 ) 4 l / M w l × k j E 1 v j v j T l = 0 M 1 ( i ) 4 l / M w l × k j E 2 v j v j T l = 0 M 1 ( 1 ) 4 l / M w l × k j E 3 v j v j T l = 0 M 1 ( i ) 4 l / M w l × k j E 4 v j v j T )
The next proof is to represent the eigenvalues ( 1 i 1 i ) using e h π i / 2 , h = 0 , 1 , 2 , 3 . In this way, we can calculate the following equation,
l = 0 M 1 ( e h π i / 2 ) 4 l / M w l × k = l = 0 M 1 e 2 π i l h / M e 2 π i l k / M = l = 0 M 1 e 2 π i l ( k + h ) / M
We thus obtain
l = 0 M 1 e 2 π i l ( k + h ) / M = { M ,   i f   h   = 0 , k = 0 M ,   i f   h = 1 , k = M 1 M ,   i f   h   = 2 , k = M 2 M ,   i f   h   = 3 , k = M 3 0 ,   o t h e r s
Equation (68) can be written as follows:
{ Y 0 = j E 1 M v j v j T , Y 1 = 0 ,               Y M 4 = 0 , Y M 3 = j E 4 M v j v j T , Y M 2 = j E 3 M v j v j T , Y M 1 = j E 2 M v j v j T .
The expression of Equation (67) is as follows:
F M α [ f ( t ) ] = 1 M ( Y 0 , Y 1 , , Y M 1 ) ( B 0 α B 1 α B M 1 α ) f ( t ) = k E 1 B 0 α v k v k T + k E 4 B M 3 α v k v k T + k E 3 B M 2 α v k v k T + k E 2 B M 1 α v k v k T
We can easily find that there are only four effective weighting terms in the extended definition.
This indicates that the extended definitions based on the WFRFT are deficient, as there are only four weighting terms in the extended definitions.

5.2. Deficiency of the Extended Definition (II)

In this section, we will analyze the extended definition of the weighted fractional Hartley transform as an example. The discrete Hartley transform (DHT) is
H = 1 N [ cos ( 2 π m n N ) + sin ( 2 π m n N ) ] .
Its fractional-order transform can be expressed as follows:
H α = V D α V H .
Because the eigenvalues of the Hartley transform are 1 and −1, Equation (79) can also be expressed as follows:
H α = k E 1 ( 1 ) α v k v k T + k E 2 ( 1 ) α v k v k T = ( 1 1 ) ( k E 1 ( 1 ) α v k v k T k E 2 ( 1 ) α v k v k T )
The extended definition [53] based on the weighted fractional Hartley transform can be expressed as follows:
T α = 1 M ( I , H 2 M , , H 2 ( M 1 ) M ) ( w 0 × 0 w 0 × 1 w 0 × ( M 1 ) w 1 × 0 w 1 × 1 w 1 × ( M 1 ) w ( M 1 ) × 0 w ( M 1 ) × 1 w ( M 1 ) × ( M 1 ) ) ( B 0 α 0 B 1 α 1 B M 1 α M 1 ) f ( t ) ,
where w = e 2 π i / M and B k α k = exp ( j π α k k ) , k = 0 , 1 , 2 , , M 1 . Let
{ Y 0 = w 0 × 0 I + w 1 × 0 H 2 M + + w ( M 1 ) × 0 H 2 ( M 1 ) M Y 1 = w 0 × 1 I + w 1 × 1 H 2 M + + w ( M 1 ) × 1 H 2 ( M 1 ) M Y 2 = w 0 × 2 I + w 1 × 2 H 2 M + + w ( M 1 ) × 2 H 2 ( M 1 ) M               Y M 1 = w 0 × ( M 1 ) I + w 1 × ( M 1 ) H 2 M + + w ( M 1 ) × ( M 1 ) H 2 ( M 1 ) M
Equation (82) can be abbreviated as follows:
Y k = w 0 × k I + w 1 × k H 2 M + + w ( M 1 ) × k H 2 ( M 1 ) M .
Substituting Equation (80) into Equation (83), we can obtain
Y k = w 0 × k I + w 1 × k H 2 M + + w ( M 1 ) × k H 2 ( M 1 ) M = ( 1 1 ) ( j E 1 ( 1 ) 0 v j v j T j E 2 ( 1 ) 0 v j v j T ) w 0 × k + ( 1 1 ) ( j E 1 ( 1 ) 2 / M v j v j T j E 2 ( 1 ) 2 / M v j v j T ) w 1 × k + + ( 1 1 ) ( j E 1 ( 1 ) 2 ( M 1 ) / M v j v j T j E 2 ( 1 ) 2 ( M 1 ) / M v j v j T ) w ( M 1 ) × k = ( 1 1 ) ( j E 1 l = 0 M 1 ( 1 ) 2 l / M w l × k v j v j T j E 2 l = 0 M 1 ( 1 ) 2 l / M w l × k v j v j T ) = ( 1 1 ) ( l = 0 M 1 ( 1 ) 2 l / M w l × k j E 1 v j v j T l = 0 M 1 ( 1 ) 2 l / M w l × k j E 2 v j v j T )
The eigenvalues of the Hartley transform are 1 and −1, which we can represent as e h π i with h = 0 , 1 . Therefore, we can obtain
l = 0 M 1 ( e h π i ) 2 l / M w l × k = l = 0 M 1 e 2 π i l h / M e 2 π i l k / M = l = 0 M 1 e 2 π i l ( k + h ) / M
then
l = 0 M 1 e 2 π i l ( k + h ) / M = { M ,   i f   h   = 0 , k = 0 M ,   i f   h   = 1 , k = M 1 0 ,   o t h e r s
Thus, Equation (82) is written as follows:
{ Y 0 = j E 1 M v j v j T , Y 1 = 0 ,           Y M 2 = 0 , Y M 1 = j E 2 M v j v j T .
The extended definition based on the weighted fractional Hartley transform can be expressed as follows:
H M α [ f ( t ) ] = 1 M ( Y 0 , Y 1 , , Y M 1 ) ( B 0 α B 1 α B M 1 α ) f ( t ) = k E 1 B 0 α v k v k T + k E 2 B M 1 α v k v k T
The extension definition has only two weighting terms.
In this section, the extended definition of the weighted fractional Hartley transform is analyzed, and the results show that there are only two effective weighting terms. In Section 3.3, other extended definitions also have such deficiencies.

5.3. Deficiency of the Extended Definition (III)

The above analysis indicates that the extended definition based on the WFRFT has four weighting terms, while the extended definition based on the weighted fractional Hartley transform has two weighting terms. We speculate that this is related to the period of the matrix, so in this section we analyze the extended definition of general periodic matrices.
The N × N matrix T is a periodic matrix satisfying T P = I , and its eigen decomposition form is T = V D V H . The eigenvalues of the periodic matrix T satisfy λ P = 1 , and these P eigenvalues can be expressed as λ = { e 2 π i 0 / P , e 2 π i 1 / P , , e 2 π i ( P 1 ) / P } . We can obtain
T = j E 1 e 2 π i 0 / P v k v k T + j E 2 e 2 π i 1 / P v k v k T + + j E P e 2 π i ( P 1 ) / P v k v k T
Its fractional-order transform can be represented as follows:
T α = j E 1 ( e 2 π i 0 / P ) α v k v k T + j E 2 ( e 2 π i 1 / P ) α v k v k T + + j E P ( e 2 π i ( P 1 ) / P ) α v k v k T = ( 1 1 1 ) ( j E 1 ( e 2 π i 0 / P ) α v k v k T j E 2 ( e 2 π i 1 / P ) α v k v k T j E P ( e 2 π i ( P 1 ) / P ) α v k v k T )
Its extended definition can be expressed as follows:
T α ¯ = 1 M ( T 0 , T P / M , , T P ( M 1 ) / M ) ( w 0 × 0 w 0 × 1 w 0 × ( M 1 ) w 1 × 0 w 1 × 1 w 1 × ( M 1 ) w ( M 1 ) × 0 w ( M 1 ) × 1 w ( M 1 ) × ( M 1 ) ) ( B 0 α 0 B 1 α 1 B M 1 α M 1 )
From the unified framework, we can know that B k α k can take different results. Let
{ Y 0 = w 0 × 0 T 0 + w 1 × 0 T P M + + w ( M 1 ) × 0 T P ( M 1 ) M Y 1 = w 0 × 1 T 0 + w 1 × 1 T P M + + w ( M 1 ) × 1 T P ( M 1 ) M Y 2 = w 0 × 2 T 0 + w 1 × 2 T P M + + w ( M 1 ) × 2 T P ( M 1 ) M           Y M 1 = w 0 × ( M 1 ) T 0 + w 1 × ( M 1 ) T P M + + w ( M 1 ) × ( M 1 ) T P ( M 1 ) M
Equation (92) can be simplified as follows:
Y k = w 0 × k T 0 + w 1 × k T P M + + w ( M 1 ) × k T P ( M 1 ) M .
Substituting Equation (90) into Equation (93), we can obtain
Y k = w 0 × k T 0 + w 1 × k T P M + + w ( M 1 ) × k T P ( M 1 ) M = ( 1 1 1 ) ( j E 1 ( e 2 π i 0 / P ) 0 v j v j T j E 2 ( e 2 π i 1 / P ) 0 v j v j T j E 4 ( e 2 π i ( P 1 ) / P ) 0 v j v j T ) w 0 × k + ( 1 1 1 ) ( j E 1 ( e 2 π i 0 / P ) P / M v j v j T j E 2 ( e 2 π i 1 / P ) P / M v j v j T j E 4 ( e 2 π i ( P 1 ) / P ) P / M v j v j T ) w 1 × k + + ( 1 1 1 ) ( j E 1 ( e 2 π i 0 / P ) P ( M 1 ) / M v j v j T j E 2 ( e 2 π i 1 / P ) P ( M 1 ) / M v j v j T j E 4 ( e 2 π i ( P 1 ) / P ) P ( M 1 ) / M v j v j T ) w ( M 1 ) × k = ( 1 1 1 ) ( j E 1 l = 0 M 1 ( e 2 π i 0 / P ) P l / M w l × k v j v j T j E 2 l = 0 M 1 ( e 2 π i 1 / P ) P l / M w l × k v j v j T j E 4 l = 0 M 1 ( e 2 π i ( P 1 ) / P ) P l / M w l × k v j v j T ) = ( 1 1 1 ) ( l = 0 M 1 ( e 2 π i 0 / P ) P l / M w l × k j E 1 v j v j T l = 0 M 1 ( e 2 π i 1 / P ) P l / M w l × k j E 2 v j v j T l = 0 M 1 ( e 2 π i ( P 1 ) / P ) P l / M w l × k j E 4 v j v j T )
where w = e 2 π i / M , h = 0 , 1 , 2 , , P 1 ,
l = 0 M 1 ( e 2 π i h / P ) P l / M w l × k = l = 0 M 1 e 2 π i l h / M e 2 π i l k / M = l = 0 M 1 e 2 π i l ( k + h ) / M
Therefore,
l = 0 M 1 e 2 π i l ( k + h ) / M = { M ,   i f   h   = 0 , k = 0 M ,   i f   h   = 1 , k = M 1              M ,   i f   h   = P , k = M P 0 ,   o t h e r s
Equation (91) is represented as follows:
T α ¯ = 1 M ( Y 0 , Y 1 , , Y M 1 ) ( B 0 α 0 B 1 α 1 B M 1 α M 1 ) = 1 M ( Y 0 B 0 α 0 + 0 + 0 + Y M P B M P α M P + + Y M 1 B M 1 α M 1 ) .
From the above proof, we know that the extended definition only has P weighted terms, which are related to the period of the matrix. This deficiency will have a significant impact on the application of the extended definitions and requires sufficient attention from researchers.

6. Conclusions

In this paper, we propose that the WFRFT is the result of the FT changing its eigenvalue into a fractional power while retaining the eigenvector, which gives us a new understanding of the WFRFT. We clarified the existing extended definitions of the WFRFT, thus establishing a unified framework for weighted class transforms wherein the previously proposed definitions can be used as special cases. Within this unified framework, we analyzed an extended definition based on the WFRFT, which has only four effective weighting terms. The extended definition based on the weighted fractional Hartley transform has only two effective weighting terms. Furthermore, we demonstrated that the effective weighting terms of the general extended definition are related to the period of the matrix. In this way, our research indicates that the extended definitions of the weighted fractional-order transform are deficient, and this deficiency has a significant impact on its application. This research achievement has important reference value for the application of the WFRFT and extended definitions.

Author Contributions

Methodology, T.Z.; validation, T.Z. and Y.C.; investigation, T.Z.; writing—original draft preparation, T.Z.; writing—review and editing, T.Z.; supervision, T.Z.; project administration, T.Z.; funding acquisition, T.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This study was supported by the Fundamental Research Funds for the Central Universities (N2123016); and the Scientific Research Projects of Hebei colleges and universities (QN2020511).

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Wiener, N. Hermitian polynomials and Fourier analysis. J. Math. Phys. 1929, 8, 70–73. [Google Scholar] [CrossRef]
  2. Condon, E.U. Immersion of the Fourier Transform in a Continuous Group of Functional Transformations. Proc. Natl. Acad. Sci. USA 1937, 23, 158–164. [Google Scholar] [CrossRef]
  3. Kober, H. Wurzeln aus der Hankel-, Fourier-und aus anderen stetigen Transformationen. Q. J. Math. 1939, 45–59. [Google Scholar] [CrossRef]
  4. Hida, T. A role of Fourier transform in the theory of infinite dimensional unitary group. J. Math. Kyoto Univ. 1973, 13, 203–212. [Google Scholar] [CrossRef]
  5. Namias, V. The fractional order Fourier transform and its application to quantum mechanics. Ima J. Appl. Math. 1980, 25, 241–265. [Google Scholar] [CrossRef]
  6. McBride, A.; Kerr, F. On Namias’s fractional Fourier transforms. Ima J. Appl. Math. 1987, 39, 159–175. [Google Scholar] [CrossRef]
  7. Lohmann, A.W. Image rotation, Wigner rotation, and the fractional Fourier transform. JOSA A 1993, 10, 2181–2186. [Google Scholar] [CrossRef]
  8. Almeida, L.B. The fractional Fourier transform and time-frequency representations. IEEE T Signal Proces. 1994, 42, 3084–3091. [Google Scholar] [CrossRef]
  9. Ozaktas, H.M.; Arikan, O.; Kutay, M.A.; Bozdagt, G. Digital computation of the fractional Fourier transform. IEEE T Signal Proces. 1996, 44, 2141–2150. [Google Scholar] [CrossRef]
  10. Shih, C.-C. Fractionalization of Fourier transform. Opt. Commun. 1995, 118, 495–498. [Google Scholar] [CrossRef]
  11. Santhanam, B.; McClellan, J.H. The DRFT-a rotation in time-frequency space. In Proceedings of the 1995 International Conference on Acoustics, Speech, and Signal Processing, Detroit, MI, USA, 9–12 May 1995; IEEE: Piscataway, NJ, USA, 1995; pp. 921–924. [Google Scholar]
  12. Liu, S.; Jiang, J.; Zhang, Y.; Zhang, J. Generalized fractional Fourier transforms. J. Phys. A Gen. Phys. 1997, 30, 973. [Google Scholar] [CrossRef]
  13. Liu, S.; Zhang, J.; Zhang, Y. Properties of the fractionalization of a Fourier transform. Opt. Commun. 1997, 133, 50–54. [Google Scholar] [CrossRef]
  14. Zhu, B.; Liu, S.; Ran, Q. Optical image encryption based on multifractional Fourier transforms. Opt. Lett. 2000, 25, 1159–1161. [Google Scholar] [CrossRef]
  15. Refregier, P.; Javidi, B. Optical image encryption based on input plane and Fourier plane random encoding. Opt. Lett. 1995, 20, 767–769. [Google Scholar] [CrossRef] [PubMed]
  16. Tao, R.; Lang, J.; Wang, Y. Optical image encryption based on the multiple-parameter fractional Fourier transform. Opt. Lett. 2008, 33, 581–583. [Google Scholar] [CrossRef]
  17. Ran, Q.; Zhang, H.; Zhang, J.; Tan, L.; Ma, J. Deficiencies of the cryptography based on multiple-parameter fractional Fourier transform. Opt. Lett. 2009, 34, 1729–1731. [Google Scholar] [CrossRef]
  18. Lang, J. Image encryption based on the reality-preserving multiple-parameter fractional Fourier transform and chaos permutation. Opt. Laser Eng. 2012, 50, 929–937. [Google Scholar] [CrossRef]
  19. Ran, Q.; Zhao, T.; Yuan, L.; Wang, J.; Xu, L. Vector power multiple-parameter fractional Fourier transform of image encryption algorithm. Opt. Laser Eng. 2014, 62, 80–86. [Google Scholar] [CrossRef]
  20. Sui, L.; Duan, K.; Liang, J. Double-image encryption based on discrete multiple-parameter fractional angular transform and two-coupled logistic maps. Opt. Commun. 2015, 343, 140–149. [Google Scholar] [CrossRef]
  21. Zhao, T.; Ran, Q.; Yuan, L.; Chi, Y.; Ma, J. Security of image encryption scheme based on multi-parameter fractional Fourier transform. Opt. Commun. 2016, 376, 47–51. [Google Scholar] [CrossRef]
  22. Chen, B.; Yu, M.; Tian, Y.; Li, L.; Wang, D.; Sun, X. Multiple-parameter fractional quaternion fourier transform and its application in colour image encryption. IET Image Process 2018, 12, 2238–2249. [Google Scholar] [CrossRef]
  23. Zhao, T.; Ran, Q. The weighted fractional Fourier transform and its application in image encryption. Math. Probl. Eng. 2019, 2019, 4789194. [Google Scholar] [CrossRef]
  24. Zhao, T.; Chi, Y. Key validity using the multiple-parameter fractional fourier transform for image encryption. Symmetry 2021, 13, 1803. [Google Scholar] [CrossRef]
  25. Choudhary, A.S.; Kumar, M.; Keshari, S. 4-Weighted Fractional Fourier Transform based Multiple Image Encryption Approach with PAN. J. Adv. Appl. Sci. Res. 2022, 4. [Google Scholar]
  26. Pei, S.C.; Hsue, W.-L. The multiple-parameter discrete fractional Fourier transform. IEEE Signal Proc. Lett. 2006, 13, 329–332. [Google Scholar]
  27. Yeung, D.S.; Ran, Q.; Tsang, E.C.; Teo, K.L. Complete way to fractionalize Fourier transform. Opt. Commun. 2004, 230, 55–57. [Google Scholar] [CrossRef]
  28. Ran, Q.; Yeung, D.S.; Tsang, E.C.; Wang, Q. General multifractional Fourier transform method based on the generalized permutation matrix group. IEEE Trans. Signal Proces. 2004, 53, 83–98. [Google Scholar]
  29. Ran, Q.-W.; Zhao, H.; Ge, G.-X.; Ma, J.; Tan, L.-Y. Sampling analysis in weighted fractional Fourier transform domain. In Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, Sanya, China, 24–26 April 2009; IEEE: Piscataway, NJ, USA, 2009; pp. 878–881. [Google Scholar]
  30. Ran, Q.-W.; Zhao, H.; Ge, G.-X.; Ma, J.; Tan, L.-Y. Sampling Theorem Associated with Multiple-parameter Fractional Fourier Transform. J. Comput. 2010, 5, 695–702. [Google Scholar]
  31. Mei, L.; Sha, X.; Ran, Q.; Zhang, N. Research on the application of 4-weighted fractional Fourier transform in communication system. Sci. China Inf. Sci. 2010, 53, 1251–1260. [Google Scholar] [CrossRef]
  32. Mei, L.; Zhang, Q.; Sha, X.; Zhang, N. Digital computation of the weighted-type fractional Fourier transform. Sci. China Inf. Sci. 2013, 56, 1–12. [Google Scholar] [CrossRef]
  33. Hui, Y.; Li, B.; Tong, Z. 4-weighted fractional Fourier transform over doubly selective channels and optimal order selecting algorithm. Electron. Lett. 2015, 51, 177–179. [Google Scholar] [CrossRef]
  34. Fang, X.J.; Sha, X.J.; Li, Y. Secret communication using parallel combinatory spreading WFRFT. IEEE Commun. Lett. 2014, 19, 62–65. [Google Scholar]
  35. Ni, L.; Da, X.; Hu, H.; Liang, Y.; Xu, R. PHY-Aided Secure Communication via Weighted Fractional Fourier Transform. Wirel. Commun. Mob. Comput. 2018, 2018, 7963451. [Google Scholar] [CrossRef]
  36. Bobitha, P.; Muralidhar, P. Significance of Weighted-Type Fractional Fourier Transform in FIR Filters. J. Telemat. Inform. 2015, 2, 50–56. [Google Scholar] [CrossRef]
  37. Liang, Y.; Da, X.; Wang, S. On narrowband interference suppression in OFDM-based systems with CDMA and weighted-type fractional Fourier transform domain preprocessing. KSII Trans. Internet Inf. Syst. (TIIS) 2017, 11, 5377–5391. [Google Scholar]
  38. Wang, Z.; Mei, L.; Wang, X.; Zhang, N. Bit error rate analysis of generalised frequency division multiplexing with weighted-type fractional Fourier transform precoding. IET Commun. 2017, 11, 916–924. [Google Scholar] [CrossRef]
  39. Fang, X.; Zhang, N.; Zhang, S.; Chen, D.; Sha, X.; Shen, X. On physical layer security: Weighted fractional Fourier transform based user cooperation. IEEE Trans. Wirel. Commun. 2017, 16, 5498–5510. [Google Scholar] [CrossRef]
  40. Li, J.; Sha, X.; Fang, X.; Mei, L. 8-Weighted-type fractional Fourier transform based three-branch transmission method. China Commun. 2018, 15, 147–159. [Google Scholar] [CrossRef]
  41. Li, Y.; Song, Z.; Sha, X. The multi-weighted type fractional fourier transform scheme and its application over wireless communications. Eurasip J. Wirel. Comm. 2018, 2018, 1–10. [Google Scholar] [CrossRef]
  42. Wang, X.; Mei, l.; Wang, Z.; Sha, X. Analysis of weighted fractional Fourier transform based hybrid carrier signal characteristics. J. Shanghai Jiaotong Univ. 2020, 25, 27–36. [Google Scholar] [CrossRef]
  43. Huang, Y.; Sha, X.; Fang, X.; Song, G. Secure spatial modulation based on two-dimensional generalized weighted fractional Fourier transform encryption. Eurasip J. Wirel. Commun. Netw. 2023, 2023, 13. [Google Scholar] [CrossRef]
  44. Keshari, S.; Modani, S.G. Weighted fractional Fourier transform based image steganography. In Proceedings of the 2011 International Conference on Recent Trends in Information Systems, Kolkata, India, 21–23 December 2011; IEEE: Piscataway, NJ, USA, 2011; pp. 214–217. [Google Scholar]
  45. Zhang, Y.D.; Chen, S.; Wang, S.H.; Yang, J.F.; Phillips, P. Magnetic resonance brain image classification based on weighted-type fractional Fourier transform and nonparallel support vector machine. Int. J. Imag. Syst. Tech. 2015, 25, 317–327. [Google Scholar] [CrossRef]
  46. Zhang, Y.-D.; Wang, S.-H.; Liu, G.; Yang, J. Computer-aided diagnosis of abnormal breasts in mammogram images by weighted-type fractional Fourier transform. Adv. Mech. Eng. 2016, 8, 1687814016634243. [Google Scholar] [CrossRef]
  47. Liu, F.; Feng, Y. Regeneration scanning method for M-WFRFT communication signals. IET Commun. 2020, 14, 514–521. [Google Scholar] [CrossRef]
  48. Liu, F.; Feng, Y. High resolution blind scanning method for weighted fractional Fourier transform signals. IET Signal Process 2022, 16, 992–1001. [Google Scholar] [CrossRef]
  49. Tao, R.; Zhang, F.; Wang, Y. Research progress on discretization of fractional Fourier transform. Sci. China Ser. F Inf. Sci. 2008, 51, 859–880. [Google Scholar] [CrossRef]
  50. Gómez-Echavarría, A.; Ugarte, J.P.; Tobón, C. The fractional Fourier transform as a biomedical signal and image processing tool: A review. Biocybern. Biomed. Eng. 2020, 40, 1081–1093. [Google Scholar] [CrossRef]
  51. Yeh, M.-H.; Pei, S.-C. A method for the discrete fractional Fourier transform computation. IEEE Trans. Signal Process. 2003, 51, 889–891. [Google Scholar]
  52. Tao, R.; Zhang, F.; Wang, Y. Linear summation of fractional-order matrices. IEEE Trans. Signal Process. 2010, 58, 3912–3916. [Google Scholar] [CrossRef]
  53. Kang, X.; Tao, R.; Zhang, F. Multiple-parameter discrete fractional transform and its applications. IEEE Trans. Signal Process. 2016, 64, 3402–3417. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Zhao, T.; Chi, Y. Discussion on Weighted Fractional Fourier Transform and Its Extended Definitions. Fractal Fract. 2024, 8, 464. https://doi.org/10.3390/fractalfract8080464

AMA Style

Zhao T, Chi Y. Discussion on Weighted Fractional Fourier Transform and Its Extended Definitions. Fractal and Fractional. 2024; 8(8):464. https://doi.org/10.3390/fractalfract8080464

Chicago/Turabian Style

Zhao, Tieyu, and Yingying Chi. 2024. "Discussion on Weighted Fractional Fourier Transform and Its Extended Definitions" Fractal and Fractional 8, no. 8: 464. https://doi.org/10.3390/fractalfract8080464

APA Style

Zhao, T., & Chi, Y. (2024). Discussion on Weighted Fractional Fourier Transform and Its Extended Definitions. Fractal and Fractional, 8(8), 464. https://doi.org/10.3390/fractalfract8080464

Article Metrics

Back to TopTop