Next Article in Journal
Fractional-Order Nonlinear Multi-Agent Systems: A Resilience-Based Approach to Consensus Analysis with Distributed and Input Delays
Previous Article in Journal
Nonexistence of Finite-Time Stable Equilibria in a Class of Nonlinear Integral Equations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

The Convolution Theorem Involving Windowed Free Metaplectic Transform

1
School of Mathematics and Statistics, Nanjing University of Information Science and Technology, Nanjing 210044, China
2
Center for Applied Mathematics of Jiangsu Province, Nanjing University of Information Science and Technology, Nanjing 210044, China
3
Jiangsu International Joint Laboratory on System Modeling and Data Analysis, Nanjing University of Information Science and Technology, Nanjing 210044, China
*
Author to whom correspondence should be addressed.
Fractal Fract. 2023, 7(4), 321; https://doi.org/10.3390/fractalfract7040321
Submission received: 13 March 2023 / Revised: 2 April 2023 / Accepted: 7 April 2023 / Published: 9 April 2023

Abstract

:
The convolution product is widely used in many fields, such as signal processing, numerical analysis and so on; however, the convolution theorem in the domain of the windowed metaplectic transformation (WFMT) has not been studied. The primary goal of this paper is to give the convolution theorem of WFMT. Firstly, we review the definitions of the FMT and WFMT and give the inversion formula of the WFMT and the relationship between the FMT and WFMT. Then, according to the form of the classical convolution theorem and the convolution operator of the FMT, the convolution theorem in the domain of the WFMT is given. Finally, we prove the existence theorems of the proposed convolution theorem.

1. Introduction

The free metaplectic transformation (FMT), which is also known as a high-dimensional form of the nonseparable linear canonical transform (LCT), was first produced in [1]. A 2 n × 2 n real symplectic matrix M = ( A , B ; C , D ) with n ( 2 n + 1 ) independent parameters was used in the free metaplectic transformation. When the symplectic matrix M takes different matrices, the FMT can reduce to different transformations, such as the Fourier transform (FT), the fractional Fourier transform (FRFT), the Fresnel transform (FRT), the linear canonical transform (LCT), and the basic quadratic phase factor multiplication [2]. Today, FMT is a central tool in time-frequency analysis, with several applications to PDE and mathematical physics [3,4,5]. Moreover, it has been widely used in optical systems, filter design, image processing, time-frequency analysis, harmonic analysis, and so on [6,7,8,9].
As a useful mathematical tool, the convolution product plays an important role in the design and implementation of multiplicative filters, harmonic analysis, image processing, and signal processing [10,11,12]. In recent years, people have conducted a lot of research on convolution theorems; many one-dimensional convolution theorems have been proposed, and many different transformations have been obtained based on convolution operators [13,14,15,16]. In the Fourier transform (FT) domain, the classical convolution theorem shows that the FT of two signals’ convolution is equal to the product of their FT, which means that the FT can replace the complex convolution operation with a simple product operation. The FT has its own advantages and good effects in processing and analyzing stationary signals, but its ability in processing and analyzing nonstationary signals is weak due to its limitations. The fractional Fourier transform (FRFT) is an extension of the Fourier transform. By introducing a rotation angle α , it can be considered that the signal rotates arbitrarily by angle α on the time axis, and the information of the time domain and frequency domain can be obtained simultaneously [17,18]. In the fractional Fourier domain, a lot of work has been conducted on convolution; Wei proposed a new convolution structure for the FRFT [19]. On this basis, the paper [20] extended one dimension to high dimensions and gave the generalized fractional convolution theorem of N-dimension. The fractional Fourier transform uses a separable kernel and only has one extra degree of freedom, while the linear canonical transform (LCT) uses an inseparable kernel and introduces three extra degrees of freedom, which is more valuable for research. At present, various convolution operators and corresponding convolution theorems have been proposed in the LCT domain [21,22,23,24,25], which have made great contributions to signal processing and application. However, the FMT, as an n-dimensional nonseparable LCT, has higher extra degrees of freedom, which is the generalization of the LCT.
Although the FMT has been successfully applied in many fields, it has a large limitation. Because of its global kernel, there is no way to process the local spectral components of nontransient signals [26,27]. Therefore, in order to solve this defect, it is necessary to window the free metaplectic transformation; this concept was first put forward by Shah et al. in [28]. The windowed free metaplectic transformation (WFMT), also called the short time free metaplectic transformation, is an efficient signal processing tool that can locate the frequency spectrum of nontransient signals in the free metaplectic domain. The WFMT has more degrees of freedom and can produce a localized analysis of chirp signals that is effective.
In the windowed Fourier transform (WFT) domain, Lu and Zhang [29] used windowed convolution theorem for time-frequency analysis. In the windowed fractional Fourier (WFRFT) domain, Gao and Li developed a convolution form with a concise traditional convolution theorem in the frequency domain [30]. In the windowed linear canonical transform (WLCT) domain, the WLCT is defined by the convolution operator, and some properties and practical applications were studied in [31]. The WFT, WFRFT, and WFMT are all special forms of the WFMT, which urges us to actively explore the convolution theory of WFMT. Through the analysis of the present research situation, it is very meaningful to study the convolution theorem of the WFMT. Some scholars have studied the convolution theory of many time-frequency analysis tools, but no one has studied the convolution theory of WFMT; so, the study of the convolution theorem of WFMT is extremely important from a theoretical standpoint. To summarize, this paper studies the convolution theorem of the WFMT.
In this paper, we mainly study the convolution theorem of the WFMT. A convolution operator is proposed in the WFMT domain, which makes the convolution theorem in the WFMT domain have the same concise form as that in the traditional Fourier transform domain.In this way, we can transform the convolution in the time domain into the product in the metaplectic domain, which is very convenient and concise in the frequency domain and is beneficial to the design of the multiplication filter. Meanwhile, we prove the existence of the proposed convolution. The remainder of this paper is structured as follows. In Section 2, we briefly review the definition and elementary properties of the FMT. In Section 3, the definition of the WFMT and the related convolution theorem are given. In Section 4, we give the explanation of the existence theorem of the above convolution theorem. Finally, the conclusion is in Section 5.

