Next Article in Journal
Predictive Resilience Modeling Using Statistical Regression Methods
Next Article in Special Issue
Orthogonal Stability and Solution of a Three-Variable Functional Equation in Extended Banach Spaces
Previous Article in Journal
Hyperpolyadic Structures
Previous Article in Special Issue
Existence of Solutions for Planar Kirchhoff–Choquard Problems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Offset Linear Canonical Stockwell Transform for Boehmians

1
Department of Mathematics, IIT Patna, Patna 801106, Bihta, India
2
School of Ethics, Governance, Culture and Social Systems, Chinmaya Vishwa Vidyapeeth, Ernakulam 682313, Kerala, India
3
Department of Mathematics and Systems Engineering, Florida Institute of Technology, Melbourne, FL 32901, USA
*
Author to whom correspondence should be addressed.
Mathematics 2024, 12(15), 2379; https://doi.org/10.3390/math12152379
Submission received: 1 June 2024 / Revised: 13 July 2024 / Accepted: 17 July 2024 / Published: 31 July 2024
(This article belongs to the Special Issue Nonlinear Equations: Theory, Methods, and Applications III)

Abstract

:
In this article, we construct a Boehmian space using the convolution theorem that contains the offset linear canonical Stockwell transforms (OLCST) of all square-integrable Boehmians. It is also proven that the extended OLCST on square-integrable Boehmians is consistent with the traditional OLCST. Furthermore, it is one-to-one, linear, and continuous with respect to Δ -convergence as well as Δ -convergence. Subsequently, we introduce a discrete variant of the OLCST. Ultimately, we broaden the application of the presented work by examining the OLCST within the domain of almost periodic functions.
MSC:
81S30; 42C40; 65R10; 42C15; 44A35

1. Introduction

Offset Linear Canonical Transform (OLCT) [1,2,3,4] is a mathematical tool widely employed in signal processing, optics, and various scientific and engineering domains. It extends the capabilities of Linear Canonical Transform (LCT). Moshinsky and Quesne’s foundational work in quantum mechanics laid the formulation for LCT [5]. In contemporary signal processing research, LCT has emerged as a prominent area of study. This heightened interest has spurred substantial efforts to elucidate its mathematical foundations, leading to the establishment of numerous theorems pertaining to critical concepts such as sampling theorems [6,7,8], convolution theorems [9,10], and uncertainty principles [11]. The field of signal processing, in particular, has experienced a notable surge in investigations centered on LCT [12]. Originally, LCT was recognized for its ability to encompass fundamental transforms such as Fourier transform (FT) [13,14], fractional Fourier transform (FrFT) [15,16,17] and Fresnel transform [18]. These transformations have long been cornerstones in signal processing and optics, enabling the analysis and manipulation of signals and images in different domains.
Defined by a set of six parameters ( A , B , C , D , τ , η ) , OLCT, also known as special affine Fourier transform (SAFT) [19], represents the time-shifted τ and frequency-modulated η version of the LCT [20], which has four parameters ( A , B , C , D ) . The additional parameters enhance the generality and flexibility of OLCT, making it applicable to a wide range of electrical and optical signal systems. OLCT has seen a rise in applications in various fields, such as optics and signal processing, in recent years [2,3,21]. In signal processing, FT represents signals widely in both temporal and spatial domains. While short-time Fourier transform (StFT) has addressed some limitations of Fourier transform, it struggles with signals featuring high frequencies for a small duration and low frequencies for a large duration because the analysis window width is fixed. Continuous wavelet transform (WT) [22,23] was introduced to overcome this limitation by offering greater adaptability. However, WT has its own drawbacks, such as a lack of phase information and poor directionality.
LCT faces challenges when analyzing signals with poorly concentrated energy in the frequency domain and non-stationary characteristics. Windowed linear canonical transform (WLCT) involves segmenting the signal before LCT spectral analysis to address these issues. However, the fixed window width restricts its practical application. Gupta et al. [24] introduced linear canonical wavelet transform (LCWT) as a solution, overcoming the limitations of LCT, WT, and WLCT.
To further address these challenges, Stockwell et al. [25] introduced Stockwell transform (ST) by merging advantages of the StFT and wavelet transform; the classical Stockwell transform provides accurate information about the local behavior of a signal in temporal–spatial analysis [26]. To analyse signals with multi-angle, multi-resolution, multi-scale, and temporal localization capabilities, researchers have proposed extensions of the Stockwell transform, such as fractional Stockwell transform (FrST) [27,28,29,30,31] and linear canonical Stockwell transform (LCST) [32,33,34].
In recent years, several expansions of Stockwell transform (ST) have emerged, integrating it with other relevant transforms such as FrFT, LCT, and Dunkl transforms, and others [27,32,34,35,36]. These extensions, such as Dunkl–Stockwell transform, fractional Stockwell transform (FrST), and linear canonical Stockwell transform (LCST) facilitate the analysis of signals with capabilities for multi-scale, multi-resolution, and temporal localization, etc. Consequently, they are adept at handling chirp-like signals, which are pervasive in various domains. Delving into the expansive realms of Stockwell transforms (STs) and recognizing the significant utility of the OLCT, there is a compelling drive to integrate their distinct advantages into an innovative transformation termed offset linear canonical Stockwell transform (OLCST). The main benefit of this suggested OLCST is that it inherits some interesting aspects from the classic ST and OLCT in addition to the good mathematical qualities of the former, especially when it comes to concurrently showing both temporal and OLCST domain information. The proposed transform offers increased degrees of freedom, improving its versatility in non-stationary signal processing applications, among other fields.
In 1981, Mikusinski [37] presented Boehmians as sequence quotients to generalize functions and distributions. Following the significant work by Mikusiński on the convergence of Boehmians [38], numerous studies [39,40,41,42,43,44,45] have been conducted by various researchers from different viewpoints. In this work, we apply OLCST to the space of square-integrable Boehmians. The space contains an example of a Boehmian that does not match to any distribution, as shown in [38]. Hence, defining OLCST on square-integrable Boehmians is a reasonable generalization of OLCST on L 2 ( R ) .
The structure of the paper is as given: Section 2 offers the necessary background, including OLCST. In Section 3, we extend OLCST to the space of square-integrable Boehmians and the definition of OLCST in this space serves as a proper generalization of OLCST on L 2 ( R ) .  Section 4 discusses the discrete iteration of the new transform and derives its reconstruction formula. In Section 5, we expand our study to explore the application of the novel transform to almost periodic functions (APFs). In Section 6, we provide the potential applications, and finally, Section 7 provides the conclusions of our work.

2. Preliminaries

