Abstract
The offset fractional Fourier transform (OFrFT) has emerged as a mathematical tool for time-frequency analysis of non-stationary signals. However, there has been relatively little research on investigating properties including the convolution theorem and the sampling formulas. This paper investigates the new form of convolution theorem and its product theorem associated with the OFrFT. We also establish a sampling formula related to the transformation. Finally, a simple example is displayed to verify the results related to the sampling formula for the OFrFT.
1. Introduction
It is well known that convolution is a fundamental concept in the theory of linear time-invariant (LTI) systems [1]. The convolution of an input signal with the impulse response of an LTI system produces the system output. The impulse response characterizes the system’s behavior, and convolution incorporates this behavior into the input signal to generate the output. In addition to this, convolution is closely related to the classical Fourier transform (FT) through the convolution theorem, which states that the FT of a convolution of two signals equals the product of their FTs. Building on this relationship, many authors have developed the convolution theorem in different types of transformations. For instance, in [2,3], the authors explored the convolution theorem for the fractional Fourier transform (FrFT). As is known, the offset fractional Fourier transform (OFrFT) is a general version of the FrFT, so the properties of the OFrFT are an extension of the corresponding properties of the FrFT [4,5,6,7,8,9,10,11,12,13]. Especially, the authors of [14] presented a convolution theorem for the OFrFT, which involves the multiplication of their OFrFT and a phase factor. The form of this convolution theorem contains an additional extra chirp factor and is not exactly similar to the convolution theorem for the FT. Compared to the convolution theorem proposed in [14], our result discussed in this work is simpler and closer to the convolution theorem related to the FT in the existing literature [15]. Additionally, the product theorem related to the proposed convolution definition is also established in detail.
On the other hand, the theory of the sampling formula associated with the FT was studied by the author in [16] and its application to time-varying systems was also demonstrated in [17]. A variant of the sampling formula is a generalized exponential sampling operator, which was recently studied by the authors of [18,19,20]. Further, the sampling formula for the FT was expanded in the framework of the FrFT [21,22,23]. As a non-trivial generalization of the FrFT, there is an inevitable desire to expand the sampling formula to the OFrFT domains. Therefore, the present research also aims to investigate the sampling formula related to this transformation, which has not appeared in the literature so far.
The organization of the work is as follows. In Section 2, we recall some essential facts on the FrFT, the OFrFT, and their basic properties. Section 3 focuses on discussing the fundamental properties of OFrFT that have not been studied in the existing literature. These properties will be very useful in solving partial differential equations in the OFrFT setting. Section 4 is devoted to the derivation of convolution and its product theorems concerning the OFrFT. The derivation of the sampling formula associated with the OFrFT is discussed in Section 5. Additionally, we include a simple example illustration related to the sampling formula. The paper ends with the conclusion in Section 6.
2. Preliminaries
In this part, we provide a brief review on some results that will be useful in the next section. We begin by introducing the following notations:
Definition 1.
For , the space of measurable functions f defined on denoted by , such that
Especially, for , we get
The usual inner product of is then defined as
where overline means the conjugation.
In the following, we recall the definition of the fractional Fourier transform (FrFT) and its inverse, see, e.g., [2,3,24].
Definition 2.
The FrFT of any function f belongs to with the real parameter β defined by
where the kernel is
and
We describe the basic properties of the kernel :
and
where is Dirac’s delta.
Definition 3.
Assume that any function f and its FrFT are in . The inversion formula for the FrFT is calculated by
The direct interaction between the FrFT and the FT is
for which
Here, the definition of the Fourier transform (FT) for signal f in is described by (see [15,25,26,27])
and its inverse is
The subsequent definition refers to the OFrFT [14] mentioned earlier, which may be interpreted as a natural expansion of the FrFT.
Definition 4.
The definition of the OFrFT for function f belonging to is expressed as
where
Here, the parameters are real numbers.
It is straightforward to verify that when in Equation (14), we obtain the definition of the FrFT (4).
The next lemma describes the natural relation between the OFrFT and the FT, which is central in deriving the upcoming results related to the proposed OFrFT.
Lemma 1.
For every function f belonging to , the following relation is satisfied:
where
Next, one can easily generate the original function f in terms of its by utilizing the following definition.
Definition 5.
For any function f and its OFrFT belonging to , the inverse of the OFrFT is expressed as
The Parseval’s identity related to the OFrFT defined by (14) is expressed in the following form:
Theorem 1.
Any two functions are related to their OFrFT via Parseval’s identity as
In particular,
Some key properties of the OFrFT compared to the FrFT were studied by the authors in [28].
3. Fundamental Properties for the OFrFT
In [28], the authors derived some properties of the OFrFT, such as shifting, modulation, and uncertainty principles. Now, let us establish the OFrFT of the nth derivative, for which the result was not published in [28].
Theorem 2.
Suppose that is continuous n-times differentiable, and if we assume that
then
Proof.
For , we have
This equation is equal to
After simplification, we get
Therefore,
Assume that Equation (23) is true for , namely,
It follows that
which finishes the proof. □
We collect the observations regarding Theorem 2 in the remark:
Remark 1.
- For and , we get
- Selecting results in
which is the FrFT of the nth derivative.
Next, we obtain the result.
Theorem 3.
Let be the kernel of the OFrFT. We denote by the following:
then for , we have
- (i)
- .
- (ii)
Here, .
4. Convolution and Product Theorems for OFrFT
In [14], the authors proposed the convolution definition pertaining to the OFrFT of two signals of the form
Here, ★ is the classical convolution and and , respectively. With this definition, they then established the convolution theorem in the form
Due to Equation (36), it is straightforward to see that their convolution involves the multiplication of their OFrFT and a phase factor.
In this part, we establish two types of convolution theorems for the OFrFT, which are quite different from those proposed [14]. We will see that the convolution theorems are a simple multiplication of the OFrFT and the FT. For this aim, we first introduce the following definition:
Definition 6.
The convolution operation of two functions in the OFrFT domain is defined by
With Definition 6, this leads to the following theorem:
Theorem 4.
Suppose that , then the OFrFT of the convolution of f and g is given by
Proof.
Remark 2.
In Theorem 4, it can easily be seen that the proposed convolution theorem is the product of the OFrFT and the FT. This form is closer to the convolution theorem for the FT.
The alternative structure of the convolution operation and its theorem is demonstrated as below.
Definition 7.
Let two functions . The convolution of f and g in the OFrFT domain is defined by
Here, and * is the classical convolution operation.
This definition gives the next result.
Theorem 5.
For any functions , then
Proof.
Remark 3.
It is easy to see that there is a slight difference between Theorems 4 and 5.
Based on Definition 7, we obtain the product theorem associated with the OFrFT, as expressed below.
Theorem 6.
Let , then one gets
where
5. Sampling Formula
The authors of [22,23] discussed the sampling formula for the FrFT and then our work [11] utilized this formula to solve the generalized heat equations. This part will construct a generalization of the sampling formula in the context of the OFrFT. To achieve this, we first recall a class of functions whose OFrFT is zero outside a finite interval . These functions are often referred to as band-limited . In this case, a positive number is called a bandwidth of the function. Now, let us begin by introducing the following important definition:
Definition 8.
We call signal the band-limited σ for the OFrFT, if there is a positive number σ satisfying for every .
As an immediate consequence of the above definition, we get the following important result:
Theorem 7.
Suppose that is band-limited by σ concerning the OFrFT such that
then f has the following expansion:
Proof.
According to Equations (14) and (47), we obtain
On the other hand, we have
Setting to in Equation (50), it is easily seen that
Relation (51) can be rewritten in the form
Multiplying both sides of Equation (52) by produces
Inserting (16) into the left-hand side of Equation (53), we immediately obtain
Further, substituting (54) into (49), we infer that
Relation (55) may be expressed as
which finishes the proof. □
Remark 4.
which is known as the sampling formula for the FrFT.
- For and , we get
which is known as the Shannon–Whittaker sampling theorem [27].
The next result is the following:
Theorem 8.
Under the assumption as in Theorem 7, we have
Proof.
Let us now illustrate the utility of Theorem 7 above by providing the following example:
Example 1.
Consider a function defined by
Figure 1 and Figure 2 demonstrate the comparison of in Equation (69) using the partial series with sampling Formula (70).
Figure 1.
Graph of in Equation (69) (a) for (b) for , .
Figure 2.
Graph of in Equation (70) (a) for (b) for , .
6. Conclusions
In this work, we introduced the OFrFT and investigated its fundamental properties, which have not appeared in the existing literature to date. The convolution and product theorems related to this transform were constructed. A sampling formula involving the OFrFT was established. Lastly, we verified the sampling formula for the OFrFT by providing a simple example.
Author Contributions
Conceptualization, M.B.; Formal analysis, M.B. and S.A.A.K.; Funding acquisition, M.R.; Investigation, M.R. and M.Z.; Methodology, S.A.A.K.; Resources, M.Z. and N.B.; Validation, writing—original draft, N.B., B.A.S. and M.Z.; Writing—review and editing, M.B. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Data are contained within the article.
Conflicts of Interest
The authors declare no conflicts of interest.
References
- Dalal, M.; Sandoval, S. Vector Signals and Invariant Systems: Re-Tooling Linear Systems Theory. Signals 2025, 6, 28. [Google Scholar] [CrossRef] [Scilit]
- Wei, D.Y. Novel Convolution and Correlation Theorems for the Fractional Fourier Transform. Optik 2016, 127, 3669–3675. [Google Scholar] [CrossRef] [Scilit]
- Shi, J.; Sha, X.; Song, X.; Zhang, N. Generalized Convolution Theorem Associated with Fractional Fourier Transform. Wirel. Commun. Mob. Comput. 2014, 14, 1340–1351. [Google Scholar]
- Tao, R.; Zhang, F.; Wang, Y. Sampling Random Signals in a Fractional Fourier Domain. Signal Process. 2011, 91, 1394–1400. [Google Scholar] [CrossRef] [Scilit]
- Ozaktas, H.M.; Zalevsky, Z.; Kutay, M.A. The Fractional Fourier Transform with Applications in Optics and Signal Processing; Wiley: New York, NY, USA, 2001. [Google Scholar]
- Bahri, M.; Karim, S.A.A. Fractional Fourier Transform: Main Properties and Inequalities. Mathematics 2023, 11, 1234. [Google Scholar] [CrossRef] [Scilit]
- Li, B.Z.; Xu, T.Z. Parseval Relationship of Samples in the Fractional Fourier Transform Domain. J. Appl. Math. 2012, 2012, 428142. [Google Scholar] [CrossRef] [Scilit]
- Shi, J.; Liu, X.; Zhang, N. On Uncertainty Principle for Signal Concentrations with Fractional Fourier Transform. Signal Process. 2012, 92, 2830–2836. [Google Scholar] [CrossRef] [Scilit]
- Almeida, L.B. The Fractional Fourier Transform and Time-Frequency Representations. IEEE Trans. Signal Process. 1994, 42, 3084–3091. [Google Scholar] [CrossRef] [Scilit]
- Zayed, Z.I. A Convolution and Product Theorem for the Fractional Fourier Transform. IEEE Signal Process. Lett. 1998, 5, 101–103. [Google Scholar] [CrossRef] [Scilit]
- Sulasteri, S.; Bahri, M.; Bachtiar, N.; Kusuma, J.; Ribal, A. Solving Generalized Heat and Generalized Laplace Equations Using Fractional Fourier transform. Fractal Fract. 2023, 7, 557. [Google Scholar] [CrossRef] [Scilit]
- Narayanana, V.A.; Prabhub, K.M.M. The Fractional Fourier Transform: Theory, Implementation and Error Analysis. Microprocess. Microsyst. 2003, 27, 511–521. [Google Scholar] [CrossRef] [Scilit]
- Namias, V. The Fractional Order Fourier Transform and its Application to Quantum Mechanics. IMA J. Appl. Math. 1980, 25, 241–265. [Google Scholar] [CrossRef] [Scilit]
- Goel, N.; Singh, K. Convolution and Correlation Theorems for the Offset Fractional Fourier Transform and its Application. AEU-Int. J. Electron. Commun. 2016, 70, 138–150. [Google Scholar] [CrossRef] [Scilit]
- Debnath, L.; Shah, F.A. Wavelet Transform and Their Basic Properties; Birkhauser: Boston, MA, USA, 2015. [Google Scholar]
- Campbell, L.L. Sampling Theorem for the Fourier transform of a Distribution with Bounded Support. SIAM J. Appl. Math. 1968, 16, 626–636. [Google Scholar] [CrossRef] [Scilit]
- Jerri, A.J. Application of the Sampling Theorem to Time-Varying Systems. J. Frank. Inst. 1972, 293, 53–58. [Google Scholar] [CrossRef] [Scilit]
- Acar, T.; Draganov, B.R.; Kursun, S. Saturation Class of Generalized Exponential Sampling Operators. Mediterr. J. Math. 2025, 22, 71. [Google Scholar] [CrossRef] [Scilit]
- Costarelli, D.; Piconi, M.; Vinti, G. On the Regularization by Durrmeyer-Sampling Type Operators in Lp-Spaces via a Distributional Approach. J. Fourier Anal. Appl. 2025, 31, 11. [Google Scholar] [CrossRef] [Scilit]
- Gupta, V.; Sharma, V. Kantorovich-Type Sampling Operators and Approximation. Math. Methods Appl. Sci. 2025, 48, 14488–14504. [Google Scholar] [CrossRef] [Scilit]
- Zhao, H.; Li, B.Z. Unlimited Sampling Theorem Based on Fractional Fourier Transform. Fractal Fract. 2023, 7, 338. [Google Scholar] [CrossRef] [Scilit]
- Zayed, A.I. Sampling Theorem for Two Dimensional Fractional Fourier Transform. Signal Process. 2021, 181, 107902. [Google Scholar] [CrossRef] [Scilit]
- Zayed, A.I.; García, A.G. New Sampling Formulae for the Fractional Fourier Transform. Signal Process. 1999, 77, 111–114. [Google Scholar] [CrossRef] [Scilit]
- Li, Z.; Zhou, X.; Wang, Y.; Huang, G.; Liu, S.; Gao, B.; Liu, Z. Flexible and Universal Autofocus Based on Amplitude Difference of Fractional Fourier Transform. Opt. Lasers Eng. 2024, 175, 107991. [Google Scholar] [CrossRef] [Scilit]
- Gröchenig, K. Foundation of Time-Frequency Analysis; Birkhäuser: Boston, MA, USA, 2001. [Google Scholar]
- Bracewell, R. The Fourier Transform and Its Applications; McGraw Hill: Boston, MA, USA, 2000. [Google Scholar]
- Bogges, A.; Narcowich, F.J. A First Course in Wavelets with Fourier Analysis, 2nd ed.; John Wiley & Sons: Hoboken, NJ, USA, 2011. [Google Scholar]
- Bahri, M.; Nabila, A.; Bachtiar, N.; Zakir, M. A Comparative Study on Properties and Uncertainty Principles of Fractional Fourier Transform and Offset Fractional Fourier Transform. Results Appl. Math. 2025, 27, 100616. [Google Scholar] [CrossRef] [Scilit]
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. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.

