Next Article in Journal
Mode Locking, Farey Sequence, and Bifurcation in a Discrete Predator-Prey Model with Holling Type IV Response
Previous Article in Journal
The m-CCE Inverse in Minkowski Space and Its Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

New Uncertainty Principles in the Linear Canonical Transform Domains Based on Hypercomplex Functions

School of Mathematical Science, Yangzhou University, Yangzhou 225002, China
Axioms 2025, 14(6), 415; https://doi.org/10.3390/axioms14060415
Submission received: 7 May 2025 / Revised: 27 May 2025 / Accepted: 27 May 2025 / Published: 28 May 2025

Abstract

:
In this paper, we obtain uncertainty principles associated with the linear canonical transform (LCT) of hypercomplex functions. First, we derive the uncertainty principle for hypercomplex functions in the time and LCT domains. Moreover, we exploit the uncertainty principle in two LCT domains. The lower bounds are related to the LCT parameters and the covariance, and the uncertainty principle presented herein is sharper than what has been presented in the existing literature.These tighter bounds can be obtained using hypercomplex chirp functions for a Gaussian envelope. Finally, we verify the validity of the uncertainty principles through some examples and discuss several potential applications of the new results in signal processing.

1. Introduction

Uncertainty principles have a wide range of useful applications in different fields; for example, Dar and Bhat derived the Donoho–Stark uncertainty principle, Hardy’s uncertainty principle, Beurling’s uncertainty principle, and the logarithmic uncertainty principle for the short-time quaternion offset linear canonical transform [1]. Kais obtained Hardy’s uncertainty principle for the Gabor transform and solve the sharpness problem [2]. Samanta and Sarkar studied an uncertainty principle of finite linear combinations of Fourier–Wigner transforms and proved a finite rank theorem for the Weyl transform [3]. In [4], the logarithmic uncertainty principle, the entropic uncertainty principle, the Lieb uncertainty principle, and the Donoho–Stark uncertainty principle associated with the quaternion windowed linear canonical transform were obtained, and the authors discussed a numerical example and a potential application to signal recovery.Nicola and Trapasso studied a new type of uncertainty principle for the short-time Fourier transform that forbids the arrangement of an arbitrary “bump with fat tail” profile [5]. Zhang derived the N-dimensional Heisenberg’s uncertainty principle of the fractional Fourier transform, and its effectiveness was illustrated by applications in the effective estimation of spreads in time–frequency analysis and optical systems analysis [6]. In [7], some equivalent formulations of the sign uncertainty principle were established. The uncertainty principle for vector-valued functions is studied in [8]. In [9,10], uncertainty principles of the graph Fourier transform were proposed for representing and processing signals on directed graphs.
The uncertainty principle states that the spread product of a function x ( t ) in the time domain Δ t 2 and the frequency domain Δ w 2 has a lower bound:
Δ t 2 Δ w 2 1 4 ,
where
Δ t 2 = R ( t t x ¯ ) 2 x ( t ) 2 d t ,
is the spread of the function in the time domains and
Δ w 2 = R ( w w x ¯ ) 2 x ^ ( w ) 2 d w ,
is the spread of the function in the frequency domains. Here, the Fourier transform (FT) [5,6] of the function x is defined as
x ^ ( w ) = R x ( t ) e 2 π i t w d t ,
the mean time is denoted by
t x ¯ = R t x ( t ) 2 d t ,
and the mean frequency is given by
w x ¯ = R w x ^ ( w ) 2 d w .
On the basis of Heisenberg’s uncertainty principle of the FT, several scholars have obtained the uncertainty principles of the FT for different types of functions. From the covariance matrix, two forms of the lower bound of the covariance uncertainty product of a real signal in two free element transform domains are obtained [11]. Afzal et al. [12] derived a stronger uncertainty principle of the FT for the complex signals, and the lower bound of the inequality was not a constant but was related to the covariance of the signal. Naoki [13] investigated the uncertainty principles of the short-time FT for a complex signal and studied signal recovery problems according to the uncertainty principles. Moreover, based on complex signals, Mahesh Krishna [14] obtained an uncertainty principle of the FT showing that the lower bound is related to absolute covariance. Zhang [15] obtained the uncertainty principle under the N-dimensional FT of a complex signal, and the result was a sharper uncertainty inequality with a tighter lower bound than the classical N-dimensional lower bound. In addition, based on the obtained results, the applications in signal processing were discussed. Fei et al. [16] established a new uncertainty principle of the Dunkl transform associated with a complex signal. Ren et al. [17] studied several sharper uncertainty principles of a quaternion signal. A hypercomplex function is a more generalized function type than a complex function [18]. Based on hypercomplex functions, Yang et al. [19] obtained the uncertainty principles in the context of the FT and derived the uncertainty principle related to the covariance and absolute covariance in [20]. In addition, the uncertainty principles associated with the geometric Fourier transform of Clifford ambiguity functions [21,22] were exploited.
The linear canonical transform (LCT) [23,24,25,26,27] is a general transform of the FT. In recent years, the uncertainty principles associated with the LCT have been extensively studied and applied. Feng et al. [28] studied time frequency resolution analysis and signal energy concentrations by the weighted uncertainty principles of the LCT. Adrian [29] obtained several uncertainty relations of the LCT and discussed their implications in some common optical systems. The uncertainty principle of the LCT can be applied in signal processing associated with propagation in the LCT domain [30,31]. In two existing papers [32,33], signal recovery problems have been discussed according to the uncertainty principle of the LCT. Based on the uncertainty principle, Xu et al. [34] analyzed the frequency resolution of a signal in the LCT domain. We studied biquaternion signal recovery by the Donoho-Stark uncertainty principle associated with the biquaternion offset LCT [35]. Sharma [36] obtained the uncertainty principle associated with the LCT of a real signal. In [37], three different types of uncertainty principles in the LCT domain were derived. The results of the study showed that the lower bound was related to the parameters of the matrix, and their physical explanations were given. The complex signal moments and uncertainty principles in the LCT domain were studied [38]. In [39], the uncertainty principle bounds of the LCT were related to the phase and the amplitude of the complex signal. Shi [40] proved that the lower bounds of uncertainty principles for complex signals hold for arbitrary LCTs. Dang et al. [41] derived tighter lower bounds of the uncertainty principles for a complex signal in the LCT context. In addition, the uncertainty principles for the short-time LCT of a complex signal were studied in different papers [42]. To date, most studies on the uncertainty principle of the LCT have focused on real functions and complex functions.
Due to the extensive research on the uncertainty principle of the LCT, Kou and Yang [43] investigated the uncertainty principle for hypercomplex functions associated with the LCT. Tighter lower bounds were given for effective width products of hypercomplex functions in the time domain and the LCT domain, and these lower bounds can be obtained by Gaussian functions.
In this paper, we further study the uncertainty principles of the LCT under hypercomplex functions. First, according to the properties of hypercomplex functions, we obtain the uncertainty principle in the time and LCT domains. The lower bound obtained is related to the absolute covariance and matrix parameters. The result is sharper than what has been presented in the existing literature. Then, we derive the uncertainty principle of the LCT for hypercomplex functions in two LCT domains, and get the conditions that make the equality sign true in the inequality. Finally, we illustrate the validity of the obtained results by examples and introduce potential applications of the uncertainty principles of the LCT in signal processing.
The structure of this paper is as follows: In Section 2, we present several properties of Clifford algebra and the FT. The definition and properties of the LCT for hypercomplex functions are given in Section 3. In Section 4, we obtained two types of uncertainty principles associated with hypercomplex functions in the LCT domains. Two examples are provided in Section 5. In Section 6, potential applications are introduced. Some conclusions are drawn in Section 7.