2. Preliminaries

In this section, we mainly review some concepts and basic knowledge, which are used in the following sections.The space composed of all square integrable functions can be expressed as
L 2 R n = f : R n f ( x ) 2 d x < .
For any positive integer p, the space formed by all p-integrable functions on R n is expressed by L p ( R n ) . For any function f ( x ) L p ( R n ) , the norm of f is defined as
f p = R n f ( x ) p d x 1 p .
We denote a real symplectic 2 n × 2 n matrix M = A B C D as M = ( A , B ; C , D ) (equivalently d e t ( B ) 0 ) for typographical convenience, where A , B , C , and D are n × n real matrices satisfying
AB T = BA T , CD T = D C T , AD T BC T = I n ,
where I n denotes the n-dimensional identity matrix. If | d e t B | 0 and M T J M = J , the matrix M = ( A , B ; C , D ) is considered to be a free symplectic matrix. M T = ( A T , C T ; B T , D T ) and M 1 = ( D T , B T ; C T , A T ) provide the transpose and the inverse of the free symplectic matrix M = ( A , B ; C , D ) , respectively.
We define the FMT [32,33] as follows:
Definition 1.
The free metaplectic transform (FMT) of any function f L 2 R n with a free real symplectic matrix M = ( A , B ; C , D ) is denoted by F M [ f ] and is defined as [32,33]
F M f w = R n f ( x ) K M ( x , w ) d x ,
where kernel K M ( x , w ) is given by
K M ( x , w ) = 1 d e t B e i π ( w T DB 1 w 2 w T B T 1 x + x T B 1 A x ) ,
with | d e t B | 0 .
The corresponding (4) inversion formula is given by
f ( x ) = F M 1 F M f ( w ) ( x ) = R n F M [ f ] ( w ) K M 1 ( w , x ) d w .

3. Windowed Free Metaplectic Transform