Let L p ( R ) represent the space of all complex-valued Lebesgue measurable functions on R with
f p = R | f ( t ) | p d t 1 p < where p = 1 , 2 .
We also represent the set of all complex-valued functions which are Lebesgue measurable by
| Φ | 2 = R R | Φ ( a , b ) | 2 d b d a | a | 1 2 < ,
by L 2 ( R 2 ) .
Fix a mother affine wavelet ϕ L 1 ( R ) L 2 ( R ) such that R ( | ϕ ^ ( t ) | 2 | t | ) d t < , where ϕ ^ ( t ) = 1 2 π R ϕ ( x ) e i t x d x , t R , the Fourier transform of ϕ .
Definition 1. 
For any signal f ( t ) L 2 ( R ) and augmented matrix parameter A = A B ; τ C D ; η with A D B C = 1 , OLCT is given by
O A [ f ( t ) ] ( ω ) = R f ( t ) K A ( t , ω ) d t ,
where K A ( t , ω ) = K B e j 2 B ( A t 2 + 2 t ( τ ω ) 2 ω ( D τ B η ) + D ( ω 2 + τ 2 ) ) with K B = 1 j 2 π B . We only took into account the case in which B is not 0, as OLCT is only a chirp multiplication when B = 0 . The inversion formula corresponding to OLCT is given by
O A 1 [ O A f ] ( t ) = f ( t ) = K R O A [ f ] ( ω ) K A 1 ( ω , t ) d ω ,
where A 1 = D B ; B η D τ C A ; C τ A η and K = e j 2 C D τ 2 2 A D τ η + A B η 2 . The Parseval’s formula is given by
f , g = O A [ f ] ( ω ) , O A [ g ] ( ω ) .
Definition 2. 
For f L 2 ( R ) ,   ψ L 2 ( R ) , and matrix parameter A = A B ; τ C D ; η , the OLCST of f is defined as
O ψ A [ f ] ( a , b ) = R f ( t ) ψ a , b A ( t ) ¯ d t ,
where
ψ a , b A ( t ) = a e j 2 B ( A b 2 + 2 τ b ) ψ ( a ( t b ) ) e j a t j 2 B ( A t 2 + 2 τ t ) .
The Parseval’s identity for OLCST is defined by
R R + O ψ A [ f ] ( a , b ) O ψ A [ g ] ( a , b ) ¯ d b d a a = | C | 2 C Ψ f , g ,
where C Ψ = R + ( O A Ψ ) ω a 2 d a a . The reconstruction formula is given by
f ( t ) = 1 | C | 2 C Ψ R R + O ψ A [ f ] ( a , b ) ψ a , b A ( t ) d b d a a , a . e .

3. Boehmian Space (B-S)

In this part, we revisit the construction of B-S and proceed to establish the B-S B 2 L 2 R 2 , ( D ( R ) , ) , A , Δ 0 . This B-S encompasses the OLCSTs of square-integrable Boehmians.
Consider a semi-group (commutative) ( S , × ) , vector space Γ , and : Γ × S Γ , meeting the subsequent conditions:
(1)
( α + β ) ξ = ( α ξ ) + ( β ξ ) , α , β Γ , and ξ S .
(2)
( c α ) ξ = c ( α ξ ) , c C , α Γ , and ξ S .
(3)
α ( ξ × ζ ) = ( α ξ ) ζ , α Γ , and ξ , ζ S .
(4)
If ξ S and lim n α n α in Γ , then lim n α n ξ α ξ in Γ .
A set of all sequences ξ n originating from S , denoted by Δ , that adhere to the following conditions:
Δ 1
if ξ n , ζ n belongs to Δ , then ξ n × ζ n Δ ;
Δ 2
if lim n α n α in Γ and ξ n Δ , then lim n α n ξ n α in Γ .
All Boehmians are expressed in the form α n / ξ n , where α n Γ and ξ n Δ n N , satisfying the following condition:
α n ξ m = α m ξ n for all m , n N .
The collective set of all Boehmians is denoted as B = B ( Γ , ( S , × ) , , Δ ) . Two Boehmians, α n / ξ n and β n / ζ n in B , are considered equal if
α n ζ m = β m ξ n m , n N .
The space Γ is mapped to a subset of B via the mapping α α ξ n / ξ n , where ξ n Δ is arbitrary. In the sense of B , properties of operation ★ are defined as follows:
  • Addition: α n / ξ n + β n / ζ n = α n ζ n + β n ξ n / ξ n × ζ n ;
  • Scalar Multiplication: c α n / ξ n = c α n / ξ n ;
  • α n / ξ n ξ = α n ξ / ξ n .
Two convergence notions for B-Ss are described as follows.
Definition 3. 
A Boehmian sequence X n is δ-converged to X if ξ k Δ , so that X n ξ k Γ n , k and X ξ k Γ k , and for each k and n that approaches ∞, X n ξ k X ξ k in Γ.
Definition 4. 
A Boehmian sequence X n is Δ-converged to X if ξ n Δ , so that X n X ξ n Γ n , and X n X ξ n 0 as n approaches ∞ in Γ.
The construction of L p -Boehmians, as detailed in [46] for p > 1 , focuses on recalling the definition of Boehmians that are square-integrable. The space BL 2 ( R ) denotes the collection of square integrable Boehmians and can be represented as B ( L 2 ( R ) , ( D ( R ) , A ) , A , Δ 0 ) . This representation arises by considering Γ as L 2 ( R ) . The semi-group (commutative) ( S , × ) is specified as ( D ( R ) , A ) , where D ( R ) denotes the Schwartz space on R . In this context, A denotes the convolution operation functions, and the space is defined by
( f A μ ) ( t ) = e i 2 B ( A t 2 + 2 τ t ) ( f ˜ μ ˜ ) ( t ) ,
where f ˜ ( t ) = e i 2 B ( A t 2 + 2 τ t ) and ∗ is classical convolution.
Therefore,
( f A μ ) ( t ) = e i 2 B ( A t 2 + 2 τ t ) f ( t s ) e i 2 B ( A ( t s ) 2 + 2 τ ( t s ) ) μ ( s ) e i 2 B ( A s 2 + 2 τ s ) d s x R .
Here, ★ denotes the identical convolution operation A , and Δ represents the collection denoted as Δ 0 , encompassing all sequences μ n originating from D ( R ) that adhere to the following properties:
(1)
μ n ( t ) d t = 1 , n N ;
(2)
μ n ( t ) d t M , n N for some M > 0 ;
(3)
For the given ϵ > 0 , m N such that supp μ n ( ϵ , ϵ ) , n m , where supp μ n is the support of μ n .
Subsequently, we formulate the B-S denoted as B L 2 R 2 = B L 2 R 2 , ( D ( R ) , A ) , A , Δ 0 by introducing the operation A and establishing its essential properties through rigorous proof.
Definition 5. 
For Φ L 2 R 2 and μ D ( R ) , define
( Φ A μ ) ( v , u ) = Φ ( v s , u ) μ ( s ) e i s u + i 2 B ( A s 2 + 2 τ s ) d s ( v , u ) R 2 .
Lemma 1. 
If Φ L 2 R 2 and μ D ( R ) , then Φ A μ 2 Φ 2 μ 1 , and hence Φ A μ L 2 R 2 .
Proof. 
For | μ | 1 = 0 , the lemma follows trivially. Therefore, we proceed under the assumption that | μ | 1 0 . By applying Jensen’s property and Fubini’s theorem, we obtain
| Φ A μ | 2 2 | Φ ( v s , u ) μ ( s ) | d s 2 d v d u | u | μ 1 2 | Φ ( v s , u ) | 2 | μ ( s ) | d s μ 1 d v d u | u | ,
Given that | μ ( s ) | d s | μ | 1 forms a probability measure on R , Jensen’s inequality can be applied:
Φ A μ 2 2 μ 1 | μ ( s ) | | Φ ( v s , u ) | 2 d v d u | u | d s = μ 1 2 | Φ | 2 2 .
Hence, it is proven. □
The subsequent lemma directly results from Lemma 1.
Lemma 2. 
If Φ n Φ in L 2 R 2 as n and μ D ( R ) , then Φ n A μ Φ A μ in L 2 R 2 as n .
Lemma 3. 
If Φ , Φ 1 , Φ 2 L 2 R 2 , μ , μ 1 , μ 2 D ( R ) and c C , then
(1)
Φ 1 + Φ 2 A μ = Φ 1 A μ + Φ 2 A μ .
(2)
( c Φ ) A μ = c ( Φ A μ ) .
(3)
Φ A μ 1 A μ 2 = Φ A μ 1 A μ 2 .
Proof. 
Given that the first two identities follow directly, we focus our attention solely on demonstrating the validity of the third identity.
Φ A μ 1 A μ 2 ( v , u ) = Φ ( v s , u ) μ 1 A μ 2 ( s ) e i s u + i 2 B ( A s 2 + 2 τ s ) d s = Φ ( v s , u ) e i 2 B ( A s 2 + 2 τ s ) μ 1 ( s t ) e i 2 B ( A ( s t ) 2 + 2 τ ( s t ) ) μ 2 ( t ) e i 2 B ( A t 2 + 2 τ t ) d t e i s u + i 2 B ( A s 2 + 2 τ s ) d s = Φ ( v s , u ) μ 1 ( s T ) e i 2 B ( A ( s t ) 2 + 2 τ ( s t ) ) e i s u d s μ 2 ( t ) e i 2 B ( A t 2 + 2 τ t ) d t ,
using the change of variable z = s t
Φ A μ 1 A μ 2 ( v , u ) = Φ ( v ( z + t ) , u ) μ 1 ( z ) e i 2 B ( A z 2 + 2 τ z ) e i ( z + t ) u d z μ 2 ( t ) e i 2 B ( A t 2 + 2 τ t ) t = Φ ( ( v t ) z ) , u ) μ 1 ( z ) e i z u + i 2 B ( A z 2 + 2 τ z ) d z μ 2 ( t ) e i t u + i 2 B ( A t 2 + 2 τ t ) d t = Φ A μ 1 ( v t , u ) μ 2 ( t ) e i t u + i 2 B ( A t 2 + 2 τ t ) d t = Φ A μ 1 A μ 2 ( v , u ) for almost all u R .
Hence, Φ A μ 1 A μ 2 = Φ A μ 1 A μ 2 in L 2 R 2 . □
Lemma 4. 
If Φ n Φ in L 2 R 2 as n and μ n Δ 0 , then Φ n A μ n Φ in L 2 R 2 as n .
Proof. 
Applying Lemma 3, we obtain
| Φ n A μ n Φ | 2 | Φ n Φ A μ n | 2 + | Φ A μ n Φ | 2 .
Using Lemma 1 and property (2) of μ n Δ 0 on the right-hand side of (6), we observe that the initial term is bounded by M Φ n Φ 2 , which diminishes as n . Our subsequent objective is to demonstrate the convergence of the second term towards zero.
Let ϵ > 0 . We opt for Ψ C c ( R × ( R \ 0 ) ) , such that | | Φ Ψ | | 2 < ϵ , leveraging the density property of the space C c ( R × ( R \ 0 ) ) , which encompasses all continuous functions with compact support on R 2 , in L 2 ( R × ( R \ 0 ) ) = L 2 R 2 . For any given ( v , u ) R 2 , if we define g ( t ) = Ψ ( v t , u ) e i t u + i 2 B ( A t 2 + 2 τ t ) for all t R 2 , then g C c ( R ) , signifying that g is uniformly continuous on R . Consequently, there exists δ > 0 such that | g ( u ) g ( v ) | < ϵ whenever v , u R and | v u | δ . As supp μ n 0 is as n , we can find N N such that supp μ n is encompassed within the closed ball with the center at the origin and radius δ in R 2 , for all n N . Now, we have the following:
  • If supp Ψ [ p , q ] × K for some < p < q < + and a compact subset K of R \ { 0 } , then Ψ ( v s , u ) = 0 , for every ( v , u ) [ p δ , q + δ ] × K and for every y [ δ , δ ] .
  • From property (2) of μ n Δ 0 , we have μ n 1 M , n N , for M > 0 .