2. Preliminaries

Hypercomplex signals are generated by Clifford algebras [44], and so it is necessary to understand the properties of Clifford algebras to study hypercomplex functions. In this section, we mainly review Clifford algebras and the FT.

2.1. Clifford Algebras

Let the Euclidean space [44] be given by
E n = { t t = t 1 e 1 + + t n e n , t i R , i = 1 , 2 , , n } ,
where these basic elements e 1 , , e n satisfy
e i e j = e j e i , i j 1 , i = j ,
and every element in E n is a real vector.
The paravector space [44] is defined by
P n = { t 0 + t t 0 R , t E n } ,
where every element in P n is a real paravector.
For t ˜ = t 0 + t = i = 0 n t i e i P n and r ˜ = r 0 + r = i = 0 n r i e i P n , we have
t ˜ r ˜ = ( t 0 + t ) ( r 0 + r ) = ( t 0 r 0 + t · r ) + ( t 0 r + r 0 t ) + ( t r ) ,
where e 0 = 1 is the unit element of the algebra. t · r = i = 1 n t i r i = 1 2 ( t r + r t ) , and t r = i < j e i e j ( t i r j t j r i ) = 1 2 ( t r r t ) .
The Clifford algebras C l 0 , n = C l n is expressed by the orthonormal basis e 1 , , e n of the real n-dimensional Euclidean space, generated by the multiplication rule:
e i e j + e j e i = 2 δ i j , i , j = 1 , 2 , , n ,
where δ i j denotes the Kronecker delta function [44].
They are the associative and non-commutative algebras on the field R ( C ) [44]. For k = { 1 i 1 < i 2 < < i l n } , 1 l n , let = k k e k C l 0 , n , where e k = e i 1 e i 2 e i l .
The conjugation of e k is defined by [44]
e k ¯ = e i l ¯ e i 1 ¯ ,
where e i e j ¯ = e i e j and e i ¯ = e i . Then, we can obtain t ¯ = t and t r ¯ = t r .
Let = k k e k and = k k e k . The inner product , is given by [44]
, = k k k ;
if = , then | | = , 1 2 = k k 2 1 2 .
The Clifford-valued modules L p ( E n , C l 0 , n ) are given by [44]
L p ( E n , C l 0 , n ) : = x : E n C l 0 , n x L p ( E n , C l 0 , n ) p = E n x ( t ) p d t < ,
where p = 1 , 2 .
For any function x ( t ) ( E n , C l 0 , n ) [44,45], we have
x ( t ) = x 0 ( t ) + x 1 ( t ) e 1 + x 2 ( t ) e 2 + + x n ( t ) e n = x ( t ) e ( t ) ( t ) = ( t ) e ( t ) ( t ) ,
where
( t ) = x ( t ) = ( x 0 2 ( t ) + x 1 2 ( t ) + + x n 2 ( t ) ) 1 2 ,
( t ) = x 1 ( t ) e 1 + x 2 ( t ) e 2 + + x n ( t ) e n ( x 1 2 ( t ) + x 2 2 ( t ) + + x n 2 ( t ) ) 1 2 ,
while
( t ) = arctan ( x 1 2 ( t ) + x 2 2 ( t ) + + x n 2 ( t ) ) 1 2 x 0 ( t ) [ 0 , π ]
is the phase angle and e ( t ) ( t ) is the phase vector.
Let Clifford-valued functions x , y L 2 ( E n , C l 0 , n ) [44], we have
x , y L 2 ( E n , C l 0 , n ) = S c E n x ( t ) y ( t ) ¯ d t ,
where S c E n x ( t ) y ( t ) ¯ d t is the real part of E n x ( t ) y ( t ) ¯ d t .
When x = y ,
x L 2 ( E n , C l 0 , n ) = E n x ( t ) 2 d t 1 2 .

