1. Introduction
The linear canonical transform (LCT) was proposed by Collins [
1] and by Moshinsky and Quesne [
2] almost simultaneously in the early 1970s. Since LCT has more free parameters than the classical Fourier transform (FT) and the fractional Fourier transform (FRFT), it has become an important tool for time-frequency analysis, especially for non-stationary signals or time-varying signals, and it is widely used in many fields such as radar, sonar, communication, information security, and digital watermarking [
3,
4,
5,
6,
7,
8,
9].
In the field of two-dimensional signal processing, sometimes we can reduce the problem to a one-dimensional situation, but in many cases it cannot be reduced, and two-dimensional signal processing tools are needed. Two-dimensional linear canonical transform (2D-LCT), as a generalized form of two-dimensional Fourier transform and two-dimensional fractional Fourier transform, has also attracted the attention of many scholars. In recent years, there are numerous applications of 2D-LCT have been discovered, including sampling theory, discrete theory, optical implementation, filter design, signal encryption, image reconstruction, and the uncertainty principle; see, for example, refs. [
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20] and references therein.
As Fourier transformations of functions are the mathematical basis of various applications, which is a complicated theory, it is necessary to develop theory for 2D-LCT before any further rigorous mathematical investigation of LCT. In this paper, we obtain a satisfactory theory for 2D-LCT. As we know, FT is only defined for functions naturally. Extending its definition to functions is a complicated procedure that requires deep theories such as Plancherel identity, the inversion problem, convolution theory, and the multiplication formula. Therefore, in this paper, we also establish the corresponding theory for 2D-LCT on and , and then to general . We further establish the multiplier theory and Littlewood–Paley theorems associated with the 2D-LCT. As applications, we demonstrate the recovery of the signal function by simulation.
Let us review the definition of 1D-LCT. Denote by the set of all real matrices of determinant 1.
Definition 1 ([
21]).
For any matrix the 1D-LCT
is defined bywhere By contrast, LCT is a generalization of FRFT and FT; it has three free parameters, and the set of all LCT does not form a commutative group (Abelian group) under multiplication, which is quite different from FRFT and FT. However, for special values of
in
Table 1, the set of all transforms forms an Abelian group, respectively.
If parameter , the 1D-LCT will degenerate into the chirp product. Therefore, we just consider in the following.
Chen et al. [
22] solved the inversion problem for the 1D-FRFT on
. Then, they obtained
multipliers and Littlewood–Paley theorems. Zhang and Li [
23] extended their results to 2D-FRFT and obtained the Heisenberg inequality. Yang et al. [
24] gave the approximation theorems of
nD-FRFT and used them to verify solutions to the Laplace equation and the heat equation with particular conditions in the upper half-space. Motivated by these works, we consider the corresponding problems for 2D-LCT.
Definition 2 ([
21]).
For any matrix , , , , the 2D-LCT
is defined bywhere Combining Definition 1 and Definition 2, we see that
where
and
are the 1 dimensional linear canonical operators of
and
, respectively.
From
Table 1, we know that some transforms are special cases of LCT. A natural thought is whether LCT can be decomposed into a combination of these special transforms.
Recall the definition of 2D-FT. For suitable function
f on
, the 2D-FT of
f is defined by (see [
25])
Considering the relationship between 2D-LCT and 2D-FT, the 2D-LCT can be rewritten as
According to (
2), the 2D-LCT of
can be decomposed as follows:
- 1.
Multiplying by a chirp function, ;
- 2.
2-dimensional Fourier transform, ;
- 3.
Scaling, ;
- 4.
Multiplying by a chirp function, .
In
Section 2, we provide the Heisenberg inequality and inverse transform for 2D-LCT on
. A natural question is whether it holds on
. However,
is not a sufficient condition for
. In order to study the inversion problem of 2D-LCT on
, we discuss the elementary properties of 2D-LCT on
. In
Section 3, we define the appropriate convolution and some special means. We prove that the convolution converges approximately to the original function and demonstrate the recovery of the function.
Section 4 is devoted to the problem of 2D-LCT on
for
. In
Section 5, we obtain the
multiplier theorem for 2D-LCT. In
Section 6, we demonstrate the recovery of the
signal function by simulation and give the 2D-LCT image of a discrete signal, considering the influence of different parameters of 2D-LCT.
2. 2D-LCT on
We discuss the Heisenberg inequality for 2D-LCT on
. According to the definition of 2D-LCT and the properties for 1D-LCT in [
21], we can obtain the following properties for 2D-LCT.
Lemma 1. Let . Then,
- (i)
;
- (ii)>
;
- (iii)
;
- (iv)
and .
- (v)
, where and is the adjoint matrix of , that is, is the 2D inverse linear canonical transform on .
Proof. From Definition 2 and the properties for 1D-LCT in [
21], it is clear that (i)–(iv) hold. We only give the proof of (v). From (i), we have
□
Lemma 1 (iv) is the Plancherel identity for 2D-LCT, which means
for
and
. In fact, the inverse transform of 2D-LCT on
, that is Lemma 1 (v), can also be found in [
26].
Theorem 1 (General multiplication formula).
Letwhere For every we have Proof. From Fubini’s theorem, we have
Hence, this theorem is proved. □
The classical Heisenberg uncertainty principle in the Fourier transform system is very important in signal processing, especially in time-frequency analysis, which states that a signal cannot be both time-limited and band-limited. In recent years, many researchers extended the Heisenberg principle to the LCT domains and its special cases such as FRFT. It is shown that there are different bounds for real and complex signals in the LCT and FRFT domains. In the 2D Non-separate LCT domain, Ding and Pei [
20] discussed the related theory of Heisenberg uncertainty and revealed the lower limit of the product of time width and frequency width of signals in the 2D non-separate LCT domain. In this article, we obtain the following general Heisenberg inequality for the 2D-LCT.
Theorem 2 (General Heisenberg inequality).
Let andFor any , if thenwhere Proof. We divide our proof into three steps.
(i) Let
,
and
We suppose
,
and define
Using the classical Heisenberg inequality in [
27], we obtain
From (
4) and (
5), we have
By adjusting the variables, we obtain
It follows from the definition of 2D-LCT that
where
,
. Then,
Since
, we have
(ii) Let
,
. If
or
holds for at least one, then we obtain the conclusion. Suppose that both are limited. Since
is dense in
, i.e., for each
, we can choose
such that
as
. Then, we also obtain
(iii) Let
,
. We define
Accoding to the time-shift property of 2D-LCT,
As a result of changing variables and using (ii), we obtain
This completes the proof. □
3. 2D-LCT on
The inversion problem for 2D-LCT (Lemma 1 (v)) on can be easily solved due to the Plancherel identity for LCT. However, it is not always true that if then . In this section, we consider the inversion problem of the 2D-LCT on . We need the following lemma.
Lemma 2 (General Riemann–Lebesgue lemma).
If , then Proof. According to (
2), the boundedness of
and the Riemann–Lebesgue lemma of the classical Fourier transform, we obtain
□
Definition 3. For , we define the convolution by For , let
Proposition 1. Let and . If ; then, Proof. Since
, we have
Due to Minkowski’s integral inequality, we obtain
Using the fact that the space of continuous functions with compact support
is dense in
, for an arbitrary
, there are
such that
Additionally,
g is uniformly continuous,
Using Lebesgue’s dominated convergence theorem, we obtain
According to Lebesgue’s dominated convergence theorem and
, we obtain
Hence, the proposition follows. □
Proposition 2. Let and . Denote by the decreasing radial dominant functions of ϕ. If and , then Proof. As
, using the Lebesgue differentiation theorem, we obtain
Suppose that
is any fixed point in
E. For any
, there are
such that
whenever
.
We assume
, where
. Then,
decreases. Denoting by
the volume of unit sphere in
, we obtain
as
or
. Thus, there are a constant
, such that
, for
We define
where
is the surface measure on
. Therefore, Equation (
7) is equivalent to
whenever
. Hence,
Denote by
the characteristic function of the set
. It follows from the Hölder inequality that
as
, which proves the proposition. □
Definition 4. Let with . For any , the means of the linear canonical integral with respect to of f is defined bywhere Proposition 3. Let and . We havewhere and Proof. From (
2) and multiplication formular of 2D-FT, we obtain
□
Lemma 3 ([
25]).
For any , we have- (i)
(Poisson kernel);
- (ii)
(Gauss–Weierstrass kernel).
- (iii)
.
Definition 5. Let , . For any ,is called the linear canonical Poisson integral of f,is called the linear canonical Gauss–Weierstrass integral of f. Definition 6. Then, the means with respect to are called the Abel means of the linear canonical integral of
f, whileare called the Gauss means of the linear canonical integral of
f.
It is clear that
for any
.
From Propositions 1, 2, and 3, we can obtain the following approximation theorem.
Theorem 3. Let with and . Then,
- (i)
The means of the linear canonical integral of f are convergent to f in the sense of norm: - (ii)
The means of the linear canonical integral of f are convergent to f almost everywhere, i.e.,
From Theorem 3, we deduce the following conclusion.
Corollary 1. If , thenand Corollary 2. Suppose . Then, Proof. By Corollary 1, we obtain
for almost every
. Using the Lebesgue dominated convergence theorem, it follows that
□
Corollary 3. For withwe have 5. Multiplier Theory and Littlewood–Paley Theorem Associated with the 2D-LCT
Definition 8. For and . The operator is defined by If there are a constant satisfyingthen is called the linear canonical multiplier. Since
is dense in
, we can obtain a unique bounded extension of
in
satisfying (
11).
Example 1. The cross-orthant Hilbert transform [28] is defined as In other words,where is the double Hilbert transform. Then, using the fact that the operator norm of is bounded on [29], we have That is, is also bounded on . By the proof of [28] [Theorem 2], we havewhere This means that is the linear canonical multiplier. Example 2. If , then is the linear canonical Poisson integral. The linear canonical Gauss–Weierstrass integral is the operator with respect to the multiplier .
Example 3. Let and . We write the characteristic function of the interval . We will prove that is an () multiplier in the 2D-LCT context.
Theorem 5. Let . If there are a constant satisfying one of the following conditions:
Then, there are satisfying Proof. It follows from (
2) that
and
Then, for some positive constant
C,
which completes the proof of the theorem. □
From the prove of Theorem 5, it is easy to obtain the following results.
Corollary 4 (The Bernstein-type multiplier theorem).
Assume that () and . If , then there are satisfying Corollary 5 (The Marcinkiewicz-type multiplier theorem).
Assume that and (). If there are satisfyingwhereis the set of dyadic rectangles in , then there are satisfying Let
. We decompose
as the union of the internally disjoint intervals. Define the internally disjoint intervals by
With representing the collection of dyadic rectangles in , that is, , for any we can write , where represents the enumeration of the dyadic intervals used above.
We define the partial summation operator
associated with
as
where
is the characteristic function of
. It is simple to show that
Theorem 6. For , , we haveand there are satisfying Proof. Let
where
,
. Then,
For
, we obtain
Now, we are only dealing with the one variable of
f for
. Then,
f can be regarded as a one-dimensional function. Hence,
where
It is easy to obtain the decomposition of one-dimensional from (
2). Based on this, we have
In order to obtain the following, we need
in [
25]. Thus,
Using the same method to deal with another variable of function
f, we obtain
where
,
,
and
. That is,
It follows from (
13) that
is also a bounded operator on
,
. If we take special matrices
, then
can be regarded as a two dimensional classical partial summation operator
for
, where
is defined as (refer to [
27])
Using the classical Littlewood–Paley theorem, we can easily carry out this theorem. □
6. Simulation
The phenomenon in which the frequency of a signal increases or decreases with time is called chirp. It is a term in communication technology related to coded pulse technology, which means that when the pulse is encoded, its carrier frequency increases linearly during the duration of the pulse.
In the first part of this section, we show the realization of the 2D-LCT approximation theorem with a graph of a continuous function. In the second part, we process discrete signals to show the influence of parameters a, b, c, and d on the image frequency domain in 2D-LCT.
6.1. Simulation of Continuous Function
In this subsection, we demonstrate the recovery of signal on .
Take the original signal
f,
as an example to this recovery.
Figure 1 shows the real part, the imaginary part, and the corresponding sectional views of the original function
f.
Consider the 2D-LCT of
with respect to
, where
and
According to (
2), we draw each step of
. To offer more intuitionistic information, we divide the real part and the imaginary part in
Figure 2 and
Figure 3, respectively.
In order to recover the original signal
, we use Theorem 3 and Corollary 1 to obtain
, which approximates to
, where
Figure 4 shows the real part, the imaginary part, and the corresponding sectional views of
with
.
Choosing a different set of
, from
Figure 5 we know that the smaller the parameter
is, the more precisely the approximate function of
converges to the original function.
We also select a set of wrong parameters
, which is different from right parameters
, to recover the signal. We draw the to compare with the original signal. It is observed from
Figure 6 that the approximate function with parameters
has considerable error compared to the original signal function.
6.2. Processing of Digital Image
In this part, we present images of 2D-LCT for a digital image to illustrate the effect of changing parameters
on the frequency domain. Let
Figure 7 shows the original image and the 2D-LCT image with parameter matrices
, and
, respectively. Parameters
, and
d of image (b) are relatively small numbers. The parameters of image (c) are larger than the parameters of image (b). The parameters of image (d) are larger than those of image (c). The larger the parameters are, the greater the frequency becomes, which means that the signal jitter is stronger. As a result, the image appears black. Furthermore, 2D-LCT is also used in the area of image encryption. As can be seen from
Figure 7, we cannot directly see the original image after 2D-LCT. Since 2D-LCT has six free parameters, if the corresponding parameters of the inverse transform change, the image cannot be recovered correctly. This encryption method is more secure.
According to Lemma 1 (v), we can obtain the 2D-LCT inverse transform for a digital image by discrete method. Take
, and
of the above parameter matrices, respectively. We can recover
Figure 7b–d and obtain the correct original figure.