Next Article in Journal
On Gaussian Leonardo Hybrid Polynomials
Previous Article in Journal
Spherical, Axial, and Triaxial Symmetries in the Study of Halo Nuclei with Covariant Density Functional Theory
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Wigner–Ville Distribution Associated with Clifford Geometric Algebra Cln,0, n=3(mod 4) Based on Clifford–Fourier Transform

1
Department of Mathematical Sciences, Islamic University of Science and Technology, Kashmir 192122, India
2
Mathematics Department, College of Science, King Khalid University, Abha 61413, Saudi Arabia
*
Author to whom correspondence should be addressed.
Symmetry 2023, 15(7), 1421; https://doi.org/10.3390/sym15071421
Submission received: 16 June 2023 / Revised: 7 July 2023 / Accepted: 8 July 2023 / Published: 15 July 2023

Abstract

:
In this study, the Wigner–Ville distribution is associated with the one sided Clifford–Fourier transform over R n , n = 3(mod 4). Accordingly, several fundamental properties of the WVD-CFT have been established, including non-linearity, the shift property, dilation, the vector differential, the vector derivative, and the powers of τ R n . Moreover, powerful results on the WVD-CFT have been derived such as Parseval’s theorem, convolution theorem, Moyal’s formula, and reconstruction formula. Eventually, we deduce a directional uncertainty principle associated with WVD-CFT. These types of results, as well as methodologies for solving them, have applications in a wide range of fields where symmetry is crucial.

1. Introduction

The Fourier transform is one of the most crucial fields in pure and applied mathematics. Recently, the Fourier transform has been widely studied in integral transforms in the real, complex or quaternion setting [1,2,3]. Brackx et al. [4] extended the Fourier transform to Clifford analysis C l 0 , n , which is called the Clifford–Fourier transform (CFT). Some characterizations of the CFT have been discussed [5], and its application in the vector fields and vector-valued filters have investigated by Ebling and Scheuremann [6]. Various types of CFT’s were intensively explored by many researchers. One of the most studied and investigated versions of CFT is C l 3 , 0 [6]. The geometric algebra of three-dimensional Euclidean space R 3 has been extended to n-dimensional Euclidean space Clifford algebras C l n , 0 [7,8,9], where some fundamental properties such as convolution, correlation, and the uncertainty principle were obtained. Furthermore, some other properties of CFT C l n , 0 where n = 3(mod 4) have also been proved, which involve linearity, scaling, shifting in space and frequency domain, the vector derivative, the vector differential, and the Parseval theorem. The directional uncertainty principle for C l n , 0 has also been verified [5]. Some authors presented the CFT differently, as in [10]. Hitzer in [11] proposed a new type of CFT, which can be regarded as the general form of two-sided quaternion Fourier transform (QFT) [12,13].
The Wigner–Ville distribution introduced by J.Ville can be described as one of the most effective methods in detecting linear frequency-modulated (LFM) signals and parameter estimation. The WVD plays a vital role in the analysis of non-stationary signals [14]. Hahn and Snopek developed Fourier–Wigner distributions of 2D quaternion signals [15], and then Bahri thoroughly discussed the 2D WVD associated with QFT [16]. Since then, tremendous work has been done on WVD [17,18,19,20]. The idea of associating the WVD with the Clifford algebra of n-dimensional Euclidean space R n has not been explored yet. The main purpose of this paper is to investigate the CFT and WVD and to derive the fundamental properties of the WVD associated with the CFT, which include linearity, scaling, shift property, vector differential and derivative, parseval theorem, convolution theorem, correlation theorem, Moyal’s formula, and the directional uncertainty principle.
The findings of our work can be best utilized in symmetry. The content of the current paper is organized as follows. Section 2 displays basic notions and results on Clifford algebra, which are needed throughout this study. In Section 3, the results regarding the Clifford–Fourier transform in R 3 are obtained and extended to Clifford–Fourier transform in R n , n = 3(mod 4). Section 4 deals with our main findings in detail, that is, the Wigner–Ville distribution associated with Clifford–Fourier transform.

2. Preliminaries

Clifford Geometric Algebra C 3 of R 3

