Next Article in Journal
Multidimensional Stability of Planar Traveling Waves for Competitive–Cooperative Lotka–Volterra System of Three Species
Previous Article in Journal
A Method for Detecting Overlapping Protein Complexes Based on an Adaptive Improved FCM Clustering Algorithm
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Quaternion Fractional Fourier Transform: Bridging Signal Processing and Probability Theory

by
Muhammad Adnan Samad
1,2,3,
Yuanqing Xia
1,4,*,
Saima Siddiqui
5,6,
Muhammad Younus Bhat
7,
Didar Urynbassarova
8 and
Altyn Urynbassarova
9,10
1
School of Automation, Beijing Institute of Technology, Beijing 100081, China
2
Electrical Engineering, Electrical Mechanics and Electrical Technologies Department, Fergana Polytechnic Institute, Fergana 150100, Uzbekistan
3
Telecommunication Engineering Department, Tashkent University of Information Technologies, Fergana 150100, Uzbekistan
4
Zhongyuan University of Technology, Zhengzhou 450007, China
5
Department of Mathematics, Fergana Polytechnic Institute, Fergana 150100, Uzbekistan
6
Computer Engineering and Artificial Intelligence Department, Tashkent University of Information Technologies, Fergana 150100, Uzbekistan
7
Department of Mathematical Sciences, Islamic University of Science and Technology, Kashmir, Awantipora 192122, India
8
National Engineering Academy of the Republic of Kazakhstan, Almaty 050010, Kazakhstan
9
Faculty of Information Technology, Department of Information Security, L.N. Gumilyov Eurasian National University, Astana 010000, Kazakhstan
10
Institute of Automation and Information Technologies, Department of Cybersecurity, Information Processing and Storage, Satbayev University, Almaty 050000, Kazakhstan
*
Author to whom correspondence should be addressed.
Mathematics 2025, 13(2), 195; https://doi.org/10.3390/math13020195
Submission received: 28 November 2024 / Revised: 7 January 2025 / Accepted: 7 January 2025 / Published: 9 January 2025

Abstract

:
The one-dimensional quaternion fractional Fourier transform (1DQFRFT) introduces a fractional-order parameter that extends traditional Fourier transform techniques, providing new insights into the analysis of quaternion-valued signals. This paper presents a rigorous theoretical foundation for the 1DQFRFT, examining essential properties such as linearity, the Plancherel theorem, conjugate symmetry, convolution, and a generalized Parseval’s theorem that collectively demonstrate the transform’s analytical power. We further explore the 1DQFRFT’s unique applications to probabilistic methods, particularly for modeling and analyzing stochastic processes within a quaternionic framework. By bridging quaternionic theory with probability, our study opens avenues for advanced applications in signal processing, communications, and applied mathematics, potentially driving significant advancements in these fields.

1. Introduction

The theory of fractional Fourier transforms (FRFTs) [1,2,3,4,5,6,7,8,9] has evolved significantly since its inception, primarily driven by the need to generalize the classical FT for various applications in optics, signal processing, and quantum mechanics. The FRFT, which interpolates between the identity operation and the FT, provides a powerful tool for analyzing signals in a rotated time–frequency plane. The quaternion fractional Fourier transform (QFRFT) [10,11,12] further extends this concept into the quaternion domain, offering a more comprehensive framework for handling multi-dimensional and complex-valued signals.
The 1DQFRFT builds upon the foundations laid by the classical FRFT and the quaternion algebra, enabling the processing of signals with quaternionic components. This transform not only preserves the fundamental characteristics of the FRFT, such as linearity, shift, and modulation, but also introduces new capabilities specific to quaternionic signals. The 1DQFRFT has shown its versatility in various fields [13,14,15,16,17,18,19,20], including quantum mechanics, tensor-valued decomposition, color image processing, and three-dimensional signal analysis, where it effectively handles the challenges posed by multi-dimensional data. Quaternion algebras have also been instrumental in developing and solving various mathematical challenges. These include the formulation and resolution of quaternion linear systems [21], the analysis of linear differential equations within the quaternionic framework [22], and the advancement of sampling theories [23,24] that leverage quaternion properties. These applications demonstrate the algebras’ versatility and power in addressing complex problems across multiple domains. Recent research has delve into one-dimensional signal processing [23,24,25,26].
In this article, we present a detailed introduction to the 1DQFRFT, highlighting its significance in probability theory. We explore key properties of the 1DQFRFT, such as convolution, in the context of probability density functions (PDFs). This exploration is crucial for understanding how quaternion-valued signals interact with systems or filters, particularly when dealing with complex structures like color images or signals in 3D space.

1.1. State of the Art: Quaternion-Valued Signals in Probability Theory

Quaternion algebra has gained considerable attention in probability theory due to its ability to effectively represent and manage multi-dimensional data. First introduced by W.R. Hamilton in 1843 [27], this mathematical framework provides a powerful tool for processing complex and multi-component signals. Its versatility has found applications in diverse fields, including 3D computer graphics, aerospace engineering, artificial intelligence, and color image processing.
Quaternion-valued signals enhance traditional methods by extending them to higher dimensions. Researchers have utilized quaternions to create sophisticated approaches for analyzing stochastic processes with multiple interconnected components. This work has led to the development of quaternion-valued random variables, probability density functions, and characteristic functions, offering fresh perspectives and tools for probabilistic analysis.
Significant advancements in this field include the development of Quaternion Fourier Transforms (QFTs) and their applications in signal processing. These transforms provide an efficient framework for managing quaternion-valued signals, maintaining their multi-dimensional structure while supporting operations like filtering and reconstruction. Researchers [26,28,29,30,31,32,33] have expanded the theoretical and practical understanding of quaternion signals within probability theory. Furthermore, quaternion-valued moment functions have been introduced and analyzed, offering tools to characterize the statistical properties of quaternion-valued random processes.
The integration of probability theory and quaternion algebra enriches theoretical frameworks while unlocking practical applications in fields that rely on multi-dimensional signal analysis. This interdisciplinary synergy fosters ongoing advancements, driving innovation and providing novel insights into the processing and interpretation of complex signals.
The QFT is a valuable tool but has the following limitations:
  • It is confined to frequency-domain analysis, lacking the flexibility of fractional- domain representations.
  • It does not readily connect with probabilistic tools like correlation or regression.
  • Its utility in analyzing multi-dimensional quaternion-valued signals is limited.
The 1DQFRFT addresses these gaps by the following:
  • Enabling fractional-domain analysis between time and frequency.
  • Establishing a novel bridge between signal processing and probability theory.
  • Providing tools for multi-dimensional quaternion signal analysis, expanding its scope to applications like physics and imaging.