Therefore, by employing Jensen’s property, for n N , we obtain
| Ψ A μ n Ψ | 2 2 = K p δ q + δ Ψ ( v s , u ) e i s u + i 2 B ( A s 2 + 2 τ s ) Ψ ( v , u ) μ n ( s ) d s 2 d v d u | u | = K p δ q + δ [ g ( s ) g ( 0 ) ] μ n ( s ) d s 2 d v d u | u | μ n 1 K p δ q + δ δ δ | g ( s ) g ( 0 ) | 2 μ n ( s ) d s d v d u | u | M 2 ϵ 2 K p δ q + δ d b d a | a | = 1 θ M 2 m ( K ) ( q p + 2 δ ) ϵ 2 ,
Here, θ < 0 = inf a K | a | and m ( K ) represent the Lebesgue measure of K . Utilizing Lemma 1 and the calculated approximation, we obtain
| Φ n A μ n Φ | 2 | Φ Ψ A μ n | 2 + | Ψ A μ n Ψ | 2 + | Ψ Φ | 2 < [ 1 + 1 θ m ( K ) ( q p + 2 δ ) ] M + 1 ϵ .
Thus, the lemma is concluded. □
Theorem 1. 
If a function f L 2 ( R ) and μ D ( R ) , then O ψ A ( f A μ ) = O ψ A f A μ .
Proof. 
Let ( v , u ) R 2 be arbitrary:
O ψ A ( f A μ ) ( v , u ) = a e i 2 B ( A b 2 + 2 τ b ) e i t u + i 2 B ( A t 2 + 2 τ t ) ( f A μ ) ( t ) ψ ( u ( t v ) ) ¯ d t = a e i 2 B ( A b 2 + 2 t b ) e i t u f ( t s ) e i 2 B ( A ( t s ) 2 + 2 τ ( t s ) ) μ ( s ) e i 2 B ( A s 2 + 2 τ s ) d s ψ ( u ( t v ) ) ¯ d t = a e i 2 B ( A b 2 + 2 τ b ) e i t u f ( t s ) e i 2 B ( A ( t s ) 2 + 2 τ ( t s ) ) ψ ( u ( t v ) ) ¯ d t μ ( s ) e i 2 B ( A s 2 + 2 τ s ) d s = a e i 2 B ( A b 2 + 2 τ b ) e i ( z + s ) u f ( z ) e i 2 B ( A z 2 + 2 τ z ) ψ ( u ( z ( v s ) ) ) ¯ d z μ ( s ) e i 2 B ( A s 2 + 2 τ s ) d s = ( O ψ A f ) ( v s , u ) μ ( s ) e i s u e i 2 B ( A s 2 + 2 τ s ) d s = O ψ A f A μ ( v , u ) .
Hence, the theorem follows. □
Definition 6. 
We define the extended Stockwell transform O ψ A : B L 2 ( R ) B L 2 R 2 by
O ψ A f n / μ n = O ψ A f n / μ n , f n / μ n B L 2 ( R ) .
The extension of OLCST onto B L 2 ( R ) is clearly well defined. To elaborate, suppose X = f n / μ n B L 2 ( R ) , and then
f n A μ m = f m A μ n m , n N .
Applying OLCST on both sides, we obtain
O ψ A f n A μ m = O ψ A f m A μ n m , n N ,
and hence ( O ψ A f n ) / ( μ n ) B L 2 R 2 . Furthermore, if f n / μ n = g n / λ n B L 2 ( R ) , then we have
f n A λ m = g m A μ n n , m N .
Using OLCST on both sides once more, we find that
O ψ A f n A λ m = O ψ A g m A μ n m , n N .
This demonstrates that O ψ A X remains unaffected by the choice of representative for X.
Theorem 2. 
The extended OLCST O ψ A : B L 2 ( R ) B L 2 R 2 is consistent with O ψ A : L 2 ( R ) L 2 R 2 .
Proof. 
Consider any arbitrary function f L 2 ( R ) . The Boehmian representing f in B L 2 ( R ) is expressed as [ ( f A μ n ) / ( μ n ) ] , where ( μ n ) Δ 0 is chosen arbitrarily. Consequently,
O ψ A f μ n / μ n = O ψ A f μ n / μ n = O ψ A f A μ n / μ n ,
which is the Boehmian in B L 2 ( R 2 ) , which represents O ψ A f .      □
Theorem 3. 
The extended OLCST O ψ A : B L 2 ( R ) B L 2 R 2 is linear.
Proof. 
The demonstration of the above theorem is obvious. □
Theorem 4. 
The extended OLCST O ψ A : B L 2 ( R ) B L 2 R 2 is one–one.
Proof. 
Let X = f n / μ n , Y = g n / λ n B L 2 ( R ) be such that O ψ A X = O ψ A Y , that is, O ψ A f n / μ n = O ψ A g n / λ n . Therefore, it follows that
O ψ A f n A λ m = O ψ A g m A μ n m , n N ,
and therefore, according to Theorem 1, we obtain
O ψ A f n λ m = O ψ A g m μ n .
Since O ψ A is one–one, we obtain
f n A λ m = g m A μ n .
Thus, X = f n / μ n = g n / λ n = Y . □
Theorem 5. 
The range of the extended OLCST O ψ A : B R 2 B L 2 R 2 is
X B L 2 R 2 : X has a representation Φ n / μ n with Φ n O ψ A L 2 ( R ) n N .
Proof. 
If X O ψ A B R 2 , then f n / μ n B R 2 such that O ψ A f n / μ n = X . It is evident that O ψ A f n / μ n works as an appropriate representation for X. Alternatively, consider Φ n / μ n B L 2 R 2 such that Φ n O ψ A L 2 ( R ) for all n N and f n L 2 ( R ) such that O ψ A f n = Φ n . Our claim is that f n μ n B R 2 . From Φ n / μ n B L 2 R 2 , we derive
Φ n A μ m = Φ m A μ n m , n N .
This implies that
O ψ A f n A μ m = O ψ A f m A μ n m , n N .
Due to the fact that O ψ A : L 2 ( R ) L 2 R 2 is injective, we obtain
f n A μ m = f m A μ n m , n N .
Thus, f n / μ n B R 2 and O ψ A f n / μ n = O ψ A f n / μ n = Φ n / μ n . □
Theorem 6 
(Generalized convolution theorem). If   X B L 2 ( R ) and μ D ( R ) , then O ψ A ( X A μ ) = O ψ A X A μ .
Proof. 
The demonstration that supports this theorem is clearly deduced from Theorem 1. □
Theorem 7. 
The extended OLCST O ψ A : B L 2 ( R ) B L 2 R 2 maintains continuity associated with both δ-convergence and Δ-convergence.
Proof. 
Suppose X n δ X as n in B L 2 ( R ) . Then, μ n Δ 0 so that X n A μ k , X A μ k L 2 ( R ) and X n A μ k X A μ k as n in L 2 ( R ) for each fixed k N . Given the continuity of the OLCST O ψ A : L 2 ( R ) L 2 R 2 , we deduce that
O ψ A X n A μ k O ψ A X A μ k as n in L 2 R 2 ,
for every fixed k N . By employing Theorems 2 and 6, we obtain
O ψ A X n A μ k = O ψ A X n A μ k = O ψ A X n A μ k ,
which tends to
O ψ A X A μ k = O ψ A X A μ k = O ψ A X A μ k ,
as n in L 2 R 2 , for k N . Therefore, O ψ A X n δ O ψ A X as n .
Next, let us assume that X n Δ X as n . Consequently, μ n Δ 0 such that X n X A μ n L 2 ( R ) for all n N , and X n X A μ n converges to 0 as n in L 2 ( R ) . By leveraging Theorems 2, 3 and 6, we have
O ψ A X n O ψ A X A μ n = O ψ A X n X A μ n = O ψ A X n X A μ n n N .
Additionally, utilizing the continuity of O ψ A on L 2 ( R ) , we obtain
O ψ A X n O ψ A X A μ n 0 as n in L 2 R 2 .
This shows that O ψ A X n Δ O ψ A X as n . □

4. Discrete OLCST

The development of discrete OLCST relies on discretizing the parameters a and b. Mathematically, we achieve this by discretizing the continuous parameters a and b in Equation (3) as integral values. To effectively discretize the window functions, we opt for a = a 0 m and b = n b 0 a 0 m , where a 0 and b 0 are constant positive values. This chosen approach results in a well-defined family of discretized window functions. Embracing this methodology not only simplifies the procedure but also enhances the accuracy of our analysis. Therefore, the set of discretized window functions is given as
ψ m , n A ( t ) = a 0 m e j 2 B ( A n 2 b 0 2 a 0 2 m + 2 τ n b 0 a 0 m ) ψ ( a 0 m t n b 0 ) ) e j a 0 m t j 2 B ( A t 2 + 2 τ t ) .
In this context, the parameters m and n play pivotal roles in dilation and translation, respectively. To simplify computations, we can set a 0 = 2 and b 0 = 1 , resulting in a binary dilation of 2 m and a dyadic translation of n 2 m . With these choices, the simplified form of the discretized family (7) is
ψ m , n A ( t ) = 2 m e j 2 B ( A n 2 2 2 m + 2 τ n 2 m ) ψ ( 2 m t n ) ) e j 2 m t j 2 B ( A t 2 + 2 τ t ) .
The precise definition of discrete OLCST is provided as follows.
Definition 7. 
For ψ L 2 ( R ) and f L 2 ( R ) , the discrete OLCST of f is defined by
O ψ A [ f ] ( m , n ) = f , ψ m , n A = f ( t ) ψ m , n A ( t ) ¯ d t , m , n Z ,
where ψ m , n A ( t ) is given by (8).
Now, let us consider an example to illustrate discrete OLCST better.
Example 1. 
Assume the Gaussian function of unit amplitude as f ( x ) = e k x 2 , where k > 0 . The discrete OLCST of f concerning the rectangular function ψ ( x ) with a bounded width T is given by
ψ ( x ) = { 1 , T 2 < x T 2 , 0 , elsewhere .
Using integer translations and dyadic dilations of ψ, we have
ψ ( 2 m x n ) = 1 , 1 2 m n T 2 < x 1 2 m n + T 2 , 0 , elsewhere .
Therefore, the discrete OLCST is computed for f(x) as
O ψ A [ f ] ( m , n ) = 2 m e j 2 B ( A n 2 2 2 m + 2 τ n 2 m ) f ( x ) ψ ( 2 m x n ) ) ¯ e j 2 m x + j 2 B ( A x 2 + 2 τ x ) d x = 2 m e j 2 B ( A n 2 2 2 m + 2 τ n 2 m ) 2 m ( n T 2 ) 2 m ( n + T 2 ) e ( j A 2 B k 2 ) x 2 + ( j τ B j 2 m ) x d x = 2 m e j 2 B ( A n 2 2 2 m + 2 τ n 2 m ) i B e τ 2 m B 2 2 B 2 B k 2 i A π 4 B k 2 2 i A × ( erfi 2 m 3 2 2 A n + 2 m + 1 τ 2 B 4 m i k 2 ( 2 n T ) A T B 2 B k 2 i A erfi 2 m 3 2 2 m + 1 τ + A ( 2 n + T ) 2 B 4 m i k 2 ( 2 n + T ) B 2 B k 2 i A ) .
Here, ‘erfi(·)’ represents the imaginary error function.
After formulating discrete OLCST, our primary objective is to reconstruct the original signal from the transformed one. The inversion process involves working with coefficients in the form of f , ψ m , n A m , n Z . This reconstruction follows two fundamental principles [47]: characterizing random functions from L 2 ( R ) through the sequences from f , ψ m , n A m , n Z , and ensuring this characterization by numerical stability.
It is important to note that functions can be uniquely identified by their coefficients f , ψ m , n A . Specifically, if f , ψ m , n A m , n Z = g , ψ m , n A m , n Z , then f = g . Likewise, if f , ψ m , n A m , n Z = 0 , then f = 0. Achieving this relies on ensuring that whenever f and g are close, the coefficient sequences f , ψ m , n A m , n Z and g , ψ m , n A m , n Z are close. In this context, closeness is defined using the standard l2-norm in the space l 2 ( Z 2 ) . The condition holds for a constant Y > 0 , which is free from f, so that
f , ψ m , n A m , n Z 2 = m Z n Z | f , ψ m , n A | 2 Y f 2 .
The practical interpretation of numerical stability in characterizing functions in L 2 ( R ) through their sequences of coefficients is as follows: when the coefficient sequences of two functions are close in l 2 ( Z 2 ) , it indicates that they are close in L 2 ( R ) . Hence, if m Z n Z | f , ψ m , n A | 2 is lower, then f 2 is also lower. More precisely, there should be a finite constant ϖ < , such that if
m Z n Z | f , ψ m , n A | 2 1 ,
it implies that
f 2 ϖ .
In simpler terms, when the sum of squared coefficients is bounded, it indicates that the norm of the original function is also bounded. This concept ensures stability in the numerical representation of functions in L 2 ( R ) . For f L 2 ( R ) , f ~ = f { m Z n Z | f , ψ m , n A | 2 } 1 2 . Subsequently, we can easily confirm that m Z n Z | f , ψ m , n A | 2 1 , ensuring that f ~ 2 2 ϖ . This indicates that the squared norm of the transformed signal, denoted as f ~ , is bounded by ϖ. Hence,
m Z n Z | f , ψ m , n A | 2 1 f 2 ϖ or X f 2 m Z n Z | f , ψ m , n A | 2 ,
For a certain positive constant X = ϖ 1 > 0 , then the numerical stability of characterizing f L 2 ( R ) in terms of f , ψ m , n A m , n Z is satisfied. This condition stipulates the existence of constants 0 < X Y < , such that
X f 2 m Z n Z | f , ψ m , n A | 2 Y f 2 .
Now, let us introduce the inversion formula for (9).
Theorem 8. 
Consider  ψ L 2 ( R ) , the discrete OLCST of   f ( t ) , as defined by (9). Assuming the stability condition (10), let us define linear operator T as
T ( f ) = m Z n Z f , ψ m , n A ψ m , n A ,
and
f ( t ) = m Z n Z f , ψ m , n A T 1 ( ψ m , n A ) for f L 2 ( R ) .
Proof. 
Condition (10) makes it easy to verify that T is a bounded linear operator with injective properties. This implies that for g = T(f), the following relationship holds:
g , f = m Z n Z f , ψ m , n A ψ m , n A , f Y f 2 .
By employing the Cauchy–Schwarz property, we obtain
X T 1 ( g ) 2 = X T 1 ( T ( f ) ) 2 m Z n Z f , ψ m , n A 2 = g T 1 ( g ) .
Hence,
T 1 ( g ) 1 X g .
Therefore,
f = T 1 T ( f ) = m Z n Z f , ψ m , n A T 1 ( ψ m , n A ) .
The proof of Theorem 8 is now complete. □

5. OLCST for Almost Periodic Functions (APFs)

In this section, we aim to broaden the application scope of OLCST to encompass persistent signals, with a particular emphasis on APFs. APFs, extending the concept of traditional periodic functions to the real line, have been extensively investigated across various mathematical, physical, and engineering disciplines [48,49,50]. Recent research efforts have focused on representing APFs using WFT [51], WT [52], FrFT [53], Gabor transform [54], etc. Now, we will try to extend the OLCST introduced in Equation (2) to the realm of APFs. This extension holds the potential to unveil new insights and enhance our understanding of these persistent signals.
Let the set of trigonometric polynomials (TPs) T P defined on R be given by
T P = f ( t ) = k = 1 N h k e i ω k t : ω k R , h k C , , N N .
where the norm is f = sup t R | f ( t ) | . By completing T P with this norm, we arrive at the space of APFs, denoted as A P . Alternatively, A P can be regarded as the closed subspace of L ( R ) , comprising functions of form e i ω t , where ω R . It is noteworthy that all APFs exhibit uniform continuity and boundedness.
An alternative norm on a set of TPs T P is established as
f A P 2 2 = lim T 1 2 T T T | f ( t ) | 2 d t ,
with inner product relation f , g = lim T 1 2 T T T f ( t ) g ( t ) ¯ d t . The set of TPs T P is characterized by the norm (12), and it is important to note that this space is neither complete nor separable. The Hilbert space A P 2 (where A P serves as a subset of A P 2 ) of Besicovitch APFs is obtained by completing T P with respect to this norm [48]. It is worth emphasizing that all APFs display uniform continuity and boundedness when considered with the aforementioned norm.
Consider the set Q ( R ) of functions q given as
q ( x ) = l = 1 L ω l x α l , x 0 , l = 1 L ω l ( x ) α l , x < 0 .
In this context, L represents a natural number, and ω l ranges over real values for l = 1 , 2 , , L , where α 1 > α 2 > > α L > 0 . Consider a generalized trigonometric polynomial (GTP) on R as P ( x ) = k = 1 N h k e i q k ( x ) , where q k ( x ) Q ( R ) and h k C .
Definition 8. 
For every ϵ > 0 , a function f R possess a robust limit power if there exists a GTP P ϵ , so that
f P ϵ = sup | f ( t ) P ϵ | : t R < ϵ .
The the inner product of collection G ( R ) , possessing a robust limit power, is defined as
f , g G = lim T 1 2 T T T f ( t ) g ( t ) ¯ d t .
Hence, it is evident that A P is a subset of G ( R ) , and the norms f A P 2 and f G are equivalent and both G ( R ) and A P are closed subspaces of L ( R ) [55].
Now, we will explore OLCST (2) in the space of APFs.
Theorem 9. 
If f is an APF, then the OLCST of f concerning   A = A B ; τ C D ; η with A , B 0 emerges as a function with a robust limit power.
Proof. 
Let us initiate the proof by considering the case where f is a TP; that is,
f ( t ) = k = 1 N h k e j ω k t .
The OLCST of f is
O A [ f ( t ) ] ( ξ ) = R f ( t ) K A ( t , ξ ) d t = k = 1 N h k R e j ω k t j 2 π B e j 2 B ( A t 2 + 2 t ( τ ξ ) 2 ξ ( D τ B η ) + D ( ξ 2 + τ 2 ) ) d t = k = 1 N h k j 2 π B e j 2 B { D ( ξ 2 + τ 2 ) 2 ξ ( D τ B η ) } R e j 2 B ( A t 2 + 2 t ( τ ξ ) + 2 B ω k t ) d t = k = 1 N h k j 2 π B e j 2 B { D ( ξ 2 + τ 2 ) 2 ξ ( D τ B η ) } R e A t 2 2 j B + ( j ω k + ( τ ξ ) j B ) t d t .
The integral part adopts the following expression
R e A t 2 2 j B + ( j ω k + ( τ ξ ) j B ) t d t = j 2 π B A e j ( ( ξ τ ) B ω k ) 2 2 A B .
Therefore, we have,
O A [ f ( t ) ] ( ξ ) = k = 1 N h k A e j 2 B { D ( ξ 2 + τ 2 ) 2 ξ ( D τ B η ) } e j ( ( ξ τ ) B ω k ) 2 2 A B = 1 A k = 1 N h k e j ( ( A D ( ξ 2 + τ 2 ) 2 ξ ( D τ B η ) A ) ( ( ξ τ ) B ω k ) 2 ) 2 A B .
This expression represents a GTP in ξ. Moreover, for an APF f, there is a sequence of TPs { f n } such that it uniformly converges to f. Hence, it is enough to show that the limit of f n f tends to 0 as n approaches infinity, and then the limit of O A f n O A f also tends to 0.
We obtain
| O A [ f n ] ( ξ ) O A [ f ] ( ξ ) | 1 j 2 π B R f n ( t ) f ( t ) d t 0 .
Therefore,
O A [ f n ] ( ξ ) O A [ f ] ( ξ ) 0 .
The proof of Theorem 9 is now complete. □
The following theorem shows that the presumption ψ L 1 ( R ) is sufficient to ensure that OLCST represents a function with a robust limit power.
Theorem 10. 
Consider a window function ψ L 1 L 2 ( R ) . Then, for any APF f , the OLCST O ψ A [ f ] ( a , b ) is characterized as a function with a robust limit power in b.
Proof. 
Let f(t) be a TP defined as
f ( t ) = k = 1 N h k e j ω k t .
Therefore, the OLCST of f is
O ψ A [ f ] ( a , b ) = a k = 1 N h k e j 2 B ( A b 2 + 2 τ b ) R ψ ( a ( t b ) ) ¯ e j ( ω k a ) t + j 2 B ( A t 2 + 2 τ t ) d t .
With a ( t b ) = z , we have
O ψ A [ f ] ( a , b ) = e j 2 B ( A b 2 + 2 τ b ) k = 1 N h k R ψ ( z ) ¯ e j ( ω k a ) ( b + z a ) + j 2 B ( A ( b + z a ) 2 + 2 τ ( b + z a ) ) d z = e j 2 B ( A b 2 + 2 τ b ) k = 1 N e j ( ω k a ) b h k R ψ ( z ) ¯ e j ( z ω k a z ) + j 2 B A z 2 a 2 + j B A b z a + j τ z B a d z = e j 2 B ( A b 2 + 2 τ b ) k = 1 N e j ( ω k a ) b h k R ψ ( z ) ¯ e j z + j A z 2 2 B a 2 + j A z 2 2 B + j B τ z × e j 2 B { A z 2 + 2 z ( τ ( B ω k + A b + τ a ) ) 2 ( B ω k + A b + τ a ) ( D τ B η ) + D ( B ω k + A b + τ a ) 2 + D τ 2 } × e j 2 B ( B ω k + A b + τ a ) ( D τ B η ) D ( B ω k + A b + τ a ) 2 D τ 2 d z = j 2 π B k = 1 N h k e j ( ω k a ) b + j 2 B ( B ω k + A b + τ a ) ( D τ B η ) D ( B ω k + A b + τ a ) 2 D τ 2 O A [ Ψ ] B ω k + A b + τ a ¯ ,
and here Ψ ( z ) = ψ ( z ) e j z j A 2 B 1 a 2 + 1 z 2 j τ z B .
Hence, for a fixed a, we infer that the OLCST O A ψ [ f ] ( a , b ) represents a GTP in b. Furthermore, if f is an APF, a sequence of GTPs fn converges uniformly to f. Therefore, it is enough to demonstrate that whenever the limit f n f approaches 0, the limit of O A ψ [ f n ] ( a , b ) O A ψ [ f ] ( a , b ) also tends to 0.
Also,
O ψ A [ f n ] ( a , b ) O ψ A [ f ] ( a , b ) f n f ψ 1 0 .
Hence, we observed that the OLCST O ψ A [ f ] ( a , b ) of an APF f represents a function with a robust limit power in b. □
Now, we will develop a frame decomposition for APFs using OLCST.
Theorem 11. 
For any APF f , invariables C 1 , C 2 > 0 so that
C 1 f A P 2 2 1 2 N + 1 n = N N m = | f , ψ m , n A | 2 C 2 f A P 2 2 .
Proof. 
For TP f ( t ) = k = 1 K h k e j ω k t , we obtain
f , ψ m , n A = k = 1 K 2 m h k R e j 2 B ( A n 2 2 2 m + 2 τ n 2 m ) ψ ( 2 m t n ) ) ¯ e j ( ω k 2 m ) t + j 2 B ( A t 2 + 2 τ t ) d t .
With 2 m t n = z , we have
f , ψ m , n A = k = 1 K h k R ψ ( z ) ¯ e j 2 m ( ω k 2 m ) ( n + z ) + j 2 B ( A ( n + z ) 2 2 2 m + 2 τ ( n + z ) 2 m ) j 2 B ( A n 2 2 2 m + 2 τ n 2 m ) d z = k = 1 K h k e j ω k 2 m 1 n R ψ ( z ) ¯ e j ω k z 2 m j z + j 2 B ( A z 2 2 2 m + 2 A n z 2 2 m ) + j B τ z 2 m d z = k = 1 K h k e j ω k 2 m 1 n R ψ ( z ) ¯ e j z + j 2 B A z 2 2 2 m + 2 A n z 2 2 m + 2 τ z 2 m + A z 2 + 2 τ z × e j 2 B { A z 2 + 2 z ( τ B ω k 2 m ) 2 B ω k 2 m ( D τ B η ) + D B ω k 2 m 2 + D τ 2 } e j 2 B B ω k 2 m ( D τ B η ) D B ω k 2 m 2 D τ 2 d z = k = 1 K h k e j ω k 2 m 1 n + j D 2 B B ω k 2 m 2 + τ 2 j ω k 2 m ( D τ B η ) R ψ ( z ) ¯ e j z + j 2 B A z 2 2 2 m + 2 A n z 2 2 m + 2 τ z 2 m + A z 2 + 2 τ z K A ( z , B ω k 2 m ) ¯ d z = k = 1 K h k e j ω k 2 m 1 n + j D 2 B B ω k 2 m 2 + τ 2 j ω k 2 m ( D τ B η ) O A [ Ψ ] B ω k 2 m ¯ ,
where Ψ ( z ) = ψ ( z ) e j z j 2 B A z 2 2 2 m + 2 A n z 2 2 m + 2 τ z 2 m + A z 2 + 2 τ z .
Moreover, we observe that
1 2 N + 1 n = N N m = f , ψ m , n A 2 = | 2 π B | 2 N + 1 n = N N m = k = 1 K l = 1 K h k h l ¯ e j 2 m ( ω k ω l ) n + j D 2 B B 2 m 2 ( ω k 2 ω l 2 ) j ( ω k ω l ) 2 m ( D τ B η ) O A [ Ψ ] B ω k 2 m ¯ O A [ Ψ ] B ω l 2 m .
As N , Equation (14) simplifies to
1 2 N + 1 n = N N m = | f , ψ m , n A | 2 = | 2 π B | k = 1 K | h k | 2 m = O A [ Ψ ] B ω k 2 m 2 + Rest ( f ) ,
Rest ( f ) = h k h l ¯ Δ ( ω k , ω l ) , and the summation includes all pairs k , l , where ω k ω l is a non-zero multiplication of 2 m and
Δ ( ω k , ω l ) = m = O A [ Ψ ] B ω k 2 m ¯ O A [ Ψ ] B ω l 2 m e j D 2 B B 2 m 2 ( ω k 2 ω l 2 ) j ( ω k ω l ) 2 m ( D τ B η ) .
Now, for Rest (f), we apply the Cauchy–Schwarz property:
| Rest ( f ) | = ω R s Z { 0 } h ω h ω + s 2 m ¯ m = O A [ Ψ ] B ω 2 m ¯ O A [ Ψ ] B ω 2 m + B s e j D B s 2 2 ω 2 m + s e j s ( D τ B η ) s Z { 0 } m = ω R | h ω | 2 O A [ Ψ ] B ω 2 m O A [ Ψ ] B ω 2 m + B s 1 2 × m = ω R | h ω + s 2 m | 2 O A [ Ψ ] B ω 2 m O A [ Ψ ] B ω 2 m + B s 1 2 ω R | h ω | 2 s Z { 0 } Γ ( s ) Γ ( s ) 1 2 ,
where Γ ( s ) = ω R m = O A [ Ψ ] B ω 2 m O A [ Ψ ] B ω 2 m + B s .
Similar to the assumptions formulated by Daubechies [47] when establishing wavelet frames within L 2 ( R ) , we will embrace the same hypothesis, that
C 1 = inf ω R m = O A [ Ψ ] B ω 2 m 2 s Z { 0 } Γ ( s ) Γ ( s ) 1 2 > 0 , C 2 = sup ω R m = O A [ Ψ ] B ω 2 m 2 + s Z { 0 } Γ ( s ) Γ ( s ) 1 2 < ,
This gives rise to the inequality (13), which is applicable to TPs. Through the use of a standard approximation argument, we can infer that the same conclusion holds for APFs. □

6. Potential Application

Let L p ( R ) be the space of complex-valued Lebesgue integrable functions on real-line R and δ be the delta sequence. Then, the equivalence class of the quotients is called the integrable Boehmian, the space of which is denoted by B L 2 ( R ) . One may refer to Mikusinski [56], where Fourier transform for integrable Boehmians is investigated. By using the relation between OLCT and OLCST, one can define and find OLCST for integrable Boehmians.
This OLCST model features a greater number of free parameters than the existing FrST [27,57] and LCST [33,34] models. This increased flexibility enables the OLCST to outperform in the time–frequency analysis of chirp signals. The enhanced performance is demonstrated through the high-resolution spectrum achieved by the transform, the effective detection of disturbed chirp signals, and the representation of the linear frequency modulation (LFM) signal. The LFM signal is a critical non-stationary signal widely used in information systems such as sonar, radar, and communications. Moreover, OLCST can provide an optimal time–frequency distribution with a high time–frequency concentration.

7. Conclusions

In conclusion, this article has employed the convolution theorem to establish a B-S encompassing the OLCST of all square-integrable Boehmians. Through rigorous proof, we have demonstrated that the extended OLCST on square-integrable Boehmians is consistent with the traditional OLCST. Moreover, we have established key properties, affirming linearity, injectiveness, and continuity concerning both δ-convergence and Δ-convergence. This study contributes to the understanding of extended OLCST, providing a foundation for further exploration and applications in the realm of B-Ss. Also, we have introduced a discrete iteration of the OLCST. Furthermore, the breadth of our proposed work is expanded as we delve into the study of the OLCST within the domain of APFs. This extension underscores the versatility and applicability of the proposed methodology, offering valuable insights into its potential applications across various domains. The effectiveness and performance of the proposed transform can be further evaluated through simulation analyses of OLCST in future research.

Author Contributions

Conceptualization, N.K. and B.G.; Methodology, N.K. and B.G.; Validation, A.K.V.; Investigation, R.P.A.; Resources, A.K.V. and R.P.A.; Writing—original draft, N.K.; Writing—review & editing, B.G., A.K.V. and R.P.A.; Supervision, A.K.V. and R.P.A.; Project administration, A.K.V. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially funded by the Council of Scientific and Industrial Research (CSIR) (File No. 09/1023(0035)/2020-EMR-I) and DST SERB (File No. MTR/2021/000907), New Delhi, India.

Data Availability Statement

The data used to support the findings of this study are included within the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Abe, S.; Sheridan, J.T. Optical operations on wave functions as the Abelian subgroups of the special affine Fourier transformation. Opt. Lett. 1994, 19, 1801–1803. [Google Scholar] [CrossRef] [PubMed]
  2. Stern, A. Sampling of compact signals in offset linear canonical transform domains. Signal Image Video Process. 2007, 1, 359–367. [Google Scholar] [CrossRef]
  3. Xiang, Q.; Qin, K.Y.; Huang, Q.Z. Multichannel sampling of signals band-limited in offset linear canonical transform domains. Circuits Syst. Signal Process. 2013, 32, 2385–2406. [Google Scholar] [CrossRef]
  4. Zhi, X.; Wei, D.; Zhang, W. A generalized convolution theorem for the special affine Fourier transform and its application to filtering. Optik 2016, 127, 2613–2616. [Google Scholar] [CrossRef]
  5. Moshinsky, M.; Quesne, C. Linear canonical transformations and their unitary representations. J. Math. Phys. 1971, 12, 1772–1780. [Google Scholar] [CrossRef]
  6. Shi, J.; Liu, X.; Sha, X.; Zhang, N. Sampling and reconstruction of signals in function spaces associated with the linear canonical transform. IEEE Trans. Signal Process. 2012, 60, 6041–6047. [Google Scholar]
  7. Stern, A. Sampling of linear canonical transformed signals. Signal Process. 2006, 86, 1421–1425. [Google Scholar] [CrossRef]
  8. Tao, R.; Li, B.Z.; Wang, Y.; Aggrey, G.K. On sampling of band-limited signals associated with the linear canonical transform. IEEE Trans. Signal Process. 2008, 56, 5454–5464. [Google Scholar]
  9. Shi, J.; Liu, X.; Zhang, N. Generalized convolution and product theorems associated with linear canonical transform. Signal Image Video Process. 2014, 8, 967–974. [Google Scholar] [CrossRef]
  10. Deng, B.; Tao, R.; Wang, Y. Convolution theorems for the linear canonical transform and their applications. Sci. China Ser. Inf. Sci. 2006, 49, 592–603. [Google Scholar] [CrossRef]
  11. Stern, A. Uncertainty principles in linear canonical transform domains and some of their implications in optics. JOSA A 2008, 25, 647–652. [Google Scholar] [CrossRef]
  12. Xiang, Q.; Qin, K.Y. The linear canonical transform and its application to time-frequency signal analysis. In Proceedings of the 2009 International Conference on Information Engineering and Computer Science, Wuhan, China, 19–20 December 2009; IEEE: Piscataway, NJ, USA, 2009; pp. 1–4. [Google Scholar]
  13. Bracewell, R.; Kahn, P.B. The Fourier transform and its applications. Am. J. Phys. 1966, 34, 712. [Google Scholar] [CrossRef]
  14. Bracewell, R.N. The Fourier transform. Sci. Am. 1989, 260, 86–95. [Google Scholar] [CrossRef]
  15. Almeida, L.B. The fractional Fourier transform and time-frequency representations. IEEE Trans. Signal Process. 1994, 42, 3084–3091. [Google Scholar] [CrossRef]
  16. Tao, R.; Li, Y.L.; Wang, Y. Short-time fractional Fourier transform and its applications. IEEE Trans. Signal Process. 2009, 58, 2568–2580. [Google Scholar] [CrossRef]
  17. Verma, A.K.; Gupta, B. A note on continuous fractional wavelet transform in Rn. Int. J. Wavelets Multiresolution Inf. Process. 2022, 20, 2150050. [Google Scholar] [CrossRef]
  18. James, D.F.; Agarwal, G.S. The generalized Fresnel transform and its application to optics. Opt. Commun. 1996, 126, 207–212. [Google Scholar] [CrossRef]
  19. Pei, S.C.; Ding, J.J. Eigenfunctions of the offset Fourier, fractional Fourier, and linear canonical transforms. JOSA A 2003, 20, 522–532. [Google Scholar] [CrossRef] [PubMed]
  20. Ding, J.J.; Pei, S.C. Linear canonical transform. In Advances in Imaging and Electron Physics; Elsevier: Amsterdam, The Netherlands, 2014; Volume 186, pp. 39–99. [Google Scholar]
  21. Xiang, Q.; Qin, K. Convolution, correlation, and sampling theorems for the offset linear canonical transform. Signal Image Video Process. 2014, 8, 433–442. [Google Scholar] [CrossRef]
  22. Rioul, O.; Vetterli, M. Wavelets and signal processing. IEEE Signal Process. Mag. 1991, 8, 14–38. [Google Scholar] [CrossRef]
  23. Kaur, N.; Gupta, B.; Verma, A.K. Multidimensional fractional wavelet transforms and uncertainty principles. J. Comput. Appl. Math. 2023, 430, 115250. [Google Scholar] [CrossRef]
  24. Gupta, B.; Verma, A.K.; Cattani, C. A New Class of Linear Canonical Wavelet Transform. J. Appl. Comput. Mech. 2024, 10, 64–79. [Google Scholar]
  25. Stockwell, R.G.; Mansinha, L.; Lowe, R. Localization of the complex spectrum: The S transform. IEEE Trans. Signal Process. 1996, 44, 998–1001. [Google Scholar] [CrossRef]
  26. Stockwell, R.G. A basis for efficient representation of the S-transform. Digit. Signal Process. 2007, 17, 371–393. [Google Scholar] [CrossRef]
  27. Wei, D.; Zhang, Y. Fractional Stockwell transform: Theory and applications. Digit. Signal Process. 2021, 115, 103090. [Google Scholar] [CrossRef]
  28. Xu, D.P.; Guo, K. Fractional S transform—Part 1: Theory. Appl. Geophys. 2012, 9, 73–79. [Google Scholar] [CrossRef]
  29. Du, Z.C.; Xu, D.P.; Zhang, J.M. Fractional S-transform—Part 2: Application to reservoir prediction and fluid identification. Appl. Geophys. 2016, 13, 343–352. [Google Scholar] [CrossRef]
  30. Kamalakkannan, R.; Roopkumar, R. Two-dimensional fractional Stockwell transform. Circuits Syst. Signal Process. 2022, 41, 1735–1750. [Google Scholar] [CrossRef]
  31. Ranjan, R.; Jindal, N.; Singh, A.K. Fractional S-transform and its properties: A comprehensive survey. Wirel. Pers. Commun. 2020, 113, 2519–2541. [Google Scholar] [CrossRef]
  32. Gupta, B.; Verma, A.K. Linear canonical Stockwell transform and the associated multiresolution analysis. Math. Methods Appl. Sci. 2024. [Google Scholar] [CrossRef]
  33. Wei, D.; Zhang, Y.; Li, Y.M. Linear canonical Stockwell transform: Theory and applications. IEEE Trans. Signal Process. 2022, 70, 1333–1347. [Google Scholar] [CrossRef]
  34. Shah, F.A.; Tantary, A.Y. Linear canonical Stockwell transform. J. Math. Anal. Appl. 2020, 484, 123673. [Google Scholar] [CrossRef]
  35. Mejjaoli, H. Dunkl–Stockwell transform and its applications to the time–frequency analysis. J. Pseudo Differ. Oper. Appl. 2021, 12, 32. [Google Scholar] [CrossRef]
  36. Srivastava, H.; Shah, F.A.; Tantary, A.Y. A family of convolution-based generalized Stockwell transforms. J. Pseudo Differ. Oper. Appl. 2020, 11, 1505–1536. [Google Scholar] [CrossRef]
  37. Mikusinski, J. Quotients de suites et leurs applications dans l’analyse fonctionelle. CR Acad. Sci. Paris 1981, 293, 463–464. [Google Scholar]
  38. Mikusinski, P. Convergence of Boehmians. Jpn. J. Math. New Ser. 1983, 9, 159–179. [Google Scholar] [CrossRef]
  39. Atanasiu, D.; Mikusiński, P. On the Fourier transform, Boehmians, and distributions. In Colloquium Mathematicum; Instytut Matematyczny Polskiej Akademii Nauk: Warszawa, Poland, 2007; Volume 108, pp. 263–276. [Google Scholar]
  40. Betancor, J.; Linares, M.; Méndez, J. The Hankel transform of integrable Boehmians. Appl. Anal. 1995, 58, 367–382. [Google Scholar] [CrossRef]
  41. Betancor, J.; Linares, M.; Mendez, J.M.R. Ultraspherical transform of summable Boehmians. Math. Jpn. 1996, 44, 81–88. [Google Scholar]
  42. Burzyk, J.; Mikusiński, P.; Nemzer, D. Remarks on topological properties of Boehmians. Rocky Mt. J. Math. 2005, 35, 727–740. [Google Scholar] [CrossRef]
  43. Dill, E.R.; Mikusiński, P. Strong boehmians. Proc. Am. Math. Soc. 1993, 119, 885–888. [Google Scholar] [CrossRef]
  44. Roopkumar, R. Wavelet analysis on a Boehmian space. Int. J. Math. Math. Sci. 2003, 2003, 917–926. [Google Scholar] [CrossRef]
  45. Nemzer, D. A uniqueness theorem for Boehmians of analytic type. Int. J. Math. Math. Sci. 2000, 24, 501–504. [Google Scholar] [CrossRef]
  46. Karunakaran, V.; Kalpakam, N. Hilbert transform for Boehmians. Integral Transform. Spec. Funct. 2000, 9, 19–36. [Google Scholar] [CrossRef]
  47. Daubechies, I. Ten Lectures on Wavelets; SIAM: Philadelphia, PA, USA, 1992. [Google Scholar]
  48. Besicovitch, A.S.; Besicovitch, A.S. Almost Periodic Functions; AMS Chelsea Publishing: New York, NY, USA, 1954; Volume 4. [Google Scholar]
  49. Corduneanu, C.; Gheorghiu, N.; Barbu, V. Almost Periodic Functions; Interscience: Woburn, MA, USA, 1968. [Google Scholar]
  50. Mäkilä, P.; Partington, J.; Norlander, T. Bounded power signal spaces for robust control and modeling. SIAM J. Control. Optim. 1998, 37, 92–117. [Google Scholar] [CrossRef]
  51. Partington, J.R.; Ünalmış, B. On the windowed Fourier transform and wavelet transform of almost periodic functions. Appl. Comput. Harmon. Anal. 2001, 10, 45–60. [Google Scholar] [CrossRef]
  52. Galindo, F. Some remarks on “On the windowed Fourier transform and wavelet transform of almost periodic functions,” by JR Partington and B. Ünalmış. Appl. Comput. Harmon. Anal. 2004, 16, 174–181. [Google Scholar] [CrossRef]
  53. Uzun, B.Ü. On the fractional Fourier and continuous fractional wave packet transforms of almost periodic functions. J. Inequalities Appl. 2017, 2017, 126. [Google Scholar] [CrossRef] [PubMed]
  54. Boggiatto, P.; Fernández, C.; Galbis, A. Gabor systems and almost periodic functions. Appl. Comput. Harmon. Anal. 2017, 42, 65–87. [Google Scholar] [CrossRef]
  55. Zhang, C.; Meng, C. C/sup*/-algebra of strong limit power functions. IEEE Trans. Autom. Control 2006, 51, 828–831. [Google Scholar] [CrossRef]
  56. Mikusinski, P. Fourier transform for integrable Boehmians. Rocky Mt. J. Math. 1987, 17, 577–582. [Google Scholar] [CrossRef]
  57. Wei, D.; Shen, J. Multi-spectra synchrosqueezing transform. Signal Process. 2023, 207, 108940. [Google Scholar] [CrossRef]
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

Kaur, N.; Gupta, B.; Verma, A.K.; Agarwal, R.P. Offset Linear Canonical Stockwell Transform for Boehmians. Mathematics 2024, 12, 2379. https://doi.org/10.3390/math12152379

AMA Style

Kaur N, Gupta B, Verma AK, Agarwal RP. Offset Linear Canonical Stockwell Transform for Boehmians. Mathematics. 2024; 12(15):2379. https://doi.org/10.3390/math12152379

Chicago/Turabian Style

Kaur, Navneet, Bivek Gupta, Amit K. Verma, and Ravi P. Agarwal. 2024. "Offset Linear Canonical Stockwell Transform for Boehmians" Mathematics 12, no. 15: 2379. https://doi.org/10.3390/math12152379

APA Style

Kaur, N., Gupta, B., Verma, A. K., & Agarwal, R. P. (2024). Offset Linear Canonical Stockwell Transform for Boehmians. Mathematics, 12(15), 2379. https://doi.org/10.3390/math12152379

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