The geometric algebra over R 3 denoted by C 3 consists of a graded 8 = 2 3 dimensional basis given by
{ 1 , e 1 , e 2 , e 3 , e 12 , e 23 , e 31 , e 123 }
where { e 1 , e 2 , e 3 } is the orthonormal basis of the real 3D Euclidean vector space R 3 .
Here, 1 is the real scalar identity element of grade 0; e 1 , e 2 , e 3 are the basis vectors of R 3 having grade 1; e 12 = e 1 e 2 , e 23 = e 2 e 3 , and e 31 = e 3 e 1 are the grade 2 basis bi-vectors that are frequently used; and e 123 = e 1 e 2 e 3 = i 3 is the trivector or volume element or unit-oriented pseudoscalar having grade 3—the highest grade blade element in C 3 , which commutes with all the other elements of C 3 and i 3 2 = 1 .
The basis vectors obey the following restrictions:
e m e n = e n e m f o r m n , m , n = 1 , 2 , 3 e m 2 = 1 f o r m = 1 , 2 , 3 .
Therefore, inner products obey the following condition:
e m . e n = 1 2 ( e m e n + e n e m ) = δ m n , m , n = 1 , 2 , 3 .
Thus, the inner product of grade 1 vectors x and y is given as
x . y = 1 2 ( x y + y x ) = ( x 1 e 1 + x 2 e 2 + x 3 e 3 ) . ( y 1 e 1 + y 2 e 2 + y 3 e 3 ) = x 1 y 1 + x 2 y 2 + x 3 y 3 .
Likewise, the outer product of two arbitrary grade 1 vectors x and y is as
x y = 1 2 ( x y y x ) = ( x 1 y 2 x 2 y 1 ) e 12 + ( x 3 y 1 x 1 y 3 ) e 31 + ( x 2 x 3 x 3 x 2 ) e 23 .
Hence, the Clifford geometric product of two arbitrary grade 1 vectors is written as
x y = x . y + x y ,
where x y is the scaler quantity and x y is the vector quantity. Therefore, Equation (1) clearly represents that the Clifford geometric product is the addition of the scaler and vector quantities.
Generally speaking, the elements of a geometric algebra are called multi-vectors. In C 3 , every multi-vector M can be expressed as
P = A α A e A = α 0 + α 1 e 1 + α 2 e 2 + α 3 e 3
+ α 12 e 12 + α 23 e 23 + α 31 e 31 + α 123 e 123 .
Equation (3) represents that every multi-vector can be expressed as linear combination of k-grade elements, k = 0 , 1 , 2 , 3 , where A { 0 , 1 , 2 , 3 , 12 , 23 , 31 , 123 } and α R . The above Equation (3) can be written as
P = P + P 1 + P 2 + P 3
where P k is called the grade selector for the k- vector part of M, specifically, P = P 0 . The reverse of P is defined by the anti-automorphism
P ˜ = P + P 1 P 2 P 3
which satisfies ( P Q ) ˜ = Q ˜ P ˜ for every P , Q C 3 . The square of the norm is defined by
P 2 = P Q ˜ = A α A 2
where
P Q ˜ = P Q ˜ = A α A β A
represents real valued scalar product for any multi-vectors P , Q C 3 , where P and Q are given by
P = A α A e A
Q = A β A e A .
Note that
P Q = Q P = P ˜ Q ˜ = Q ˜ P ˜
and
x 2 P 2 = x 2 P 2 = x P 2 , x R 3 .
It has been already proved that the norm satisfies the inequality:
P Q ˜ P Q P , Q C 3 .
Owing to (10), the Cauchy–Schwarz inequality for multi-vectors can be given as:
| P Q ˜ | 2 P 2 Q 2 P , Q C 3 .

3. Clifford–Fourier Transform

In this section, we discuss briefly the concept of Fourier transform in R and extend it to a Clifford’s geometric algebra C 3 of dimension 3. Other generalizations can be found in [21,22,23].

3.1. Fourier Transform in R

The definition of Fourier transform has been given by Popoulis [24] as
Definition 1. 
The Fourier transform of an integrable function f L 2 ( R ) is the function F { f } : R C defined by
F { f } ( ω ) = R f ( t ) e i ω t d t
where i 2 = 1 and e i ω t = c o s ω t i s i n ω t .
The general form of the function F { f } ( ω ) is given by
F { f } ( ω ) = A ( ω ) + i B ( ω ) = C ( ω ) e i ϕ ( ω )
where C ( ω ) is called the Fourier spectrum of f ( t ) and ϕ ( ω ) is its phase angle.
Definition 2 
(Inverse Fourier transform). The inverse Fourier transform of f L 2 ( R ) is defined by
f ( t ) = F 1 [ F { f } ] ( ω ) = 1 2 π R F { f } ( ω ) e i ω t d ω .
The basic properties of the Fourier transform are given below in Table 1.
Now, we will discuss the Clifford geometric algebra Fourier transform in C 3 .
Consider a multi-vector valued function f : R 3 C 3 , i.e.,
f ( t ) = A f A ( t ) e A = f 0 ( t ) + f 1 ( t ) e 1 + f 2 ( t ) e 2 + f 3 e 3
+ f 12 ( t ) e 12 + f 23 ( t ) e 23 + f 31 e 31 + f 123 e 123 ,
where f A are real valued functions and t is a vector variable. The above Equation (16) can be expressed as a set of four complex functions
f ( t ) = [ f 0 ( t ) + f 123 ( t ) i 3 ] + [ f 1 ( t ) + f 23 ( t ) i 3 ] e 1 + [ f 2 ( t ) + f 31 ( t ) i 3 ] e 2 + [ f 3 ( t ) + f 12 ( t ) i 3 ] e 3 .
This is the motivation behind the extension of Fourier transform to Clifford–Fourier transform (CFT), the definition of which is given below.
Definition 3. 
The Clifford–Fourier transform of f ( t ) L 2 ( R 3 , C 3 ) is given by
F { f } ( ω ) = R 3 f ( t ) e i 3 ω . t d 3 t ,
where t = t 1 e 1 + t 2 e 2 + t 3 e 3 ; ω = ω 1 e 1 + ω 2 e 2 + ω 3 e 3 ; and e 1 , e 2 , e 3 are the basis vectors of R 3 and
d 3 t = d t 1 d t 2 d t 3 i 3
is scalar valued, where d t k = d t k e k , k = 1 , 2 , 3 no summation.
Since i 3 commutes with element of C 3 , the Clifford–Fourier Kernel e i 3 ω . t also commutes with every element of C 3
Theorem 1 
(Inverse Clifford–Fourier transform). Let f L 2 ( R 3 , C 3 ) with R 3 f 2 d 3 t < ; then, the inverse of Clifford–Fourier transform is calculated by
f ( t ) = F 1 [ F { f } ] ( t ) = 1 ( 2 π ) 3 R 3 F f ( ω ) e i 3 ω . t d 3 ω .
Equation (20) is called the Clifford–Fourier integral theorem. It just shows how to get back to the given function f from the Fourier transform.
The proof is already formulated in [5].
The important properties and some theorems related to the CFT are summarized in Table 1, which have been already proved in [5].