This integration of probability theory and quaternion algebra enriches theoretical frameworks while addressing the limitations of the QFT. The 1DQFRFT not only enhances the flexibility of signal analysis through fractional-domain representations but also fosters an interdisciplinary synergy. This connection unlocks practical applications in fields that rely on multi-dimensional signal analysis, driving innovation and providing novel insights into the processing and interpretation of complex signals. By bridging the gap between signal processing and probability theory, the 1DQFRFT establishes itself as a transformative tool in quaternion-based analysis, opening new frontiers in applications ranging from physics to imaging and beyond.
This article is organized into distinct sections to systematically explore the integration of the QFRFT with probability theory. Section 2 delves into the 1DQFRFT, discussing its mathematical formulation and key properties. In Section 3, the focus shifts to applying the QFRFT within the context of probability theory, highlighting its role in analyzing quaternion-valued random variables and stochastic processes. Section 4 provides a discussion and analysis, critically evaluating the theoretical and practical implications of the proposed methods, supported by examples and comparisons. Finally, Section 5 concludes the article by summarizing the key findings and outlining potential avenues for future research.

1.2. Theoretical Foundations

We begin by reviewing the fundamental concepts and definitions related to quaternions. Quaternions are an extension of complex numbers and form an associative but non-commutative algebra over R . The set of quaternions is denoted by H . Any quaternion q H can be expressed in the following form [34]:
q = q r + i q i + j q j + k q k ,
where q r , q i , q j , q k R . Here, q r represents the scalar part of q, denoted as Sc ( q ) , while i q i + j q j + k q k represents the vector (or pure) part of q, conventionally denoted as q .
The multiplication rules for the quaternion units are as follows:
i j = j i = k , j k = k j = i , k i = i k = j ,
i 2 = j 2 = k 2 = i j k = 1 ,
For two quaternions p , q H with vector parts p and q , respectively, the quaternionic multiplication q p is given by
q p = q r p r q · p + q r p + q p r ,
where
q · p = q i p i + q j p j + q k p k
q p = i q j p k q k p j + j q k p i q i p k + k q i p j q j p i
Analogous to the complex case, the quaternion conjugate of q is defined as follows:
q ¯ = q r i q i j q j k q k ,
which is an anti-involution, meaning q p ¯ = p ¯ q ¯ . Notice that the conjugate reverses the order of multiplication.
From (6), the norm or modulus of a quaternion q H is defined as follows:
| q | = q r 2 + q i 2 + q j 2 + q k 2 .
It follows that
q ¯ q = q q ¯ = | q | 2
Using the conjugate (6) and modulus (7), the inverse of a non-zero quaternion q H is given by
q 1 = q ¯ | q | 2 ,
which shows that H is a normed division algebra. When | q | = 1 , q is a unit quaternion. A quaternion q with q r = 0 is called a pure quaternion, and its square is the negative of the sum of the squares of its components:
q 2 = ( q i 2 + q j 2 + q k 2 ) .
The scalar part of the product of two quaternions p and q can be obtained as follows:
Sc ( p q ) = 1 2 p q + q p = p r q r p · q
A quaternion number q may also be represented as a complex number with complex and imaginary parts:
q = z 1 + j z 2 ,
where
z 1 = q r + i q i , z 2 = q j + i q k .
This representation is known as the Cayley–Dickson form.
We define derivative operators for quaternions as follows:
x = x r + x i i + x j j + x k k
where x r and similar terms denote partial derivatives with respect to the quaternion components.
Using the orthogonal planes split of q H with respect to the pure quaternion space, we define
q + = 1 2 ( q + q ¯ ) , q = 1 2 ( q q ¯ ) ,
where q + is the symmetric part and q is the antisymmetric part of q.
In a similar manner to the complex case, an inner product for functions f and g in H is defined as follows:
( f , g ) L 2 ( H ; H ) = H f ( x ) · g ( x ) d 4 x ,
where x H and d 4 x = d x r d x i d x j d x k . Each quaternion function f can be decomposed as
f ( x ) = f r ( x ) + f i ( x ) i + f j ( x ) j + f k ( x ) k ,
where f r ( x ) , f i ( x ) , f j ( x ) , and f k ( x ) are real-valued functions of x.
In particular, for f = g , the L 2 ( H ; H ) norm is defined as follows:
f = H | f ( x ) | 2 d 4 x 1 / 2 .

2. One-Dimensional Quaternion Fractional Fourier Transform with Properties