2.2. Fourier Transform of Hypercomplex Functions

In this subsection, we will present some definitions and properties related to FT [20,44].
Definition 1
([20,44]). Let a hypercomplex function x L 1 ( E n , C l 0 , n ) . Then the FT of x is defined as
F { x } ( w ) = 1 ( 2 π ) n E n e i t , w x ( t ) d t ,
where t , w = t 1 w 1 + + t n w n . t i , w i R and i = 1 , , n .
The inverse transform of the FT is given by [20,44]
x ( t ) = 1 ( 2 π ) n E n e i t , w F { x } ( w ) d w .
Let x , y L 2 ( E n , C l 0 , n ) . Then, the Plancherel theorem of the FT is presented by [20,44]
S c E n x ( t ) y ( t ) ¯ d t = Sc E n F { x } ( w ) F { y } ( w ) ¯ d w .
When x = y ,
E n x ( t ) 2 d t = E n F { x } ( w ) 2 d w .
Lemma 1
([20,44]). Let the hypercomplex function x ( t ) = ( t ) e ( t ) ( t ) L 1 L 2 ( E n ) and t m x L 2 ( E n , P n ) , for t m , w m R , m = 1 , 2 , , n . Then,
E n w m 2 F { x } ( w ) 2 d w = E n t m ( t ) 2 d t + E n 2 ( t ) t m e ( t ) ( t ) e ( t ) ( t ) 2 d t .

3. Linear Canonical Transform of Hypercomplex Functions

Definition 2
([43]). Let A = a b c d R 2 × 2 be a matrix parameter satisfying det ( A ) = 1 . The LCT of a hypercomplex function x L 2 ( E n , C l 0 , n ) is defined as
L A { x ( t ) } ( w ) = E n x ( t ) K A ( t , w ) d t , b 0 d e i c d 2 w 2 x ( d w ) , b = 0 ,
where K A ( t , w ) is a transform kernel function of the LCT and is denoted by
K A ( t , w ) = 1 i ( 2 π ) n b e i a 2 b | t | 2 i 1 b t , w + i d 2 b | w | 2 .
If b = 0 , the LCT of x ( t ) is a chirp multiplication, and it is not the subject of our study. Without loss of generality, we suppose that b 0 in this paper.
Notice that when A = a b c d = 0 1 1 0 , the LCT of x ( t ) reduces to the FT of x ( t ) . That is to say,
i L A { x ( t ) } ( w ) = F { x ( t ) } ( w ) .
The LCT of x ( t ) reduces to the fractional Fourier transform (FRFT) [44] of x ( t ) , when A = a b c d = cos α sin α sin α cos α .
According to the definition of the LCT, the additive property of the LCT [46] is
L B { L A { x ( t ) } } = L B A { x ( t ) } ,
where B = a 1 b 1 c 1 d 1 R 2 × 2 is a matrix parameter.
Lemma 2
(Inverse transform for the LCT). Let the hypercomplex function x ( t ) = ( t ) e ( t ) ( t ) L 2 ( E n , C l 0 , n ) , L A { x ( t ) } L 2 ( E n , C l 0 , n ) . Then the inverse transform of the LCT is given by
x ( t ) = L A 1 { L A { x ( t ) } } ( t ) = E n L A { x ( t ) } ( w ) K A 1 ( w , t ) d w ,
where A 1 = d b c a R 2 × 2 is a matrix parameter.
Proof. 
From the Formula (7), we obtain the following result:
E n L A { x ( t ) } ( w ) K A 1 ( w , t ) d w = E n E n x ( s ) K A ( s , w ) d s K A 1 ( w , t ) d w .
According to Formula (8), the above formula becomes
E n L A { x ( t ) } ( w ) K A 1 ( w , t ) d w = E n x ( s ) e i a 2 b ( s 2 t 2 ) δ ( s t ) d s = x ( t ) .
This completes the proof. □
Lemma 3
((Plancherel theorem) [43]). If two hypercomplex functions x , y L 2 ( E n , C l 0 , n ) , then the Plancherel theorem can be presented by
x , y L 2 ( E n , C l 0 , n ) = L A { x } , L A { y } L 2 ( E n , C l 0 , n ) .
In particular, if x = y , we obtain Parseval’s theorem:
x L 2 ( E n , C l 0 , n ) 2 = L A { x } L 2 ( E n , C l 0 , n ) 2 .
Based on the definitions of the FT and the LCT, the relationship between the LCT and the FT is obtained [43]
i b e i d 2 b w 2 L A { x ( t ) } ( w ) = F { x ( t ) e i a 2 b t 2 } w b .

4. Uncertainty Principles for Linear Canonical Transform of Hypercomplex Functions

First, we will present the uncertainty principle of the FT in the directional case [20].
Lemma 4.
Suppose a hypercomplex function x ( t ) = ( t ) e ( t ) ( t ) L 2 ( E n ) and x L 2 ( E n , C l 0 , n ) = 1 , if t j x and x ( t ) t j exist for j = 1 , , n . Then, the uncertainty principle of the FT is given by
E n t 2 x ( t ) 2 d t E n w 2 F { x } ( w ) 2 d w n 2 4 + COV t 2 ,
where
COV t j = E n t j t j e ( t ) ( t ) e ( t ) ( t ) 2 ( t ) d t ,
and the absolute covariance is
COV t = j = 1 n COV t j .
The equality holds if and only if
x ( t ) = e γ 2 t 2 e ( t ) ( t ) ,
and
λ t j = t j e ( t ) ( t ) e ( t ) ( t ) ,
where γ > 0 and λ > 0 .
Next, according to the above lemma, we obtain the uncertainty principle of hypercomplex functions in the time domain and the LCT domain.
Theorem 1.
Let x ( t ) = ( t ) e ( t ) ( t ) L 1 ( E n ) L 2 ( E n ) be a hypercomplex function and x L 2 ( E n , C l 0 , n ) = 1 , if t j f and x ( t ) t j exist for j = 1 , , n . Then, we have
E n t 2 x ( t ) 2 d t E n w 2 L A { x ( t ) } ( w ) 2 d w b 2 n 2 4 + COV t 2 ,
where
COV t j = E n t j t j e φ ( t ) ϑ ( t ) e φ ( t ) ϑ ( t ) 2 ( t ) d t ,
and the absolute covariance is COV t = j = 1 n COV t j .
The equality holds if and only if
x ( t ) = e i a 2 b t 2 e γ 2 t 2 e φ ( t ) ϑ ( t ) ,
and
λ t j = t j e φ ( t ) ϑ ( t ) e φ ( t ) ϑ ( t ) ,
where γ > 0 and any real number λ > 0 .
Proof. 
Let h ( t ) = x ( t ) e i a 2 b t 2 . By Formula (1), h ( t ) = ( t ) e ( t ) ( t ) L 1 ( E n ) L 2 ( E n ) .
According to Lemma 4, we have
E n t 2 h ( t ) 2 d t E n w 2 F { h } ( w ) 2 d w n 2 4 + COV t 2 ,
that is to say,
E n t 2 h ( t ) 2 d t E n w b 2 F { h } w b 2 d w b n 2 4 + COV t 2 ,
where w = w b = 1 b ( w 1 , w 2 , , w n ) R n .
Based on Formula (13), the above formula becomes
E n t 2 x ( t ) 2 d t E n w b 2 i b e i d 2 b w 2 L A { x ( t ) } ( w ) 2 d w b n 2 4 + COV t 2 .
The equality holds if and only if x ( t ) e i a 2 b t 2 = e γ 2 t 2 e ( t ) ( t ) , that is to say,
x ( t ) = e i a 2 b t 2 e γ 2 t 2 e ( t ) ( t ) . Hence, we obtain the result. □
Corollary 1.
When A = 0 1 1 0 , Theorem 1 reduces to Lemma 4.
Corollary 2.
When A = cos α sin α sin α cos α , Theorem 1 reduces to the uncertainty principle of the FRFT in the spatial case [44].
Theorem 2.
Let x ( t ) = ( t ) e ( t ) ( t ) L 1 ( E n ) L 2 ( E n ) be a hypercomplex function and x L 2 ( E n , C l 0 , n ) = 1 , if t j f and x ( t ) t j exist for j = 1 , , n . Then, we obtain
E n v 2 L M { x ( t ) } ( v ) 2 d v E n w 2 L A { x ( t ) } ( w ) 2 d w b 2 n 2 4 + COV t 2 ,
where A = a b c d R 2 × 2 , a a , a d b c = 1 , M = A 1 A = 1 0 c a a c 1 , v = ( v 1 , v 2 , , v n ) R n , and the absolute covariance of every variable is given by
COV t j = E n t j t j e ( t ) ( t ) e ( t ) ( t ) 2 ( t ) d t ,
and
COV t = j = 1 n COV t j .
The equality holds if and only if
x ( t ) = e i a 2 b t 2 e γ 2 t 2 e ( t ) ( t ) ,
and
λ t j = t j e ( t ) ( t ) e ( t ) ( t ) ,
where γ > 0 and λ > 0 .
Proof. 
Let h ( t ) = x ( t ) e i a 2 b t 2 . According to Formula (3), we have
h ( t ) 2 = 1 ( 2 π ) n E n F { h ( t ) } ( w ) e i t , w d w 2 .
Let w = w b ; then,
h ( t ) 2 = 1 ( 2 π ) n E n F { h ( t ) } ( w b ) e i t , w b d ( w b ) 2 .
By Formula (13), the above formula becomes
h ( t ) 2 = 1 ( 2 π ) n E n i b e i d 2 b w 2 L A { x ( t ) } ( w ) e i t , w b d ( w b ) 2 = 1 ( 2 π ) n b i E n L A { x ( t ) } ( w ) e i t , w b i d 2 b w 2 d w 2 = e i a 2 b t 2 ( 2 π ) n b i E n L A { x ( t ) } ( w ) e i a 2 b t 2 + i t , w b i d 2 b w 2 d w 2 ,
where A = a b c d R 2 × 2 , a a , and the condition a d b c = 1 is satisfied.
According to Formula (11), we obtain
h ( t ) 2 = L A 1 { L A { x ( t ) } } 2 ;
by Formula (10),
h ( t ) 2 = L A 1 A { x ( t ) } 2 = L M { x ( t ) } 2 ,
where M = A 1 A , and
M = d b c a a b c d = 1 0 c a a c 1 .
According to the Euler formula,
x ( t ) 2 = h ( t ) 2 = L M { x ( t ) } 2 .
Based on Theorem 1, we can obtain the result. □
Based on Theorem 2, the uncertainty principle in two domains of the LCT can generate the uncertainty principle of the FRFT in two fractional Fourier transform domains [44], when A = cos α sin α sin α cos α and M = cos β sin β sin β cos β .

5. Example

Next, we prove the validity of Theorem 1 in two cases through the following examples.
Case 1: Let a hypercomplex function be given by
x ( t ) = ( z π ) n 4 e z 2 t , t e i a 2 b t , t e φ t , t 2 ,
where φ is a vector-valued constant, z is a positive real number, and x L 2 ( E n , C l 0 , n ) = 1 is unit energy.
First, we calculate the following formula:
E n t j 2 x ( t ) 2 d t = 1 2 z .
Moreover, according to the Formula (13), we have
E n w j 2 L A { x ( t ) } ( w ) 2 d w = b 2 ( z 2 + 1 2 z ) ,
where the equation is derived from Formula (6).
Then, we obtain
E n t j 2 x ( t ) 2 d t E n w j 2 L A { x ( t ) } ( w ) 2 d w = b 2 4 ( 1 + 1 z 2 ) .
On the other hand,
COV t j = 1 2 z .
Therefore,
E n t j 2 x ( t ) 2 d t E n w j 2 L A { x ( t ) } ( w ) 2 d w = b 2 ( 1 4 + COV t j 2 ) .
Hence,
E n t 2 x ( t ) 2 d t E n w 2 L A { x ( t ) } ( w ) 2 d w = b 2 ( n 2 4 + COV t 2 ) .
Thus we have verified that the equation of Theorem 1 is true.
Case 2: Suppose a hypercomplex function
y ( t ) = ( z π ) n 4 e z 2 t , t e i a 2 b t , t e z 1 t 1 e 1 ,
where z is a positive real number, z 1 is a real number, and y L 2 ( E n , C l 0 , n ) = 1 is unit energy.
According to Formula (17), we have
E n t j 2 y ( t ) 2 d t = 1 2 z .
When j = 1 , it follows from Formula (18) that
E n w 1 2 L A { y ( t ) } ( w ) 2 d w = b 2 ( z 2 + z 1 2 ) ,
and
COV t 1 = | z 1 | π z ;
thus,
E n t 1 2 y ( t ) 2 d t E n w 1 2 L A { y ( t ) } ( w ) 2 d w > b 2 ( 1 4 + COV t 1 2 ) .
In addition, for j = 2 , , n , we obtain
E n w j 2 L A { y ( t ) } ( w ) 2 d w = b 2 z 2 ,
and COV t j = 0 .
Then,
E n t j 2 y ( t ) 2 d t E n w j 2 L A { y ( t ) } ( w ) 2 d w = b 2 ( 1 4 + COV t 1 2 ) .
For j = 1 , , n , by combining Formulas (21) and (23), we obtain
E n t j 2 y ( t ) 2 d t E n w j 2 L A { y ( t ) } ( w ) 2 d w > b 2 ( 1 4 + COV t j 2 ) .
Hence
E n t 2 y ( t ) 2 d t E n w 2 L A { y ( t ) } ( w ) 2 d w > b 2 ( n 2 4 + COV t 2 ) .
The above formula show that the inequality in Theorem 1 true.

6. Potential Applications

In this section, several potential applications of the uncertainty principles associated with the LCT are discussed to show the significance and useful of the theorems in signal processing [33,47].
The uncertainty principles of the LCT show that when the signal x ( t ) is a Gaussian signal, the minimum value b 2 n 2 4 + C O V t 2 can be achieved. However, for a non-Gaussian signal, the lower bound b 2 n 2 4 + C O V t 2 of the uncertainty principles cannot be obtained, and the spread product is greater than the lower bound. Hence, uncertainty principles can be applied to estimate the bandwidths by the lower bound [33]. For instance, when E n t 2 x ( t ) 2 d t is given, based on Theorem 1, we have
E n w 2 L A { y ( t ) } ( w ) 2 d w b 2 ( n 2 4 + COV t 2 ) E n t 2 y ( t ) 2 d t b 2 n 2 4 E n t 2 y ( t ) 2 d t .
It shows that only Gaussian signals can obtain the second term in the above inequality. That is to say, the middle term of the above inequality is usually not reachable.
The LCT is not only an integral transform in mathematics but also an affine transform associated with the time-frequency plane [33]. The uncertainty principle of LCT is also applied to the spectral analysis of affine modulation systems [47]. For instance, in affine modulation schemes, spectral efficiency plays a very important role in the effective implementation of the LCT [33,47]. If the pulse is compressed in the time–frequency plane, it is crucial to study the effective bandwidth of the LCT domain [47]. The uncertainty principles in this paper are combined with the multi-channel interpolation technique to discuss the spread spectrum problem in the LCT domain, which has theoretical significance and application value [33].
The uncertainty principle is closely related to the study of optical signal processing [30,31]. The uncertainty principle of the LCT can be used to deal with optical systems associated with propagation in the LCT domain [30,31]. Here, we present an example to prove the application associated with the uncertainty principle of the LCT in the field of optics. Specifically, we use an example based on wave propagation through an aperture setting [48,49]. After passing through the aperture, the field has a certain effective width E n t 2 x ( t ) 2 d t , which is determined by the aperture width. According to Theorem 1, by propagating some distance, the transverse distribution of the field can be described by simulation of the LCT. Therefore, the uncertainty principle of the LCT has important application prospects for signal recovery in the hypercomplex domain.

7. Conclusions

In this paper, we studied two kinds of uncertainty principles associated with the LCT for hypercomplex functions. According to the relationship between the FT and the LCT, the inverse transform of the LCT was given. Based on the uncertainty principle of the FT, we obtained a new uncertainty principle of the LCT for hypercomplex functions in the time and LCT domains. The conditions under which the equality holds were presented. The obtained results can be regarded as the general form of the FT and FRFT. Then, we exploited an uncertainty principle in two LCT domains by the inverse transform of the LCT. This paper shows that these uncertainty principles were related to the absolute covariance, which can be obtained from Gaussian signals. In addition, the advantages of our results were analyzed, and the differences between the obtained results and the existing literature were also compared. Finally, the validity of the obtained result in two cases were proved using examples. Several potential applications in applied mathematics and signal processing were discussed.

Funding

This research was funded by the National Natural Science Foundation of China grant number 62301474.

Data Availability Statement

The data are contained within the article.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Dar, A.H.; Bhat, M.Y. Donoho-Stark’s and Hardy’s uncertainty principles for the short-time quaternion offset linear canonical transform. Filomat 2023, 37, 4467–4480. [Google Scholar] [CrossRef]
  2. Kais, S. Hardy’s uncertainty principle for Gabor transform on compact extensions of R n . Monatshefte Math. 2024, 204, 581–600. [Google Scholar]
  3. Samanta, A.; Sarkar, S. Uncertainty principle for Weyl transform and Fourier-Wigner transform. Can. J. Phys. 2023, 174, 217–227. [Google Scholar] [CrossRef]
  4. Gao, W.B.; Li, B.Z. Uncertainty principle for the two-sided quaternion windowed linear canonical transform. Circuits Syst. Signal Process. 2022, 41, 1324–1348. [Google Scholar] [CrossRef]
  5. Nicola, F.; Trapasso, S.I. A note on the HRT conjecture and a new uncertainty principle for the short-time Fourier transform. J. Fourier Anal. Appl. 2020, 26, 68. [Google Scholar] [CrossRef]
  6. Zhang, Z.C.; Han, Y.P.; Sun, Y.; Wu, A.Y.; Shi, X.Y.; Qiang, S.Z.; Jiang, X.; Wang, G.; Liu, L.B. Heisenberg’s uncertainty principle for N-dimensional fractional Fourier transform of complex-valued functions. Optik 2021, 242, 167052. [Google Scholar] [CrossRef]
  7. Goncalves, F.; Silva, D.O.; Ramos, J.P.G. On regularity and mass concentration phenomena for the sign uncertainty principle. J. Geom. Anal. 2021, 31, 6080–6101. [Google Scholar] [CrossRef]
  8. Qu, F.F.; Xin, W.; Chen, J. Uncertainty principle for vector-valued functions. AIMS Math. 2024, 9, 12494–12510. [Google Scholar] [CrossRef]
  9. Wei, D.Y.; Yan, Z. Generalized sampling of graph signals with the prior information based on graph fractional Fourier transform. Signal Process. 2024, 214, 109263. [Google Scholar] [CrossRef]
  10. Wei, D.Y.; Yuan, S.X. Hermitian random walk graph Fourier transform for directed graphs and its applications. Digit. Signal Process. 2024, 155, 104751. [Google Scholar] [CrossRef]
  11. Emory, T.; Iyer, R. Heisenberg’s uncertainty principle, Bohr’s complementarity principle, and the Copenhagen interpretation. Phys. Essays 2024, 37, 71–73. [Google Scholar]
  12. Afzal, R.; Ali Mohammadian, R.; Saeed, M. A unified approach to the generalized uncetainty principle. Rep. Math. Phys. 2024, 93, 57–69. [Google Scholar] [CrossRef]
  13. Naoki, H. Sharp uncertainty principle inequality for solenoidal fields. J. Math. Pures Appl. 2023, 172, 202–235. [Google Scholar]
  14. Mahesh Krishna, K. Functional deutsch uncertainty principle. J. Class Anal. 2023, 1, 11–18. [Google Scholar] [CrossRef]
  15. Zhang, Z.C.; Shi, X.Y.; Wu, A.Y.; Li, D. Some properties of windowed linear canonical transform and its logarithmic uncertainty principle. IEE Signal Process. Lett. 2021, 28, 1665–1669. [Google Scholar] [CrossRef]
  16. Fei, M.G.; Wang, Q.; Yang, L. Sharper uncertainty principle and Paley-Wiener theorem for the Dunkl transform. Math. Meth. Appl. Sci. 2022, 45, 882–898. [Google Scholar] [CrossRef]
  17. Xu, Z.H.; Ren, G.B. Sharper uncertainty principles in quaternionic Hilbert spaces. Math. Methods Appl. Sci. 2022, 43, 1608–1630. [Google Scholar] [CrossRef]
  18. Zhang, Z.C. Sharper uncertainty principles associated with L-p-norm. Math. Meth. Appl. Sci. 2020, 43, 6663–6676. [Google Scholar] [CrossRef]
  19. Yang, Y.; Dang, P.; Qian, T. Space-frequency analysis in higher dimensions and applications. Ann. Mat. Pura Appl. 2015, 194, 953–968. [Google Scholar] [CrossRef]
  20. Yang, Y.; Dang, P.; Qian, T. Stronger uncertainty principles for hypercomplex signals. Complex Var. Elliptic Equ. 2015, 60, 1696–1711. [Google Scholar] [CrossRef]
  21. Lian, P. Sharp inequalities for geometric Fourier transform and associated ambiguity function. J. Math. Anal. Appl. 2020, 484, 123730. [Google Scholar] [CrossRef]
  22. Banouh, H.; Ben Mabrouk, A. A sharp Clifford wavelet Heisenberg-type uncertainty principle. J. Math. Phys. 2020, 61, 093502. [Google Scholar] [CrossRef]
  23. Gao, W.B. Convolution theorem for the windowed linear canonical transform. Integral Transform. Spec. Funct. 2024, 36, 91–101. [Google Scholar] [CrossRef]
  24. Varghese, S.; Kundu, M. Revisit of uncertainty principles via OPS method approach in the framework of quaternion quadratic phase Fourier transform. Int. J. Geom. Methods Mod. Phys. 2024, 22, 2550007. [Google Scholar] [CrossRef]
  25. Kundu, M.; Prasad, A. Uncertainty principles associated with quaternion linear canonical transform and their estimates. Math. Meth. Appl. Sci. 2022, 45, 4772–4790. [Google Scholar] [CrossRef]
  26. Dar, A.H.; Bhat, M.Y. Special affine stockwell transform: Theory, uncertainty principles and applications. Int. J. Wavelets Multiresolut. Inf. Process. 2024, 22, 2350057. [Google Scholar] [CrossRef]
  27. Dar, A.H.; Bhat, M.Y. N-dimensional wave packet transform and associated uncertainty principles in the free metaplectic transform domain. Math. Meth. Appl. Sci. 2024, 47, 13199–13220. [Google Scholar] [CrossRef]
  28. Feng, Q.; Li, B.Z.; Rassias, J.M. Weighted Heisenberg-Pauli-Weyl uncertainty principles for the linear canonical transform. Signal Process. 2019, 165, 209–221. [Google Scholar] [CrossRef]
  29. Adrian, S. Uncertainty principles in linear canonical transform domains and some of their implications in optics. J. Opt. Soc. Am. A 2009, 25, 647–652. [Google Scholar]
  30. Skoog, R. An uncertainty principle for functions vanishing on a half-line. IEEE Trans. Circuit Theory 1970, 17, 241–243. [Google Scholar] [CrossRef]
  31. Xu, S.Q.; Li, F.; Chai, Y.; Du, B.; He, Y.G. Uncertainty relations for signal concentrations associated with the linear canonical transform. Digit. Signal Process. 2018, 81, 100–105. [Google Scholar] [CrossRef]
  32. Zhang, Z.C. Uncertainty principle for linear canonical transform using matrix decomposition of absolute spread matrix. Digit. Signal Process. 2019, 89, 145–154. [Google Scholar] [CrossRef]
  33. Gao, W.B.; Li, B.Z. Uncertainty principles for the short-time linear canonical transform of complex signals. Digit. Signal Process. 2021, 111, 102953. [Google Scholar] [CrossRef]
  34. Xu, S.Q.; Chai, Y.; Hu, Y.Q.; Li, F.; Huang, L. Uncertainty inequalities for the linear canonical Hilbert transform. Circuits Syst. Signal Process. 2018, 37, 4584–4598. [Google Scholar] [CrossRef]
  35. Gao, W.B. Uncertainty principles for the biquaternion offset linear canonical transform. J. Pseudo-Differ. Oper. Appl. 2024, 15, 22. [Google Scholar] [CrossRef]
  36. Sharma, K.K.; Joshi, S.D. Uncertainty principle for real signals in the linear canonical transform domains. IEEE Trans. Signal Process. 2008, 56, 2677–2683. [Google Scholar] [CrossRef]
  37. Xu, G.L.; Wang, X.T.; Xu, X.G. Three uncertainty relations for real signals associated with linear canonical transform. IET Signal Process. 2009, 3, 85–92. [Google Scholar]
  38. Zhao, J.; Tao, R.; Li, Y.L. On signal moments and uncertainty relations associated with linear canonical transform. Signal Process. 2010, 90, 2686–2689. [Google Scholar] [CrossRef]
  39. Xu, G.L.; Wang, X.T.; Xu, X.G. On uncertainty principle for the linear canonical transform of complex signals. IEEE Trans. Signal Process. 2010, 58, 4916–4918. [Google Scholar]
  40. Shi, J.; Liu, X.; Zhang, N.T. On uncertainty principles for linear canonical transform of complex signals via operator methods. Signal Image Video Process. 2014, 8, 85–93. [Google Scholar] [CrossRef]
  41. Dang, P.; Deng, G.T.; Qian, T. A tighter uncertainty principle for linear canonical transform in terms of phase derivative. IEEE Trans. Signal Process. 2013, 61, 5153–5164. [Google Scholar] [CrossRef]
  42. Li, Z.W.; Gao, W.B. Inequalities for the windowed linear canonical transform of complex functions. Axioms 2023, 12, 554. [Google Scholar] [CrossRef]
  43. Yang, Y.; Kou, K.I. Uncertainty principles for hypercomplex signals in the linear canonical transform domains. Digit. Signal Process. 2014, 95, 67–75. [Google Scholar] [CrossRef]
  44. Gao, W.B. Uncertainty principles of hypercomplex functions for fractional Fourier transform. Fract. Calc. Appl. Anal. 2023, 26, 2298–2317. [Google Scholar] [CrossRef]
  45. Adcock, C.J. The linear skew-t distribution and its properties. Stats 2023, 6, 381–410. [Google Scholar] [CrossRef]
  46. Lacaze, B. About sampling for band-limited linear canonical transform. Signal Process. 2011, 91, 1076–1078. [Google Scholar] [CrossRef]
  47. Healy, J.J.; Kutay, M.A.; Ozaktas, H.M.; Sheridan, J.T. Linear Canonical Transforms; Springer: New York, NY, USA, 2016. [Google Scholar]
  48. Donoho, D.L.; Stark, P.B. Uncertainty principles and signal recovery. SIAM J. Appl. Math. 1989, 49, 906–931. [Google Scholar] [CrossRef]
  49. Cohen, L. Wavelet Transforms and Time-Frequency Signal Analysis; Birkhäuser: Boston, MA, USA, 2001. [Google Scholar]
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

Gao, W.-B. New Uncertainty Principles in the Linear Canonical Transform Domains Based on Hypercomplex Functions. Axioms 2025, 14, 415. https://doi.org/10.3390/axioms14060415

AMA Style

Gao W-B. New Uncertainty Principles in the Linear Canonical Transform Domains Based on Hypercomplex Functions. Axioms. 2025; 14(6):415. https://doi.org/10.3390/axioms14060415

Chicago/Turabian Style

Gao, Wen-Biao. 2025. "New Uncertainty Principles in the Linear Canonical Transform Domains Based on Hypercomplex Functions" Axioms 14, no. 6: 415. https://doi.org/10.3390/axioms14060415

APA Style

Gao, W.-B. (2025). New Uncertainty Principles in the Linear Canonical Transform Domains Based on Hypercomplex Functions. Axioms, 14(6), 415. https://doi.org/10.3390/axioms14060415

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