3.2. Generalization towards One Sided n-Dimensional Clifford–Fourier Transform

This section recalls the definition of n-dimensional Clifford–Fourier transform C n = C l ( n , 0 ) , n = 3 ( m o d 4 ) with a graded 2 n dimensional basis. Then, we present some important properties of C n = C l ( n , 0 ) [5]. For more details on the Clifford algebra of the n dimension, see reference [5].
Definition 4. 
The Clifford–Fourier transform of f ( t ) L 2 ( R n , C n ) is given by:
F { f } ( ω ) = R n f ( t ) e i n ω . t d n t ,
where t = t 1 e 1 + t 2 e 2 + t 3 e 3 + . . . + t n e n ; ω = ω 1 e 1 + ω 2 e 2 + ω 3 e 3 + . . . + ω n e n ; and e 1 , e 2 , e 3 . . . , e n are the basis vectors of R n
and
d n t = d t 1 d t 2 d t 3 . . . d t n i n ,
is scalar valued, where d t k = d t k e k , k = 1 , 2 , 3 , , n no summation.
Since i n commutes with the element of C n , for n = 3 (mod 4), the Clifford–Fourier Kernel e i n ω . t also commutes with every element of C n . However, this is not true in the case of n = 2 (mod 4).
Theorem 2 
(Inverse Clifford–Fourier transform). Let f L 2 ( R n , C n ) with R n f 2 d n t < ; then, the inverse of Clifford–Fourier transform is calculated by
f ( t ) = F 1 [ F { f } ] ( t ) = 1 ( 2 π ) n R n F { f } ( ω ) e i n ω . t d n ω .
Proof. 
The proof has already been derived in [7] for the 3-dimensional case, which can be easily generalized in the case of n-dimensional Clifford–Fourier transform. □
Now, we will present some properties of C n = C l ( n , 0 ) in the Table 2, which will satisfy for n = 3 (mod 4) due to the commutative property of i n for n = 3 (mod 4).
In the coming section, we are now going to discuss our main work, that is, the Wigner–Ville distribution associated with the n-dimensional Clifford–Fourier transform, where n = 3 (mod 4).

4. Wigner–Ville Distribution Associated with Clifford Geometric Algebra C l n , 0 , n = 3 (mod 4) Based on Clifford–Fourier Transform, n = 3 (mod 4)