The 1DQFRFT with angle β of a signal f ( t ) , denoted as F β ( u ) , is defined as [35]
F β ( u ) = A β R f ( t ) K β ( u , t ) d t ,
where K β ( u , t ) = exp j t 2 + u 2 2 cot β t u csc β is the transforming kernel of the 1DQFRFT, and A β = 1 j cot ( β ) 2 π is the normalization constant.
The inverse transform is given by
f ( t ) = R F β ( u ) K β ( u , t ) d u
Here, β represents the rotation angle and ∗ denotes complex conjugation. The term A β = 1 j cot ( β ) 2 π is a scaling factor, and F β denotes the corresponding QFRFT with angle β . For β = π 2 , the QFRFT simplifies to the QFT. From (17), we observe that if f ( t ) is a real-valued function, we can interchange the position of the kernel K β ( u , t ) as follows:
F β ( u ) = R f ( t ) K β ( u , t ) d t = R K β ( u , t ) f ( t ) d t
Theorem 1. 
Let f L 2 ( R ; H ) ; then, we have
R | f ( t ) | 2 d t = R | F β ( u ) | 2 d u
This Plancherel theorem demonstrates the preservation of energy between the original signal f ( t ) and its 1DQFRFT F β ( u ) . This property is essential for analyzing quaternion-valued signals in the 1DQFRFT domain, similar to the classical Plancherel theorem for the FT. The theorem plays a vital role in signal processing applications by ensuring that key signal characteristics, such as energy or power, remain intact when transforming signals from the time domain to the frequency domain using the 1DQFRFT.
The 1DQFRFT preserves the L 2 -norm of quaternion-valued functions, which implies that smoothness (in terms of continuity and differentiability) is preserved after the transformation. This is crucial in ensuring that the transformation does not distort the underlying signal in a way that would compromise its smoothness.
Theorem 2 
(Conjugate Symmetry for 1DQFRFT). Let f L 2 ( R ; H ) be a quaternion-valued function, and F β ( u ) be its 1DQFRFT with parameter β. Then, the following conjugate symmetry property holds:
F β ( u ) ¯ = F β ( u )
Proof. 
We begin by recalling the definition (17) of the 1DQFRFT F β ( u ) :
F β ( u ) = A β R f ( t ) K β ( u , t ) d t ,
Now, let us consider the complex conjugate of F β ( u ) :
F β ( u ) ¯ = A β ¯ R f ( t ) ¯ K β ( u , t ) ¯ d t
Since the kernel K β ( u , t ) is a complex exponential, taking its conjugate gives
K β ( u , t ) ¯ = exp j t 2 + u 2 2 cot β t u csc β
Notice that
K β ( u , t ) ¯ = K β ( u , t )
Thus, we can rewrite the expression for F β ( u ) ¯ as follows:
F β ( u ) ¯ = A β ¯ R f ( t ) ¯ K β ( u , t ) d t
Since the normalization constant A β depends on β , we have A β ¯ = A β . Therefore,
F β ( u ) ¯ = A β R f ( t ) ¯ K β ( u , t ) d t
This is precisely the 1DQFRFT of f ( t ) ¯ with parameter β :
F β ( u ) ¯ = F β ( u )
Thus, the conjugate symmetry property is established.
F β ( f ) ¯ ( u ) = R A β ( f r ( t ) i f i ( t ) j f j ( t ) k f k ( t ) ) exp j ( t 2 + u 2 ) 2 cot β t u csc β d t = R A β f r ( t ) exp j ( t 2 + u 2 ) 2 cot β t u csc β d t i R A β f i ( t ) exp j ( t 2 + u 2 ) 2 cot β t u csc β d t j R A β f j ( t ) exp j ( t 2 + u 2 ) 2 cot β t u csc β d t k R A β f k ( t ) exp j ( t 2 + u 2 ) 2 cot β t u csc β d t = F β ( f r ) ( u ) i F β ( f i ) ( u ) j F β ( f j ) ( u ) k F β ( f k ) ( u ) .
which completes the proof. □
Theorem 3. 
For f L p ( R ; H ) , where p = 1 , 2 , the following holds:
  • If f is a real signal or if f ( t ) = f r ( t ) + j f j ( t ) (where f r ( t ) and f j ( t ) are the real and imaginary components, respectively), then
    F β ( f ) ¯ ( u ) = F β ( f ¯ ) ( u ) , u R ,
    where F β ( f ) ( u ) is the 1DQFRFT of f ( t ) with parameter β , and f ¯ denotes the quaternionic conjugate of f.
  • If f is a quaternionic signal, then it becomes
    F β ( f ) ( u ) ¯ = F β ( f r ) ( u ) i F β ( f i ) ( u ) j F β ( f j ) ( u ) k F β ( f k ) ( u ) ,
    where f ( t ) = f r ( t ) + i f i ( t ) + j f j ( t ) + k f k ( t ) represents the components of the quaternionic signal f.
The proof of this theorem can be seen in [35]. This is known as the conjugate symmetry for the 1DQFRFT. One valuable tool associated with the 1DQFRFT is the convolution operator. We will now revisit the definition of convolution and its corresponding theorem for a brief overview.
Definition 1 
(Quaternion Convolution for 1DQFRFT). Let f , g L 1 ( R ; H ) . The convolution ( f g ) β associated with the 1DQFRFT F β ( u ) of f and g is defined by
( f g ) β ( t ) = R f ( y ) g β ( t y ) d y ,
where g β ( t ) is the 1DQFRFT of g ( t ) with parameter β.
This definition extends the classical convolution operation to the quaternion-valued signals in the context of the 1DQFRFT.
Theorem 4 
(Convolution Theorem). For f L 2 ( R ; H ) and g L 1 ( R ; H ) , the following holds:
F β ( f β g ) ( u ) = F β ( f ) ( u ) F β ( g ) ( u ) e i β u 2 , u R .
Proof. 
For any u R ,
F β ( f β g ) ( u ) = F β f 1 g 1 F 2 β ( f 2 ) g 2 ( u ) + j F β f 2 g 1 + F 2 β ( f 1 ) g 1 ( u ) = F β ( f 1 ) ( u ) F β ( g 1 ) ( u ) e i β u 2 F β F 2 β ( f 2 ) ( u ) F β ( g 2 ) ( u ) e i β u 2 + j F β ( f 2 ) ( u ) F β ( g 1 ) ( u ) e i β u 2 + F β F 2 β ( f 1 ) ( u ) F β ( g 1 ) ( u ) e i β u 2 = F β ( f 1 ) ( u ) F β ( g 1 ) ( u ) F β ( F 2 β ( f 2 ) ) ( u ) F β ( g 2 ) ( u ) e i β u 2 + j F β ( f 2 ) ( u ) F β ( g 1 ) ( u ) + F β ( F 2 β ( f 1 ) ) ( u ) F β ( g 1 ) ( u ) e i β u 2 = F β ( f 1 ) ( u ) F β ( g 1 ) ( u ) F β ( f 2 ) ( u ) F β ( g 2 ) ( u ) e i β u 2 + j F β ( f 2 ) ( u ) F β ( g 1 ) ( u ) + F β ( f 1 ) ( u ) F β ( g 1 ) ( u ) e i β u 2 = F β ( f ) ( u ) F β ( g ) ( u ) e i β u 2 .
Hence, the theorem is proved. □
The preservation of stability is shown by demonstrating that the 1DQFRFT of a convolution of two functions is equivalent to the product of their individual transforms. This ensures that the stability, in terms of boundedness and control over growth, is maintained under the transform.
Theorem 5 
(Differential Property). Let f ( t ) L 2 ( R ; H ) . Then, the 1DQFRFT of the k-th derivative of f ( t ) is given by
F β d k f ( t ) d t k ( u ) = cos β d d u + sin β j u k F β ( u )
for all k 1 .
Proof. 
We prove this by mathematical induction on k. For k = 1 , the property reduces to
F β f ( t ) ( u ) = cos β d d u + sin β j u F β ( u ) .
This can be proven by differentiating the inverse 1DQFRFT with respect to t:
f ( t ) = R F β ( u ) K β ( u , t ) d u , d d t f ( t ) = R F β ( u ) t K β ( u , t ) d u .
The kernel K β ( u , t ) is given by
K β ( u , t ) = exp j t 2 + u 2 2 cot β t u csc β .
Differentiating with respect to t, we have
t K β ( u , t ) = j t cot β + j u csc β K β ( u , t ) = j u csc β t cot β K β ( u , t ) .
Thus, we obtain
d d t f ( t ) = R F β ( u ) j u csc β t cot β K β ( u , t ) d u .
Taking the 1DQFRFT of both sides and applying the property of the kernel function leads to the desired result in (25).
Assume that the property holds for k = n , i.e.,
F β d n f ( t ) d t n ( u ) = cos β d d u + sin β j u n F β ( u ) .
We need to prove that the property holds for k = n + 1 . Consider
d n + 1 f ( t ) d t n + 1 = d d t d n f ( t ) d t n .
Taking the 1DQFRFT of both sides,
F β d n + 1 f ( t ) d t n + 1 ( u ) = F β d d t d n f ( t ) d t n ( u ) = cos β d d u + sin β j u F β d n f ( t ) d t n ( u ) .
Using the inductive hypothesis,
F β d n + 1 f ( t ) d t n + 1 ( u ) = cos β d d u + sin β j u cos β d d u + sin β j u n F β ( u )
= cos β d d u + sin β j u n + 1 F β ( u ) .
Thus, the property holds for k = n + 1 .
By mathematical induction, the property holds for all k 1 . □
The above differential property provides a framework for understanding how the 1DQFRFT interacts with signal derivatives. The operator involved ensures that smooth, differentiable signals retain their behavior after transformation, supporting the stability and smoothness of the signal.
Theorem 6 
(Linearity). Given two quaternion-valued functions f ( t ) and g ( t ) , and scalars a and b, we aim to prove the linearity of the 1DQFRFT:
F β { a f ( t ) + b g ( t ) } ( u ) = a F β { f ( t ) } ( u ) + b F β { g ( t ) } ( u )
where the 1DQFRFT is defined as follows:
F β { f ( t ) } ( u ) = R f ( t ) K β ( u , t ) d t
and K β ( u , t ) is the quaternionic kernel associated with the 1DQFRFT.
Proof. 
Let us consider
F β { a f ( t ) + b g ( t ) } ( u ) = R [ a f ( t ) + b g ( t ) ] K β ( u , t ) d t = R a f ( t ) K β ( u , t ) + b g ( t ) K β ( u , t ) d t = a R f ( t ) K β ( u , t ) d t + b R g ( t ) K β ( u , t ) d t = a F β { f ( t ) } ( u ) + b F β { g ( t ) } ( u )
which shows that F β ( u ) is linear. □

3. One-Dimensional Quaternion Fractional Fourier Transform in Probability Theory

A quaternion-valued probability density function (PDF) f X ( x ) satisfies the following conditions:
  • Positivity: f a X ( x ) 0 , f b X ( x ) 0 , f c X ( x ) 0 , f d X ( x ) 0 for all x R .
  • Normalization:
    f X ( x ) d x = 1 ,
    where the integral is taken component-wise, i.e.,
    f a X ( x ) d x + i f b X ( x ) d x + j f c X ( x ) d x + k f d X ( x ) d x = 1 .
When the 1DQFRFT is applied to f X ( x ) , the resulting transform F β ( f X ) ( u ) captures the frequency domain representation of the quaternion-valued function in the context of the QFRFT parameter β . Mathematically, the 1DQFRFT of f X ( x ) is defined as follows:
F β ( f X ) ( u ) = R f X ( x ) K β ( x , u ) d x ,
where K β ( x , u ) is the kernel of the 1DQFRFT, which depends on the parameter β .
Expressing f X ( x ) in terms of its components, we can write
F β ( f X ) ( u ) = α = a , b , c , d e α R f α X ( x ) K β ( x , u ) d x ,
where e α represents the quaternionic units 1 , i , j , and k, respectively, and f α X ( x ) are the scalar components of f X ( x ) .
Definition 2. 
The quaternion cumulative distribution function (CDF) F X ( x ) for the 1DQFRFT F β ( u ) can be expressed as the derivative of the quaternion cumulative distribution function F X ( x ) with respect to x:
f X ( x ) = d d x F X ( x ) ,
where the probability P is related to F X ( x ) by
F X ( x ) = P ( X x ) .
Applying the 1DQFRFT to the CDF
F β [ F X ] ( u ) = R F X ( x ) K β j ( x , u ) d x ,
where K β j ( x , u ) is the kernel of the 1DQFRFT.
The corresponding PDF in the 1DQFRFT domain can be found by differentiating F β [ F X ] ( u ) with respect to x:
F β [ f X ] ( u ) = d d x F β [ F X ] ( u ) .
Definition 3 
(Expected value). In the 1DQFRFT domain, the expected value is given by
E [ X ] = R x F f X β ( u ) d u ,
where F f X β ( u ) is the 1DQFRFT of the PDF f X ( x ) .
In the 1DQFRFT domain, the expected value captures the distribution of X across fractional Fourier orders, providing a more generalized view of the frequency-domain behavior of the random variable.
Definition 4 
(The mean). The mean of a quaternion-valued random variable X in the context of the 1DQFRFT is defined similarly to the traditional mean, but it incorporates the fractional Fourier domain characteristics. Given a quaternion-valued random variable X with a quaternion PDF f X ( x ) , the mean in the 1DQFRFT domain is given by
E [ X ] = R x F f X β ( u ) d u ,
where F f X β ( u ) represents the 1DQFRFT of the PDF f X ( x ) .
Table 1 presents an overview of the 1DQFT, 1DQLCT, and 1DQFRFT, emphasizing their roles in probability theory.
Example 1. 
Consider a quaternion-valued random variable X ( t ) with the quaternion PDF given by
f X ( x ) = f a X ( x ) + i f b X ( x ) + j f c X ( x ) + k f d X ( x ) ,
where f a X ( x ) , f b X ( x ) , f c X ( x ) , and f d X ( x ) are the real-valued PDFs of the components X a , X b , X c , and X d , respectively.
Assume the following PDFs for the components:
f a X ( x ) = 1 2 π e x 2 2 , f b X ( x ) = 1 2 e | x | , f c X ( x ) = 1 π ( 1 + x 2 ) , f d X ( x ) = 1 2 e x , x 0 , 0 , otherwise .
The mean of X in the 1DQFRFT domain is defined as follows:
E [ X ] = x F f X β ( u ) d u ,
where F f X β ( u ) is the 1DQFRFT of the PDF f X ( x ) . The 1DQFRFT can be calculated component-wise.
For X a (Gaussian Distribution):
F f a X β ( u ) = F β 1 2 π e x 2 2 ( u )
The 1DQFRFT of a Gaussian function remains a Gaussian function (with possible scaling depending on β ).
For X b (Laplace Distribution):
F f b X β ( u ) = F β 1 2 e | x | ( u )
The 1DQFRFT of a Laplace distribution typically results in a function that resembles the original distribution but shifted and scaled in the fractional Fourier domain.
For X c (Cauchy Distribution):
F f c X β ( u ) = F β 1 π ( 1 + x 2 ) ( u )
The Cauchy distribution in the 1DQFRFT domain will also produce a function related to the Cauchy distribution.
For X d (Exponential Distribution):
F f d X β ( u ) = F β 1 2 e x for x 0 and 0 otherwise ( u )
The exponential distribution will transform into another function in the fractional Fourier domain.
The expected values can also be calculated component-wise.
For X a :
E [ X a ] = x F f a X β ( u ) d u
Since the Gaussian function is symmetric around 0, the mean E [ X a ] will be 0.
For X b :
E [ X b ] = x F f b X β ( u ) d u
The mean of the Laplace distribution is 0, and this will remain the same in the 1DQFRFT domain (due to the symmetry and transformation properties).
For X c :
E [ X c ] = x F f c X β ( u ) d u
The Cauchy distribution does not have a well-defined mean in the traditional sense due to its heavy tails, so this component contributes nothing to the mean.
For X d :
E [ X d ] = x F f d X β ( u ) d u
The mean of the exponential distribution f d X ( x ) = 1 2 e x is 1 / 2 , and this will remain the same in the fractional domain.
Combining all the results and substituting the calculated values, we obtain the mean of X in the 1DQFRFT domain as
E [ X ] = E [ X a ] + i E [ X b ] + j E [ X c ] + k E [ X d ] = 0 + i ( 0 ) + j ( 0 ) + k 1 2 = k 2 .
From above example, the following result can easily be verified
E [ X ] ¯ = E [ X a ] i E [ X b ] j E [ X c ] k E [ X d ]
Example 2. 
The quaternion-valued PDF is given by
f X ( x ) = 1 + j · 0.5 f o r x [ 0 , 1 ] 0 o t h e r w i s e
Using the definition (36), we compute the expected value of the real part as
E [ X a ] = 0 1 x d x = 1 2
The expected value of the imaginary parts X b and X c are zero:
E [ X b ] = E [ X c ] = 0
The expected value of the imaginary part X d is
E [ X d ] = 0 1 0.5 · x d x = 0.25
Thus, the final expected value is
E [ X ] = 1 2 + 0.25 k
Definition 5. 
Let X be a real random variable with the quaternion probability density function f X ( x ) . The characteristic function of X, χ X : R H , is defined by the formula
χ X ( t ) = E [ e i t X ] = R f X ( x ) e i t x d x .
The Equation (38) above may be expressed in the form
χ X ( t ) = R f a X ( x ) + i f b X ( x ) + j f c X ( x ) + k f d X ( x ) e i t x d x = R f a X ( x ) e i t x d x + i R f b X ( x ) e i t x d x + j R f c X ( x ) e i t x d x + k R f d X ( x ) e i t x d x = χ a X ( t ) + i χ b X ( t ) + j χ c X ( t ) + k χ d X ( t ) ,
where
χ i X ( t ) = R f i X ( x ) e i t x d x , i = a , b , c , d .
In the 1DQFRFT domain, the characteristic function is defined by applying the 1DQFRFT to the quaternion-valued probability density function:
F β { χ X } ( u ) = R χ X ( t ) K β ( t , u ) d t .
The characteristic function F β { χ X } ( u ) provides a comprehensive insight into the behavior of quaternion-valued distributions by capturing their transformation across fractional orders. This enables a nuanced analysis of characteristics such as mean and variance in fractional domains, making the 1DQFRFT particularly valuable for studying non-stationary signals and distributions with complex dynamics. The continuity of the characteristic function in the 1DQFRFT domain is guaranteed by the smoothness and boundedness of the kernel K β ( t , u ) , along with the L 2 -norm preservation ensured by the linearity and unitarity of the 1DQFRFT. In practical applications, high-resolution discretization and stable numerical methods play a crucial role in preserving these theoretical properties, maintaining smoothness and stability during fractional-order approximations.
Lemma 1. 
Let X ( t ) be a real random variable. Then,
F β { X ( t ) } ( u ) = a F β { X ( t ) } ( u ) + i b F β { X ( t ) } ( u ) + j c F β { X ( t ) } ( u ) + k d F β { X ( t ) } ( u ) .
Proof. 
In fact, we have
F β { X ( t ) } ( u ) = X ( t ) K β ( t , u ) d t ,
from the definition (17) of the 1DQFRFT. This can be written as follows:
F β { X ( t ) } ( u ) = a f X ( x ) + i b f X ( x ) + j c f X ( x ) + k d f X ( x ) K β ( t , u ) d t .
The integral can be distributed:
F β { X ( t ) } ( u ) = a f X ( x ) K β ( t , u ) d t + i b f X ( x ) K β ( t , u ) d t + j c f X ( x ) K β ( t , u ) d t + k d f X ( x ) K β ( t , u ) d t .
Therefore, we have
F β { X ( t ) } ( u ) = a F β { X ( t ) } ( u ) + i b F β { X ( t ) } ( u ) + j c F β { X ( t ) } ( u ) + k d F β { X ( t ) } ( u ) .
This is the desired result. □
Lemma 2 
(Riemann–Lebesgue Lemma). For a quaternion density function f X L 1 ( H ; H ) , the characteristic function χ X ( t ) satisfies the following:
lim | t | χ X ( t ) = 0 .
Proof. 
Given that the characteristic function χ X ( t ) of a random variable X is defined as
χ X ( t ) = E [ e i t X ] = R f X ( x ) e i t x d x ,
and the 1DQFRFT with angle β is given (17)
F β ( u ) = A β R f ( t ) K β ( u , t ) d t ,
we will use the 1DQFRFT to demonstrate that χ X ( t ) 0 as | t | .
The characteristic function χ X ( t ) can be connected to the 1D QFRFT by examining how the QFRFT affects the density function f X . The goal is to analyze the behavior of
χ X ( t ) = R f X ( x ) e i t x d x .
This function behaves similarly to F β ( u ) when β = π / 2 because the FRFT generalizes the FT.
The kernel K β ( u , t ) in the 1DQFRFT expression introduces a phase that oscillates rapidly when u is large:
K β ( u , t ) = exp j t 2 + u 2 2 cot β t u csc β .
For large | u | , the oscillations of K β ( u , t ) dominate the integral’s behavior.
By substituting into the 1DQFRFT, we obtain
χ X ( t ) = R f X ( x ) e i t x d x = R f X ( t ) K β ( u , t ) d t ,
where we interpret K β ( u , t ) in terms of its oscillatory behavior when β = π / 2 to approximate the Fourier-like behavior.
For | t | , the integral
F β ( u ) = A β R f X ( t ) exp j t 2 + u 2 2 cot β t u csc β d t
tends to zero because the highly oscillatory nature of exp ( j ( t u csc β ) ) causes the terms to cancel out, especially when combined with the normalization factor A β .
Thus,
lim | t | χ X ( t ) = lim | t | A β R f X ( t ) exp j t 2 + u 2 2 cot β t u csc β d t = 0 ,
due to the Riemann–Lebesgue Lemma for oscillatory integrals. □
The characteristic function χ X ( t ) , analyzed through the framework of the 1DQFRFT, shows that the oscillatory nature of the kernel as | t | ensures that χ X ( t ) 0 . This conclusion aligns with the classical result but extends naturally to quaternion-valued functions and their fractional transforms, demonstrating the vanishing of the characteristic function at infinity.
Theorem 7 
(Continuity). The characteristic function χ X ( t ) of a quaternion-valued random variable X is continuous with respect to t.
Proof. 
Using the definition of the characteristic function, we have
χ X ( t ) = E [ e i t X ] = R f X ( x ) e i t x d x ,
where f X ( x ) is the probability density function (pdf) of X.
To show continuity, consider | χ X ( t + h ) χ X ( t ) | :
| χ X ( t + h ) χ X ( t ) | = R f X ( x ) e i ( t + h ) x e i t x d x .
by factoring out e i t x :
| χ X ( t + h ) χ X ( t ) | = R f X ( x ) e i t x e i h x 1 d x .
Using the triangle inequality, we obtain
| χ X ( t + h ) χ X ( t ) | R | f X ( x ) | · | e i h x 1 | d x .
Now, note that
| e i h x 1 | 2 | f X ( x ) | , and 2 | f X ( x ) | L 1 ( R ) ,
ensuring that the integrand is absolutely integrable. By the Dominated Convergence Theorem,
R | f X ( x ) | · | e i h x 1 | d x 0 as h 0 .
Thus, we conclude
lim h 0 | χ X ( t + h ) χ X ( t ) | = 0 .
Therefore, χ X ( t ) is continuous with respect to t. □
In the context of the 1DQFRFT, the continuity of the characteristic function implies that the transform preserves the smoothness and stability of the signal or probability distribution under transformations involving quaternionic variables. This continuity is essential for ensuring reliable signal analysis and processing when dealing with quaternion-valued data. The continuity property guarantees that small perturbations in the time or frequency domain result in proportionally small changes in the transformed space, which is crucial for practical applications in signal processing, communications, and control systems involving quaternion data representations.
Theorem 8 
(Parseval’s Identity for 1DQFRFT). Let F β ( u ) and G β ( u ) be the 1DQFRFT of functions f X ( t ) and g X ( t ) , respectively, defined using the kernel K β ( u , t ) . The 1DQFRFT is defined by
F β ( u ) = R f ( t ) K β ( u , t ) d t ,
where K β ( u , t ) is the kernel of the 1DQFRFT. Parseval’s identity states
R G β ( t ) F β ( t ) d t = R R g X ( x ) f X ( y ) K β ( x , y ) d x d y ,
where ∗ denotes the quaternion conjugate.
Proof. 
Since f X ( t ) , g X ( t ) , and the 1DQFRFT kernel K β ( u , t ) are quaternions, we will decompose each into their scalar components:
f X ( t ) = f 0 ( t ) + f 1 ( t ) i + f 2 ( t ) j + f 3 ( t ) k ,
g X ( t ) = g 0 ( t ) + g 1 ( t ) i + g 2 ( t ) j + g 3 ( t ) k ,
K β ( u , t ) = K 0 ( u , t ) + K 1 ( u , t ) i + K 2 ( u , t ) j + K 3 ( u , t ) k .
Each component function f n ( t ) , g n ( t ) , K n ( u , t ) (for n = 0 , 1 , 2 , 3 ) is real-valued.
The 1DQFRFT is computed component-wise:
F β , n ( u ) = R f n ( t ) K n ( u , t ) d t ,
G β , n ( u ) = R g n ( t ) K n ( u , t ) d t .
The corresponding transformed components are multiplied component-wise. The inner product of the transformed functions is
R G β ( t ) F β ( t ) d t = n = 0 3 R G β , n ( t ) F β , n ( t ) d t .
Substituting the expressions for F β , n ( t ) and G β , n ( t ) yields
R G β , n ( t ) F β , n ( t ) d t = R R g n ( x ) K n ( t , x ) d x R f n ( y ) K n ( t , y ) d y d t .
Applying Fubini’s theorem component-wise to interchange the order of integration yields
R R R K n ( t , x ) K n ( t , y ) d t g n ( x ) f n ( y ) d x d y .
Using the orthogonality property of the kernel components K n ( u , t ) yields
R K n ( t , x ) K n ( t , y ) d t = K n ( x , y ) .
Thus,
R G β , n ( t ) F β , n ( t ) d t = R R g n ( x ) f n ( y ) K n ( x , y ) d x d y .
Summing the results over all components
n = 0 3 R G β , n ( t ) F β , n ( t ) d t = n = 0 3 R R g n ( x ) f n ( y ) K n ( x , y ) d x d y ,
yields
R G β ( t ) F β ( t ) d t = R R g X ( x ) f X ( y ) K β ( x , y ) d x d y .
which completes the proof. □
Definition 6 
(Variance). For a real random variable X, the variance is defined as follows:
σ 2 = E [ ( X E [ X ] ) 2 ] = E [ X 2 ] ( E [ X ] ) 2 .
The quaternionic characteristic function in the 1DQFRFT domain is given by
F β { X ( t ) } ( u ) = f X ( x ) K β ( t , u ) d x ,
where K β ( t , u ) is the kernel of the 1DQFRFT. To find the variance using the 1DQFRFT, we need the first and second derivatives of F β { X ( t ) } ( u ) with respect to t at t = 0 :
d d t F β { X ( t ) } ( u ) t = 0 · ( i ) ,
d 2 d t 2 F β { X ( t ) } ( u ) t = 0 · ( i ) 2 .
The variance σ 2 can be computed using the following formula:
σ 2 = d 2 d t 2 F β { X ( t ) } ( u ) t = 0 · ( i ) 2 d d t F β { X ( t ) } ( u ) t = 0 · ( i ) 2 .
Example 3. 
Consider a real random variable X uniformly distributed over the interval [ 1 , 1 ] . The probability density function (PDF) is as follows:
f X ( x ) = 1 2 i f 1 x 1 , 0 o t h e r w i s e .
E [ X ] :
E [ X ] = 1 1 x 1 2 d x = 0 .
E [ X 2 ] :
E [ X 2 ] = 1 1 x 2 1 2 d x = 1 3 .
Variance σ 2 :
σ 2 = E [ X 2 ] ( E [ X ] ) 2 = 1 3 .
In the context of the 1DQFRFT, this variance can also be computed through the derivatives of the quaternionic characteristic function, as illustrated above. For this simple case, the result matches what you would get from the traditional method, but using 1DQFRFT provides a more generalized approach applicable to more complex quaternionic distributions.

4. Discussion and Analysis

The 1DQFRFT provides the most general framework, capable of handling both stationary and non-stationary processes, with the added benefit of fractional order, making it suitable for processes with fractional dynamics or other complex probabilistic structures. In summary, while the QFT provides the foundation, the QLCT and 1DQFRFT offer progressively more flexibility and capability in analyzing quaternionic signals and stochastic processes in probability theory. The choice of transform depends on the specific requirements of the problem at hand, such as the nature of the signal or process being studied and the desired level of detail in the analysis. While the 1DQFT expected value operates purely in the time domain, the 1DQLCT and 1DQFRFT expected values involve transformations that provide additional insights into how the quaternion random variable’s distribution behaves under different transformations. The 1DQLCT focuses on shifts and scales, whereas the 1DQFRFT emphasizes fractional Fourier orders.

5. Conclusions and Future Perspectives

In this study, we investigated key probabilistic concepts within this framework, including the characteristic function, expected value, probability density function, and variance under the 1DQFRFT. These results highlight the potential of the 1DQFRFT to enhance the development of probability theory in the context of quaternion algebra, offering new avenues for research and application in fields requiring advanced signal processing techniques.
Future work will focus on further exploring the implications of the 1DQFRFT in uncertainty principles and how the quaternion probability density function interacts with its corresponding characteristic function. This exploration will deepen our understanding of the interplay between time–frequency localization and probabilistic properties in the quaternion setting.

Author Contributions

Conceptualization, M.A.S. and S.S.; methodology, M.A.S. and S.S.; validation, M.A.S., Y.X., S.S. and M.Y.B.; writing—original draft, M.A.S. and S.S.; writing—review and editing, M.A.S., S.S., D.U. and A.U.; supervision, Y.X.; funding acquisition, D.U. All authors have read and agreed to the published version of the manuscript.

Funding

This research is funded by the Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan, (No. AP14871252).

Data Availability Statement

The data will be provided on request to the authors.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zayed, A.I. A convolution and product theorem for the fractional Fourier transform. IEEE Signal Process. Lett. 1998, 5, 101–103. [Google Scholar] [CrossRef]
  2. Ervin, S.; Igor, D.; LJubiša, S. Fractional Fourier transform as a signal processing tool: An overview of recent developments. Signal Process. 2011, 91, 1351–1369. [Google Scholar] [CrossRef]
  3. Victor, N. The Fractional Order Fourier Transform and its Application to Quantum Mechanics. IMA J. Appl. Math. 1980, 25, 241–265. [Google Scholar] [CrossRef]
  4. Pei, S.-C.; Ding, J.-J. Fractional Fourier Transform, Wigner Distribution, and Filter Design for Stationary and Nonstationary Random Processes. IEEE Trans. Signal Process. 2010, 58, 4079–4092. [Google Scholar] [CrossRef]
  5. Kilbas, A.A.; Luchko, Y.F.; Martínez, H.; Trujillo, J.J. Fractional Fourier transform in the framework of fractional calculus operators. Integral Transform. Spec. Funct. 2010, 21, 779–795. [Google Scholar] [CrossRef]
  6. McBride, A.C.; Kerr, F.H. On Namias’s Fractional Fourier Transforms. IMA J. Appl. Math. 1987, 39, 159–175. [Google Scholar] [CrossRef]
  7. Ozaktas, H.M.; Kutay, M.A. The fractional Fourier transform. In Proceedings of the 2001 European Control Conference (ECC), Porto, Portugal, 4–7 September 2001; pp. 1477–1483. [Google Scholar] [CrossRef]
  8. Almeida, L.B. The Fractional Fourier Transform and Time-Frequency Representations. IEEE Trans. Signal Process. 1994, 42, 3084–3091. [Google Scholar] [CrossRef]
  9. Aloui, Z.; Brahim, K. Fractional Fourier Transform, Signal Processing and Uncertainty Principles. Circuits Syst Signal Process. 2023, 42, 892–912. [Google Scholar] [CrossRef]
  10. Elgadiri, F.; Akhlidj, A. Uncertainty principles for the fractional quaternion Fourier transform. J. Pseudo-Differ. Oper. Appl. 2023, 14, 54. [Google Scholar] [CrossRef]
  11. Lian, P. Quaternion and fractional Fourier transform in higher dimension. Appl. Math. Comput. 2021, 389, 125585. [Google Scholar] [CrossRef]
  12. Samad, M.A.; Xia, Y.; Al-Rashidi, N.; Siddiqui, S.; Bhat, M.Y.; Alshanbari, H.M. Generalized Sampling Theory in the Quaternion Domain: A Fractional Fourier Approach. Fractal Fract. 2024, 8, 748. [Google Scholar] [CrossRef]
  13. Bahri, M.; Ashino, R.; Vaillancourt, R. Two-dimensional quaternion Fourier transform of type II and quaternion wavelet transform. In Proceedings of the International Conference on Wavelet Analysis and Pattern Recognition, Xi’an, China, 15–17 July 2012; pp. 359–364. [Google Scholar] [CrossRef]
  14. Bie, H.D.; Schepper, N.D.; Ell, T.A.; Rubrecht, K.; Sangwine, S.J. Connecting spatial and frequency domains for the quaternion Fourier transform. Appl. Math. Comput. 2015, 271, 581–593. [Google Scholar] [CrossRef]
  15. Guanlei, X.; Xiaotong, W.; Xiaogang, X. Fractional quaternion Fourier transform, convolution and correlation. Signal Process. 2008, 88, 2511–2517. [Google Scholar] [CrossRef]
  16. Huang, J.; Zhang, F.; Safaei, B.; Qin, Z.; Chu, F. The flexible tensor singular value decomposition and its applications in multisensor signal fusion processing. Mech. Syst. Signal Process. 2024, 220, 111662. [Google Scholar] [CrossRef]
  17. Huang, J.; Zhang, F.; Coombs, T.; Chu, F. The first-kind flexible tensor SVD: Innovations in multi-sensor data fusion processing. Nonlinear Dyn. 2024. [Google Scholar] [CrossRef]
  18. Xu, H.; Wang, X.; Huang, J.; Zhang, F.; Chu, F. Semi-supervised multi-sensor information fusion tailored graph embedded low-rank tensor learning machine under extremely low labeled rate. Inf. Fusion 2024, 105, 102222. [Google Scholar] [CrossRef]
  19. Ell, T.A.; Sangwine, S.J. Hypercomplex Fourier Transforms of Color Images. IEEE Trans. Image Process. 2007, 16, 22–35. [Google Scholar] [CrossRef] [PubMed]
  20. Wei, D.; Li, Y. Different forms of Plancherel theorem for fractional quaternion Fourier transform. Optik 2013, 124, 6999–7002. [Google Scholar] [CrossRef]
  21. Fan, X.; Li, Y.; Liu, Z.; Zhao, J. Solving Quaternion Linear System Based on Semi-Tensor Product of Quaternion Matrices. Symmetry 2022, 14, 1359. [Google Scholar] [CrossRef]
  22. Kou, K.I.; Xia, Y.H. Linear Quaternion Differential Equations: Basic Theory and Fundamental Results. Stud. Appl. Math. 2018, 141, 3–45. [Google Scholar] [CrossRef]
  23. Siddiqui, S.; Li, B.Z.; Samad, M.A. New Sampling Expansion Related to Derivatives in Quaternion Fourier Transform Domain. Mathematics 2022, 10, 1217. [Google Scholar] [CrossRef]
  24. Siddiqui, S.; Li, B.Z.; Samad, M.A. Generalized sampling expansion for the quaternion linear canonical transform. Signal Image Video Process. 2024, 18, 345–354. [Google Scholar] [CrossRef]
  25. Siddiqui, S.; Li, B.Z. Quaternionic One-Dimensional Linear Canonical Transform. Optik 2021, 244, 166914. [Google Scholar] [CrossRef]
  26. Ekasasmita, W.; Bahri, M.; Bachtiar, N.; Rahim, A.; Nur, M. One-Dimensional Quaternion Fourier Transform with Application to Probability Theory. Symmetry 2023, 15, 815. [Google Scholar] [CrossRef]
  27. Hamilton, W.R. Elements of Quaternions; Longmans, Green: London, UK, 1866. [Google Scholar]
  28. Olhede, S.C. On probability density functions for complex variables. IEEE Trans. Inf. Theory 2006, 52, 1212–1217. [Google Scholar] [CrossRef]
  29. Bihan, N.L.; Sangwine, S.J. Quaternionic Spectral Analysis of Non-Stationary Improper Complex Signals. In Quaternion and Clifford Fourier Transforms and Wavelets; Hitzer, E., Sangwine, S., Eds.; Trends in Mathematics: Birkhäuser, Basel, 2013. [Google Scholar] [CrossRef]
  30. Samad, M.A.; Xia, Y.; Siddiqui, S.; Bhat, M.Y. Two-Dimensional Quaternion Linear Canonical Transform: A Novel Framework for Probability Modeling. arXiv 2024, arXiv:2410.19001. [Google Scholar] [CrossRef]
  31. Li, S.; Leng, J.; Fei, M. The Quaternion-Fourier Transform and Applications. In Communications and Networking; Liu, X., Cheng, D., Jinfeng, L., Eds.; ChinaCom, Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering; Springer: Cham, Swithzerland, 2018; Volume 262. [Google Scholar] [CrossRef]
  32. Nurwahidah, N.; Bahri, M.; Rahim, A. Two-Dimensional Quaternion Fourier Transform Method in Probability Modeling. Symmetry 2024, 16, 257. [Google Scholar] [CrossRef]
  33. Siddiqui, S.; Samad, M.A.; Ismoiljonovich, F.D. One dimensional quaternion linear canonical transform in probability theory. Signal Image Video Process. 2024, 18, 9419–9430. [Google Scholar] [CrossRef]
  34. Morais, J.; Georgiev, S.; Sprosig, W. Real Quaternion Calculus Handbook; Springer: Basel, Switzerland, 2014. [Google Scholar] [CrossRef]
  35. Roopkumar, R. Quaternionic one-dimensional fractional Fourier transform. Optik 2016, 127, 11657–11661. [Google Scholar] [CrossRef]
Table 1. An Overview of 1DQFT, 1DQLCT, and 1DQFRFT in probability theory.
Table 1. An Overview of 1DQFT, 1DQLCT, and 1DQFRFT in probability theory.
Feature1DQFT1DQLCT1DQFRFT
Transformation F [ f ( t ) ] ( u ) = R f ( t ) e j u t d t Q A [ f ( t ) ] ( u ) = R f ( t ) K A j ( t , u ) d t F β [ f ( t ) ] ( u ) = R f ( t ) K β j ( t , u ) d t
CDF F X ( x ) = P ( X x ) F X ( x ) = P ( X x ) F X ( x ) = P ( X x )
PDF f X ( x ) = d d x F X ( x ) f X ( x ) = d d x F X ( x ) f X ( x ) = d d x F X ( x )
Expected Value E [ X ] = R x f X ( x ) d x E [ X ] = R x f X ( x ) d x E [ X ] = R x f X ( x ) d x
Variance Var ( X ) = E [ X 2 ] ( E [ X ] ) 2 Var ( X ) = E [ X 2 ] ( E [ X ] ) 2 Var ( X ) = E [ X 2 ] ( E [ X ] ) 2
Characteristic Function φ X ( u ) = E [ e j u X ] = F [ f X ] ( u ) φ X ( u ) = Q A [ f X ] ( u ) φ X ( u ) = F β [ f X ] ( u )
Differentiation Property F d n f ( t ) d t n = ( j ) n F { f ( t ) } Q d f ( t ) d t = j u c + a d d u Q { f ( t ) } F β d f ( t ) d t = cos β d d u + sin β j u F β { f ( u ) }
Convolution Theorem F [ f g ] ( u ) = F [ f ] ( u ) F [ g ] ( u ) Q A [ f g ] ( u ) = Q A [ f ] ( u ) Q A [ g ] ( u ) F β [ f g ] ( u ) = F β [ f ] ( u ) F β [ g ] ( u )
Energy Preservation (Plancherel) R | f ( t ) | 2 d t = R | F [ f ( u ) ] | 2 d u R | f ( t ) | 2 d t = R | Q A [ f ( u ) ] | 2 d u R | f ( t ) | 2 d t = R | F β [ f ( u ) ] | 2 d u
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

Samad, M.A.; Xia, Y.; Siddiqui, S.; Bhat, M.Y.; Urynbassarova, D.; Urynbassarova, A. Quaternion Fractional Fourier Transform: Bridging Signal Processing and Probability Theory. Mathematics 2025, 13, 195. https://doi.org/10.3390/math13020195

AMA Style

Samad MA, Xia Y, Siddiqui S, Bhat MY, Urynbassarova D, Urynbassarova A. Quaternion Fractional Fourier Transform: Bridging Signal Processing and Probability Theory. Mathematics. 2025; 13(2):195. https://doi.org/10.3390/math13020195

Chicago/Turabian Style

Samad, Muhammad Adnan, Yuanqing Xia, Saima Siddiqui, Muhammad Younus Bhat, Didar Urynbassarova, and Altyn Urynbassarova. 2025. "Quaternion Fractional Fourier Transform: Bridging Signal Processing and Probability Theory" Mathematics 13, no. 2: 195. https://doi.org/10.3390/math13020195

APA Style

Samad, M. A., Xia, Y., Siddiqui, S., Bhat, M. Y., Urynbassarova, D., & Urynbassarova, A. (2025). Quaternion Fractional Fourier Transform: Bridging Signal Processing and Probability Theory. Mathematics, 13(2), 195. https://doi.org/10.3390/math13020195

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