Definition 2
(WFMT). Let g L 2 R n be a window function; the windowed free metaplectic transform (WFMT) of any f L 2 R n with a free real symplectic matrix M = ( A , B ; C , D ) is defined as [28]
( G g M f ) ( b , u ) = R n f ( x ) g ( x b ) ¯ K M ( x , u ) d x ,
where kernel K M ( x , u ) is given as (5).
Remark 1.
Let A = D = d i a g ( c o s α , c o s α , , c o s α ) and B = C = d i a g ( s i n α , s i n α , , s i n α ) ; then, the definition of the WFMT will reduce to the windowed fractional Fourier transform (WFRFT) with rotational angle α.
Remark 2.
When the window function g ( x ) = 1 , the definition of the WFMT [28] equals the FMT [32,33].
From (4) and (7), the relationship between the FMT and WFMT can be written as
( G g M f ) ( b , u ) = F M [ h ] ( u ) ,
where h ( x , b ) = f ( x ) g ( x b ) ¯ .
Proposition 1
(The inversion of the WFMT). Let g L 2 ( R n ) be a window function, and g 2 0 ; G g M f denotes the windowed free metaplectic transform of f, and
f ( x ) = 1 g 2 R n R n ( G g M f ) ( b , u ) K M ( x , u ) ¯ g ( x b ) d u d b .
Proof of Proposition 1.
Letting h ( x , b ) = f ( x ) g ( x b ) ¯ ,
( G g M f ) ( b , u ) = R n h ( x , b ) K M ( x , u ) d x = F M [ h ] ( u ) .
According to the inversion formula of FMT (6), we have
h ( x , b ) = R n F M [ h ] ( u ) K M 1 ( u , x ) d u .
Then,
f ( x ) g ( x b ) ¯ = R n ( G g M f ) ( b , u ) K M ( x , u ) ¯ d u .
Multiplying g ( x b ) on both sides of the above equation and integrating, we obtain
R n f ( x ) g ( x b ) ¯ g ( x b ) d b = R n R n ( G g M f ) ( b , u ) K M ( x , u ) ¯ g ( x b ) d u d b .
That is,
f ( x ) g 2 2 = R n R n ( G g M f ) ( b , u ) K M ( x , u ) ¯ g ( x b ) d u d b .
Since g 2 0 , we can obtain
f ( x ) = 1 g 2 R n R n ( G g M f ) ( b , u ) K M ( x , u ) ¯ g ( x b ) d u d b .
Thus, the proof is finished. □
Definition 3.
Given two functions f , h L 2 ( R n ) , the free metaplectic convolution with a free symplectic matrix M = ( A , B ; C , D ) is denoted by M and is defined as [32]
( f M h ) ( b ) = 1 d e t B R n f ( x ) h ( b x ) e i π x T B 1 A ( x b ) + ( x b ) T B 1 Ax d x .
According to (15), f M h can be written as
( f M h ) ( b ) = 1 d e t B f 1 h 1 ( b ) ,
where f 1 ( x ) = f ( x ) e i π x T B 1 A ( x b ) , h 1 ( x ) = h ( x ) e i π x T B 1 A ( x b ) , and ∗ denotes the common convolution operator.
Proposition 2.
For two functions f , h L 2 ( R n ) in free metaplectic domains, the convolution theorem can be written as
F M f M h ( b ) ( w ) = e i π w T DB 1 w F M [ f ] ( w ) F M [ h ] ( w ) .
Proof of Proposition 2.
The proof is very simple; so, it is omitted here. □
According to (7) and (15), the WFMT can be expressed in terms of the convolution
( G g M f ) ( b , u ) = f u ˜ M g b ˜ ( b ) ,
where
f u ˜ ( x ) = f ( x ) e i π ( u T DB 1 u 2 u T B T 1 x + x T B 1 Ax ) ,
g b ˜ ( x ) = g ( x ) ¯ e i π ( b x ) T B 1 Ax + x T B 1 A ( b x ) .
We define the convolution product associated with the WFMT as
G g M f 🟉 M h ( b , u ) = G g M f ( b , u ) G g M h ( b , u ) .
Theorem 1
(Convolution theorem for the WFMT). Let g L 2 ( R n ) be a window function, f L 2 ( R n ) and h L 2 ( R n ) . For any x R n , the windowed convolution is obtained by
f 🟉 M h ( x ) = R n R n A u ξ , y , x f ( ξ ) h ( y ) d ξ d y ,
where
A u ξ , y , x = 1 d e t B R n R n K M ( x , w ) ¯ K M ( t , w ) U ( ξ , u ) U ( y , u ) U ( x , u ) × g b ˜ ( t ξ ) g b ˜ ( t y ) F M g b ˜ ( w ) e i π ξ T B 1 A ( ξ t ) + ( ξ t ) T B 1 A ξ × e i π y T B 1 A ( y t ) + ( y t ) T B 1 Ay e i π w T DB 1 w d t d w ,
U ( x , u ) = e i π ( u T DB 1 u 2 u T B T 1 x + x T B 1 Ax ) ,
g b ˜ ( x ) = g ( x ) ¯ e i π ( b x ) T B 1 Ax + x T B 1 A ( b x ) .
Proof of Theorem 1.
According to (17) and (18), we have
F M ( G g M f ) ( b , u ) ( w ) = F M f u ˜ M g b ˜ ( b ) ( w ) = e i π w T DB 1 w F M [ f u ˜ ] ( w ) F M g b ˜ ( w ) .
Let U ( x , u ) = e i π ( u T DB 1 u 2 u T B T 1 x + x T B 1 Ax ) ; then, we have
F M ( G g M f 🟉 M h ) ( b , u ) ( w ) = e i π w T DB 1 w F M [ f 🟉 M h u ˜ ] ( w ) F M g b ˜ ( w ) = e i π w T DB 1 w F M f 🟉 M h ( x ) U ( x , u ) ( w ) F M g b ˜ ( w ) .
Moreover, we have
F M ( G g M f 🟉 M h ) ( b , u ) ( w ) = F M G g M f ( b , u ) G g M h ( b , u ) ( w ) = F M f u ˜ M g b ˜ h u ˜ M g b ˜ ( w ) .
Thus,
e i π w T DB 1 w F M f 🟉 M h ( x ) U ( x , u ) ( w ) F M g b ˜ ( w ) = F M f u ˜ M g b ˜ h u ˜ M g b ˜ ( w ) .
So,
F M f 🟉 M h ( x ) U ( x , u ) ( w ) = e i π w T DB 1 w F M f u ˜ M g b ˜ h u ˜ M g b ˜ ( w ) F M g b ˜ ( w ) .
According to the inversion Formula (6), we can obtain
f 🟉 M h ( x ) U ( x , u ) = F M 1 e i π w T DB 1 w F M f u ˜ M g b ˜ h u ˜ M g b ˜ ( w ) F M g b ˜ ( w ) = R n e i π w T DB 1 w F M g b ˜ ( w ) F M f u ˜ M g b ˜ h u ˜ M g b ˜ ( w ) K M ( x , w ) ¯ d w = R n e i π w T DB 1 w F M g b ˜ ( w ) R n f u ˜ M g b ˜ ( t ) h u ˜ M g b ˜ ( t ) K M ( t , w ) d t × K M ( x , w ) ¯ d w = 1 d e t B R n R n R n R n e i π w T DB 1 w F M g b ˜ ( w ) K M ( t , w ) K M ( x , w ) ¯ × f u ˜ ( ξ ) g b ˜ ( t ξ ) e i π ξ T B 1 A ( ξ t ) + ( ξ t ) T B 1 A ξ × h u ˜ ( y ) g b ˜ ( t y ) e i π y T B 1 A ( y t ) + ( y t ) T B 1 Ay d ξ d y d w d t = 1 d e t B R n R n R n R n K M ( t , w ) K M ( x , w ) ¯ × g b ˜ ( t ξ ) g b ˜ ( t y ) F M g b ˜ ( w ) e i π ξ T B 1 A ( ξ t ) + ( ξ t ) T B 1 A ξ × e i π y T B 1 A ( y t ) + ( y t ) T B 1 Ay e i π w T DB 1 w f ( ξ ) U ( ξ , u ) × h ( y ) U ( y , u ) d ξ d y d w d t .
Since U ( x , u ) 0 , we can obtain
f 🟉 M h ( x ) = R n R n A u ξ , y , x f ( ξ ) h ( y ) d ξ d y ,
where A u ξ , y , x is defined as (23). Thus, the proof is finished. □
Remark 3.
Let A = D = d i a g ( c o s α , c o s α , , c o s α ) and B = C = d i a g ( s i n α , s i n α , , s i n α ) in the matrix M = ( A , B ; C , D ) ; then, the convolution theorem of the WFMT will reduce to the convolution theorem of the WFRFT in [30].
Remark 4.
Since the FMT uses the global kernel, there is no way to deal with the local spectral components of nontransient signals, but the WFMT can solve this problem well. Therefore, the convolution theorem proposed in this paper is less limited than the convolution theorem proposed in [32], and it is better for capturing and analyzing nontransient signals. The convolution theorem (21) has the simplicity and elegance consistent with the classical convolution theorem in the FT. However, the convolution theorems in [28,32,33] are not so concise and elegant with an extra chirp function. Through the convolution theorem proposed in this paper, we can transform the convolution in the time domain into the simple product in the metaplectic domain.
Theorem 2.
For any functions f , h , k L 2 ( R n ) and the free real symplectic matrix M , the convolution of the WFMT satisfies the commutative law and the associative law:
(i) (Commutative law)
f 🟉 M h = h 🟉 M f .
(ii) (Associative law)
f 🟉 M h 🟉 M k = f 🟉 M h 🟉 M k .
Proof of Theorem 2.
The commutative law is obvious. Next, we prove the associative law.
f 🟉 M h 🟉 M k ( m ) = R n R n A u x , l , m f 🟉 M h ( x ) k ( l ) d x d l = R n R n A u x , l , m k ( l ) R n R n A u ξ , y , x f ( ξ ) h ( y ) d ξ d y d x d l = R n R n R n R n A u x , l , m A u ξ , y , x f ( ξ ) g ( y ) k ( l ) d x d y d l d ξ ,
f 🟉 M h 🟉 M k ( m ) = R n R n A u ξ , x , m h 🟉 M k ( x ) f ( ξ ) d ξ d x = R n R n A u ξ , x , m f ( ξ ) R n R n A u y , l , x h ( y ) k ( l ) d y d l d ξ d x = R n R n R n R n A u ξ , x , m A u y , l , x f ( ξ ) h ( y ) k ( l ) d x d y d l d ξ .
Obviously, A u x , l , m A u ξ , y , x = A u ξ , x , m A u y , l , x . Thus,
f 🟉 M h 🟉 M k = f 🟉 M h 🟉 M k .
Thus, the proof is finished. □
Example 1.
For simplicity, we chose a two-dimensional Gaussian function g ( x ) = e ( x 1 2 + x 2 2 ) as the window function and fixed the center of the window function at the origin. For the symplectic matrix M , we chose
M = A B C D = 1 2 1 / 2 1 / 2 2 1 1 / 2 1 / 2 1 3 1 1 1 0 1 / 2 1 / 2 .
Thus,
B 1 = 1 1 1 1 ,
w T DB 1 w = w 1 w 2 2 0 0 1 w 1 w 2 = 2 w 1 2 + w 2 2 ,
w T B T 1 x = w 1 w 2 1 1 1 1 x 1 x 2 = w 1 x 2 w 1 x 2 w 2 x 1 + w 2 x 2 ,
x T B 1 Ax = x 1 x 2 1 3 3 1 x 1 x 2 = x 1 2 6 x 1 x 2 x 2 2 ,
x T B 1 Ay = x 1 x 2 1 3 3 1 y 1 y 2 = ( x 1 3 x 2 ) y 1 + ( 3 x 1 + x 2 ) y 2 ,
K M ( t , w ) = 2 e i π 2 w 1 2 + w 2 2 + 2 w 1 t 2 + w 1 t 2 + w 2 t 1 w 2 t 2 + t 1 2 6 t 1 t 2 t 2 2 ,
U ( x , u ) = e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 ,
g b ˜ ( x ) = e ( x 1 2 + x 2 2 ) e 2 i π x 1 2 6 x 1 x 2 x 2 2 .
According to the above formulas, we obtain
f 🟉 M h ( x ) = R 2 R 2 A u ξ , y , x f ( ξ ) h ( y ) d ξ d y = 2 R 2 R 2 R 2 R 2 2 e i π 2 w 1 2 + w 2 2 + 2 w 1 t 2 + w 1 t 2 + w 2 t 1 w 2 t 2 + t 1 2 6 t 1 t 2 t 2 2 × 2 e i π 2 w 1 2 + w 2 2 + 2 w 1 x 2 + w 1 x 2 + w 2 x 1 w 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × e i π 2 u 1 2 + u 2 2 + 2 u 1 ξ 2 + u 1 ξ 2 + u 2 ξ 1 u 2 ξ 2 + ξ 1 2 6 ξ 1 ξ 2 ξ 2 2 × e i π 2 u 1 2 + u 2 2 + 2 u 1 y 2 + u 1 y 2 + u 2 y 1 u 2 y 2 + y 1 2 6 y 1 y 2 y 2 2 × e ( t 1 ξ 1 ) 2 + ( t 2 ξ 2 ) 2 e 2 i π ( t 1 ξ 1 ) 2 6 ( t 1 ξ 1 ) ( t 2 ξ 2 ) ( t 2 ξ 2 ) 2 × e ( t 1 y 1 ) 2 + ( t 2 y 2 ) 2 e 2 i π ( t 1 ξ 1 ) 2 6 ( t 1 ξ 1 ) ( t 2 ξ 2 ) ( t 2 ξ 2 ) 2 1 F M g b ˜ ( w ) × e 2 i π ( ξ 1 3 ξ 2 ) ( ξ 1 t 1 ) + ( 3 ξ 1 + ξ 2 ) ( ξ 2 t 2 ) e 2 i π ( y 1 3 y 2 ) ( y 1 t 1 ) + ( 3 y 1 + y 2 ) ( y 2 t 2 ) × e i π 2 w 1 2 + w 2 2 d t d w f ( ξ ) h ( y ) d ξ d y .
Let
I u f ( ξ ) = f ( ξ ) e i π 2 u 1 2 + u 2 2 + 2 u 1 ξ 2 + u 1 ξ 2 + u 2 ξ 1 u 2 ξ 2 + ξ 1 2 6 ξ 1 ξ 2 ξ 2 2 ,
I u h ( y ) = h ( y ) e i π 2 u 1 2 + u 2 2 + 2 u 1 y 2 + u 1 y 2 + u 2 y 1 u 2 y 2 + y 1 2 6 y 1 y 2 y 2 2 .
Then, we can obtain
f 🟉 M h ( x ) = 4 e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × R 2 R 2 R 2 R 2 e i π 2 w 1 2 + w 2 2 + 2 w 1 t 2 + w 1 t 2 + w 2 t 1 w 2 t 2 + t 1 2 6 t 1 t 2 t 2 2 × e i π 2 w 1 2 + w 2 2 + 2 w 1 x 2 + w 1 x 2 + w 2 x 1 w 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × e ( t 1 ξ 1 ) 2 + ( t 2 ξ 2 ) 2 e 2 i π ( t 1 ξ 1 ) 2 6 ( t 1 ξ 1 ) ( t 2 ξ 2 ) ( t 2 ξ 2 ) 2 × e ( t 1 y 1 ) 2 + ( t 2 y 2 ) 2 e 2 i π ( t 1 y 1 ) 2 6 ( t 1 y 1 ) ( t 2 y 2 ) ( t 2 y 2 ) 2 1 F M g b ˜ ( w ) × e 2 i π ( ξ 1 3 ξ 2 ) ( ξ 1 t 1 ) + ( 3 ξ 1 + ξ 2 ) ( ξ 2 t 2 ) e 2 i π ( y 1 3 y 2 ) ( y 1 t 1 ) + ( 3 y 1 + y 2 ) ( y 2 t 2 ) × e i π 2 w 1 2 + w 2 2 I u f ( ξ ) I u h ( y ) d t d w d ξ d y , = 4 e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × R 2 R 2 1 F M g b ˜ ( w ) e i π 2 w 1 2 + w 2 2 × e i π 2 w 1 2 + w 2 2 + 2 w 1 t 2 + w 1 t 2 + w 2 t 1 w 2 t 2 + t 1 2 6 t 1 t 2 t 2 2 × e i π 2 w 1 2 + w 2 2 + 2 w 1 x 2 + w 1 x 2 + w 2 x 1 w 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × ( R 2 I u f ( ξ ) e ( t 1 ξ 1 ) 2 + ( t 2 ξ 2 ) 2 e 2 i π ( t 1 ξ 1 ) 2 6 ( t 1 ξ 1 ) ( t 2 ξ 2 ) ( t 2 ξ 2 ) 2 × e 2 i π ( ξ 1 3 ξ 2 ) ( ξ 1 t 1 ) + ( 3 ξ 1 + ξ 2 ) ( ξ 2 t 2 ) d ξ ) ( R 2 I u h ( y ) × e ( t 1 y 1 ) 2 + ( t 2 y 2 ) 2 e 2 i π ( t 1 y 1 ) 2 6 ( t 1 y 1 ) ( t 2 y 2 ) ( t 2 y 2 ) 2 × e 2 i π ( y 1 3 y 2 ) ( y 1 t 1 ) + ( 3 y 1 + y 2 ) ( y 2 t 2 ) d y ) d t d w .
For ease of writing, we let
I ( t ) = ( R 2 I u f ( ξ ) e ( t 1 ξ 1 ) 2 + ( t 2 ξ 2 ) 2 e 2 i π ( t 1 ξ 1 ) 2 6 ( t 1 ξ 1 ) ( t 2 ξ 2 ) ( t 2 ξ 2 ) 2 × e 2 i π ( ξ 1 3 ξ 2 ) ( ξ 1 t 1 ) + ( 3 ξ 1 + ξ 2 ) ( ξ 2 t 2 ) d ξ ) ( R 2 I u h ( y ) e ( t 1 y 1 ) 2 + ( t 2 y 2 ) 2 × e 2 i π ( t 1 y 1 ) 2 6 ( t 1 y 1 ) ( t 2 y 2 ) ( t 2 y 2 ) 2 e 2 i π ( y 1 3 y 2 ) ( y 1 t 1 ) + ( 3 y 1 + y 2 ) ( y 2 t 2 ) d y ) .
According to (4) and (6), the FMT and the inverse of the FMT can be written as
F M I ( t ) w = 2 R 2 I ( t ) e i π 2 w 1 2 + w 2 2 + 2 w 1 t 2 + w 1 t 2 + w 2 t 1 w 2 t 2 + t 1 2 6 t 1 t 2 t 2 2 d t ,
f ( x ) = F M 1 F M f ( w ) ( x ) = 2 R n F M f w e i π 2 w 1 2 + w 2 2 + 2 w 1 x 2 + w 1 x 2 + w 2 x 1 w 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 d w .
Thus, we obtain
f 🟉 M h ( x ) = 4 e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × R 2 e i π 2 w 1 2 + w 2 2 F M g b ˜ ( w ) e i π 2 w 1 2 + w 2 2 + 2 w 1 x 2 + w 1 x 2 + w 2 x 1 w 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × R 2 I ( t ) e i π 2 w 1 2 + w 2 2 + 2 w 1 t 2 + w 1 t 2 + w 2 t 1 w 2 t 2 + t 1 2 6 t 1 t 2 t 2 2 d t d w = 2 2 e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × R 2 e i π 2 w 1 2 + w 2 2 F M g b ˜ ( w ) F M I w × e i π 2 w 1 2 + w 2 2 + 2 w 1 x 2 + w 1 x 2 + w 2 x 1 w 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 d w = 2 e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 × F M 1 e i π 2 w 1 2 + w 2 2 F M g b ˜ ( w ) F M I w ( x ) .
Therefore,
e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 f 🟉 M h ( x ) = 2 F M 1 e i π 2 w 1 2 + w 2 2 F M g b ˜ ( w ) F M I w ( x ) .
Performing the FMT on both sides of the above formula,
F M e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 f 🟉 M h ( x ) ( w ) = 2 e i π 2 w 1 2 + w 2 2 F M g b ˜ ( w ) F M I w ,
it follows that
e i π 2 w 1 2 + w 2 2 F M e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 f 🟉 M h ( x ) ( w ) × F M g b ˜ ( w ) = 2 F M I w .
According to the convolution theorem of the FMT in (17), the above formula can be rewritten as
F M e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 f 🟉 M h ( x ) M g b ˜ w = 2 F M I w ;
thus,
e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 f 🟉 M h ( x ) M g b ˜ = 2 I .
The left side of the above equation can be written as
e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 f 🟉 M h ( x ) M g b ˜ ( b ) = 2 R 2 f 🟉 M h ( x ) e ( x 1 2 + x 2 2 ) e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 d x ,
and the right side can be written as
2 I ( b ) = ( G g M f ) ( b , u ) ( G g M h ) ( b , u ) .
According to the definition of the WFMT (7), we know
( G g M f 🟉 M h ) ( b , u ) = 2 R 2 f 🟉 M h ( x ) e ( x 1 2 + x 2 2 ) × e i π 2 u 1 2 + u 2 2 + 2 u 1 x 2 + u 1 x 2 + u 2 x 1 u 2 x 2 + x 1 2 6 x 1 x 2 x 2 2 d x ,
which is equal to (55). Thus, we have
( G g M f 🟉 M h ) ( b , u ) = ( G g M f ) ( b , u ) ( G g M h ) ( b , u ) .
Therefore, we obtain the convolution theorem of the above concrete example, which is consistent with the convolution theorem proposed in this paper.

4. Existence Theorems

In this section, we introduce some existence theorems of the proposed convolution theorem.
Lemma 1.
Let g L 2 ( R n ) be a window function, f L 2 ( R n ) and h L 2 ( R n ) . Then, the Parseval theorem of the windowed free metaplectic transform is obtained by
R n R n ( G g M f ) ( b , u ) ( G g M h ) ( b , u ) ¯ d u d b = g 2 2 f , h 2 .
Theorem 3.
Let g L 2 ( R n ) be a window function, f L 2 ( R n ) and h L 2 ( R n ) . Thus, we can obtain
f 🟉 M g 2 f 2 g 2 h 2 .
Proof of Theorem 3.
For f L 2 ( R n ) and h L 2 ( R n ) , 1 r + 1 s = 1 , 1 r , s < , we have
f M h f r h s .
Thus,
( G g M f ) ( b , u ) = f u ˜ M g b ˜ | | f u ˜ | | 2 g b ˜ 2 = f 2 g 2 .
From Lemma (1), we have
G g M f ( b , u ) 2 = f 2 g 2 .
So,
G g M f 🟉 M h ( b , u ) 2 = G g M f ( b , u ) G g M h ( b , u ) 2 = R n R n G g M f ( b , u ) G g M h ( b , u ) 2 1 2 f 2 g 2 R n G g M h ( b , u ) 2 1 2 = f 2 g 2 G g M h 2 = f 2 g 2 2 h 2 .
Since G g M f 🟉 M h ( b , u ) 2 = f 🟉 M h 2 g 2 , we obtain
f 🟉 M h 2 g 2 f 2 g 2 2 h 2 .
Hence, we obtain
f 🟉 M h 2 f 2 g 2 h 2 .
Thus, the proof is finished. □
Theorem 4.
For the free real symplectic matrix M , let f L r ( R n ) , h L s ( R n ) , 1 < r , s < , and g L r ( R n ) L s ( R n ) be a window function, 1 r + 1 r = 1 , 1 s + 1 s = 1 ; with respect to the free real symplectic matrix M = ( A , B ; C , D ) , we have
G g M f 🟉 M h ( b , u ) f r g r h s g s .
Proof of Theorem 4.
G g M f 🟉 M h ( b , u ) = G g M f ( b , u ) G g M h ( b , u ) = f u ˜ M g b ˜ ( b ) h u ˜ M g b ˜ ( b ) f r g r h s g s .
Thus, the proof is finished. □
Theorem 5.
Let g L 2 ( R n ) be a window function, f , h L 2 ( R n ) . Then,
R n R n G g M f 🟉 M h ( b , u ) d u d b f 2 h 2 g 2 2 .
Proof of Theorem 5.
According to Lemma (1) and the Hölder inequality, we have
R n R n G g M f 🟉 M h ( b , u ) d u d b = R n R n G g M f ( b , u ) G g M h ( b , u ) d u d b g 2 2 R n f ( t ) h ( t ) d t f 2 h 2 g 2 2 .
Thus, the proof is finished. □
Theorem 6.
Let g L q ( R n ) be a window function, f , h L p ( R n ) , 1 p , q < , 1 p + 1 q 1 0 , f 🟉 M h L r R n , and 1 r = 1 p + 1 q 1 . Then,
G g M f 🟉 M h ( b , u ) r 1 d e t B f p h p g q 2 .
Proof of Theorem 6.
By (16) and Young‘s Inequality, we have
f M g r = R n 1 d e t B f 1 g 1 ( b ) r d b 1 r = 1 d e t B f 1 g 1 r 1 d e t B f 1 p g 1 q ,
where f 1 ( x ) = f ( x ) e i π x T B 1 A ( x b ) , g 1 ( x ) = g ( x ) e i π x T B 1 A ( x b ) , and ∗ denotes the common convolution operator. It is apparent that f 1 p = f p , g 1 q = g q ; thus,
f M g r 1 d e t B f p g q .
Hence,
G g M f r = f u ˜ M g b ˜ r 1 d e t B | | f u ˜ | | p g b ˜ q = 1 d e t B f p g q .
Since G g M h ( b , u ) = h u ˜ M g b ˜ ( u ) h p g q , thus
G g M f 🟉 M h r = G g M f G g M h r = R n R n G g M f ( b , u ) G g M h ( b , u ) r d u d b 1 r h p g q R n R n G g M f ( b , u ) r d u d b 1 r = h p g q G g M f r 1 d e t B f p h p g q 2 .
Thus, the proof is finished. □

5. Conclusions

In this paper, according to the definition of the windowed free metaplectic transformation, we introduced a convolution theorem in the WFMT, which has an elegant and simple result as the traditional FT in the frequency domain.This convolution theorem is a perfect extension of the convolution theorem in the WFRFT domain. Finally, according to the new convolution of the WFMT, we introduced several kinds of existence theorems for the convolution theorem of the WFRFT.

Author Contributions

Conceptualization, M.C. and Z.Z.; methodology, M.C.; validation, M.C. and Z.Z.; formal analysis, M.C. and Z.Z.; writing—original draft preparation, M.C.; writing—review and editing, M.C. and Z.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China under Grant No. 61901223, the Natural Science Foundation of Jiangsu Province under Grant No. BK20190769, the Jiangsu Planned Projects for Postdoctoral Research Funds under Grant No. 2021K205B, and the Jiangsu Province High-Level Innovative and Entrepreneurial Talent Introduction Program under Grant No. R2020SCB55.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
FTFourier transform
FRFTFractional Fourier transform
FRTFresnel transform
LCTLinear canonical transform
FMTFree metaplectic transformation
WFTWindowed Fourier transform
WFRFTWindowed fractional Fourier transform
WLCTWindowed linear canonical transform
WFMTWindowed free metaplectic transformation

References

  1. Folland, G.B. Harmonic Analysis in Phase Space; Number 122; Princeton University Press: Princeton, NJ, USA, 1989. [Google Scholar]
  2. Zhang, Z. Uncertainty principle for real functions in free metaplectic transformation domains. J. Fourier Anal. Appl. 2019, 25, 2899–2922. [Google Scholar] [CrossRef]
  3. De Gosson, M.A. Symplectic Methods in Harmonic Analysis and in Mathematical Physics; Springer: Berlin/Heidelberg, Germany, 2011; Volume 7. [Google Scholar]
  4. Cordero, E.; Rodino, L. Time-Frequency Analysis of Operators. In Time-Frequency Analysis of Operators; De Gruyter: Berlin, Germany; Boston, MA, USA, 2020. [Google Scholar]
  5. Nicola, F.; Trapasso, S.I. Wave Packet Analysis of Feynman Path Integrals; Springer: Berlin/Heidelberg, Germany, 2022. [Google Scholar]
  6. De Gosson, M.A. Symplectic Geometry and Quantum Mechanics; Springer: Berlin/Heidelberg, Germany, 2006; Volume 166. [Google Scholar]
  7. Jing, R.; Liu, B.; Li, R.; Liu, R. The N-dimensional uncertainty principle for the free metaplectic transformation. Mathematics 2020, 8, 1685. [Google Scholar] [CrossRef]
  8. Tantary, A.Y.; Shah, F.A. An intertwining of curvelet and linear canonical transforms. J. Math. 2020, 2020, 1–14. [Google Scholar] [CrossRef]
  9. Shah, F.A.; Tantary, A.Y. Multi-dimensional linear canonical transform with applications to sampling and multiplicative filtering. Multidimens. Syst. Signal Process. 2022, 33, 621–650. [Google Scholar] [CrossRef]
  10. Wei, D.; Li, Y.M. Convolution and multichannel sampling for the offset linear canonical transform and their applications. IEEE Trans. Signal Process. 2019, 67, 6009–6024. [Google Scholar] [CrossRef]
  11. Xiang, Q.; Qin, K. Convolution, correlation, and sampling theorems for the offset linear canonical transform. Signal Image Video Process. 2014, 8, 433–442. [Google Scholar] [CrossRef]
  12. Ma, W.; Jia, X.C.; Zhang, D. Networked continuous-time filtering for quadratically inner-bounded time-delay systems with multirate sampling. J. Frankl. Inst. 2017, 354, 7946–7967. [Google Scholar] [CrossRef]
  13. Shah, F.A.; Tantary, A.Y.; Zayed, A.I. A convolution-based special affine wavelet transform. Integral Transform. Spec. Funct. 2021, 32, 780–800. [Google Scholar] [CrossRef]
  14. Wei, D.; Li, Y.M. Generalized wavelet transform based on the convolution operator in the linear canonical transform domain. Optik 2014, 125, 4491–4496. [Google Scholar] [CrossRef]
  15. Garg, T.K.; Lone, W.Z.; Shah, F.A.; Mejjaoli, H. A convolution-based shearlet transform in free metaplectic domains. J. Math. 2021, 2021, 1–23. [Google Scholar] [CrossRef]
  16. Srivastava, H.; Shah, F.A.; Tantary, A.Y. A family of convolution-based generalized Stockwell transforms. J. Pseudo-Differ. Oper. Appl. 2020, 11, 1505–1536. [Google Scholar] [CrossRef]
  17. Yu, S.S.; Zhou, N.R.; Gong, L.H.; Nie, Z. Optical image encryption algorithm based on phase-truncated short-time fractional Fourier transform and hyper-chaotic system. Opt. Lasers Eng. 2020, 124, 105816. [Google Scholar] [CrossRef]
  18. Gaglione, D.; Clemente, C.; Ilioudis, C.V.; Persico, A.R.; Proudler, I.K.; Soraghan, J.J.; Farina, A. Waveform design for communicating radar systems using fractional Fourier transform. Digit. Signal Process. 2018, 80, 57–69. [Google Scholar] [CrossRef]
  19. Wei, D. Novel convolution and correlation theorems for the fractional Fourier transform. Optik 2016, 127, 3669–3675. [Google Scholar] [CrossRef]
  20. Kamalakkannan, R.; Roopkumar, R. Multidimensional fractional Fourier transform and generalized fractional convolution. Integral Transform. Spec. Funct. 2020, 31, 152–165. [Google Scholar] [CrossRef]
  21. Deng, B.; Tao, R.; Wang, Y. Convolution theorems for the linear canonical transform and their applications. Sci. China Ser. F Inf. Sci. 2006, 49, 592–603. [Google Scholar] [CrossRef]
  22. Wei, D.; Ran, Q.; Li, Y. Multichannel sampling expansion in the linear canonical transform domain and its application to superresolution. Opt. Commun. 2011, 284, 5424–5429. [Google Scholar] [CrossRef]
  23. Wei, D.; Ran, Q.; Li, Y. A convolution and correlation theorem for the linear canonical transform and its application. Circuits Syst. Signal Process. 2012, 31, 301–312. [Google Scholar] [CrossRef]
  24. Wei, D.; Ran, Q.; Li, Y.; Ma, J.; Tan, L. A convolution and product theorem for the linear canonical transform. IEEE Signal Process. Lett. 2009, 16, 853–856. [Google Scholar]
  25. Zhang, Z.C. New convolution and product theorem for the linear canonical transform and its applications. Optik 2016, 127, 4894–4902. [Google Scholar] [CrossRef]
  26. Shah, F.A.; Teali, A.A.; Tantary, A.Y. Windowed special affine Fourier transform. J. Pseudo-Differ. Oper. Appl. 2020, 11, 1389–1420. [Google Scholar] [CrossRef]
  27. Bhat, M.Y.; Dar, A.H. The algebra of 2 D Gabor quaternionic offset linear canonical transform and uncertainty principles: The algebra of 2 D Gabor quaternionic offset LCT and uncertainty principles. J. Anal. 2022, 30, 637–649. [Google Scholar] [CrossRef]
  28. Shah, F.A.; Qadri, H.L.; Lone, W.Z. Non-separable windowed linear canonical transform. Optik 2022, 251, 168192. [Google Scholar] [CrossRef]
  29. Lu, W.k.; Zhang, Q. Deconvolutive short-time Fourier transform spectrogram. IEEE Signal Process. Lett. 2009, 16, 576–579. [Google Scholar]
  30. Gao, W.; Li, B. Convolution theorem involving n-dimensional windowed fractional Fourier transform. Sci. China Inf. Sci. 2021, 64, 169302. [Google Scholar] [CrossRef]
  31. Wei, D.; Hu, H. Theory and applications of short-time linear canonical transform. Digit. Signal Process. 2021, 118, 103239. [Google Scholar] [CrossRef]
  32. Shah, F.A.; Qadri, H.L.; Lone, W.Z. Free metaplectic wavelet transform in L2(ℝn). Int. J. Wavelets, Multiresolution Inf. Process. 2022, 20, 2250005. [Google Scholar] [CrossRef]
  33. Srivastava, H.M.; Shah, F.A.; Garg, T.K.; Lone, W.Z.; Qadri, H.L. Non-separable linear canonical wavelet transform. Symmetry 2021, 13, 2182. [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

Cui, M.; Zhang, Z. The Convolution Theorem Involving Windowed Free Metaplectic Transform. Fractal Fract. 2023, 7, 321. https://doi.org/10.3390/fractalfract7040321

AMA Style

Cui M, Zhang Z. The Convolution Theorem Involving Windowed Free Metaplectic Transform. Fractal and Fractional. 2023; 7(4):321. https://doi.org/10.3390/fractalfract7040321

Chicago/Turabian Style

Cui, Manjun, and Zhichao Zhang. 2023. "The Convolution Theorem Involving Windowed Free Metaplectic Transform" Fractal and Fractional 7, no. 4: 321. https://doi.org/10.3390/fractalfract7040321

APA Style

Cui, M., & Zhang, Z. (2023). The Convolution Theorem Involving Windowed Free Metaplectic Transform. Fractal and Fractional, 7(4), 321. https://doi.org/10.3390/fractalfract7040321

Article Metrics

Back to TopTop