We begin by providing the definition of the Wigner–Ville distribution and enlist its properties.
Definition 5. 
The Wigner–Ville transform (WVT) of f , g L 2 ( R ) is defined by:
W f , g ( t , ω ) = R f t + τ 2 g t τ 2 ¯ e i ω τ d τ .
The fundamental properties of WVT and their proofs can be found in [21,22,23].
Definition 6 
(WVD-CFT). The WVD-CFT of two functions f , g ( R n , C n ) , n = 3 (mod 4) for any τ R n is defined as:
W f , g ( t , ω ) = R n f t + τ 2 g ¯ t τ 2 e i n ω . τ d n τ .
Suppose the auto correlation is defined as:
h t ( τ ) = f t + τ 2 g ¯ t τ 2 .
Therefore (6) becomes
W f , g ( t , ω ) = R n h t ( τ ) e i n ω . τ d n τ
with t , ω R n .
Note that d n τ = d τ 1 d τ 2 d τ 3 . . . d τ n i n is scalar valued with d x k = d x k e k R n , k = 1 , 2 , . . . , n , no summation.
Theorem 3. 
The WVD-CFT of f L 2 ( R n , C n ) , n = 3 ( m o d 4 ) , w i t h R n f 2 d n τ < is invertible, and its inverse is calculated by
f t + τ 2 f ¯ t τ 2 = 1 ( 2 π ) n R n W f ( t , ω ) e i n ω . τ d n ω
where h t ( τ ) is defined in (26).
Proof. 
1 ( 2 π ) n R n W f ( t , ω ) e i n ω . τ d n ω = 1 ( 2 π ) n R n R n f y + τ 2 f ¯ y τ 2 e i n ω . y d n y e i n ω . τ d n ω = 1 ( 2 π ) n R n R n f y + τ 2 f ¯ y τ 2 e i n ( τ y ) ω d n ω d n y = R n R n f y + τ 2 f ¯ y τ 2 m = 1 n e i m ( τ m y m ) ω m d n ω d n y = R n f y + τ 2 f ¯ y τ 2 m = 1 n δ ( τ m y m ) d n y = f t + τ 2 f ¯ t τ 2 .
This completes the proof.
Note that we have used 1 2 π R e i ( τ m y m ) ω m d ω m = δ ( τ m y m ) , 1 m n for the fourth equality. □
Theorem 4 
(Non-linearity property). Let f , g L 2 ( R n , C n ) , then
W f + g ( t , ω ) = W f ( t , ω ) + W g ( t , ω ) + W f , g ( t , ω ) W g , f ( t , ω ) .
Proof. 
W f + g ( t , ω ) = R n ( f + g ) t + τ 2 ( f + g ) ¯ t τ 2 e i n ω . τ d n τ = R n f t + τ 2 + g t + τ 2 f t + τ 2 ¯ + g t + τ 2 ¯ e i n ω . τ d n τ = R n f t + τ 2 f ¯ t τ 2 e i n ω . τ d n τ + R n g t + τ 2 g ¯ t τ 2 e i n ω . τ d n τ + R n f t + τ 2 g ¯ t τ 2 e i n ω . τ d n τ + R n g t + τ 2 f ¯ t τ 2 e i n ω . τ d n τ = W f ( t , τ ) + W g ( t , τ ) + W f , g ( t , τ ) + W g , f ( t , τ ) .
Hence, proved.
Theorem 5 
(Shift in space domain). Let f L 2 ( R n , C n ) and if f s ( t ) = f ( t t 0 ) , then
W f s ( t , ω ) = W f ( t t 0 , ω ) .
Proof. 
W f s ( t , ω ) = R n f t t 0 + τ 2 f ¯ t t 0 τ 2 e i n ω . τ d n τ .
Put t t 0 = α , we have
W f s ( t , ω ) = R n f α + τ 2 f ¯ α τ 2 e i n ω . τ d n τ = W f ( α , ω ) = W f ( t t 0 , ω ) .
Theorem 6 
(Shift in Frequency Domain). Let f L 2 ( R n , C n ) and if f 0 ( t ) = f ( t ) e i n ω 0 t , then
W f 0 ( t , ω ) = W f ( t , ω ω 0 ) .
Proof. 
W f 0 ( t , ω ) = R n f t + τ 2 e i n ω 0 ( t + τ 2 ) f ¯ t τ 2 e i n ω 0 ( t τ 2 ) e i n ω . τ d n τ = R n f t + τ 2 f ¯ t τ 2 e i n ( ω ω 0 ) τ d n τ = W f ( t , ω ω 0 ) .
The WVD-CFT W f ( t , ω ω 0 ) is centered at the point ω = ω 0 in the frequency domain.
Theorem 7 
(Plancherel theorem for WVD-CFT). Let f , g ( R n , C n ) with their WVD-CFT’s W f ( t , τ ) and W g ( t , τ ) , respectively, then
R n h f ( t , τ ) h g ( t , τ ) ¯ d n τ = 1 ( 2 π ) n R n W f ( t , τ ) W g ( t , τ ) ¯ d n ω
where
h f ( t , τ ) = f t + τ 2 f ¯ t τ 2 h g ( t , τ ) = g t + τ 2 g ¯ t τ 2 .
Proof. 
R n h f ( t , τ ) h g ( t , τ ) ¯ d n τ = 1 ( 2 π ) n R n R n W f , t ( τ ) e i n ω . τ d n ω h g , t ( τ ) ¯ d n τ = 1 ( 2 π ) n R n W f , t ( τ ) R n h g , t ( τ ) e i n ω . τ d n τ d n ω = 1 ( 2 π ) n R n W f ( t , τ ) W g ( t , τ ) ¯ d n ω
which proves (31). □
It is worth mentioning that the Plancherel theorem is a multivector-valued theorem. It is valid for each grade k , 0 k n of the multivectors on both sides of Equation (31). Hence, we conclude the following result.
Corollary 1. 
R n h f , t ( τ ) h g , t ( τ ) ¯ d n τ k = 1 ( 2 π ) n R n W f , t ( τ ) W g , t ( τ ) ¯ d n ω k .
Remark 1. 
If f = g , then we have the following multivector version of the Parseval theorem.
Theorem 8 
(Parseval theorem).
R n h f , t ( τ ) h f , t ( τ ) ¯ d n τ = 1 ( 2 π ) n R n W f , t ( τ ) W f , t ( τ ) ¯ d n ω .
Since M 2 = M M ¯ , the scalar part of the Parseval theorem together with M 2 = M M ¯ gives us the scalar Parseval theorem.
Theorem 9 
(Scalar parseval).
R n h f , t ( τ ) 2 d n τ = 1 ( 2 π ) n R n W [ h f , t ( τ ) ] 2 d n ω
Now, we will derive the most important result, that is, convolution for WVD-CFT.

4.1. Convolution for WVD-CFT

