1. Introduction
Due to resilience to background noise, stability of sparse reconstruction, and the ability to capture local time-frequency information, framelets are becoming a powerful tool in applied analysis and data science. Let
be a sequence in
. If there exist
such that
then,
is called a frame for
with bounds
A and
B [
1,
2]. Let
and
If the affine system
is a frame for
, then, the set
is called a framelet [
1,
2].
The well-known approach to construct framelets is through frame multiresolution analysis (FMRA) [
3,
4,
5]. In 1998, Benedetto and Li [
3] introduced the theory of one-dimensional FMRA, which is a fundamental concept in framelet theory. In 2004, Mu et al. [
4] further established the theory of high-dimensional FMRA. The structure of FMRA is as follows:
Let be a sequence of subspaces of such that
(i) ;
(ii) if and only if ;
(iii) there exists a such that is a frame for .
Then is called a frame multiresolution analysis (FMRA) and is called a frame scaling function.
If the Fourier transform of a frame scaling function
is compactly supported (i.e.,
), then
is said to be bandlimited. Furthermore,
, since
is a frame for
. When
f is expanded into a frame series,
; then, taking Fourier transform of both sides, it follows that
It means that
is bandlimited. Since
, the support of frequency domain of any function in
is contained in
G or equal to
G. Therefore, such an FMRA is said to be a bandlimited FMRA with the support of frequency domain
G.
Various framelets with nice properties are constructed by FMRAs [
4,
5,
6,
7,
8,
9,
10]. Mu et al. [
4] and Zhang [
5] showed that the number of generators in framelets associated with FMRA is determined completely by the frequency domain of FMRAs. Zhang [
6] discussed the convergence of a framelet series derived from FMRAs. Chui and He [
7], Antolin and Zalin [
8], and Atreasa et al. [
9] constructed many examples on compactly supported framelets when FMRAs extend into general MRAs. Zhang [
10] extended framelets derived by FMRAs into the case of framelet packets with finer time-frequency resolution.
Frequency domain of bandlimited FMRAs plays a key role when derived framelets are applied into narrowband signal processing and data analysis. A suitable frequency domain of bandlimited FMRAs can mitigate the effects of narrowband noises well, so the perfect reconstruction filter bank associated with a bandlimited FMRA can achieve quantization noise reduction simultaneously with reconstruction of a given narrowband signal [
3]. This is a unique and key advantage of framelets over traditional wavelets [
3]. However, until now, the structure of frequency domain of bandlimited FMRAs has not been investigated.
In this study, the frequency domain of bandlimited FMRA will be characterized. In
Section 2, the necessary condition for
G to be the support of frequency domain of bandlimited FMRA is given first. In
Section 3, in order to obtain sufficient condition, a fine partition of any bounded region
G is presented, satisfying
and .
Based on this partition, in
Section 4, a bandlimited FMRA with the support of frequency domain
G is directly constructed. With the help of it, for any given narrowband signal, one can choose the most suitable bandlimited FMRA to analyze it and, at the same time, mitigate noise effects.
3. Partition of the Support of Frequency Domain
Let
G be a bounded closed set in
, satisfying Theorem 1(i)–(iii). A fine partition of
G will be given in this section. This partition will be used to further prove that there exists a bandlimited FMRA with the support of frequency domain
G in
Section 4, i.e., the converse of Theorem 1 holds.
Some notations are needed as follows: For
,
Noticing that
G is bounded, one can choose a
such that
Lemma 1. If G satisfies (i) and (iii), then,
(a) ; (b) .
Hereafter, is written simply as .
Proof. By (i), it follows that
and clearly, this is an union of
disjoint point sets. So,
, and so,
For any
, by (iii), it follows that
. So,
Let
. Then,
. Again, by
, it means that
From this and
, it follows that
By
and
, it follows that
and
. Further,
. From this and (2),
, and so,
By (1),
. So
. On the other hand, by (3),
. So,
. From this and (2), it fol‘lows that
Lemma 1 is proved. □
Next, a decomposition of each
is given. For arbitrarily, finitely, many distinct points
, define a point set
:
Let
. Note that
. Since
G is bounded, there only exist finitely many
such that
. So,
must lie in some
, and so,
and the right-hand side of (6) is a disjoint union. Let
By (1) and
, if some
in
satisfies
, then, for any
, it follows that
. Again, by (5), it follows that
. Therefore,
only consists of finitely many point sets.
Lemma 2. If , then, and these point sets are disjoint.
Proof. For each
s,
is equivalent to
. Let
. Then,
. So,
. Again, by (5), it follows that
is equivalent to
and
, and
. It means that
, i.e.,
Let
. Then,
and
. This implies that
Lemma 2 is proved. □
Lemma 3. There exist finitely many point sets , where λ is some natural number, such that is the following disjoint union Proof. Take a point set
. By Lemma 2, the point sets
and these point sets are disjoint. Denote
Let
. After that, take a point set
. Denote
Since
consists of finitely many nonempty point sets, repeating the above process, one can finally choose finitely many point sets
(
is some natural number) such that
By (6) and (7), Lemma 3 is proved. □
4. Sufficient Conditions for the Support of Frequency Domains
of Bandlimited FMRA
In this section, the converse of Theorem 1 will be proved:
Theorem 2. Let G be a bounded closed set in satisfying Theorem 1(i)–(iii), then, there exists a bandlimited FMRA with the support of frequency domain G.
Proof. Since G is bounded, one can choose a such that . Two functions and will be constructed such that and
(*) ;
(**) , where and is the characteristic function of . □
The process is divided into four steps.
Step 1. Define .
Step 2. Define on and on , in detail;
Define
. For
, by Lemma 1(b), it follows that
. So,
Furthermore,
has been defined on
and
i.e., Formula (**) holds for
.
Define . If , then, . By and (8), . Hence, Formula (*) holds for . If , then, . From this and (8), , Clearly, Formula (*) holds for . Thus, Formula (*) holds for .
Step 3. Based on Step 2, the idea of mathematics induction will be used. For
, assume that
is defined on
and
is defined on
such that Formula (*) holds on
, Formula (**) holds on
, and
where
, and
are constants.
Define on . By Lemma 3, one only needs to define on each .
Since
has been defined on
and
. Again, by Lemma 3:
so, for each
and
, the values of
have been defined and
. Write
Noticing that the point sets
are disjoint, one can define
on
such that for
,
where
and
where
and
are constants.
By (9), for
, define
Due to the Lemma 3,
is defined on
and
where
and
.
Below, we will prove that if and for some , then .
By
and Lemma 3, there exist
j and
n such that
where
. Since
and
, there is some
such that
By (12)–(14), it follows that
By uniqueness of decomposition in (9), it follows that
. It means that
when
and
for some
.
Based on this fact, one can further define . So, is well-defined on and .
Now, define
on
. Let
Then,
is defined on
and
By Step 1 and Lemma 1(a), it follows that
. So,
is defined on
.
This will prove that Formula (*) holds on : If , by (16), Formula (*) holds. If , then, . By Lemma 1(a), it follows that . By , we get . So, . Formula (*) also holds.
Finally, it will prove that Formula (**) holds on .
Let
. Then,
By
, it follows that
and then,
. Again, by (17), it follows that
. So,
. By Lemma 1(a), it means that
. So,
, and so,
By (9) and (16), it follows that
Again by (18) and (10), it follows that for
,
Similar to the above process, it follows that (19) also holds for
. Again, by Lemma 3, (19) holds for
. Noticing that
, it means that
holds on
.
Step 4. From Steps 1–3,
is defined on
G and
is defined on
. Now, define
and
. By assumption (iii) in Theorem 2, it follows that
It means that
H has been well-defined on
and
.
From Steps 1–3, Formula (*) holds on . For , it follows that . By (20), it follows that . Hence, . Again, by , Formula (*) holds also on . Thus, by (20), Formula (*) holds for . When , by assumption (i) in Theorem 2, it follows that , which means that Formula (*) also holds for . Therefore, Formula (*) holds on .
From Steps 1–3, Formula (**) holds on G. Since the sum is a periodic function, holds on . If , then, for any , it follows that . So, on , and so, , i.e., Formula (**) holds on .
Up to now, the constructed
and
satisfy Formulas (*) and (**). Let
. Since
H is a
periodic bounded function,
can be expanded into a Fourier series:
. By Formula (*), it follows that
Taking the inverse Fourier transform on both sides, we have
and so,
. This implies that
.
By a known results in [1-2], Formula (**) implies the system
is a frame for
. For any
, it follows that
. It can be expanded into a frame series with respect to
:
Taking the Fourier transform on both sides, we have
i.e.,
, where
. So,
for
. Since
, it implies that
By Assumption (ii), it follows that
By a known result in [
1,
2], we have
. Therefore,
is a bandlimited FMRA with frequency domain
G.
Example 1. Let , whereIt is very clear that G satisfies (i) , (ii) , and (iii) .
Theorem 2 shows that there exists a bandlimited FMRA with frequency domain .