1. Introduction
The classical Fourier transform (FT) is one of the most influential tools in signal processing. With the development of signal processing theory, some researchers realized that the fractional Fourier transform (FRFT) is well suited to processing complicated signals. It can reflect the information of signals in both the time domain and the frequency domain. Therefore, it can deal with time-varying degradation models and non-stationary processes. In recent decades, the FRFT has become an attractive tool and has various applications in many fields of applied sciences, such as signal processing [
1,
2], image processing [
3,
4,
5], optics [
6,
7,
8], communications [
9,
10,
11], quantum mechanics [
12,
13] and so on.
Wiener first introduced the FRFT in his 1929 work [
14]. Namias proposed the FRFT in [
12] using its eigenvalue equation. Since Namias’ work in 1980, the FRFT has attracted a lot of interest. Compared with FT, the FRFT contains one extra free parameter and is more suited to process non-stationary signals, especially chirp signals. As a result, FRFT can achieve effects that the classical Fourier transform or time-frequency analysis cannot.
Recall that for appropriate function
, the
nd-FT of
f is defined by (see [
15])
For
and
, the
nd-FRFT of
f with order
is defined by (see [
16,
17])
where
and here for each
,
is defined as follows
where
.
Throughout this paper, we fix
with
,
. Then,
where
It is obvious that
where
.
For the 1-dimensional case, Chen et al. [
18] studied the approximation theorem for FRFT. A new 2d-FRFT was proposed by Zayed in [
19], where the convolution theorem and Poisson summation formula were proved. It is natural for us to investigate cases in high dimensions. By combining the definitions provided by [
18,
20,
21], the multidimensional fractional convolution of order
can be defined as follows. For
,
We establish the following two approximation theorems, where Theorem 1 is approximation in norm and Theorem 2 is almost everywhere approximation.
Theorem 1. Let , and . Thenwhere . Theorem 2. Let , and . Denote by the decreasing radial dominant function of ϕ. If , then for almost all ,where . The uncertainty principle is a principle of physics introduced by Heisenberg in 1927. It points out that it is impossible to precisely determine the position and momentum of a microscopic particle at the same time. It is one of the fundamental results in quantum mechanics. The uncertainty principle is expressed mathematically as the Heisenberg inequality. In this paper, we study the general Heisenberg inequality.
Theorem 3 (General Heisenberg inequality).
Let and , For any , if , thenwhere In
Section 2, we prove the above theorems. As applications, we investigate the Laplace and heat equations with boundary and initial conditions for chirp functions in
Section 3. Furthermore, we demonstrate the effectiveness of our method through graphs in
Section 4.
2. The Proof of Theorems
Firstly, we prove two approximation theorems. Before proving Theorem 1, we need the following lemma.
Lemma 1. Let . Then, for every Proof. Since the space of continuous functions with compact support
is dense in
, for an arbitrary
, there exists
, satisfying
Because
g is uniformly continuous, we have
According to Lebesgue’s dominated convergence theorem and Equation (
11), we obtain
This proves the lemma. □
Proof of Theorem 1. Using Minkowski’s integral inequality, we can obtain
where
is in Equation (
12). It is clear that
From Lemma 1 and the Lebesgue dominated convergence theorem, we get
This proves Theorem 1. □
Proof of Theorem 2. Since
, using the Lebesgue differentiation theorem, we have
Assume
is any fixed point in
E. For any
, there exists
such that
whenever
.
We set
, where
, then
is decreasing. Denoting by
the volume of unit sphere in
, we get
as
or
. Thus, there exists a positive constant
A, such that
, for
Set
and
where
is the surface measure on
. Then Equation (
14) is equivalent to
whenever
. Then,
Denote by
the characteristic function of the set
. Using the Hölder inequality, we have
as
, which completes the proof of Theorem 2. □
Similar to definitions of means of 1d-FRFT and 2d-FRFT [
18,
22], we can define means for
nd-FRFT as follows.
Definition 1. Let and . For , the means of the multidimensional frational Fourier integral is defined bywhere Proposition 1. Let . Then,where , and . Proof. Using the multiplication formula of the classical Fourier transform and Equation (
5), we get
This completes the proof. □
Next, we study the general Heisenberg inequality. Before proving this inequality, we introduce the following two lemmas.
Lemma 2 ([
17]).
Let . Then The second equality in Lemma 2 is the Parseval equality associated with
nd-FRFT; that is,
for
and
. From this lemma, we get
and
which means
is the inverse transform of
on
.
Lemma 3 (General Multiplication formula, [
22]).
Let . Then, Proof of Theorem 3. (i) Let
,
and
. We assume
, and define
It follows from the classical Heisenberg inequality in [
23] that
By Equations (
22) and (
23), we obtain
As a result of changing variables, we have
According to the definition of
nd-FRFT,
Since
, by Equation (
24), we obtain
(ii) Let
,
. If
or
holds for at least one, then the conclusion can be drawn. Assume that both
and
are finite. As
is dense in
, i.e., for each
, we can choose
satisfying
as
. Then, we obtain
(iii) Let
,
,
. We define
Using the time-shift property of
nd-FRFT, we obtain
By changing variables and using (ii), we have
This proves Theorem 3. □
3. Application in Partial Differential Equations
In this section, we present applications of approximation theorems for FRFT to Laplace and heat equations.
Example 1. For , consider the Laplace equation with the Dirichlet boundary condition in the upper half-space : Let in Equation (6). We havewhereis the n-dimensional Poisson kernel. By calculation, we obtain From [15] (Chapter 1, Lemma 1.17), we can see Using Theorem 1, we havein norm. Consequently, is a solution to the Equation (28). Example 2. For , consider the heat equation with the initial value condition in the upper half-space : Let in Equation (6). We havewhereis the n-dimensional Gauss–Weierstrass kernel. By calculation, we get Similarly, by [15] (Chapter 1, Lemma 1.17), we have Using Theorem 1, we obtainin norm. Therefore, is a solution of Equation (30). 4. Simulations
In this section, we give a specific function to illustrate the initial problem of heat equation with chirp function. In Example 2, let
On the one hand, by fixing
, we investigate the effect of
. We take
and
, respectively. Then, we can describe
in
Figure 1,
Figure 2 and
Figure 3. In fact, when
, we have
, which is the case of classical heat equation. From
Figure 1,
Figure 2 and
Figure 3, it is clear that the smaller
are, the stronger the vibration of
is.
On the other hand, by fixing
, we investigate the effect of
y in the approximation. we take different
and
. As
,
tends to
and this trend can be seen clearly from the sectional views in
Figure 4.
5. Conclusions
This paper gives two approximation theorems in via the multidimensional fractional convolution related to the FRFT. The first one is that the multidimensional fractional convolution of an function f and a regular function can approximate f in norm. The second one is that the multidimensional fractional convolution of an function f and an function satisfying certain conditions can approximate f point by point. As applications of the second approximation theorem, we verify solutions to the Laplace equation with the Dirichlet boundary condition and the heat equation with the initial value condition in the upper half-space. In addition, through a specific initial value function, we illustrate both the influence of the Chirp function’s index on the smoothness of the solution, and the approximation speed of the solution to the initial value.
Author Contributions
Conceptualization, Y.Y.; methodology, Y.Y. and Q.W.; software, Y.Y.; validation, Y.Y. and Q.W.; formal analysis, Y.Y. and Q.K.; investigation, Y.Y.; writing—original draft preparation, Y.Y.; writing—review and editing, Y.Y. and Q.W.; funding acquisition, Q.W. and S.T.J. All authors have read and agreed to the published version of the manuscript.
Funding
This research was funded by the National Research Foundation of Korea funded by the Ministry of Education grant number NRF-2021R1A2C1095739, the National Natural Science Foundation of China grant number 12171221, and the Natural Science Foundation of Shandong Province grant number ZR2021MA031 and 2020KJI002.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Durak, L.; Aldirmaz, S. Adaptive fractional Fourier domain filtering. Signal Process. 2010, 90, 1188–1196. [Google Scholar] [CrossRef]
- Sejdić, E.; Djurović, I.; Stanković, L. Fractional Fourier transform as a signal processing tool: An overview of recent developments. Signal Process. 2011, 91, 1351–1369. [Google Scholar] [CrossRef] [Green Version]
- Gómez, A.; Ugarte, J.P.; Tobón, C. The fractional Fourier transform as a biomedical signal and image processing tool: A review. Biocybern. Biomed. Eng. 2020, 40, 1081–1093. [Google Scholar] [CrossRef]
- Kumar, S.; Saxena, R.; Singh, K. Fractional Fourier transform and fractional-order calculus-based image edge detection. Circuits Syst Signal Process. 2017, 36, 1493–1513. [Google Scholar] [CrossRef]
- Saxena, N.; Sharma, K.K. Pansharpening scheme using filtering in twodimensional discrete fractional Fourier transform. IET Image Process. 2018, 12, 1013–1019. [Google Scholar] [CrossRef]
- Bernardo, L.M.; Soares, O.D.D. Fractional Fourier transforms and imaging. J. Opt. Soc. Am. A 1994, 11, 2622–2626. [Google Scholar] [CrossRef]
- Liu, S.; Ren, H.; Zhang, J.; Zhang, X. Image-scaling problem in the optical fractional Fourier transform. Appl. Opt. 1997, 36, 5671–5674. [Google Scholar] [CrossRef] [PubMed]
- Ozaktas, H.M.; Aytr, O. Fractional Fourier domains. Signal Process. 1995, 22, 119–124. [Google Scholar] [CrossRef] [Green Version]
- Li, J.; Sha, X.; Fang, X.; Mei, L. 8-Weighted-type fractional Fourier transform based three-branch transmission method. China Commun. 2018, 15, 147–159. [Google Scholar] [CrossRef]
- Li, Y.; Song, Z.; Sha, X. The multi-weighted type fractional Fourier transform scheme and its application over wireless communications. J. Wireless Com. Netw. 2018, 2018, 41. [Google Scholar] [CrossRef]
- Zhou, L.; Zhao, Q.; Chi, S.; Li, Y.; Liu, L.; Yu, Q. A fractional Fourier transform-based channel estimation algorithm in single-carrier direct sequence code division multiple access underwater acoustic communication system. Int. J. Distrib. Sens. Netw. 2019, 15, 11. [Google Scholar] [CrossRef] [Green Version]
- Namias, V. The fractional order Fourier transform and its application to quantum mechanics. IMA J. Appl. Math. 1980, 25, 241–265. [Google Scholar] [CrossRef]
- Raymer, M.G.; Beck, M.; McAlister, D. Complex wave-field reconstruction using phase-space tomography. Phys. Rev. Lett. 1994, 72, 1137–1140. [Google Scholar] [CrossRef] [PubMed]
- Wiener, N. Hermitian polynomials and Fourier analysis. J. Math. Phys. 1980, 8, 70–73. [Google Scholar] [CrossRef]
- Stein, E.M.; Weiss, G. Introduction to Fourier Analysis on Euclidean Spaces; Princeton University Press: Princeton, NJ, USA, 1971. [Google Scholar]
- Ozaktas, H.M.; Zalevsky, Z.; Kutay, M. The Fractional Fourier Transform: With Applications in Optics and Signal Processing; Wiley: New York, NY, USA, 2001. [Google Scholar]
- Kamalakkannan, R.; Roopkumar, R. Multidimensional fractional Fourier transform and generalized fractional convolution. Integral Transforms Spec. Funct. 2020, 31, 152–165. [Google Scholar] [CrossRef]
- Chen, W.; Fu, Z.W.; Grafakos, L.; Wu, Y. Fractional Fourier transforms on Lp and applications. Appl. Comput. Harmon. Anal. 2021, 55, 71–96. [Google Scholar] [CrossRef]
- Zayed, A.I. Two-dimensional fractional Fourier transform and some of its properties. Integral Transform. Spec. Funct. 2018, 29, 553–570. [Google Scholar] [CrossRef]
- Mustard, D. Fractional convolution. J. Aust. Math. Soc. B 1998, 13, 257–265. [Google Scholar] [CrossRef] [Green Version]
- Zayed, A.I. A convolution and product theorem for the fractional Fourier transform. IEEE Signal Process. Lett. 1998, 5, 101–103. [Google Scholar] [CrossRef]
- Zhang, Y.; Li, W. Fractional Fourier transform on R2 and an application. Front. Math. China. 2021. [Google Scholar] [CrossRef]
- Ding, Y. Foundations of Modern Analysis, 2nd ed.; Beijing Normal University Publishers: Beijing, China, 2013. [Google Scholar]
| Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 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 (https://creativecommons.org/licenses/by/4.0/).