In the begininig, we shall define Clifford convolution.
Definition 7. 
Let f , g L 2 ( R n , C n ) ; then, the Clifford convolution is defined by
( f g ) ( t ) = R n f ( x ) g ( t x ) d x .
Theorem 10 
(Convolution for WVD-CFT). Let f , g L 2 ( R n , C n ) ; then, the Clifford Convolution for Wigner–Ville associated with CFT is
W f g ( t , ω ) = R n R n W f ( u , ω ) W g ( t u , ω ) d n u .
Proof. 
Since
W f , g ( t , ω ) = R n f t + τ 2 g ¯ t τ 2 e i n ω . τ d n τ ,
it follows that
W f g ( t , ω ) = R n ( f g ) t + τ 2 ( f ¯ g ¯ ) t τ 2 e i n ω . τ d n τ = R n R n f ( x ) g t + τ 2 x d x × R n f ( y ) ¯ g t τ 2 y d y e i n ω . τ d n τ
Put
x = u + v 2 y = u v 2 τ = v + w .
Therefore,
W f g ( t , ω ) = R n R n R n f u + v 2 g t + τ 2 u + v 2 × f u v 2 g ( t τ 2 ) ( u v 2 ) ¯ e i n ω . τ d n v d n w d n u = R n R n f u + v 2 f u v 2 ¯ e i n ω . v d n v × R n g t u + w 2 g t u w 2 ¯ e i n ω . w d w d n u = R n W f ( u , ω ) W g ( t u , ω ) d n u
which proves the convolution for WVD-CT. □
The following theorem, that is, the reconstruction formula for the WVD-CFT determines that the Clifford signal can be uniquely determined in terms of the WVD-CFT within a constant factor.
Theorem 11 
(Reconstruction formula for WVD-CFT). The inverse transform of the Clifford signal f L 2 ( R n , C n ) is given by
f ( u ) = 1 ( 2 π ) 2 g ¯ ( 0 ) R n W f , g u 2 , ω e i n ω . u d n ω .
provided g ¯ ( 0 ) 0 .
Proof. 
Since we know that
W f , g ( t , ω ) = R n f t + τ 2 g ¯ t τ 2 e i n ω . τ d n . τ .
By applying inverse of WVD-CFT (27), we obtain
f t + τ 2 g ¯ t τ 2 = 1 ( 2 π ) n R n W f , g ( t , ω ) e i n ω . τ d n ω
Using the change of variables τ 2 = t , we obtain
f ( 2 t ) g ¯ ( 0 ) = 1 ( 2 π ) 2 R n W f , g ( t , ω ) e 2 i n ω . t d n ω .
Again, using the change of variables 2 t = u , we have
f ( u ) = 1 ( 2 π ) 2 g ¯ ( 0 ) R n W f , g u 2 , ω e i n ω . u d n ω .
This ends the proof of the Theorem. □
Theorem 12 
(Moyal’s Formula for WVD-CT). Let f , g L 2 ( R n , C n ) ; then, the following equation holds:
R n R n | W f , g ( t , ω ) | 2 d n ω d n t = ( 4 π ) n R n | f ( u ) | 2 d n u R n | g ( v ) | 2 d n v .
Proof. 
W f , g ( t , w ) = F c { h t ( τ ) } ( w ) ,
where h t ( τ ) = f ( t + τ 2 ) g ¯ ( t τ 2 ) , which implies
R n W f , g ( t , w ) 2 d n w = F c { h t ( τ ) } L 2 ( R n , C l ( n , 0 ) ) 2 = ( 2 π ) n h t ( τ 2 = ( 2 π ) n R n f ( t + τ 2 ) g ¯ ( t τ 2 ) f ( t + τ 2 ) . g ¯ ( t τ 2 ) ¯ d n τ = ( 2 π ) n R n f ( t + τ 2 ) g ¯ ( t τ 2 ) f ¯ ( t + τ 2 ) . g ( t τ 2 ) d n τ .
Integrating above w.r.t d n t , we have
R n W f , g ( t , w ) 2 d n w d n t = ( 2 π ) n R n R n f ( t + τ 2 ) g ¯ ( t τ 2 ) f ¯ ( t + τ 2 ) . g ( t τ 2 ) d n τ d n t .
On setting t + τ 2 = u and t τ 2 = v , which gives d u = 1 2 d τ and d t = d v
R n W f , g ( t , w ) 2 d n w d n t = ( 2 π ) n . 2 n R n R n f ( u ) g ¯ ( v ) g ( v ) f ¯ ( u ) d n v d n u = ( 4 π ) n R n f ( u ) f ¯ ( u ) d n u R n g ( v ) 2 d n v = ( 4 π ) n R n f ( u ) 2 d n u . R n g ( v ) 2 d n v .
This proves the theorem. □
Theorem 13 
(Dilation). Let f , g ( R n , C n ) ; then,
W D c f , D c g = W f , g t c , c ω .
Proof. 
W D c f , D c g = 1 c 2 R n f t c + τ 2 c g ¯ t c τ 2 c e i n ω . τ d n τ
take τ c = y , which gives d y = d τ .
Therefore,
W D c f , D c g = R n f t c + x 2 g ¯ t c x 2 e i n c ω . x d n x = W f , g t c , c ω
Theorem 14 
(Powers of τ R n from left).
W { τ m h f , t ( τ ) } = ω m W { h f , t ( τ ) } i n m , m N
where
h t ( τ ) = f t + τ 2 f ¯ t τ 2 .
Proof. 
First we shall prove the theorem for m = 1
W { τ h t ( τ ) } = R n τ h f , t ( τ ) e i n ω . τ d n τ = R n ω h f , t ( τ ) i n e i n ω . τ d n τ = ω R n h f , t ( τ ) e i n ω . τ d n τ i n = ω w { h f , t ( τ ) } i n .
Repeating the process m 1 times, one obtains
W { τ m h f , t ( τ ) } = ω m W { h f , t ( τ ) } i n m , m N .
Theorem 15 
(Powers of τ R n from the right).
W { h f , t ( τ ) τ m } = R n h f , t ( τ ) ω m e i n ω . τ d n τ i n m m N .
Proof. 
We omit its proof as it follows directly from Theorem 14. □
Now, we will derive the final formulas for the WVD-CFT Of h f , t ( τ ) by using the above Equation (40) and the dimension dependent commutation properties of i n .
Theorem 16. 
W { ( a . τ ) m h f , t ( τ ) } = ( a . ω ) m W { h f , t ( τ ) } i n m
Proof. 
First, we shall prove the theorem for m = 1
W { ( a . τ ) h f , t ( τ ) } = R n a . τ h f , t ( τ ) e i n ω . τ d n τ = R n h f , t ( τ ) a . τ e i n ω . τ d n τ = R n h f , t ( τ ) a . ω i n e i n ω . τ d n τ = a . ω R n h f , t ( τ ) e i n ω . τ d n τ i n = a . ω W { h f , t ( τ ) } i n .
By repeating the process m 1 times
W { ( a . τ ) m h f , t ( τ ) } = ( a . ω ) m W { h f , t ( τ ) } i n m .
Corollary 2. 
On setting b . τ h f , t ( τ ) , b R n for h f , t ( τ ) , we obtain the following result.
W { ( a . τ ) b . τ h f , t ( τ ) } = a . ω b . ω W { h f , t ( τ ) } .
Theorem 17 
(Vector differential). The Clifford–Fourier transform of the m t h power vector differential of the auto-co-relation function h f , t ( τ ) is
W { ( a . ) m h f , t ( τ ) } = ( a . ω ) m W { h f , t ( τ ) } i n m .
Proof. 
We shall first prove (43) for m = 1
a . h f , t ( τ ) = a . . 1 ( 2 π ) n R n W { h f , t ( τ ) } e i n ω . τ d τ = 1 ( 2 π ) n R n W { h f , t ( τ ) } a . e i n ω . τ d τ = 1 ( 2 π ) n R n W { h f , t ( τ ) } a . ω i n e i n ω . τ d τ = W 1 { a . ω W h f , t ( τ ) i n } .
Therefore,
W { ( a . ) h f , t ( τ ) } = ( a . ω ) W { h f , t ( τ ) } i n .
Repeating the above process, we obtain (43). This completes the proof. □
Theorem 18 
(Left vector derivative).
W { m h f , t ( τ ) } = ω m W { h f , t ( τ ) } i n m
Proof. 
The proof is omitted as it follows directly from Theorem 17. □
Theorem 19 
( m from right).
h f , t ( τ ) m = 1 ( 2 π ) n R n W { h f , t ( τ ) } i n m e i n ω . τ ω m d n ω .
Proof. 
Setting m = 1
h f , t ( τ ) = 1 ( 2 π ) n R n W { h f , t ( τ ) } e i n ω . τ d n ω = 1 ( 2 π ) n R n W { h f , t ( τ ) } e i n ω . τ d n ω = 1 ( 2 π ) n R n W { h f , t ( τ ) } e i n ω . τ i n ω d n ω = 1 ( 2 π ) n R n W { h f , t ( τ ) } i n e i n ω . τ ω d n ω
This proves the case for m = 1 . Following the same procedure, we obtain (46). □

4.2. Uncertainty Principle

The uncertainty principle plays a central role in understanding the concepts of quantum physics and is also vital for information processing. Quantum physics states that the conjugate properties such as particle momentum and position cannot be simultaneously measured accurately. Fourier analysis states that a function and its Fourier transform cannot be simultaneously sharply localized.
In order to prove the directional uncertainty principle for WVD-CFT, we first state a lemma and a proposition about the directional uncertainty principle for Clifford–Fourier transform, which has been already proved in [5].
Lemma 1 
(Directional uncertainty principle for CFT). Let f ( R n , C n ) , having Clifford–Fourier transform F { f } with R n f 2 d n x = F < ; then, for any arbitrary constant vectors a , b :
R n ( a . x ) 2 f ( x ) 2 d n x . 1 ( 2 π ) n R n ( b . ω ) 2 F { f } ( ω ) 2 d n ω ( a . b ) 1 4 F 2
Proposition 1 
(Integration by parts).
R n f ( t ) [ a . g ( t ) ] d n t = R n 1 f ( t ) g ( t ) d n 1 t a . t = a . t = R n [ a . f ( t ) ] g ( t ) d n t .
Theorem 20 
(Directional uncertainty principle for WVD-CT). Let f , g ( R n , C n ) , such that h f , t ( τ ) = f ( t + τ 2 ) g ¯ ( t τ 2 ) having the Clifford–Fourier transform F { h t ( τ ) } ( ω ) . Suppose that R n h t ( τ ) 2 d n τ = H < ; then, for any arbitrary constant vectors a , b , the following inequality holds:
R n ( a . τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n ( b . ω ) 2 F { h t ( τ ) } ( ω ) 2 d n ω ( a . b ) H 2 .
Proof. 
R n ( a . τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n ( b . ω ) 2 F { h t ( τ ) } ( ω ) 2 d n ω = R n ( a . τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n F { b . h t ( τ ) } ( ω ) 2 d n ω u s i n g ( 44 ) = R n ( a . τ ) 2 h t ( τ ) 2 d n τ . R n b . h t ( τ ) 2 d n τ u s i n g ( 33 ) R n ( a . τ ) h t ( τ ) b . h t ( τ ) d n τ 2 R n a . τ h t ( τ ) ¯ b . h t ( τ ) d n τ 2 u s i n g ( 11 ) R n a . τ h t ( τ ) ¯ b . h t ( τ ) d n τ 2 .
We know that
( b . ) f 2 = 2 f ¯ ( b . ) f
Therefore, we have
R n ( a . τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n ( b . ω ) 2 F { h t ( τ ) } ( ω ) 2 d n ω R n a . τ 1 2 b . h t ( τ ) 2 d n τ 2 1 4 R n a . τ h t ( τ ) 2 d n 1 τ b . x = b . x = R n ( b . ) ( a . τ ) h t ( τ ) d n τ 2 u s i n g ( 47 ) = 1 4 0 a . b R n h t ( τ ) 2 d n τ 2 . = ( a . b ) H 2
which proves (48). This completes the proof. □
Corollary 3. 
If b = ± a , that is, b a with a 2 = 1 , then the above theorem gives the following result:
R n ( a . τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n ( a . ω ) 2 F { h t ( τ ) } ( ω ) 2 d n ω 1 4 H 2 .
Remark 2. 
Equality holds for the Gaussian multivector-valued function
h t ( τ ) = C 0 e k τ 2 .
where C 0 C n is an arbitrary constant multivector, 0 < k R .
Therefore, we have from (49)
a . h t ( τ ) = 2 k a . τ h t ( τ ) .
Theorem 21. 
For a . b = 0 , that is, a b , we have
R n ( a . τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n ( ω ) 2 F { h t ( τ ) } ( ω ) 2 d n ω 0
where
h t ( τ ) = f ( t + τ 2 ) g ¯ ( t τ 2 ) .
Theorem 22. 
With same assumptions as in theorem (48), we obtain the following result:
R n ( τ ) 2 h t ( τ ) 2 d n τ . 1 ( 2 π ) n R n ( ω ) 2 F { h t ( τ ) } ( ω ) 2 d n ω n 4 H 2 .

5. Conclusions

The Wigner–Ville distribution has been associated with the one-sided Clifford–Fourier transform over R n , n = 3(mod 4), and some fundamental properties of WVD-CFT have been established, such as non- linearity, the shift property, dilation, the vector differential, the vector derivative, and powers of τ R n . Additionally, some important theorems about WVD-CFT have been formulated, which include the Parseval theorem, the convolution theorem, Moyals formula, and the reconstruction formula. Finally, the directional uncertainty principle associated with WVD-CFT has been derived.

Author Contributions

Conceptualization, M.Y.B., S.R. and M.Z.; methodology, M.Y.B., S.R. and M.Z.; validation, M.Y.B., S.R. and M.Z.; formal analysis, M.Y.B., S.R. and M.Z.; investigation, M.Y.B., S.R. and M.Z.; resources, M.Z.; writing—original draft preparation, M.Y.B., S.R. and M.Z.; writing—review and editing, M.Y.B., S.R. and M.Z.; supervision, M.Y.B.; project administration, M.Y.B., S.R. and M.Z.; and funding acquisition, M.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This work is funded by the Deanship of Scientific Research at King Khalid University through a large group Research Project under grant number RGP2/237/44.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

M. Zayed extends her appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through large group Research Project under grant number RGP2/237/44.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Bahri, M. Product theorem for quaternion Fourier transform. Int. J. Math. Anal. 2014, 8, 81–87. [Google Scholar] [CrossRef] [Green Version]
  2. Haoui, Y.E.; Fahlaoui, S. Miyachi’s theorem for the quaternion Fourier transform. Circuits Syst. Signal Process. 2019, 39, 1–14. [Google Scholar]
  3. Xu, G.L.; Wang, X.T.; Xu, X.G. Fractional quaternion Fourier transform, convolution and correlation. Signal Process. 2008, 88, 2511–2517. [Google Scholar]
  4. Brackx, F.; Delanghe, R.; Sommen, F. Clifford Analysis; Pitman Advanced Pub. Program: Boston, MA, USA, 1982. [Google Scholar]
  5. Hitzer, E.; Bahri, M. Clifford–Fourier transform on multivector fields and Uncertainty principles for dimensions n = 2(mod 4) and n = 3(mod 4). Adv. Appl. Clifford Algebr. 2018, 18, 715–736. [Google Scholar] [CrossRef]
  6. Ebling, J.; Scheuermann, G. Clifford–Fourier transform on Vector Fields. IEEE Trans. Visual Comp. Graph. 2005, 11, 469–479. [Google Scholar] [CrossRef]
  7. Bahri, M.; Hitzer, E. Clifford–Fourier transformations and uncertainty principle for the Clifford geometric algebra Cl3,0. Adv. Appl. Clifford Algebr. 2006, 16, 41–61. [Google Scholar]
  8. Hitzer, E.; Bahri, M. Uncertainty Principle for the Clifford Geometric Algebra Cln,0, n = 3(mod 4) Based on Clifford–Fourier Transform; Springer (SCI) Book Series Applied and Numerical Harmonic Analysis; 2006; pp. 45–54. [Google Scholar]
  9. Bahri, M.; Ashino, R.; Vailancourt, R. Convolution theorems for Clifford–Fourier transform and properties. J. Indian Math. Soc. 2014, 20, 125–140. [Google Scholar] [CrossRef] [Green Version]
  10. Brackx, F.; Schepper, N.D.; Sommen, F. The Clifford–Fourier transform. J. Fourier Anal. Appl. 2005, 11, 669–681. [Google Scholar] [CrossRef]
  11. Hitzer, E. General Steerable two-sided Clifford–Fourier transform, Convolution and Mustard Convolution. Adv. Appl. Clifford Algebr. 2017, 27, 2215–2234. [Google Scholar] [CrossRef]
  12. Bahri, M. A modified uncertainty principle for two sided quaternion Fourier transform. Adv. Appl. Clifford Algebr. 2016, 26, 513–527. [Google Scholar] [CrossRef]
  13. Bahri, M.; Ashino, R. A variation on uncertainty principle and logarithmic uncertainty principle for continuous quaternion wavelet transform. Abstr. Appl. Anal. 2017, 217, 3795120. [Google Scholar] [CrossRef] [Green Version]
  14. Xia, X.G.; Owechko, Y.; Soffer, H.B.; Matic, M.R. On generalized marginal time-frequency distributions. IEEE Trans. Signal Process. 1996, 44, 2882–2886. [Google Scholar] [CrossRef]
  15. Hahn, S.L.; Snopek, K.M. Wigner distributions and ambiguity functions of 2-D quaternionic and monogenic signals. IEEE Trans. Signal Process. 2005, 53, 3111–3128. [Google Scholar] [CrossRef]
  16. Bahri, M. On two dimensional quaternion Wigne-Ville distribution. J. Appl. Math. 2014, 2014, 139471. [Google Scholar] [CrossRef] [Green Version]
  17. Bhat, M.Y.; Dar, A.H.; Nurhidayat, I.; Pinelas, S. An Interplay of Wigner–Ville Distribution and 2D Hyper-Complex Quadratic-Phase Fourier Transform. Fractal Fract. 2023, 7, 159. [Google Scholar] [CrossRef]
  18. Bhat, M.Y.; Dar, A.H. Quadratic-phase scaled Wigner distribution: Convolution and correlation. Signal Image Video Process. 2023, 17, 2779–2788. [Google Scholar] [CrossRef]
  19. Dar, A.H.; Bhat, M.Y. Wigner Distribution and Associated Uncertainty Principles in the Framework of Octonion Linear Canonical Transform. Optik 2022, 272, 170213. [Google Scholar] [CrossRef]
  20. Bhat, M.Y.; Almanjahie, I.B.; Dar, A.H.; Dar, J.G. Wigner–Ville Distribution and Ambiguity Function Associated with the Quaternion Offset Linear Canonical Transform. Demonstr. Math. 2022, 55, 786–797. [Google Scholar] [CrossRef]
  21. Claasen, T.A.C.M.; Mecklenbrauker, W.F.G. The Wigner distribution—A tool for time-frequency signal analysis—Part I: Continuous-time signals. Philips J. Res. 1980, 35, 217–250. [Google Scholar]
  22. Claasen, T.A.C.M.; Mecklenbrauker, W.F.G. The Wigner distribution—A tool for time-frequency signal analysis—Part II: Discrete-time signals. Philips J. Res. 1980, 35, 276–300. [Google Scholar]
  23. Claasen, T.A.C.M.; Mecklenbrauker, W.F.G. The Wigner distribution—A tool for time-frequency signal analysis—Part III: Relation with other time-frequency signal transformations. Philips J. Res. 1980, 35, 372–389. [Google Scholar]
  24. Papoulis, A. The Fourier Integral and Its Applications; Mc Gra-Hill Book Company, Inc.: New York, NY, USA, 1962. [Google Scholar]
Table 1. Properties of 3-dimensional Clifford–Fourier transform f , g L 2 ( R 3 , C 3 ) , α , β C 3 , s 0 , ω 0 R 3 .
Table 1. Properties of 3-dimensional Clifford–Fourier transform f , g L 2 ( R 3 , C 3 ) , α , β C 3 , s 0 , ω 0 R 3 .
PropertyFunctionCFT
Linearity α f ( t ) + β g ( t ) α F { f } ( ω ) + β F { f } ( ω )
Delay property f d ( t ) = f ( t a ) e i 3 ω . a F { f } ( ω )
Scaling property f s ( t ) = f ( s t ) 1 s 3 F { f } ( ω s )
Shift property f 0 ( t ) = f ( t ) e i 3 ω 0 . t F { f } ( ω ω 0 )
Vector differential a . f i 3 a . ω F { f } ( ω )
Vector derivative f i 3 ω { f } ( ω )
Convolution f g F { f } ( ω ) F { g } ( ω )
Parseval theorem R 3 f ( t ) 2 d 3 t 1 ( 2 π ) 3 F { f } ( ω ) 2 d 3 ω
Table 2. Properties of n-dimensional Clifford–Fourier transform, n = 3 ( mod 4 ) , f , g L 2 ( R n , C n ) , α , β C n , a 0 , ω 0 R n .
Table 2. Properties of n-dimensional Clifford–Fourier transform, n = 3 ( mod 4 ) , f , g L 2 ( R n , C n ) , α , β C n , a 0 , ω 0 R n .
PropertyFunctionCFT
Left linearity α f ( t ) + β g ( t ) α F { f } ( ω ) + β F { f } ( ω )
Scaling f a ( t ) = f ( a t ) , a 0 1 | a | n F { f } ( ω a )
Shift in frequency domain f 0 ( t ) = f ( t ) e i n ω 0 . t F { f } ( ω ω 0 )
Shift in space domain f 0 ( t ) = f ( t a ) F { f } ( ω ) e i n ω . a
Power of t R n from left t m f ( t ) ω m F { f } ( ω ) i n m
Power of t R n from right f ( t ) t m R n f ( t ) ω m e i n ω . t d n t . i n m
Parseval theorem R n f 1 ( t ) f 2 ( t ) ˜ d n t 1 ( 2 π ) n R n F { f 1 } ( ω ) F { f 2 } ( ω ) ˜ d n t
Scalar Parseval theorem R n f ( t ) 2 d n t 1 ( 2 π ) n F { f } ( ω ) 2 d n ω
Convolution f g F { f } ( ω ) F { g } ( ω )
Vector derivative (left) m f ( t ) i n m ω m F { f } ( ω )
Vector derivative (right) f ( t ) m i n m F { f } ( ω ) ω m
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

Bhat, M.Y.; Rafiq, S.; Zayed, M. Wigner–Ville Distribution Associated with Clifford Geometric Algebra Cln,0, n=3(mod 4) Based on Clifford–Fourier Transform. Symmetry 2023, 15, 1421. https://doi.org/10.3390/sym15071421

AMA Style

Bhat MY, Rafiq S, Zayed M. Wigner–Ville Distribution Associated with Clifford Geometric Algebra Cln,0, n=3(mod 4) Based on Clifford–Fourier Transform. Symmetry. 2023; 15(7):1421. https://doi.org/10.3390/sym15071421

Chicago/Turabian Style

Bhat, Mohammad Younus, Shahbaz Rafiq, and Mohra Zayed. 2023. "Wigner–Ville Distribution Associated with Clifford Geometric Algebra Cln,0, n=3(mod 4) Based on Clifford–Fourier Transform" Symmetry 15, no. 7: 1421. https://doi.org/10.3390/sym15071421

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop