Short-time free metaplectic transform: Its relation to short-time Fourier transform in L 2 ( R n ) and uncertainty principles

: The free metaplectic transformation (FMT) has gained much popularity in recent times because of its various applications in signal processing, paraxial optical systems, digital algorithms, optical encryption and so on. However, the FMT is inadequate for localized analysis of non-transient signals, as such, it is imperative to introduce a unique localized transform coined as the short-time free metaplectic transform (ST-FMT). In this paper, we investigate the ST-FMT. First we propose the deﬁnition of the ST-FMT and provide the time-frequency analysis of the proposed transform in the FMT domain. Second we establish the relationship between the ST-FMT and short-time Fourier transform (STFT) in L 2 ( R n ) and investigate the basic properties of the proposed transform including the reconstruction formula, Moyal’s formula. The emergence of the ST-FMT deﬁnition and its properties broadens the development of time-frequency representation of higher-dimensional signals theory to a certain extent. We extend some di ﬀ erent uncertainty principles (UPs) from quantum mechanics including Lieb’s inequality, Pitt’s inequality, Hausdor ﬀ -Young inequality, Heisenberg’s UP, Hardy’s UP, Beurling’s UP, Logarithmic UP and Nazarov’s UP. Finally, we give a numerical example and a possible applications of the proposed ST-FMT.


Introduction
The free metaplectic transformation (FMT) also known as the n-dimensional linear canonical transformation (LCT) first studied in [1], is widely used in many fields such as filter design, pattern recognition, optics and analyzing the propagation of electromagnetic waves [2][3][4][5].The theory of FMT with a general 2n × 2n real, symplectic matrix M = (A, B : C, D) with n(2n + 1) degrees of freedom [6,7].The FMT embodies several signal processing tools ranging from the classical Fourier, Fresnel transform, and even the fundamental operations of quadratic phase factor multiplication [8][9][10].The metaplectic operator or the FMT of any function f ∈ L 2 (R n ) with the real free symplectic matrix M = (A, B : C, D) is given by [9,32] where K M (x, w) denotes the kernel and is given by 2) The arbitrary real parameters involved in (1.1) are of great importance for the efficient analysis of the inescapable signals, i.e., the chirp-like signals.Due to the extra degrees of freedom, the FMT has been successfully employed in diverse problems arising in various branches of science and engineering, such as harmonic analysis, optical systems, reproducing kernel Hilbert spaces, quantum mechanics, image processing, sampling and so on [11,12].However, FMT has a drawback.Due to its global kernel it is not suitable for processing signals with varying frequency content [13,14].The short-time free metaplectic transform (ST-FMT) with a local window function can efficiently localize the frequency spectrum of non-transient signals in the free metaplectic transform domain, hence, overcomes this drawback.Taking this opportunity, our goal is to introduce the notion of the short-time free metaplectic transform, which is a generalized version of FMT and endowed with higher degrees of freedom, resulting in an efficient localized analysis of chirp signals.
Let us now move to the uncertainty iprinciple.Uncertainty principle was introduced by the German physicist Heisenberg [15] in 1927 and is known as the heart of any signal processing tool.With the passage of time, researchers further extended the uncertainty principle to different types of new uncertainty principles associated with the Fourier transform, for instance, Heisenberg's uncertainty principle, Logarithmic uncertainty principle, Hardy's uncertainty principle and Beurling's uncertainty principle [16][17][18][19][20][21].Later these uncertainty principles were extended to LCT and its generalized domains [22][23][24][25][26][27][28][29][30][31].In [32] authors proposed uncertainty principles associated with the FMT and in [33] (7) To present possible applications and an illustrative example.
The paper is organized as follows: In Section 2, we discuss some preliminary results and definitions required in subsequent sections.In Section 3, we formally introduced the definition of short-time free metaplectic transform (ST-FMT).Then we investigated several basic properties of the ST-FMT that are important for signal representation in signal processing.In Section 4, we extend some different uncertainty principles (UP) from quantum mechanics, including Lieb's inequality, Pitt's inequality, Heisenberg's UP, Hausdorff-Young inequality, Hardy's UP, Beurling's UP, Logarithmic UP and Nazarov's UP, which have already been well studied in the FMT domain.Section 5 is devoted to a numerical example and potential applications of the proposed ST-FMT.

Preliminary
This section give some useful definitions and lemmas about the multi-dimensional Fourier transform and free metaplectic transform.

Multi-dimensional Fourier transform (FT)
For any f ∈ L 2 (R n ), the n-dimensional Fourier transform (FT) of f (x) is given by [32] and its inversion is given by Based on the definition of short-time Fourier transform (STFT) [34], we can define n-dimensional STFT as: Definition 2.1.Let φ be a window function in L 2 (R n ), then for any f ∈ L 2 (R n ) the n-dimensional short-time Fourier transform (STFT) of f (x) with respect to the window function φ is given by [33] V (2.3)

The transpose of M
Also, inverse of the free symplectic matrix is given by M [FMT] The free metaplectic transform of a function f ∈ L 2 (R n ) with respect 2n × 2n real, free symplectic matrix M = (A, B : C, D) (with |det(B)| 0) is defined by where K M (x, w) denotes the kernel and is given by ) , then the inversion of the free metaplectic transform of f is given by where For real, symplectic matrix M = (A, B : C, D), the free metaplectic transform kernel (2.5) satisfies the following important properties: (i) then the free metaplectic transform satisfies the following parseval's formula: (2.7) The free metaplectic transform (defined in (2.4)) of a function f ∈ L 2 (R n ) can be computed via associated n-dimensional FT, namely where F { f }(w) represents the n-dimensional FT defined in (2.1) as (2.10) Equation (2.9) can be rewritten as where H(x) is given by (2.12) f (x), then we have following relationship between n-dimensional FT and FMT: (2.13) Proof.The proof follows by changing w = Bw and taking the modulus in (2.11).
Remark 2.1.If we change w = Bw and take the modulus in (2.9), we have where

The short-time free metaplectic transform
In this section, we introduce the novel short-time free metaplectic transform (ST-FMT) and discuss several basic properties of the ST-FMT.These properties play important roles in signal representation of multi-dimensional signals.
Definition 3.1.Let M = (A, B : C, D) be a real, free symplectic matrix.Let φ be a window function in L 2 (R n ), the short-time free metaplectic transform (ST-FMT) of the function f ∈ L 2 (R n ) with respect to φ is defined by where In terms of classic convolution, formula (3.1) can be written as . Also, by applying the properties of the free metaplectic transform, (3.1) can be rewritten in the form of an inner product as where The prolificacy of the short-time free metaplectic transform given in Definition 3.1 can be ascertained from the following important deductions: (i) When M = (I n cos α, I n sin α : −I n sin α, I n cos α), the ST-FMT (3.1) yields the n-dimensional non-separable short-time fractional Fourier transform: (ii) For M = (0, I n − I n , 0), the ST-FMT (3.1) boils down to an n-dimensional short-time Fourier transform: (iv) For M = (I n , B : 0, I n ), the ST-FMT (3.1) boils down to an n-dimensional short-time Fresnel transform: Now we shall establish a relationship between FMT and ST-FMT, which will be helpful in establishing various uncertainty principles in Section 4.
For fixed u, we have Applying the inverse free metaplectic transform (2.6), we have Now, we discuss several basic properties of the ST-FMT given by (3.1).These properties play important roles in multi-dimensional signal processing.
The following properties follow directly from the definition of the ST-FMT, viz: linearity; antilinearity; translation; modulation and scaling are omitted.We shall focus on boundedness, Moyal's formula and inversion.
Next we prove the lemma that is very important in establishing various uncertainty principles in Section 4.
, then we have following relationship between n-dimensional FT and ST-FMT: Proof.From (3.1), we have On changing w = Bw and taking the modulus in (3.8), we get where φ is a non-zero window function, then we have Proof.By using the Cauchy-Schwarz inequality in Definition 3.1, we have On further simplification, we obtain which completes the proof.
In the following theorem, we show that the proposed ST-FMT is reversible in the sense that the input signal f can be recovered easily from the transformed domain.

Theorem 3.3. (Inversion) For any fixed window function
Proof.From (3.4), we have Multiplying both sides of the last equation by φ(x − u) and integrating with respect to du, yields g](w, u) be the ST-FMT transforms of f and g, respectively.Then, we have Proof.
Now applying (3.4) in the above equation, we obtain which completes the proof.
From the above theorem, we obtain the following consequences: Equation (3.13) states that the proposed ST-FMT (3.1) becomes an isometry from In other words, the total energy of a signal computed in the short-time non-seperable linear canonical domain is equal to the total energy computed in the spatial domain.

N-dimensional uncertainty principles for the short-time free metaplectic transform
The uncertainty principle lies at the heart of harmonic analysis, which asserts that "the position and the velocity of a particle cannot be determined precisely at the same time."Authors in [32] studied various uncertainty principles associated with non-seperable LCT.Since ST-FMT is the generalized version of FMT and keeping in view the fact that the theory of UP's for the shorttime free metaplectic transform is yet to be explored exclusively, it is natural and interesting to study different forms of UP's in the ST-FMT domain.

Pitt's inequality
The Pitt's inequality in the Fourier domain expresses a fundamental relationship between a sufficiently smooth function and the corresponding Fourier transform [26].The Pitt's inequality introduced in [32] can be extended to the free metaplectic transformation domain.We here extend it to the ST-FMT domain.
Lemma 4.1.(Pitt's inequality for the FMT [35]) Let f ∈ S(R n ) the Schwartz class in L 2 (R n ), then we have the inequality Based on Pitt's inequality for the FMT, we obtain Pitt's inequality for the ST-FMT.
, then by virtue of (3.3), we have Now applying Lemma 4.1 to the above equation, we obtain On integrating both sides of (4.3) with respect to du, we have which completes the proof.

Lieb's UP
Here we shall establish Lieb's uncertainty principle for the ST-FMT by using the relation between ST-FMT with the short-time Fourier transform in L 2 (R n ).
Then the following inequality holds: where V φ [ f ](w, u) denotes the STFT of f given by (2.1) and S(R n ) is the Schwartz class in L 2 (R n ).
To obtain an analogue of the Leib's inequality for the ST-FMT, we replace f in the above equation by H (defined in 2.12), Setting w = B −1 w in (4.5), we get Now using Lemma 3.1, we obtain On further simplifying, we have which completes the proof.

Heisenberg's UP
In [32], authors introduced Heisenberg's UP to observe the lower bound of uncertainty corresponding to the free metaplectic transformation.We extend it to the proposed Heisenberg's UP for the ST-FMT.
Proof.For any f ∈ L 2 (R n ) the Heisenberg-Pauli-Weyl uncertainty inequality for the FMT domain is given by [32]: Using the inversion of FMT (2.6) into the (2.8), above inequality becomes First taking the square of the above equation and then integrating both sides with respect du, we obtain As a consequence of the Cauchy-Schwartz's inequality and Fubini theorem, the above inequality yields Now using (3.4) and (3.12) the above equation, we have Simplifying, we obtain On dividing both sides by φ L 2 (R n ) , we will get the desired result.
Theorem 4.4.(Hausdorff-Young) Let 1 ≤ p ≤ 2 and q be such that 1 p + 1 q = 1.Then for φ ∈ L q (R n ) and f ∈ L p (R n ), the following inequality holds: Proof.The definition of FMT 2.2 and procedure defined in Theorem 5.1 [36] together leads to For p = 1, we get Now using (4.10) and taking φ L q (R n ) = 1, Eq (3.3) yields Now for p = 2, we obtain By Riesz-Thorin interpolation theorem, we have where φ is a window function in L p (R n ), we have by anti-linearity property of FMT On taking φ = g in (4.11), we obtain which on simplification becomes This completes the proof.

Logarithmic UP
In 1995, W. Beckner [26] introduced the Logarithmic uncertainty principle.In this subsection we obtain the concept of Logarithmic uncertainty principle for the short-time free metaplectic transform as follows: Theorem 4.5.(Logarithmic UP) Let φ be a window function in L 2 (R n ) and let V M φ [ f ](w, u) ∈ S(R n ), then the short-time free metaplectic transform satisfies the following logarithmic uncertainty inequality: Proof.For any f ∈ S(R n ), the Logarithmic UP for the free metaplectic transform domain is given by [32]: Now invoking the inversion formula of the free metaplectic transform and the Parseval's formula, we obtain Integrating above inequality with respect du on both sides and then by virtue of Fubini's theorem, we have Now using (3.4) and (3.12) in thef above inequality, we have Further simplifying, we obtain the desired result as

Hardy's UP
G. H. Hardy first introduced the Hardy's uncertainty principle in 1933 [37].Hardy's uncertainty principle says that it is impossible for a function and its Fourier transform to decrease very rapidly simultaneously.Hardy's UP in the Fourier transform domain [38] was given as follows: Lemma 4.2.(Hardy's UP in the Fourier transform [38] where C is a constant in C.
Based on Lemma 4.2, we derive the corresponding Hardy's UP for the ST-FMT.
where C is a constant in C.

Proof. Consider then function
Also by Lemma 3.2, we have This completes the proof.

Beurling's UP
Beurling's uncertainty principle is a more general version of Hardy's uncertainty principle, which is given by A. Beurling.It implies the weak form of Hardy's UP.Beurling's UP in the Fourier transform domain is as follows: Lemma 4.3.(Beurling's UP in the Fourier transform domain [24]) Let f ∈ L 2 (R n ) and d ≥ 0 satisfy where A is a real positive definite symmetric matrix and P(x) is a polynomial of degree < d−n 2 .According to Lemma 4.3, we derive Beurling's uncertainty principle for the ST-FMT.
where A is a real positive definite symmetric matrix and P(x) is a polynomial of degree < d−n 2 .
Proof.Consider the function Therefore by Lemma 4.3, we have where A is a real positive definite symmetric matrix and P(x) is a polynomial of degree This completes the proof.

Nazarov's UP
Nazarov's UP was first proposed by F. L. Nazarov in 1993 [22].It measures the localization of a nonzero function by taking into consideration the notion of support of the function instead of the dispersion.In other words it argues what happens if a non-trival function and its Fourier transform are only small outside a compact set.Let us start with Nazarov's UP for the Fourier transform.Lemma 4.4.(Nazarov's UP for the Fourier transform [23]) There exists a constant K, such that for finite Lebesgue measurable sets S , E ⊂ R n and for every f ∈ L 2 (R n ), we have Ke K(S ,E) φ [ f ] be the short-time FMT, then under the assumptions of Lemma 4.4 for every f ∈ L 2 (R n ), the following inequality holds: Proof.Applying Lemma 4.4 to the function F(x) ∈ L 2 (R n ) defined in Lemma 3.2, we have Now with the help of Lemma 3.7, we have Integrating both sides with respect to u, we obtain Implementing Fubini's theorem, we have which completes the proof.
Alternative proof.For any function f ∈ L 2 (R n ) and a pair of finite measurable subsets S and E of R n , Nazarov's uncertainty principle in the linear canonical domain reads [32] Ke K(S ,E) where is the mean width of measurable subset, and |.| denotes the Lebesgue measure.Moreover, the relationship between the ST-FMT and the FMT is given by Since f (x)φ(x − u) ∈ L 2 (R n ) then by virtue of (4.14), we have Using (4.15), we have Integrating both sides with respect to u, we obtain On implementing the well known Fubini theorem in above equation, we obtain the desired result as This completes the proof.

Numerical example and potential applications
Using simulation, we will offer an illustrated case in this section to demonstrate the proposed ST-FMT (3.1) and some potential applications.
We start with an illustrative example as: 2 , which is a well known 2D-Gaussian window function.Then . (5.1) Subsequently, the ST-FMT (3.1) of f (x) with respect to the 2D-Gaussian window function φ(x), and the real symplectic matrix M = (A, B : C, D) with is given by Moreover, we have x (5.5) Plugging Eqs (5.3)-(5.5) in Eq (5. 3), we get It is clear from (5.6) that the ST-FMT given in Definition 3.1 can be visualized as a signal with four parameters w 1 , w 2 , u 1 and u 2 .A simultaneous visualization of the ST-FMT in all the four variables is hardly possible.Therefore, in order to have a sound visualization, some variables have either to be fixed or eliminated, so that one is restricted to a particular section of the parameter space.This gives rise to several representations associated with the ST-FMT (3.1).The UPs in the ST-FMT environment share the same philosophy as the UPs in the FMT environment.The ST-FMT case is subject to suitably incorporate the window function.The purpose of this section is to demonstrate the value and significance of the theorems in signal processing through a few hypothetical applications.The band-widths are frequently estimated using UPs.For example, if the spread of the signal in the time domain (T M ) is known, then the bandwidth of a system that performs ST-FMT cannot be narrower than n 2 σ 2 min (B) 16T 2 M π 2 .Thus, the derived Theorem 4.3 can be used in the estimation of effective bandwidths in the ST-FMT.Other potential applications can be found in the estimation of the lower bound of an integral as if a signal in Theorem 4.3 is determined, it is difficult to obtain the value of the left side of Theorem 4.3 by calculating the integral.However, an estimation of the left side of Theorem 4.3 can be easily obtained based on Theorem 4.3.The UPs have some applications in signal recovery.Donoho and Stark [16] studied the problem of signal recovery.The potential applications can be found in signal modulations and filter design, such as the methods presented in [39,40].Authors in [8] have shown that the uncertainty principle related to the spread in the FMT domain has an immediate application in the discussion of some well-known optical propagation models, such as wave propagation through an aperture, free-space propagation and pulse propagation in optical fibres.The correlative result has been applied to the ST-FMT domain as well.

Conclusions
In this paper we presented a novel concept of short-time free metaplectic transform.Based on the properties of ST-FMT and FMT, the relationship between these two notations are presented.Important properties such as boundedness, reconstruction formula and Moyals formula are derived.Then, we extend some different uncertainty principles from quantum mechanics including Lieb's inequality, Pitt's UP, Heisenberg's UP, Hausdorff-Young inequality, Hardy's UP, Beurling's UP, Logarithmic UP and Nazarov's UP which have already been well studied in the ST-FMT domain.Finally, we provided a numerical example and some potential applications of the proposed ST-FMT.

For
typographical convenience, we shall denote a 2n × 2n matrix M = A B C D as M = (A, B : C, D), where A, B, C and D are real n × n sub-matrices.Moreover, we recall that the matrix M is said to be a free symplectic matrix if M T ΩM = Ω, and |det(B)| 0, where Ω = (0, I n : −I n , 0) and I n represents the n × n identity matrix.The sub-matrices of M satisfy the following constraints: AB T = BA T , CD T = DC T , AD T − BC T = I n .AIMS Mathematics Volume 8, Issue 12, 28951-28975.

Theorem 4 . 1 .
(Pitt's inequality for the ST-FMT) Under the assumptions of Lemma 4.1, we have

Theorem 4 . 3 .
(Heisenberg's UP) Let V M φ [ f ] be the short-time free metaplectic transform of any nontrivial function f ∈ L 2 (R n ) with respect to a real free symplectic matrix M = (A, B : C, D), then the following inequality holds: where K(S , E) = Kmin(|S ||E|, |S | 1/n , µ(E), µ(S )|E| 1/n ), µ(S ) is the mean width of S and |S | denotes the Lebesgue measure of S .Now we shall establish Nazarov's UP to the short-time non-sperable linear canonical transform domain.Theorem 4.8.(Nazarov's UP) Let V M

Example 5 . 1 . 2 1 −x 2 2
Consider a function given by f (x) = e −x and taking the window function φ (i) Position Representation: If V M φ [ f ](w, u) is solely regarded as a function of the translation parameter u in (5.6), then the ST-FMT (3.1) yields a position representation system V M φ [ f ](., u), which is widely used in image processing: Shape and contours of objects, pattern recognition, detection of position, image filtering and so on.The real and imaginary parts of the position representation of V M φ [ f ](w, u) for the symplectic matrix M given by (5.2) are presented in Figure 1.(ii) Frequency Representation: If in V M φ [ f ](w, u) the translation parameter u is kept constant, then the ST-FMT (3.1) is regarded as a function of frequency w.The frequency representation system V M φ [ f ](w, .) is especially useful in situations where frequency behaviour is important.The real and imaginary parts of the frequency representation of V M φ [ f ](w, u) for the symplectic matrix M given by (5.2) and u = (0, 0) is presented in Figure 2.

Figure 1 .
Figure 1.Real and imaginary parts of the position of an Example 5.1 for w = (2, 1).

Figure 2 .
Figure 2. Real and imaginary parts of the frequency of an Example 5.1 for t = (0, 0).