Preprint
Article

This version is not peer-reviewed.

Quasyasymptotic Behavior of Fractional Transforms of Distributions: A Comprehensive Survey

Submitted:

26 November 2025

Posted:

27 November 2025

You are already at the latest version

Abstract
Fractional transforms have emerged as powerful analytical tools that bridge the time, frequency, and scale domains by introducing a fractional-order parameter into the kernel of classical transforms. This survey provides an overview of the mathematical foundations and distributional frameworks of several key fractional transforms, with emphasis on their formulation within appropriate spaces of generalized functions. Particular attention is devoted to the quasiasymptotic behavior of distributions in relation to the asymptotic properties of their corresponding fractional transforms. Moreover, we apply the considered transforms to the same sample signal and perform a comparative analysis.
Keywords: 
;  ;  

1. Introduction

To convert a signal into a form more suitable for analysis and processing, the term transformation is often employed. In many cases, the original signal representation is inconvenient to work with; hence signal transforms are applied to obtain representations that are easier to handle. Among the most commonly used are the Fourier transform (FT) [1,2,3], the Fourier cosine transform (FCT) and the Fourier sine transform (FST), the short-time Fourier transform (STFT) [4], the wavelet transform (WT) [5,6], the Stockwell transform (ST) [7] and the Hankel transform (HT) [8].
Over the past two decades, fractional transforms have become increasingly important in diverse fields such as signal and image processing, optics, geo-informatics, radar and communication systems, as well as biomedical applications (see Section 11). The basic idea behind fractional transforms is to replace the conventional kernel of the transform by a fractional kernel, thereby introducing an extra continuous parameter that permits interpolation between domains (for example between time and frequency). This extra degree of freedom often enables improved representations, enhanced adaptability or improved resolution in joint domains.
The archetype of these fractional transforms is the fractional Fourier transform (FRFT). Historically, although the idea of fractional powers of the Fourier operator can be traced back to early work by Norbert Wiener (1929) and Condon (1937) in the context of phase-space or harmonic oscillator Green’s functions, the formalisation in the signal-processing/ transform-theory community is commonly credited to V. Namias in 1980, who proposed the operator approach for the fractional Fourier transform in the context of quadratic Hamiltonians. [9]. The FRFT is an extension of the classical Fourier transform (FT). As explained in Ozaktas et al. [10] , “the α -th order fractional Fourier transform is the α -th power of the Fourier transform operator” and the parameter α effectively enables rotation by an arbitrary angle in the time–frequency plane.
Because the FRFT generalises and enriches the classical transform domain, it opens the way for a family of fractional versions of many other classical transforms. The survey of such fractional forms is timely because they promise advanced flexibility in representing non-stationary, multi-scale and multi-domain signals, but the literature is fragmented and each fractional version has its own nuances (kernel definitions, additivity properties, inversion, interpretation). In particular, the fractionalisation of each classical transform often aims to preserve key structural properties (such as index-additivity, unitarity, invertibility, resolution trade-offs) while adding the continuous parameter that allows “rotation” or interpolation between domains.
The classical STFT replaces the global Fourier kernel by a time-windowed kernel, enabling time–frequency localisation. However, it remains anchored to the standard Fourier domain. One limitation is that for certain types of signals (such as chirps, or signals with components that rotate in the time–frequency plane), the fixed 90 rotation may not be optimal. The short-time fractional Fourier transform (STFRFT) was proposed in [11] to overcome the limitation of the FRFT in identifying frequency components in the fractional Fourier domain. The STFRFT retains essential properties of the STFT (windowing, invertibility, time–fractional-frequency analysis) while enabling a fractional rotation in the time/frequency plane.
While the FRFT generalises the FT, the fractional Fourier cosine (FRFCT) and sine (FRFST) transforms have been introduced more recently: in [12] the real and imaginary parts of the FRFT kernel were used to define FRFCT and FRFST, though those initial definitions lacked additivity (index-sum property) and thus could not strictly be considered “true fractional” extensions. Later work (e.g., [13], and also [14,15]) proposed additive versions that maintain analogous relationships with the FRFT.
The fractional wavelet transform (FRWT) is an extension of the classical WT that incorporates the FRFT into its kernel. By introducing a fractional-order parameter, the FRWT allows the localization of a signal to be adjusted continuously between the time and frequency domains, thereby providing an additional degree of flexibility in time–frequency analysis. This adaptability enables improved representation of non-stationary and chirp-like signals, while preserving the multi-resolution nature of the standard WT. The FRWT has proven particularly effective in reducing reconstruction error and improving energy concentration in applications involving denoising, compression, and signal characterization.
The classical Stockwell transform blends elements of STFT and WT, providing time-frequency localisation with a frequency-dependent window. The fractional Stockwell transform (FRST) (first introduced in [16] for seismic data analysis) replaces the Fourier kernel with a fractional one, thus adding a fractional rotation parameter and offering enhanced time–fractional-frequency resolution compared to the classical ST. The FRST provides enhanced analysis capabilities for non-stationary signals, offering a flexible framework that bridges the ST, STFT, and FRFT domains. Owing to its improved resolution and adaptability, the FRST has found significant applications in geophysical data analysis, seismic signal interpretation, and other fields requiring high-precision time–frequency characterization.
The HT plays a key role in radially-symmetric or cylindrical problems (for example in optics, wave propagation, scattering). The fractional Hankel transform (FRHT) replaces the Bessel-function kernel of the HT by a fractional-order kernel (or via eigenfunction expansions) to introduce a fractional parameter; early work by Namias [8] and later by Kerr, Zemánek et al. [17,18,19,20,21,22,23,24,25] studied these forms. The FRHT has found applications in wave propagation, optics (e.g., elegant Laguerre–Gaussian beams), and the analysis of pseudodifferential operators.
In this manuscript we survey several key fractional transforms: the fractional Fourier transform (FRFT), the short-time fractional Fourier transform (STFRFT), the fractional Fourier cosine (FRFCT) and sine (FRFST) transforms, the fractional Stockwell transform (FRST), the fractional wavelet transform (FRWT), and the fractional Hankel transform (FRHT). Our objective is to present a unified view of their definitions, histories, underlying motivations, structural properties (such as additivity, resolution, time–fractional-frequency localisation), similar kernel structures, inversion formulas, and their inter-relationships. Our primary focus was the quasiasymptotic behavior of distributions and the corresponding Abelian and Tauberian results that link the asymptotic form of a distribution with that of its fractional image. These results not only generalize classical theorems for integral transforms but also provide a rigorous foundation for studying fractional pseudodifferential operators and asymptotic expansions in functional spaces. Crucuall role in our Tauberian type results will have the following lemma that connects the quasiasymptotic at a point and the oscillation at the same point.
Lemma 1. 
[26] [Lemma 3.1] If f ( ε x ) / ( ε m L ( ε ) ) , ψ ( x ) converges as ε 0 + , ψ S , then e i c ( ε x ) 2 / 2 f ( ε x ) / ( ε m L ( ε ) ) , ψ ( x ) converges as ε 0 + , ψ S , where c is a real constant and ε ( 0 , 1 ) . The converse statement hold under the assumption that for some ε 0 ( 0 , ε ) , the family
{ f ( ε x ) / ( ε m L ( ε ) ) : ε ( 0 , ε 0 ) } i s b o u n d e d i n S ( R ) ,

2. Spaces

2.1. Schwartz—Type Spaces

L 2 ( R ) is the Hilbert space of square integrable functions on R with the inner product ( f , g ) L 2 ( R ) = R f ( x ) g ( x ) ¯ d x , where g ( x ) ¯ is a complex conjugate of g ( x ) .
A function φ C ( R ) is said to decay rapidly at infinity if for all α N 0 , | φ ( α ) ( x ) | decreases more rapidly than the power of 1 | x | as | x | , i.e., for all k , α N 0 ,
| x k φ ( α ) ( x ) | 0 as | x | .
By S ( R ) is denoted the linear space of all rapidly decreasing smooth functions at infinity, i.e., functions φ C ( R ) for which
sup x R | x k f ( p ) ( x ) | < , k , p N 0 .
The topology of this space is defined by means of the seminorms (1).
The strong dual of S ( R ) is well known space of tempered distributions S ( R ) , i.e., S ( R ) is the linear space of all continuous linear functional on S ( R ) . Dual pairing between a distribution f S ( R ) and a test function φ S ( R ) is denoted by f , φ . Every locally integrable function f with slow or polynomial growth at infinity defines tempered distribution by the integral
f , φ = R f ( x ) φ ( x ) d x , φ S ( R ) .
The term tempered corresponds to this slow increase at infinity, and therefore the corresponding distributions are called tempered [27].
The subsets S e ( R ) and S o ( R ) consist of all even and odd functions, respectively, within S ( R ) , [28]. An even (odd) tempered distribution is defined as a continuous linear functional on the vector space S e ( R ) ( S o ( R ) ). The spaces of such distributions are denoted as S e ( R ) and S o ( R ) , respectively. It is noteworthy that S e ( R ) and S o ( R ) constitute broader classes than S ( R ) , and specifically, S e ( R ) S ( R ) and S o ( R ) S ( R ) . Moreover
S e ( R ) S o ( R ) = S ( R ) .
The space of highly localized test functions S 0 ( R ) is the closed subspace of S ( R ) for which all the moments vanish, i.e., given by
S 0 ( R ) = { φ S ( R ) R x k φ ( x ) d x = 0 , k N 0 } .
It is provided with relative topology inhered from S ( R ) . Observe that S 0 ( R ) is a closed subspace of S ( R ) and that φ S 0 ( R ) if and only if φ ^ ( m ) ( 0 ) = 0 for all m N 0 . Since the elements of S 0 ( R ) are orthogonal to every polynomial, the dual space S 0 ( R ) can be cannonicaly identified with the quotient space of S ( R ) modulo polynomials, [29].
The space S 0 ( R ) forms a wider class than S ( R ) , and specifically S 0 ( R ) S ( R ) .
The S ( R × R { 0 } ) consists of all function f C ( R × R { 0 } ) for which [29]
sup ( x , ξ ) R × R { 0 } ( | ξ | s + | ξ | s ) | x r ξ l x m f ( x , ξ ) | < , m , l , s , r N 0
The topology of this space is defined by means of the seminorms (2). The dual space of S ( R × R { 0 } ) is S ( R × R { 0 } ) .
Let R + = ( 0 , + ) . The space S ( R × R + ) consists of all functions f C ( R × R + ) for which [27,30]
sup ( x , ξ ) R × R + ξ s | x r ξ l x m f ( x , ξ ) | < , m , l , s , r N 0 .
The topology of this space is defined by means of the seminorms (3). The dual space of S ( R × R + ) is S ( R × R + ) .

2.2. Zemanian-Type Spaces

Let m , k N 0 , and μ 1 / 2 . The space K m , k μ ( R + ) consists of smooth and complex-valued function φ ( x ) on R + for which
γ m , k μ ( φ ) = sup x R + | x m ( x 1 D ) k x μ 1 2 φ ( x ) | < .
The locally convex space K μ ( R + ) is defined in [21] by K μ ( R + ) = m , k N 0 K m , k μ ( R + ) , with the topology assigned to it by the norms
γ r μ ( φ ) = max 0 m r 0 k r γ m , k μ ( φ ) , r 0 .
It is shown in [21] that K μ ( R + ) is complete, the dual space of K μ ( R + ) is the space K μ ( R + ) consisting of distributions with slow growth and specific behavior in a neighborhood of zero. If f K μ ( R + ) , then there exist r > 0 and C > 0 such that
| f , ϕ | C γ r μ ( ϕ ) , ϕ K μ ( R + ) .
If f ( x ) is a locally integrable function on R + such that f ( x ) is of slow growth, as x , and x μ + 1 2 f ( x ) is locally integrable on 0 < x < 1 , then f ( x ) generates a regular generalized function f ( x ) on K μ ( R + ) by (see [31])
f , φ = 0 f ( x ) φ ( x ) d x , φ K μ ( R + ) .
Remark 2. 
As Fréchet and Montel spaces, the aforementioned spaces possess the topological and functional-analytic properties required for the analysis of the corresponding fractional transforms, including the continuity of dual pairings, the applicability of the Banach–Steinhaus theorem, and the relevance of structural theorems in distribution theory.

3. The Quasiasymptotic Behavior

The study of asymptotic behavior plays a crucial role within distribution theory and has attracted significant attention from many researchers over the years. The idea of quasiasymptotic behavior of distributions is to describe how a distribution behaves under scaling — that is, how it changes when its argument is multiplied by a small or large parameter through asymptotic comparison with Karamata regularly varying functions. This concept of studying the asymptotic properties (near zero or infinity) of distributions has found broad applicability across various domains, including mathematical physics, number theory, and differential equations (see, for instance, [32,33,37]). Moreover, the investigation of the asymptotic properties of generalized functions has proven particularly valuable in Tauberian theory, especially in connection with several types of integral transforms [26,34,35,36,38].
Recall a measurable real valued function, defined and positive on an interval ( 0 , A ] (resp. [ A , ) ) , A > 0 , is called a slowly varying function at the origin (resp. at infinity), if
lim ε 0 + L ( a ε ) L ( ε ) = 1 ( resp . lim h L ( a h ) L ( h ) = 1 ) for each a > 0 .
Note that L 1 ( · ) is a slowly varying function in a neighborhood of if L 1 ( · ) = L ( 1 / · ) , where L is slowly varying at zero. The converse also holds. For convinience, by A ( R ) we denote any space of test functions on R , and by A ( R ) their duals.
Let L be a slowly varying function at the origin. We say that the distribution f A ( R ) has the quasiasymptotic behavior (the quasiasymptotics) of degree m R at the point x 0 R (at infinity) with respect to L if there exists u A ( R ) such that for each φ A ( R ) the following limit holds:
lim ε 0 + f ( x 0 + ε x ) ε m L ( ε ) , φ ( x ) = u ( x ) , φ ( x ) ( resp . lim λ f ( λ x ) λ m L ( λ ) , φ ( x ) = u ( x ) , φ ( x ) ) .
We also use the following convenient notation for the quasi-asymptotic behavior of degree m R at a point x 0 R (resp. at infinity) with respect to L in A ( R + )
f ( x 0 + ε x ) ε m L ( ε ) u ( x ) as ε 0 + , resp . f ( λ x ) λ m L ( λ ) u ( x ) as λ +
which should always be interpreted in the weak topology of A ( R ) , i.e., in a sense of (6).
One can prove that u cannot have an arbitrary form; indeed, it must be homogeneous with a degree of homogeneity m, i.e., u ( a x ) = a m u ( x ) , for all a > 0 (cf.[37,39]). We remark that all homogeneous distributions on the real line are explicitly known; indeed, they are of the form
u ( x ) = A x + m + B x m , A , B C i f m Z , o r
u ( x ) = A δ ( k 1 ) ( x ) + B x k , A , B C , i f m = k Z .
Remark 3. 
An Abelian-type theorem showing how the quasiasymptotic behavior of a distribution implies the corresponding behavior of its fractional transform, since the Tauber-type theorem showing how the behavior of the fractional transform implies the quasiasymptotic behavior of a distribution. To be able to apply Abelian-type theorem, the corresponding spaces need to be Montel spaces, whereas this property is not required for Tauberian theorem.

4. Kernels

In fractional transform theory, the kernel function plays a central role, as it defines how a signal is mapped into its fractional domain. The kernel for the FRFT is defined as follows:
K α ( x , ξ ) = C α e i ( x 2 + ξ 2 2 c 1 x ξ c 2 ) , α k π , k Z , δ ( ξ x ) , α = 2 k π , δ ( ξ + x ) , α = ( 2 k + 1 ) π ,
where x , ξ R , c 1 = cot α , c 2 = csc α , C α = 1 i c 1 2 π . The kernel K α ( x , ξ ) is an infinitely differentiable function in both x and ξ . The kernels used in the definition of the STFRFT and FRST are the same. For the FRFT, the kernel generalizes the classical Fourier kernel by introducing a rotation through a fractional angle in the time–frequency plane. The FRSTFT extends this idea by combining the same fractional kernel with a localized window function, enabling the analysis of nonstationary signals. The FRST further refines this concept by incorporating a frequency-dependent window within its kernel, blending the advantages of the fractional Fourier and Stockwell transforms (for their definition, see Sections bellow).
The kernel for the FRFCT is
K α c ( x , ξ ) = 2 C α e i x 2 + ξ 2 2 c 1 cos ( x ξ c 2 ) , α k π , k Z , δ ( x ξ ) , α = k π , ,
and the kernel for the FRFST is
K α s ( x , ξ ) = 2 C α e i ( α π / 2 ) x 2 + ξ 2 2 c 1 sin ( x ξ c 2 ) , α k π , k Z , δ ( x ξ ) , α = k π , .
The fractional Fourier sine and cosine transforms use kernels derived from fractional sine and cosine functions, maintaining orthogonality and energy conservation.
For the FRHT, the kernel is defined as
K α μ ( x , ξ ) = C α , μ e i ( x 2 + ξ 2 2 c 1 ) x ξ c 2 J μ ( x ξ c 2 ) , α k π , k Z , δ ( x ξ ) , α = k π ,
. where C α , μ = e i ( 1 + μ ) ( π 2 α ) sin α , and
J μ ( x ) = x 2 μ n = 0 ( 1 ) n n ! Γ ( μ + n + 1 ) x 2 2 n , x R +
is the Bessel function of first kind and order μ .
In the standard HT, the kernel involves the Bessel function of the first kind, which naturally appears in problems with circular or radial symmetry. The FRHT modifies this kernel by embedding a fractional phase factor or rotation angle, allowing a continuous transition between the original function and its full HT.

5. The Fractional Fourier Transform

The FRFT is an old mathematical tool that was popularized by Namias in 1980 in order to analyse certain classes of quadratic Hamiltonians, [9]. The FRFT generalizes the classical FT by replacing its kernel with a fractional kernel that depends of the parameter α . Different choices of α are employed across a wide range of applications, where the FRFT often yields superior results compared to traditional methods, particularly in signal processing for filtering, time-frequency modelling, radar chirp analysis, optics, and quantum physics [3,9,11,40,41,42,43,44]. In [45], the authors investigated the behavior of the FRFT on L p ( R ) spaces for 1 p < 2 , and studies of the FRFT in different generalized function spaces can be found in [26,46,47,48,49]. Pseudodifferential calculus based on the FRFT was developed in [47,50]. Furthermore, Toft and collaborators provided new perspectives, who established a connection between the FRFT and the harmonic oscillator propagator in [51]. The quasiasymptotic behavior of the FRFR is studied in [26].
Let f S ( R ) . Then the FRFT of order α is defined by
F α f ( ξ ) = R f ( x ) K α ( x , ξ ) d x , ξ R
where K α ( x , ξ ) is defined by (9). Since F α f is 2 π periodic with respect to α , we will always assume that α [ 0 , 2 π ) . For α = π / 2 the FRFT reduces to the FT
F f ( ξ ) = f ^ ( ξ ) = 1 2 π R f ( x ) e i x ξ d x , ξ R .
Notice that F α is the s-th power of the Fourier transform for s = 2 α / π . The boundedness properties of the fractional Fourier operator F α are the same as for the Fourier operator F , but the convergence properties are not trivial. In [47] it is proven that the FRFT is a continuous mapping from S ( R ) onto itself, and can be extended to the space of tempered distributions by
F α f , ϕ = f , F α ϕ , f S ( R ) , ϕ S ( R ) .
Recall that in [49] Zayed gave an equivalent definition for the FRFT:
F α f ( ξ ) = f ( t ) , K α ( t , ξ ) , ξ R , f S ( R ) .
For f S ( R ) , the inverse FRFT is F α and the inversion formula is given by [40,46]
f ( x ) = R F α f ( ξ ) K α ( x , ξ ) d ξ , x R .
Abelian theorem for the FRFT states that if f S ( R ) has quasiasymptotics at zero then F α f quasiasymptotically oscillates at infinity. The Tauberian theorem holds but with the additional assumption.
Theorem 4. 
[26] [Theorem 3.2] Let f S ( R ) , m R , L be a slowly varying function at 0 + and u S ( R ) be of the form (7) or (8). If
f ( ε x ) ε m L ( ε ) u ( x ) as ε 0 + in S ( R ) ,
then
e i c 1 ( h ξ ) 2 / 2 F α f ( h ξ ) 1 i c 1 c 2 m + 1 h m 1 L ( 1 / h ) u ^ ( ξ ) as h in S ( R ) .
Conversely, recalling Lemma 1 if { f ( ε x ) / ( ε m L ( ε ) ) : ε ( 0 , ε 0 ) } is bounded in S ( R ) , then (16) (15).

6. The Fractional Fourier Cosine (Sine) Transform

The concept of fractionalizing the Fourier cosine (sine) transform was first introduced in [12], where the authors used the real and imaginary parts of the FRFT kernel as the kernels for the FRFCT and FRFST, respectively. Nevertheless, they noted that these transforms do not satisfy index additivity and therefore cannot be regarded as true fractional extensions of the FCT and FST. Later, in [13], additive versions of the FRFCT and FRFST were proposed, which also maintain analogous relationships with the FRFT (see also [14,15]). In [36,52], the authors investigated the FRFCT and FRFST within the framework of generalized functions and studied their quasiasymptotic behavior, and the pseudodifferential calculus based on the FRFCT and FRFST was developed in [53].
When restricting to one-sided functions ( f ( x ) = 0 for x < 0 ), the FRFCT of a function f L 1 ( R ) is defined as [40,50]
F α c ( f ( x ) ) ( ξ ) = F α ( f ( x ) + f ( x ) ) ( ξ ) = 0 f ( x ) K α c ( x , ξ ) d x
where K α c ( x , ξ ) is defined by (10). For α = π / 2 the FRFCT reduces to the FCT
F c f ( ξ ) = f ^ c ( ξ ) = 1 2 π 0 f ( x ) cos ( x ξ ) d x , ξ R .
The inverse FRFCT is given by
f ( x ) = 0 F α c f ( ξ ) K α c ( x , ξ ) d ξ , x R .
Similarly, the FRFST of a function f L 1 ( R ) is defined as
F α s ( f ( x ) ) ( ξ ) = F α ( f ( x ) f ( x ) ) ( ξ ) = 0 f ( x ) K α s ( x , ξ ) d x
where K α s ( x , ξ ) is defined by (11). For α = π / 2 the FRFST reduces to the FST
F s f ( ξ ) = f ^ ) s ( ξ ) = 1 2 π 0 f ( x ) sin ( x ξ ) d x , ξ R .
The corresponding inverse FRFST is given by
f ( x ) = 0 F α s f ( ξ ) K α s ( x , ξ ) d ξ , x R .
In [14] authors studied the FRFCT (resp. FRFST) for the space S e ( R ) (resp. S o ( R ) ). It is shown in [50] [Thrm 3.1 and Thrm 3.2] that the FRFCT is the continuous linear mapping of S e ( R ) onto itself, and that the FRFST is the continuous linear mapping of S o ( R ) onto itself. This allows them to define the generalized FRFCT (FRFST) of distribution f from S e ( R ) ( S o ( R ) ) by
F α c f , φ = f , F α c φ , ( F α s f , φ = f , F α s φ )
for all φ S e ( R ) ( S o ( R ) ) ). Moreover, the FRFCT (FRFST) of a distribution f S e ( R ) ( S o ( R ) ) is a continuous linear map of S e ( R ) ( S o ( R ) ) onto itself.
To establish the connection between the FRFT of a causal, one-sided function and the FRFCT and FRFST of this function in an alternative manner, we can use the following expression.
2 F α f ( ± ξ ) = F α c f ( ξ ) ± e i α F α s f ( ξ ) .
In this identity, the transform F α c f ( ξ ) can be associated with the even component of F α f ( ξ ) , while F α s f ( ξ ) is linked to its odd component.
In [36], the quasi-asymptotic behavior of even (resp., odd) distributions within the context of a Tauberian theorem applied to the FRFCT (resp., FRFST) is characterized. With the following theorem is established that distributions exhibiting quasi-asymptotic behavior at zero manifest quasi-asymptotic oscillations at infinity through their corresponding FRFCT or FRFST.
Theorem 5. 
[36] [Theorem 2.3] Let f S e ( R ) ( S o ( R ) ) , L be of the form (5) at 0 + , u S e ( R ) ( S o ( R ) ) be homogeneous function and m R . If
f ( ε x ) ε m L ( ε ) u ( x ) as ε 0 + in S e ( R ) ( S o ( R ) ) ,
then
e i c 1 ( h ξ ) 2 / 2 F α c f ( h ξ ) 1 i c 1 c 2 m + 1 h m 1 L ( 1 / h ) u ^ c ( ξ ) as h ( e i c 1 ( h ξ ) 2 / 2 F α s f ( h ξ ) 1 i c 1 c 2 m + 1 h m 1 L ( 1 / h ) u ^ s ( ξ ) as h )
in S e ( R ) ( S o ( R ) ) .
Remark 6. 
Using [36] [Lemma 2.1] (see Lemma 1), the converse statement also holds under additional condition. Namelly, if { f ( ε x ) / ( ε m L ( ε ) ) : ε ( 0 , ε 0 ) } is bounded in S e ( R ) ( S o ( R ) ) , then (21) (20).

7. The Short-Time Fractional Fourier Transform

The STFRFT was proposed in [11] to overcome the limitation of the FRFT in identifying frequency components in the fractional Fourier domain. The FRSTFT has the property of additivity of rotation and provides the chirp signal with a horizontal oriented support, which is helpful for the analysis and processing of chirp signals. It should be noted that the STFRFTs introduced in [3,41,43,44,54] are proposed as modifications of the conventional STFT. In particular, the motivation for studying the STFRFT is clearly outlined in the paper [54], where the authors emphasize that this novel transform retains the essential properties of the traditional STFT while allowing straightforward implementation through FRFT-domain filter banks. Moreover, they provide a complete time–fractional-frequency analysis of the transform and its inverse, along with several illustrative applications. In [26], the authors investigated the STFRFT within the framework of generalized functions.
The STFRFT of an integrable function f L 1 ( R ) with respect to the window g S ( R ) { 0 } is defined in [11] as
V g α f ( x , ξ ) = R f ( t ) g ( t x ) ¯ K α ( t , ξ ) d t , ( x , ξ ) R 2
where K α ( t , ξ ) is given by (9). For α = π / 2 , the STFRFT reduces to the FRFT
V g f ( x , ξ ) = R f ( t ) g ¯ ( x t ) e i t ξ d t , ( x , ξ ) R 2 .
For given g S ( R ) { 0 } the fractional synthesis operator of F S ( R ) is defined as follows [26]
( V α ) g * F ( t ) = c 2 1 + c 1 2 R 2 F ( x , ξ ) g ( t x ) K α ( t , ξ ) d x d ξ , for almost all t R .
It is shown in [26] [Prop. 2.1] that the STFRFT is a continuous mapping from S ( R ) onto S ( R 2 ) , and that fractional synthesis operator continuous maps S ( R 2 ) onto S ( R ) [26] [Prop. 2.2] . The same properties [26] [Prop. 2.3] hold for their respective dual spaces, yielding
V g α f , Φ = f , ( V α ) g ¯ * Φ , f S ( R ) , Φ S ( R 2 )
and
( V α ) g * F , ϕ = F , V g ¯ α ϕ , F S ( R 2 ) , ϕ S ( R ) .
So, the inversion formula holds in S
Id S ( R ) = 1 ( g , φ ) ( ( V α ) φ * V g α ) ,
where g S ( R ) in a non-trivial and φ S ( R ) is a synthesis window for g, ( φ , g ) 0 .
Abelian and Tauberian results for the STFRFT are presented in [26] and state:
Theorem 7. 
[26] [Theorem 4.1] Let f S ( R ) and g S ( R ) a non-trivial. If f satisfies
f ( x / h ) h m L ( 1 / h ) u ( x ) , h , in S ( R ) ,
then for every fixed x 0 R
e i c 1 ( h ξ ) 2 / 2 V g α ( x 0 h , h ξ ) 1 i c 1 c 2 m + 1 h m 1 L ( 1 / h ) u ^ ( ξ ) , h .
Conversely, if (24) holds and for some h 0 > 0   { e i c 1 ( t h ) 2 / 2 f ( x / h ) h m L ( 1 / h ) : h > h 0 } is bounded in S ( R ) , then (23) holds.

8. The Fractional Stockwell Transform

The FRST, first introduced in [16] for the analysis of seismic data, is a generalization of the ST. In this approach, the Fourier kernel is replaced with a fractional kernel, providing greater flexibility in time–frequency analysis and in the representation of signal spectra. Compared to the standard ST, the FRST offers enhanced time–frequency resolution [55,56,57,58].
Let g L 1 ( R ) L 2 ( R ) such that R g ( x ) d x = 1 . The FRST of a signal f L 2 ( R ) is defined in [59] by
S g α f ( x , ξ ) = | ξ | R f ( t ) g ( ξ ( t x ) ) ¯ K α ( t , ξ ) d t , x R , ξ R { 0 } ,
where K α ( t , ξ ) is defined by (9). For α = π / 2 , the FRST reduces to the ST
S g α f ( x , ξ ) = | ξ | 2 π R f ( t ) g ( ξ ( t x ) ) ¯ e i x t d t , x R , ξ R { 0 } ,
The fractional Stockwell synthesis operator is defined by
( S g α ) * F ( x ) = | sin α | R R F ( y , ξ ) g ( ξ ( x y ) ) K α ( x , ξ ) d y d ξ .
In [59] the FRST was studied in spaces of generalized functions, while in [38], the connection between the distributional FRST and the FRWT was established, based on which some important properties of the FRST in spaces of generalized functions were obtained. Pseudodifferential calculus based on the FRST was developed in [60], since the quasiasymptotic behavior of the FRST is studied in [38,59].
In [59] it is shown that the FRST is a continuous mapping from S 0 ( R ) onto S 0 ( R × R { 0 } ) , and that fractional synthesis operator is a continuous mapping from S 0 ( R × R { 0 } ) onto S 0 ( R ) , with window function from S 0 ( R ) . The same hold for the duals, so we have
S g α f , Φ = f , ( S α ) g ¯ * Φ , f S 0 ( R ) , Φ S 0 ( R × R { 0 } )
and
( S α ) g * F , ϕ = F , S g ¯ α ϕ , F S 0 ( R × R { 0 } ) , ϕ S 0 ( R ) .
So, the inversion formula holds in S 0
Id S 0 ( R ) = 1 C g , ψ , c 2 ( ( S φ α ) * S g α ) .
where g S 0 ( R ) , φ S 0 ( R ) and C g , φ , c 2 = R φ ^ ( c 2 ( t 1 ) ) g ^ ( c 2 ( t 1 ) ) ¯ d t | t | < .
Abelian results for the STFT are investigated in [38,59] and state:
Theorem 8. 
[38,59] [Theorem 3.1, Theorem 5.2]Let f S 0 ( R ) have the following quasiasymptotic behavior
f ( ε x ) ε m L ( ε ) u ( x ) as ε 0 + in S 0 ( R ) ,
where m R , and L is a slowly varying function at 0 and u S 0 ( R ) . Then, for its FRST with respect to window g S 0 ( R ) { 0 } we have
e i c 1 ( ξ ε ) 2 / 2 S g α f ( ε x , ξ ε ) 1 i c 1 c 2 m ε m L ( ε ) S g u ( x c 2 , ξ c 2 ) as ε 0 + e i c 1 ( ε ξ ) 2 / 2 S g 1 / ε 2 α f ( ε x , ε ξ ) 1 i c 1 c 2 m ε m + 2 L ( ε ) S g ( M ξ / c 2 u ) ( x c 2 , ξ c 2 ) as ε 0 +
in S 0 ( R × R { 0 } , whenever α ( 2 k π , ( 2 k + 1 ) π ) , k Z (M is the modulation operator).
Tauberian results are investigated in [38,59] and state:
Theorem 9. 
[59] [Theorem 5.4] Let L be a slowly varying function at the origin, m R , f S 0 ( R ) , g S 0 ( R ) { 0 } and C ( α ) is a constant which depends of α. Assume that the limit lim ε 0 + e i c 1 ( ξ ε ) 2 / 2 S g α f ( ε x , ξ ε ) ε m L ( ε ) < exists for each ( x , ξ ) R × R { 0 } , and there exist r N , s > 1 such that
| e i c 1 ( ξ ε ) 2 / 2 S g α f ( ε x , ξ ε ) | ε m L ( ε ) ) C ( α ) | ξ | + 1 | ξ | s | x | r ,
for all ( x , ξ ) R × R { 0 } , α ( 2 k π , ( 2 k + 1 ) π ) , k Z and 0 < ε 1 . Then f has a quasiasymptotics at 0 +
Theorem 10. 
[38] [Theorem 3.2] Let L be a slowly varying function at the origin, m R , f S 0 ( R ) , g S 0 ( R ) { 0 } and C ( α ) is a constant which depends of α. Assume that the limit lim ε 0 + e i c 1 ( ε ξ ) 2 / 2 S g α f ( ε x , ε ξ ) ε m L ( ε ) < exists for each ( x , ξ ) R × R { 0 } , and there exist r N , s > 1 such that
| e i c 1 ( ε ξ ) 2 / 2 S g α f ( ε x , ε ξ ) | ε m L ( ε ) ) C ( α ) | ξ | + 1 | ξ | s | x | r ,
for all ( x , ξ ) R × R { 0 } , α ( 2 k π , ( 2 k + 1 ) π ) , k Z and 0 < ε 1 . Then f has a quasiasymptotics at 0 + .

9. The Fractional Wavelet Transform

The FRWT, first introduced in [61], extends the conventional WT. It was developed to overcome certain limitations of both the WT and the FRFT (see also [62]).
Let g L 2 ( R ) be a wavelet, i.e., let it satisfy R g ( x ) d x = 0 . The FRWT of the signal f L 2 ( R ) with respect to the wavelet g is defined in [62] by
W g α f ( x , ξ ) = 1 ξ R f ( t ) g ¯ t x ξ e i c 1 t 2 x 2 2 d t , x R , ξ R + .
For α = π / 2 , the FRWT reduces to the WT
W g f ( x , ξ ) = 1 ξ R f ( t ) g ¯ t x ξ d t , x R , ξ R + .
The fractional wavelet synthesis operator is defined by [62]
( W g α ) * F ( t ) = 1 2 π R 2 F ( x , ξ ) g t x ξ e i c 1 t 2 x 2 2 d x d ξ ξ 2 .
By incorporating the FRFT, the FRWT adjusts the signal’s localization to match the requirements of the WT. This adaptability allows control over the degree of localization, which can reduce the mean-square error. Consequently, fewer wavelet components need to be stored to achieve the same reconstruction error. The authors examined the FRWT within L 2 spaces in [62], while in [38] this analysis was extended to the space of generalized functions.
It is proven in [38] that the FRWT is a continuous linear mapping from S ( R ) onto S ( R × R + ) , and that fractional wavelet synthesis operator is a continuous mapping from S ( R × R + ) onto S ( R ) , with window function from S ( R ) . The same hold for the duals, so we have
W g α f , Φ = f , ( W g ¯ α ) ) * Φ , f S ( R ) , Φ S ( R × R + )
and
( W g α ) * F , ϕ = F , W g ¯ α ϕ , F S ( R × R + ) , ϕ S ( R ) .
So, the inversion formula holds in S
Id S ( R ) = 1 2 π C g ( ( W g α ) * W g α ) .
where g S ( R ) and C g = R | g ^ ( ω ) | 2 d ω | ω | < . By the definitions of FRWT and FRST we have the following relation [38]:
e i c 1 ξ 2 2 S g α f ( x , ξ ) = ξ C α e i c 1 x 2 2 i c 2 x ξ W M c 2 g α f ( x , 1 ξ ) , x R , ξ R + .
and (26) holds in the distributional sense, for f S 0 ( R ) and g S 0 ( R ) . Hence, based on the Abelian results for the FRST and (26), [38] obtains Abelian results for the FRWT.
Theorem 11. 
[38] [Theorem 4.7, Theorem 4.8] Let f S 0 ( R ) has the quasiasymptotic behavior (25). Then, for its FRWT with respect to the window g S 0 ( R ) { 0 } , we have
e i c 1 ( ε x ) 2 / 2 W M c 2 g α f ( ε x , ε ξ ) ε m + 1 / 2 c 2 m + 1 / 2 L ( ε ) e i x ξ ( c 2 1 ) W M 1 g u ( x c 2 , c 2 ξ ) as ε 0 +
e i c 1 ( ε x ) 2 / 2 i c 2 ε 2 x ξ W M c 2 g 1 / ε 2 α f ( ε x , 1 ε ξ ) ε m + 3 / 2 c 2 m + 1 / 2 L ( ε ) e i x ξ ( c 2 1 ) W g u ( x c 2 , c 2 ξ ) as ε 0 +
in S 0 ( R × R + ) whenever α ( 2 k π , ( 2 k + 1 / 2 ) π ) , k Z .
By applying relation (26), we derive an additional Abelian result establishing a connection between the FRST and the WT.
Theorem 12. 
[38] [Theorem 4.9] Let f S 0 ( R ) has the quasiasymptotic behavior (25). Then, for its FRST with respect to the window g S 0 ( R ) { 0 } , we have
e i c 1 ( ξ ε ) 2 / 2 S g α f ( ε 2 x , ξ ε ) C α ξ ε m L ( ε ) W g ( M ξ c 2 u ) ( 0 , 1 ξ ) as ε 0 +
in S 0 ( R × R + ) whenever α ( 2 k π , ( 2 k + 1 ) π ) , k Z .

10. The Fractional Hankel transform

The HT of order μ of a function f L 1 ( R + ) is defined by
H μ f ( ξ ) = 0 x ξ J μ ( x ξ ) f ( x ) d x , ξ R + ,
where, μ 1 / 2 and J μ is given with (13).
The FRHT represents a generalization of the classical HT, achieved by replacing the conventional Bessel kernel with one of fractional order. Moreover, the FRHT with parameter α of f ( x ) for μ 1 / 2 and α ( 0 , π ) , is defined by [31]
H μ α f ( ξ ) = 0 f ( x ) K α μ ( x , ξ ) d x ,
where K α μ ( x , ξ ) is defined by (12). For α = π / 2 the FRHT reduces to the HT.
Since the two-dimensional Fourier transform is intrinsically linked to the Hankel transform, the FRHT shares many similarities with the FRFT. In fact, it can be obtained directly from the two-dimensional FRFT [8] [p.192]. Initially introduced by Namias [8] and later expanded upon in [63,64] as well as other authors [17,18,19,20,21,22,23,24,25], the FRHT has found numerous applications in fields such as optical systems, wave propagation, and the study of pseudo-differential operators [31]. The quasiasymptotic properties of the FRHT have also been studied in detail in [34,35]. In this recent work is established that, under appropriate test-function space assumptions, quasiasymptotic behavior (at 0 or ) of a distribution implies corresponding asymptotics of its FRHT and—under extra hypotheses—the converse Tauberian assertions.
It is proven in [31] [Theorem 3.1] that the FRHT is a continuous linear mapping of K μ ( R + ) onto itself. For f K μ ( R + ) , the inverse FRHT is defined in [63] as
f ( x ) = 0 K ¯ α μ ( x , ξ ) ( H μ α f ) ( ξ ) d ξ ,
where
K ¯ α μ ( x , ξ ) = C α , μ e i ( x 2 + ξ 2 2 c 1 ) x ξ c 2 J μ ( x ξ c 2 ) , C α , μ = C α , μ ¯ sin α .
The FRHT can be extended to the space of distributions K μ ( R + ) by
H μ α f , φ = f , H μ α φ , f K μ ( R + ) , φ K μ ( R + ) ,
and furthermore FRHT is a continuous linear mapping of K μ ( R + ) onto itself.
Abelian theorem for the FRHT is given in [34] and state.
Theorem 13. 
[34] [Theorem 4.2] Let f K μ ( R + ) . Assume that f has the quasi-asymptotic behavior of degree m R at origin with respect to L in K μ ( R + ) that is,
f ( ε x ) ε m L ( ε ) u ( x ) as ε 0 + .
Then,
e i c 1 ( ξ ε ) 2 / 2 H μ α f ξ ε C α , μ c 2 m + 1 ε m + 1 L ( ε ) H μ u ( ξ ) as ε 0 + in K μ ( R + ) .
Tauberian theorem for the FRHT is given in [35] and state.
Theorem 14. 
[35] [Theorem 4.5] Assume that f K μ ( R + ) is of slow growth at infinity and locally integrable on R + , defining a regular element of K μ ( R + ) . Assume that the limit lim ε 0 + e i c 1 ( ξ ε ) 2 / 2 H μ α f ( ξ ε ) ε m + 1 L ( ε ) < exists for all ξ R + and there exist constants N > 0 , C = C ( α ) > 0 , and 0 < ε 0 1 such that
| e i c 1 ( ξ ε ) 2 / 2 H μ α f ( ξ ε ) | ε m + 1 L ( ε ) C | ξ | N + μ + 1 2 ,
for all ξ R + and 0 < ε ε 0 . Then f has the quasi-asymptotic behavior of degree m R at 0 + in K μ ( R + ) .
Table 1. Conceptual relationship between fractional transforms.
Table 1. Conceptual relationship between fractional transforms.
Transform Kernel Base Domain Fractional Parameter Role
FRFT Exponential (Fourier) Time–Frequency Rotation in time–frequency plane
FRWT Scaled wavelets Time–Scale Fractional modulation and dilation
FRSTFT Exponential + window Time–Frequency Local fractional analysis
FRST Localized exponential Time–Frequency Fractional phase rotation
FRHT Bessel-based Radial domain Fractional rotation in spatial–frequency plane
Table 2. Connection between transforms.
Table 2. Connection between transforms.
Transform Connection
FRFT and FT e i c 1 ξ 2 / 2 F α ( f ( x ) ) ( ξ ) = 1 i c 1 F ( e i c 1 x 2 / 2 f ( x ) ) ( c 2 ξ )
STFRFT and FT e i c 1 ξ 2 / 2 V g α f ( x , ξ ) = 1 i c 1 e i c 1 ξ 2 / 2 F e i c 1 t 2 / 2 f ( t ) g ( t x ) ¯ ( ξ c 2 )
FRST and FT e i c 1 ξ 2 / 2 S g α f ( x , ξ ) = 1 i c 1 | ξ | F e i c 1 t 2 2 f ( t ) g ( ξ ( t y ) ) ¯ ( ξ c 2 )
STFRFT and STFT e i c 1 ξ 2 / 2 V g α f ( x , ξ ) = 1 i c 1 V g ( f ( t ) e i c 1 t 2 / 2 ) ( x , c 2 ξ )
FRCFT and FCT e i c 1 ξ 2 / 2 F α c f ( ξ ) = 1 i c 1 F c ( e i x 2 c 1 / 2 f ( x ) ) ( ξ c 2 )
FRSFT and FST e i c 1 ξ 2 / 2 F α s f ( ξ ) = 1 i c 1 F s ( e i x 2 c 1 / 2 f ( x ) ) ( ξ c 2 )
FRST and FRWT e i c 1 ξ 2 2 S g α f ( x , ξ ) = ξ C α e i c 1 x 2 2 i c 2 x ξ W M c 2 g α f ( x , 1 ξ )
FRHT and HT H μ α f ( ξ ) = C α , μ e i c 1 ξ 2 / 2 H μ ( e i c 1 x 2 / 2 f ( x ) ) ( c 2 ξ )

11. Applications of Fractional Transforms

11.1. The Fractional Fourier Transform

As mentioned before, FRFT introduces a rotation in the time–frequency plane using the parameter α . This property enables FRFT to represent signals in intermediate domains between time and frequency, which is highly beneficial for analyzing non-stationary or chirp signals. Survey paper [65] synthesizes recent FRFT advances and application areas for nonstationary signal analysis and parameter estimation.
For signal processing purposes, a real-time photonic FRFT instrument for measuring chirp rates and detecting weak chirped radio-frequency (RF) signals under noise is demonstrated in [66], while the authors in [67] apply FRFT spectral analysis to sea-clutter radar data, revealing approximate fractal scaling useful for signal characterization. Authors in [68] present FRFT properties and applications for blind source separation and RF photonics signal manipulation. Paper [69] shows how FRFT-domain filtering achieves optimal restoration for chirplike and space-varying degradations, reducing error compared to classical Wiener filtering. The FRFT filtering also offers lower-complexity optimal estimators for nonstationary degradations and supports specialized denoising, sampling, and operator theorems for fractional domains [69,70,71].
When applied to 2D signals such as images, FRFT yields alternative image representations, improved compression [71,72], edge detection [73], and supports watermarking [74,75]. The FRFT is also widely used in opto-digital cryptosystems, holographic encryption, and optical implementations of randomized transforms, with key optical-domain works demonstrating encryption, optical correlators, and experimental decryption using FRFT models [70,75,76,77,78].
In communications, the FRFT-based modulation and demodulation schemes enhance spectral efficiency and alter signal statistics to hinder interception [79]. Moreover, the FRFT is used to optimize the fractional order to reduce the BER (Bit Error Rate) and PAPR (Peak-to-Average Power Ratio) in visible-light links [80]. Paper [66] also demonstrates agile FRFT computation hardware, enabling chirp-rate measurements and detection of weak chirped radar signals in noise.

11.2. The Fractional Stockwell Transforms

Applications of the FRST span several domains. In geophysics, the FRST transform for seismic reservoir prediction and fluid identification, which demonstrates improved time–frequency resolution, is applied [81]. In biomedical engineering, authors in [82,83] utilized the FRST for ECG denoising and QRS complex detection with notable SNR gains. Extensions of the transform, such as the Fractional Lower-Order S-Transform (FLOST) [84], the Linear Canonical Stockwell Transform (LCST) [85], and the Spectral Graph FrST [86], further expand its applicability to fault diagnosis, chirp signal analysis, and graph signal processing.
Comprehensive reviews [87,88] highlight the mathematical versatility and educational relevance of the FRST, confirming its role as a robust framework for fractional-domain time–frequency analysis and feature extraction.

11.3. The Fractional Wavelet Transforms

The FRWT generalizes the conventional WT by introducing a fractional-order parameter α , which enables a continuous rotation in the joint time–frequency–scale domain. This additional degree of freedom provides a unified mathematical framework connecting fractional Fourier and multiresolution wavelet analysis, enhancing adaptability to nonstationary and transient signals [89,90,91]. Theoretical surveys in [92,93] further positions FRWT as a mathematically consistent and computationally efficient tool for multiscale fractional-domain analysis, supporting diverse applications in denoising, compression, sampling, fusion, and feature extraction.
In signal and image processing, discrete FRWT (DFRWT) methods have been employed for medical image fusion [94], image enhancement [95], and adaptive denoising with optimal fractional orders [96,97], consistently yielding higher peak signal-to-noise ratio (PCNR) and perceptual quality than integer-order wavelets. In time–fractional–frequency analysis, FRWT has been applied to high-resolution linear frequency modulated (LFM) signal parameter estimation and optimization [98].

11.4. The Fractional Hankel Transforms

The FRHT generalizes the classical HT by introducing a fractional-order parameter that provides a continuous transition between the spatial and spatial-frequency domains. This extension preserves the transform’s rotational symmetry, making it particularly suitable for cylindrically symmetric optical systems and radially dependent field analysis.
In [99], authors established the relationship between the modal structure of rotationally symmetric beams and their fractional Hankel representations, showing that the Laguerre–Gaussian spectrum can be obtained from FRHT evaluations along the optical axis. Theoretical and review works [92,100] further discuss fractional cyclic transforms and their role in optical information processing, encryption, and filtering.
Applications of FRHT include beam propagation and diffraction modeling in misaligned and apertures optical systems [101,102], where the transform enables efficient computation of field evolution and diffraction integrals. Beyond optics, theoretical studies such as [103] extend the FRHT to almost-periodic and power-bounded signals, constructing generalized frames and inequalities that link the Hankel and wavelet domains. Collectively, these works establish the FRHT as a mathematically robust and computationally efficient tool for radially symmetric signal and optical-beam analysis.

11.5. Application Example

One of the FRFT applications is to select the optimal α parameter for non-stationary signals in order to best represent the signal in the rotated time-frequency plane. It is very useful to examine for which parameter α non stationary signal has the maximum energy concentration in the mixed time-frequency space. In this study, three representative non-stationary signals are analyzed in order to illustrate how the optimal fractional order α of the FRFT depends on the underlying time–frequency structure of the signal. The signals considered are (i) a linear chirp, (ii) a chirp with an added stationary sinusoidal component, and (iii) a Gaussian-modulated sinusoid. All of those signals are created in Matlab, and for purpose of chirp signal creation, the Matlab function “chirp” is used. An overview of all the functions mentioned with the parameters used is given in Table 3, and those are shown in Figure 1.
To determine the optimal fractional order α of the FRFT, an energy–based concentration measure is used and defined as:
C α = k | X α ( k ) | 4 ( k | X α ( k ) | 2 ) 2 ,
where X α ( k ) denotes the FRFT of the input discrete-time signal x [ n ] for a given fractional order α . In detail analysis, the denominator represents the squared total energy of the transformed signal, ensuring normalization and making the measure invariant to the absolute signal amplitude. The numerator emphasizes large–magnitude coefficients through the fourth power, which increases sensitivity to how strongly the energy is concentrated in a small number of transform coefficients.
A higher value of C α indicates that the signal becomes more compact in the FRFT domain, which means that the chosen fractional order aligns more closely with the intrinsic time–frequency structure of the signal. Therefore, the optimal fractional order is defined as:
α * = a r g max α C α .
Figure 2 shows the variation of the energy concentration measure C α as a function of the fractional order α , α [ 0 , π ] for three different input signals shown in Figure 1. As can be seen, for the pure chirp signal, the curve exhibits a clear and pronounced maximum at a specific value of α = 1.9212 rad. This occurs because the FRFT effectively “straightens” the chirp in the time–frequency plane when the fractional order corresponds to the chirp rate. At this optimal α , the signal becomes highly compact in the transform domain, resulting in maximal concentration. However, the signal composed of a chirp and an added sinusoid component produces a broader and shifted maximum. The sinusoid introduces an additional, differently oriented structure in the time–frequency plane, which cannot be simultaneously aligned with the chirp component by a single fractional order. As a result, the optimal fractional order changes, and the concentration measure becomes less sharply peaked. In this case optimal parameter α is 2.0944 rad. The optimal parameter α for the Gaussian modulated signal is not expressed as in the previous two examples, however is the maximum value is α = 3.0550 rad. Because Gaussian-type signals maintain approximate invariance under FRFT, their optimal α depends primarily on their dominant frequency and temporal localization. The described comparison illustrates that the optimal FRFT order is highly dependent on the underlying time–frequency characteristics of the signal, and that the concentration measure C α provides an effective quantitative tool for identifying it.

References

  1. Bochner, K. Chandrasekharan, Fourier Transforms, Princeton University Press., 1949.
  2. Bracewell, R. N. , The Fourier Transform and Its Applications ,3rd ed., Boston: McGraw-Hill, 2000.
  3. Capus, C.; Brown, K., Short-time fractional Fourier methods for the time-frequency representation of chirp signals, J. Acoust. Soc. Amer., 2003, 113(6), 3253–-3263. [CrossRef]
  4. Gröchenig, K., Foundations of time-frequancy analysis, Birkhauser Boston, Inc., Boston, MA, 2001.
  5. Chui, C.K., An Introduction to Wavelets, San Diego, CA: Academic Press, 1992.
  6. Meyer, Y. Yves, Wavelets and Operators, Cambridge, UK: Cambridge University Press, 1992.
  7. Stockwell, R.G.; Mansinha, L.; Lowe, RP., Localization of the complex spectrum: The S transform, IEEE Trans Signal Process, 1996, 44, 998–-1001.
  8. Namias, V., Fractionalization of Hankel transform. J. Inst. Math. Appl., 1980, 26, 187–197.
  9. Namias, V., The fractional order Fourier transform and its application to quantum mechanics, J. Inst. math. Appl., 1980, 25, 241–265. [CrossRef]
  10. Ozaktas, H. M.; Kutay, M. A.; and Mendlovic, D., Introduction to the Fractional Fourier Transform and Its Applications, Advances in Imaging and Electron Physics, 1999, 106, 239–286.
  11. Ran Tao; Yan-Lei Li; Yue Wang, Short-Time Fractional Fourier Transform and Its Applications, IEEE Transactions on Signal Processing, 2010, 58(5), 2568–2580. [CrossRef]
  12. Lohmann, A.W.; Mendlovic, D.; Zalevsky Z.; Dorsch R.G., Some Important Fractional for Signal Processing, Optics Communications, 1996 125(1-3), 18–20.
  13. Alieva, T; Bastiaans M. J., Fractional cosine and sine transforms in relation to the fractional Fourier and Hartley transforms, Proceedings of the Seventh International Symposium on Signal Processing and Its Applications, Paris, France, 2023, 2003(1), 561–564.
  14. Hudzik H.;, Jain, P.; Kumar R., On generalized fractional cosine and sine transforms, Georgian Mathematical Journal, 2018, 25(2), 259–270. [CrossRef]
  15. Pei, S.C.; Yeh M.H., The discrete fractional cosine and sine transforms, IEEE Transaction on Signal Processing, 2002, 49(6), 1198–1207.
  16. Ping, XD; Guo, K., Fractional S-transform—Part 1, Theory. Applied Geophysics, 2012, 9(1), 73-–79.
  17. Betancor J.J., On Hankel transformable distribution spaces, Publications de L’institut mathematique, 1999, 65(79), 123–141.
  18. Betancor J.J. and Rodriquez-Mesa L., Hankel convolution on distributions spaces with exponential growth, Studia Mathematica, 1996, 121(1), 35–52.
  19. Bingham N. H., A Tauberian theorem for integral transforms of Hankel type,J. London Math. Soc., 1972, 2, 5–6. [CrossRef]
  20. Sheppard, C.J.R.; Larkin, K.G., Similarity theorems for fractional Fourier transforms and fractional Hankel transforms. Opt. Commun., 1998, 154, 173–178. [CrossRef]
  21. Zemanian, A.H., Generalized Integral Transformations. Interscience Publishers, New York, 1968.
  22. Zemanian, A.H., A distributional Hankel transformation, SIAM J. Appl. Math. 1966, 14, 561–576.
  23. Zemanian, A.H., The Hankel transformation of certain distributions of rapid growth,SIAM J. Appl. Math., 1966, 14, 678–690. [CrossRef]
  24. Zemanian, A.H., Some Abelian Theorems for the Distributional Hankel and K Transformations, SIAM Journal on Applied Mathematics, 1966, 14(6), 1255–1265.
  25. Zemanian, A.H., Distribution theory and Transform Analysis, McGraw-Hill, New York, 1965.
  26. Atanasova, S.; Maksimović, S.; Pilipović, S., Abelian and Tauberian results for the fractional Fourier and short time Fourier transforms of distributions, Integral transform and Special functions, 2024, 35 (1), 1–16. [CrossRef]
  27. Schwartz L. Thory des Distributions I., 2nd ed. Paris: Hermann; 1957.
  28. Milton, E.O., Fourier transforms of odd and even tempered distributions, Pacific Journal of Mathematics, 1974, 50(2), 563–572. [CrossRef]
  29. Holschneider, M., Wavelets. An analysis tool. New York: The Clarendon Press. Oxford University Press; 1995.
  30. Pathak, RS., The wavelet transform of distributions, Tohoku Math. J. 2004, 56, 411–421.
  31. Prasad, A.; Singh, V.K., The fractional Hankel transform of certain tempered distributions and pseudo-differential operators. Ann Univ Ferrara, 2013, 59, 141–158. [CrossRef]
  32. Estrada, R.; Kanwal, R. P., A distributional approach to asymptotics. Theory and applications, Second edition, Birkhäuser, Boston, 2002.
  33. Misra, O. P.; Lavoine, J. L., Transform analysis of generalized functions, North-Holland Publishing Co., Amsterdam, 1986.
  34. Atanasova, S.; Jakšić, S.; Maksimović, S.; Pilipović, S. (2025). Abelian and Tauberian results for the fractional Hankel transform of generalized functions. Integral Transforms and Special Functions, 1–14. [CrossRef]
  35. Atanasova S.; Jakšić S.; Maksimović S.; Pilipović S., Abelian and Tauberian results for the fractional Hankel transform in Zemanian-type spaces, preprint (https://arxiv.org/abs/2504.20614).
  36. Maksimović, S.; Atanasova, S.; Mitrovic, Z., Abelian and Tauberian results for the fractional Fourier cosine (sine) transform. AIMS Mathematics, 2024, 9 (5), 12225–12238. [CrossRef]
  37. Vladimirov, V. S.; Drozhzhinov, Yu. N.; Zavialov, B. I., Tauberian theorems for generalized functions, Kluwer Academic Publishers Group, Dordrecht, 1988.
  38. Maksimović S., Asymptotic results for the distributional fractional Stockwell and fractional wavelet transforms, preprint.
  39. Pilipović, S.; Stanković, B.; Takači, A., Asymptotic Behavior and Stieltjes Transformation of Distribution, Taubner-Texte zur Mathematik, band 116, 1990.
  40. Almeida L.B., The Fractional Fourier Transform and Time-Frequency Representations , IEEE Transactions on Signal Processing, 1994, 42 (11), 3084–3091. [CrossRef]
  41. Catherall, A. T.; Williams, D. P., Detecting non-stationary signals using fractional Fourier methods, [Online]. Available: http://www. ima.org.uk/Conferences/mathssignalprocessing2006/williams.pdf.
  42. Kerr, F. H., A distributional approach to Namias’ fractional Fourier transforms, Proc. Roy. Soc. Edinburgh Sect. A 108, (1988), 133–143. [CrossRef]
  43. Stanković L.; Alieva T.; Bastiaans M. J., Time–frequency signal analysis based on the windowed fractional Fourier transform, Signal Processing, 2003, 83(11), 2459–2468. [CrossRef]
  44. Zhang, F.; Bi, G.; Chen, Y. Q., Chip signal analysis by using adaptive short-time fractional Fourier transform, 2000 [Online]. Available:http://www.eurasip.org/Proceedings/Eusipco/Eusipco2000/sessions/ WedPm/OR3/cr1282.pdf.
  45. Chen W,; Fu, Z. W.; Grafakos, L.; Wu, Y, Fractional Fourier transforms on Lp and applications. Appl Comput Harmon Anal, 2021, 55, 71–-96.
  46. McBride A.C.; Kerr F. H., On Namias’s fractional Fourier transforms, IMA J. Appl. Math., 1987 39, 159-–175.
  47. Pathak R.S.; Prasad A.; Kumar M., Fractional Fourier transform of tempered distributions and generalized pseudo/differential operator, J. Pseudo-Differ. Oper. Appl, 2012, 3, 239–254. [CrossRef]
  48. Singh, A., Fractional Fourier transform of a class of boehmians, International Journal of Pure and Applied Mathematics, 2015, 101(3), 413–420.
  49. Zayed A.I., Fractional Fourier transform of generalized functions, Integ. Trans. Spl. Funct., 1998, 7, 299–312. [CrossRef]
  50. Prasad, A.; Kumar, M. Product of two generalized pseudo-differential operators involving fractional Fourier transform, J. Pseudo Differ. Oper. Appl. 2011, 2(3), 355–365. [CrossRef]
  51. Toft J.; Bhimani D. G.; Manna R., Fractional Fourier transforms, harmonic oscillator propagators and Strichartz estimates on Pilipovic and modulation spaces, arXiv:2111.09575, 29 pp. [CrossRef]
  52. Banerji, P. K.; Al-Omari, S. K.; Debnath, L., Tempered distributional sine (cosine) transform, Integral Transforms and Special Functions, 2006, 17(11), 759–768. [CrossRef]
  53. Prasad A.; Singh M.K., Pseudo-differential operators involving Fractional Fourier cosine (sine) transform, Filomat, 2017, 31(6), 1791–1801.
  54. Shi, J.; Zheng, J.; Liu, X.; Xiang, W.; Zhang, Q. Novel Short-Time Fractional Fourier Transform: Theory, Implementation, and Applications. IEEE Transactions on Signal Processing, 2020, 68, 3280–3295. [CrossRef]
  55. Cong, D.Z.; Xu, D.P,; Zhang, J.M.. Fractional S-transform-part 2: Application to reservoir prediction and fluid identification, Applied Geophysics, 2016, 13(2), 343-–352. [CrossRef]
  56. Ranjan, R.; Jindal, N.; Singh, A.K., Fractional S-Transform and Its Properties: A Comprehensive Survey, Wireless Pers Commun, 2020, 113, 2519–2541. [CrossRef]
  57. Wang, Y.; Zhenming, P., The optimal fractional S transform of the seismic signal based on the normalized second-order central moment. Journal of Applied Geophysics, 2016, 129, 8–16.
  58. Xu, D.P.; Guo, K., Fractional S transform-Part 1: Theory. Appl. Geophys, 2012, 9, 73–79.
  59. Maksimović S. Fractional Stockwell transform of Lizorkin distributions. Integral transform and Special functions, 2024, 35 (2), 151–163. [CrossRef]
  60. Thanga Rejini, M.. Generalized fractional Stockwell transform and its associated pseudo-differential operator, Integral Transforms and Special Functions, 2024, 35(11), 637-–653. [CrossRef]
  61. Mendlovic, D.; Zalevsky, Z.; Mas, D.; García, J.; Ferreira, C., Fractional wavelet transform, Appl. Opt., 1977, 36, 4801–4806.
  62. Shi, J.; Zhang, N.T.; Liu, X.P., A novel fractional wavelet transform and its applications, Sci. China Inf. Sci., 2011, 55(6), 1270-–1279. [CrossRef]
  63. Kerr, F.H., Fractional powers of Hankel transforms in the Zemanian spaces, J. Math. Anal. Appl. 1992, 166, 65–83. [CrossRef]
  64. Kerr, F. H., A fractional power theory for Hankel transforms in L2(R+), J. Math. Anal. Appl. 1991, 158, 114–123. [CrossRef]
  65. Kumar, S.; Saxena, R.; Singh, K., Fractional Fourier Transform and Fractional-Order Calculus-Based Image Edge Detection, Circuits Systems and Signal Processing, 2017, 36(4), 1493–-1513. [CrossRef]
  66. Ludwig, L. F., Image processing utilizing non-positive-definite transfer functions via fractional Fourier transform, Feb. 2000.
  67. Ran, T.; Bingzhao, L., Theories and methods of signal processing in fractional Fourier domain, Opto-electronic Engineering, 2018, 45 (6), 1.
  68. Narendra, S.; Aloka, S., Optical image encryption using fractional Fourier transform and chaos, Optics and Lasers in Engineering, 2008, 46 (2), 117–123.
  69. Jinming, M.; Hongxia, M.; Xinhua, S.; Chang, G.; Xuejing, K.; Ran, T., Research progress in theories and applications of the fractional Fourier transform, Opto-electronic Engineering, 2018, 45 (6), 170747.
  70. Alieva, T.; Bastiaans, M. M.; Calvo, M. L., Fractional transforms in optical information processing, EURASIP Journal on Advances in Signal Processing, 2005, 2005(10), 1498-–1519. [CrossRef]
  71. Kutay M. A.; Ozaktas, H. M., Optimal image restoration with the fractional Fourier transform, Journal of The Optical Society of America A-optics Image Science and Vision, 1998, 15(4), 825-–833. [CrossRef]
  72. Singh K.; Nishchal, N. K., Fractional Fourier transform: Applications in information optics, Proc. SPIE 4929, Optical Information Processing Technology, 2002,4929, 34–48.
  73. Naveen, K. N.; Joby, J,; Kehar, S., Securing information using fractional Fourier transform in digital holography, Optics Communications, 2004, 235 (4–6), 253–259.
  74. Zunwei, Fu; Yan, L.; Dachun, Y.; Shuhui, Y., Fractional Fourier Transforms Meet Riesz Potentials and Image Processing, 2023, doi: 10.48550/arxiv.2302.13030. [CrossRef]
  75. Zhang, YS. et al., The Fractional Fourier Transform and its Application to Digital Image Watermarking, in Proc. International Conference on Advanced Maechatronic Systems, 2018, doi: 10.1109/ICAMECHS.2018.8507072.
  76. Zalevsky, Z.; Ozaktas, H. M.; Kutay, A. M., Fractional Fourier transform-exceeding the classical concepts of signal’s manipulation, Optics and Spectroscopy, 2007, 103(6), 868–-876. [CrossRef]
  77. Yetik, İ. Ş.; Kutay, M. A.; Ozaktas, H.M., Image representation and compression with the fractional Fourier transform, Optics Communications, 2001 197(4–6), 275–278. [CrossRef]
  78. Kumari R.; Mustafi, A., Denoising of Images using Fractional Fourier Transform, 2022 2nd International Conference on Emerging Frontiers in Electrical and Electronic Technologies (ICEFEET), Patna, India, 2022, pp. 1-6.
  79. Nafchi, A. R.; Hamke, E.; Pereyra, C.; Jordan, R., Circular Convolution and Product Theorem for Affine Discrete Fractional Fourier Transform, arXiv: Signal Processing, Oct. 2020.
  80. Nassiri, M.; Baghersalimi, G.; Ghassemlooy, Z., Optical OFDM based on the fractional Fourier transform for an indoor VLC system, Applied Optics, 2021, 60(9), 2664-–2671. [CrossRef]
  81. Du, Z.-C.; Xu, D.-P.; Zhang, J.-M., Fractional S Transform — Part 2: Application to Reservoir Prediction and Fluid Identification, Applied Geophysics, 2016, 13(2), 343–352. [CrossRef]
  82. Bajaj, A.; Kumar, S. A Robust Approach to Denoise ECG Signals Based on Fractional Stockwell Transform,” Biomedical Signal Processing and Control, 2020, doi:10.1016/J.BSPC.2020.102090. [CrossRef]
  83. Bajaj, A.; Kumar, S., QRS Complex Detection Using Fractional Stockwell Transform and Fractional Stockwell Shannon Energy Biomedical Signal Processing and Control, 2019. [CrossRef]
  84. Long, J.; Wang, H.; Zha, D.; Li, P.; Xie, H.; Mao, L., Applications of Fractional Lower-Order S Transform Time–Frequency Filtering Algorithm to Machine Fault Diagnosis, PLOS ONE, 2017, 12(4):e0175202. [CrossRef]
  85. Wei, D.; Zhang Y.; Li, Y. -M., Linear Canonical Stockwell Transform: Theory and Applications, IEEE Transactions on Signal Processing, 2022, 70, 1333–1347.
  86. Singh K.; Kumar, S., A Spectral Graph Fractional Stockwell Transform for Signal Analysis, Traitement du Signal, 2024, 41(3), 1539–1546. [CrossRef]
  87. Maksimovic S.; Gajic, S., Stockwell Transform and Its Modifications in Signal Processing Courses: Comparison and Features, in Proc. INFOTEH, 2023,.
  88. Ranjan, R.; Jindal, N.; Singh, A., Fractional S-Transform and Its Properties: A Comprehensive Survey, Wireless Personal Communications, 2020, 13, 2519–-2541. [CrossRef]
  89. Mendlovic, D.; Zalevsky, Z.; Mas, D.; Garcia, J.; Ferreira, C., Fractional wavelet transform, Applied Optics, 1997, 36(20), 4801-–4806.
  90. Shi, J.; Zhang, N.; Liu, X., A novel fractional wavelet transform and its applications, Science in China Series F: Information Sciences, 2012, 55(12), 2753–-2764. [CrossRef]
  91. Shi, J.; Liu, X.; Zhang, N., Multiresolution analysis and orthogonal wavelets associated with fractional wavelet transform, Signal, Image and Video Processing, 2015, 9, 211-–220. [CrossRef]
  92. Zayed, Ahmed I. Fractional Integral Transforms: Theory and Applications. Chapman and Hall/CRC, 2024.
  93. Jindal, N.; Singh, K., Applicability of fractional transforms in image processing—review, technical challenges and future trends, Multimedia Tools and Applications, 2019, 78(2 ), 34303–-34333. [CrossRef]
  94. Xiaojun Xu; Youren, W.; Shuai, C., Medical image fusion using discrete fractional wavelet transform, Biomedical Signal Processing and Control, 2016, 27, 103-–111.
  95. Guo, C., The application of fractional wavelet transform in image enhancement, International Journal of Computers and Applications, 2021, 43(6), 528-–534. [CrossRef]
  96. Wang, Y., Novel image denoising method based on discrete fractional orthogonal wavelet transform, in Proc. Conf. CNKI, 2014.
  97. Yuanyuan, J.; Youren, W.; Hui, L., Image denoising method for unknown noise based on 2-D FWT with optimal fractional order, Journal of Computers, 2014, 9(2), 412–-419.
  98. Luo, Y.; Yang, L., LFM signal optimization time–fractional–frequency analysis: Principles, method and application, Digital Signal Processing, 2022, 126, 103505,.
  99. Alieva, T.; Bastiaans, M. J. M., Mode analysis in optics through fractional transforms,” Optics Letters, 1999, 24(17):1206-1208. [CrossRef]
  100. Alieva, T.; Bastiaans, M. J. M.; Calvo, M. L., Fractional cyclic transforms in optics: Theory and applications, In book: Recent Research Developments in Optics, Research Signpost, Trivandrum, 2001.
  101. Ge, F.; Zhao, D.; Wang, S., Fractional Hankel Transform and the Diffraction of Misaligned Optical Systems, Journal of Modern Optics, 2005, 52(1), 61–71. [CrossRef]
  102. Mei Z.; Zhao, D., Propagation of Laguerre–Gaussian and Elegant Laguerre–Gaussian Beams in Apertured Fractional Hankel Transform Systems, Journal of the Optical Society of America A, 2004, 21, 2375–2381.
  103. Ünalmış Uzun, B., Fractional Hankel and Bessel Wavelet Transforms of Almost Periodic Signals, Journal of Inequalities and Applications, 2015, 388. [CrossRef]
Figure 1. Three non-stationary signals.
Figure 1. Three non-stationary signals.
Preprints 186920 g001
Figure 2. C α for different fractional orders.
Figure 2. C α for different fractional orders.
Preprints 186920 g002
Table 3. Summary of signals used in the study.
Table 3. Summary of signals used in the study.
Signal Mat. Expression Parameters / Notes
(i) sin 2 π ( f 0 t + k 2 t 2 ) f 0 = 20 Hz , f 1 = 200 Hz ,
T = 1 s , k = f 1 f 0 T
(ii) sin 2 π ( f 0 t + k 2 t 2 ) + 0.8 sin ( 2 π f s t ) f 0 = 20 Hz , f 1 = 200 Hz ,
T = 1 s , k = f 1 f 0 T , f s = 50 Hz
(iii) exp ( t 0.5 ) 2 0.005 sin ( 2 π f 1 t ) f 1 = 500 Hz ,
G. envelope centered at t = 0.5 s
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.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2025 MDPI (Basel, Switzerland) unless otherwise stated