Next Article in Journal
Monetary Datum Fractal Analysis Using the Time Series Theory
Previous Article in Journal
Robust Fault Estimation and Tolerant Control for Uncertain Takagi–Sugeno Fuzzy Systems
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

High-Dimensional Periodic Framelet with Only One Symmetric Generator

School of Mathematics, Shandong University, Jinan 250100, China
Symmetry 2023, 15(10), 1895; https://doi.org/10.3390/sym15101895
Submission received: 22 August 2023 / Revised: 29 September 2023 / Accepted: 30 September 2023 / Published: 10 October 2023
(This article belongs to the Section Mathematics)

Abstract

:
Various symmetric framelets and periodic framelets are widely utilized in data analysis due to their resilience to background noise, avoidance of linear phase distortion, and the stability of redundant representation. At present, the number of generators in known periodic framelets in high-dimensional space is infinite. It is natural to ask whether a periodic framelet exists with only one generator in high-dimensional space. In this study, for any given positive numbers, A and B, we will construct one symmetric framelet generator. This generator’s integer translate, dyadic dilation, and periodization can produce a periodic frame with optimal bounds A and B.

1. Introduction

Many data processing systems concern redundant characters since redundancy can make the systems optimally robust to erasures [1,2]. The redundant representation requirement leads to the introduction of frames [3,4,5]. Among various types of frames, well-known framelets can generate frames in L 2 ( R d ) through their dyadic dilations and integer translates [6,7,8,9,10].
Framelets can be directly constructed from the structure of frame multiresolution analysis (FMRA) [11,12,13,14,15,16]. Benedetto and Li [11,12] and Kim and Lim [13] introduced the theory of one-dimensional FMRA, a foundational concept in framelet theory. Later on, Mu et al. [14] established the theory of high-dimensional FMRA and determined the number of generators needed in derived framelets. Zhang and Saito [16] further extended these results to the case of generalized MRAs.
Symmetry is pivotal in the development of framelet theory since symmetrical framelets have linear phases, which can prevent data distortion during data decomposition and reconstruction. A lot of known symmetric framelets for L 2 ( R d ) have been constructed, mostly in one-dimensional spaces, with a few in higher-dimensional spaces [17,18,19,20,21]. In one-dimensional space, the number of generators in a framelet can easily be one, but in high-dimensional spaces, the number of generators in a framelet is generally more than one [17,18,19,20,21].
Periodic framelets can generate frames in L 2 ( [ 0 , 1 ] d ) . Compared with framelets in L 2 ( R d ) , periodic framelets are more difficult to be constructed. By imitating the idea of generalized MRA, Goh et al. [22] and Lebedeva and Prestin [23] introduced the theory of periodic MRA and constructed some tight periodic framelets. Unfortunately, these periodic framelets have an infinite number of generators. It is natural to ask whether there exists a periodic framelet with only one generator in high-dimensional space. In this study, we will construct one symmetric framelet generator, such that its integer translate, dyadic dilation, and periodization can generate a frame in L 2 ( [ 0 , 1 ] d ) . Moreover, we can determine the optimal bounds of the derived periodic frame.

2. Preliminary

Let { φ n } n Z + be a sequence of elements in the Hilbert space H . If there exists a positive constant B, such that
n Z + | ( f , φ n ) H | 2 B f H 2 for   r all f H ,
then { φ n } n Z + is called a Bessel sequence in H ; if there exist two positive constants C 1 , C 2 , such that
C 1 f H 2 n Z + | ( f , φ n ) H | 2 C 2 f H 2 for   all f H ,
then { φ n } n Z + is called a frame with lower bound C 1 and upper bound C 2 in H [5,18]. The largest lower bounds and the smallest upper bounds are called the optimal lower and upper bounds, especially when the optimal lower bound is the same as the optimal upper bound. Such a frame is called a tight frame [5,18].
Let { φ n } n Z + and { φ ˜ n } n Z + be two frames in H . If for all f H ,
f = n Z + ( f , φ n ) H φ ˜ n = n Z + ( f , φ ˜ n ) H φ n .
Then { φ n } n Z + and { φ ˜ n } n Z + are called a pair of dual frames in H . The following theorem [1,2,18] gives a characterization of dual frames:
Theorem 1. 
Two sequences { φ n } n Z + and { φ ˜ n } n Z + are a pair of dual frames in H if and only if
(i) 
Both { φ n } n Z + and { φ ˜ n } n Z + are Bessel sequences for H
(ii) 
For any f , g H , ( f , g ) H = n Z + ( f , φ n ) H ( g , φ ˜ n ) H ¯ .
A framelet can generate a frame in L 2 ( R d ) through its dyadic dilations and integer translates. In detail, for { ψ μ } μ = 1 , 2 , τ L 2 ( R d ) , if the associated affine system
ψ μ , m , n ( t ) : = 2 m d 2 ψ μ ( 2 m t n ) , m Z ; n Z d ; μ = 1 , 2 , , τ .
is a frame in L 2 ( R d ) , then { ψ μ } μ = 1 , 2 , τ are called a framelet, and each ψ μ is called a framelet generator. The number τ is just the number of generators in this framelet. In the one-dimensional space, τ can easily be one, while in high-dimensional space, τ is generally larger than one.
Similar to the construction of these framelets, some periodic framelets have also been constructed [22,23]. Unfortunately, these periodic framelets have an infinite number of generators.

3. Construction of High-Dimensional Periodic Frames

Let ψ ( t ) L 2 ( R d ) be a real-valued, even, and symmetric function, such that its Fourier transform satisfies the following three conditions:
(a)
ψ ^ ( ω ) C ( R d ) ;
(b)
supp ψ ^ ( ω ) [ π , π ] d ( ϵ , ϵ ) d ( ϵ > 0 ) ;
(c)
min ω R d { 0 } D ( ω ) = A and max ω R d { 0 } D ( ω ) = B , where D ( ω ) = m Z | ψ ^ ( 2 m ω ) | 2 ,
We define ψ ˜ ( t ) L 2 ( R d ) as
ψ ˜ ^ ( ω ) = ψ ^ ( ω ) D ( ω ) ( ω 0 ) ; ψ ˜ ^ ( 0 ) = 0 .
For m Z and n Z d , let ψ m , n ( t ) = 2 m d 2 ψ ( 2 m t n ) , ψ ˜ m , n ( t ) = 2 m d 2 ψ ˜ ( 2 m t n ) and
ψ m , n p e r ( t ) = k Z d ψ m , n ( t + k ) , ψ ˜ m , n p e r ( t ) = k Z d ψ ˜ m , n ( t + k ) ,
and
Ψ p e r = { A , ψ m , n p e r , m 0 , n Z d [ 0 , 2 m 1 ] d } , Ψ ˜ p e r = { 1 A , ψ ˜ m , n p e r , m 0 , n Z d [ 0 , 2 m 1 ] d } .
In this section, we will give the following theorem:
Theorem 2. 
The system { Ψ p e r , Ψ ˜ p e r } denotes a pair of dual periodic frames in L 2 ( [ 0 , 1 ] d ) .
The proof of Theorem 2 is very long. With the help of Theorem 2, we first prove that both Ψ p e r and Ψ ˜ p e r are Bessel sequences in L 2 ( [ 0 , 1 ] d ) , i.e.,
Lemma 1. 
For any f L 2 ( [ 0 , 1 ] d ) , we have
| ( f , A ) L 2 ( [ 0 , 1 ] d ) | 2 + m 0 n Z d [ 0 , 2 m 1 ] d | ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) | 2 C 1 f L 2 ( [ 0 , 1 ] d ) 2 , | ( f , 1 A ) L 2 ( [ 0 , 1 ] d ) | 2 + m 0 n Z d [ 0 , 2 m 1 ] d | ( f , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) | 2 C 2 f L 2 ( [ 0 , 1 ] d ) 2 ,
where C 1 and C 2 are constants.
Proof. 
Noticing that
| ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) | k Z d | ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) | ,
| ( f , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) | k Z d | ( f , ψ ˜ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) | ,
and | ( f , A ) L 2 ( [ 0 , 1 ] d ) | 2 A f L 2 ( [ 0 , 1 ] d 2 and | ( f , 1 A ) L 2 ( [ 0 , 1 ] d ) | 2 1 A f L 2 ( [ 0 , 1 ] d 2 , in order to prove (2), it is enough to prove that the following inequalities hold: For any f L 2 ( [ 0 , 1 ] d ) ,
m 0 n Z d [ 0 , 2 m 1 ] d k Z d | ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) | 2 C 1 f L 2 ( [ 0 , 1 ] d ) 2 , m 0 n Z d [ 0 , 2 m 1 ] d k Z d | ( f , ψ ˜ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) | 2 C 2 f L 2 ( [ 0 , 1 ] d ) 2 .
By ψ ^ ( ω ) C ( R d ) and supp ψ ^ [ π , π ] d \ ( ϵ , ϵ ) d ( ϵ > 0 ) , we see that D ( ω ) has only finite nonzero terms in any closed interval which does not contain the point ω = 0 . Since D ( ω ) has positive lower bound A, by ψ ^ ( ω ) = 0 ( ω [ ϵ , ϵ ] d ) , we see that ψ ˜ ^ ( ω ) C ( R d ) . Combining this and ψ ^ ( ω ) C ( R d ) gives
ψ ( t ) = O i = 1 d 1 ( 1 + | t i | ) 3 d , ψ ˜ ( t ) = O i = 1 d 1 ( 1 + | t i | ) 3 d ,
where t = ( t 1 , , t d ) .
Denote the left-hand side of the first inequality in (3) by K ( f ) , i.e.,
K ( f ) = m 0 n Z d [ 0 , 2 m 1 ] d k Z d P m , n k 2 ,
where P m , n k = | ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) | . Applying the inequality formula ( a + b ) 2 2 ( a 2 + b 2 ) gives
k Z d P m , n k 2 2 k Z d [ 2 , 2 ] d P m , n k 2 + k Z d [ 2 , 2 ] d P m , n k 2 .
From this and (5), we obtain K ( f ) 2 ( J 1 + J 2 ) , where
J 1 = m 0 n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d P m , n k 2 , J 2 = m 0 n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d P m , n k 2 .
For J 1 , noticing that ψ m , n ( t + k ) = ψ m , n 2 m k ( t ) , we obtain
k Z d [ 2 , 2 ] d P m , n k 2 = O ( 1 ) k Z d [ 2 , 2 ] d ( P m , n k ) 2 = O ( 1 ) k Z d [ 2 , 2 ] d [ 0 , 1 ] d f ( t ) ψ ¯ m , n 2 m k ( t ) d t 2 .
From here on, “O” only depends on the dimension d. Let p = n 2 m k , we further have
J 1 = O ( 1 ) m 0 n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d [ 0 , 1 ] d f ( t ) ψ ¯ m , n 2 m k ( t ) d t 2 = O ( 1 ) m 0 p Z d [ 2 m + 1 , 2 m + 1 + 2 m 1 ] d [ 0 , 1 ] d f ( t ) ψ ¯ m , p ( t ) d t 2 = O ( 1 ) m 0 p Z d [ 0 , 1 ] d f ( t ) ψ ¯ m , p ( t ) d t 2 .
Denote Q ( t ) = f ( t ) χ [ 0 , 1 ] d ( t ) , where χ [ 0 , 1 ] d ( t ) is the characteristic function of [ 0 , 1 ] d . By (5), we have
J 1 = O ( 1 ) m 0 n Z d R d Q ( t ) ψ ¯ m , n ( t ) d t 2 .
By supp ψ ^ ( 2 m ω ) [ π 2 m , π 2 m ] d , we have
J 1 = O ( 1 ) m 0 n Z d 2 d m 2 2 d π d R d Q ^ ( ω ) ψ ^ ¯ ( ω 2 m ) e i n · ω 2 m d ω 2 = O ( 1 ) m Z n Z d 2 d m 2 2 d π d [ π 2 m , π 2 m ] d Q ^ ( ω ) ψ ^ ¯ ( ω 2 m ) e i n · ω 2 m d ω 2 .
Noticing that { e i n · ω 2 m 2 d π d 2 m d 2 } n Z d is an orthonormal basis for L 2 ( [ 2 m π , 2 m π ] d ) , applying Parseval identity of the Fourier series and supp ψ ^ ( 2 m ω ) [ π 2 m , π 2 m ] d gives
J 1 = O ( 1 ) m 0 1 2 d π d [ π 2 m , π 2 m ] d Q ^ ( ω ) ψ ^ ¯ ( ω 2 m ) 2 d ω = O ( 1 ) m 0 1 2 d π d R d Q ^ ( ω ) ψ ^ ¯ ( ω 2 m ) 2 d ω = O ( 1 ) 1 2 d π d R d Q ^ ( ω ) 2 m 0 ψ ^ ¯ ( ω 2 m ) 2 d ω
By m Z | ψ ^ ( 2 m ω ) | 2 = D ( ω ) < B , it follows that
J 1 = O ( 1 ) 1 2 d π d R d Q ^ ( ω ) 2 d ω = O ( 1 ) Q L 2 ( R d ) 2 = O ( 1 ) f L 2 ( [ 0 , 1 ] d 2 .
For J 2 , let f * ( t ) be a 1-periodic function and f * ( t ) = f ( t ) ( t [ 0 , 1 ] d ) . Then
P m , n k = [ 0 , 1 ] d + k f * ( t ) ψ ¯ m , n ( t ) d t .
Applying the Cauchy’s inequality gives
k Z d [ 2 , 2 ] d P m , n k = O ( 1 ) k Z d [ 2 , 2 ] d f L 2 ( [ 0 , 1 ] ) d [ 0 , 1 ] d + k | ψ m , n ( t ) | 2 d t 1 2 .
Again by (4), we have
[ 0 , 1 ] d + k | ψ m , n ( t ) | 2 d t = O ( 1 ) i = 1 d k i k i + 1 2 m ( 1 + | 2 m t i n i | ) 6 d d t i
where k = ( k 1 , k 2 , , k d ) , t = ( t 1 , t 2 , , t d ) , n = ( n 1 , n 2 , , n d ) . Furthermore
J 2 = O ( 1 ) f L 2 ( [ 0 , 1 ] ) d 2 m 0 n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 2 m ( 1 + | 2 m t i n i | ) 6 d d t i 1 2 2
When k = ( k 1 , k 2 , , k d ) Z d [ 2 , 2 ] d , there exists a k p such that | k p | > 2 . In the case of k p > 2 , when 0 n p 2 m 1 , it follows that 2 m 1 + | 2 m t p n p | ( t p [ k p , k p + 1 ] ) and then
1 ( 1 + | 2 m k p n p | ) 6 d 1 ( 1 + | 2 m k p n p | ) 4 d · 1 ( 1 + | 2 m k p n p | ) 2 d 2 2 m d ( 1 + | 2 m k p n p | ) 4 d
In the case of k p < 2 , when 0 n p 2 m 1 , it follows that 2 m 1 + | 2 m t p n p | and then
1 ( 1 + | 2 m k p n p | ) 6 d 2 2 m d ( 1 + | 2 m a ( k p ) n p | ) 4 d
For i p , it is clear that
1 ( 1 + | 2 m k i n i | ) 6 d 1 ( 1 + | 2 m k i n i | ) 4 d · 1 ( 1 + | 2 m k i n i | ) 2 d 1 ( 1 + | 2 m k i n i | ) 4 d
Combining these and (9) gives
J 2 = O ( 1 ) f L 2 ( [ 0 , 1 ] ) d 2 m 0 2 m d n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2
We begin to estimate the core term in J 2
I : = n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2
We consider the following d cases:
Case 1. 
We consider the index k satisfying k i > 0 for i = 1 , 2 , , d . When 0 n i 2 m 1 , we have 2 m t i n i > 0 , and then
n Z d [ 0 , 2 m 1 ] d k i > 0 , i = 1 , 2 , , d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d k i > 0 , i = 1 , 2 , , d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d k i > 0 , i = 1 , 2 , , d k Z d [ 2 , 2 ] d i = 1 d 1 ( 1 + | 2 m k i n i | ) 4 d 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d k i > 0 , i = 1 , 2 , , d k Z d [ 2 , 2 ] d i = 1 d 1 ( 1 + | 2 m k i n i | ) 2 d 2 = O ( 1 ) R d i = 1 d 1 ( 1 + | t i | ) 2 d d t 2 = O ( 1 ) .
Case 2. 
We consider the index k satisfying that k 1 = 0 and k i > 0 ( i 1 ) . It follows that
n Z d [ 0 , 2 m 1 ] d k 1 = 0 , k i > 0 , i = 2 , , d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = n Z d [ 0 , 2 m 1 ] d k 1 = 0 , k i > 0 , i = 2 , d k Z d [ 2 , 2 ] d i = 2 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 × 0 1 1 ( 1 + | 2 m t 1 n 1 | ) 4 d d t 1 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d k 1 = 0 , k i > 0 , i = 2 , d k Z d [ 2 , 2 ] d i = 2 d 1 ( 1 + | 2 m k i n i | ) 4 d 1 2 × n 1 2 m n 1 2 m ( 1 + | u | ) 4 d d u 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d 2 m k 1 = 0 , k i > 0 , i = 2 , , d k Z d [ 2 , 2 ] d i = 2 d 1 ( 1 + | 2 m k i n i | ) 2 d R 1 ( 1 + | u | ) 4 d d u 1 2 2 = O ( 1 ) n 1 Z [ 0 , 2 m 1 ] 2 m R 1 ( 1 + | u | ) 4 d d u × ( n 2 , , n d ) Z d 1 [ 0 , 2 m 1 ] d 1 k 1 = 0 , k i > 0 , i = 2 , , d k Z d [ 2 , 2 ] d i = 2 d 1 ( 1 + | 2 m k i n i | ) 2 d 2 = O ( 1 ) ( n 2 , , n d ) Z d 1 [ 0 , 2 m 1 ] d 1 k 1 = 0 , k i > 0 , i = 2 , , d k Z d [ 2 , 2 ] d i = 2 d 1 ( 1 + | 2 m k i n i | ) 2 d 2 = O ( 1 ) R d 1 i = 2 d 1 ( 1 + | t i | ) 2 d d t 2 d t d 2 = O ( 1 ) .
Similarly, we can obtain
n Z d [ 0 , 2 m 1 ] d k j = 0 , k i > 0 , i j k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) .
Case p. 
We consider the index k satisfying that k i = 0 ( i p 1 ) and k i > 0 ( i > p 1 ) . It follows that
n Z d [ 0 , 2 m 1 ] d k i = 0 ( i p 1 ) , k i > 0 ( i > p 1 ) k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = n Z d [ 0 , 2 m 1 ] d k i = 0 ( i p 1 ) , k i > 0 ( i > p 1 ) k Z d [ 2 , 2 ] d i = p d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 × i = 1 p 1 0 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d k i = 0 ( i p 1 ) , k i > 0 ( i > p 1 ) k Z d [ 2 , 2 ] d i = p d 1 ( 1 + | 2 m k i n i | ) 4 d 1 2 × i = 1 p 1 n i 2 m n i 2 m ( 1 + | u | ) 4 d d u 1 2 2 = O ( 1 ) n Z d [ 0 , 2 m 1 ] d 2 ( p 1 ) m k i = 0 ( i p 1 ) , k i > 0 ( i > p 1 ) k Z d [ 2 , 2 ] d i = p d 1 ( 1 + | 2 m k i n i | ) 2 d R 1 ( 1 + | u | ) 4 d d u p 1 2 2 = O ( 1 ) ( n 1 , , n p 1 ) Z p 1 [ 0 , 2 m 1 ] p 1 2 ( p 1 ) m R 1 ( 1 + | u | ) 4 d d u p 1 × ( n p , , n d ) Z d p + 1 [ 0 , 2 m 1 ] d p + 1 k i = 0 ( i p 1 ) , k i > 0 ( i > p 1 ) k Z d [ 2 , 2 ] d i = p d 1 ( 1 + | 2 m k i n i | ) 2 d 2 = O ( 1 ) ( n p , , n d ) Z d p + 1 [ 0 , 2 m 1 ] d p + 1 k i = 0 ( i p 1 ) , k i > 0 ( i > p 1 ) k Z d [ 2 , 2 ] d i = p d 1 ( 1 + | 2 m k i n i | ) 2 d 2 = O ( 1 ) R d p + 1 i = p d 1 ( 1 + | t i | ) 2 d d t p d t d = O ( 1 ) .
Similarly, we can obtain
n Z d [ 0 , 2 m 1 ] d k j 1 = 0 , , k j p 1 = 0 , k i > 0 , i j 1 , , j p 1 k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) .
Case d. 
We consider the index k satisfying that k i = 0 and k j > 0 ( j i ) . Similar to the argument of Case p, we can deduce that
n Z d [ 0 , 2 m 1 ] d k i > 0 , k j = 0 ( j = 1 , 2 , d , j i ) k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) .
By the combination of all d cases and using the inequality ( | a 1 | + + | a 2 d | ) 2 2 d ( a 1 2 + + a 2 d 2 ) , it follows that
n Z d [ 0 , 2 m 1 ] d k i 0 , i = 1 , 2 , , d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 )
Again by the symmetry of the index k , by (11), we can deduce that
I : = n Z d [ 0 , 2 m 1 ] d k Z d [ 2 , 2 ] d i = 1 d k i k i + 1 1 ( 1 + | 2 m t i n i | ) 4 d d t i 1 2 2 = O ( 1 ) .
Combining this and (10)–(11) gives
J 2 = O ( 1 ) f L 2 ( [ 0 , 1 ] d ) 2 m 0 2 m d = O ( 1 ) f L 2 ( [ 0 , 1 ] d ) 2
From this and (8) and (5), noticing that K ( f ) 2 ( J 1 + J 2 ) , we obtain the first inequality of (3). Since the arguments of two inequalities of (3) are similar, we can deduce the second inequality of (3). Finally, Lemma 1 is proved. □
Next, we prove that the Parseval identity holds, i.e.,
Lemma 2. 
For any f , g L 2 ( [ 0 , 1 ] d ) , we have
( f , g ) L 2 ( [ 0 , 1 ] d ) = m 0 n Z d [ 0 , 2 m 1 ] d ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) + ( f , A ) L 2 ( [ 0 , 1 ] d ) ( g , 1 A ) L 2 ( [ 0 , 1 ] d ) .
Proof. 
First, we compute M : = m 0 n Z d [ 0 , 2 m 1 ] d ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) .
By (4), it is clear that
M = m 0 n Z d [ 0 , 2 m 1 ] d k Z d ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) l Z d ( g , ψ ˜ m , n ( · + l ) ) L 2 ( [ 0 , 1 ] d ) .
Noticing that
k Z d l Z d | ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n ( · + l ) ) L 2 ( [ 0 , 1 ] d ) | = k Z d | ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) | l Z d | ( g , ψ ˜ m , n ( · + l ) ) L 2 ( [ 0 , 1 ] d ) | ,
using the inequality a b 1 2 ( a 2 + b 2 ) and (3), we obtain
m 0 n Z d [ 0 , 2 m 1 ] d k Z d l Z d | ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n ( · + l ) ) L 2 ( [ 0 , 1 ] d ) | 1 2 m 0 n Z d [ 0 , 2 m 1 ] d k Z d | ( f , ψ m , n ( · + k ) ) | L 2 ( [ 0 , 1 ] d ) 2 + l Z d | ( g , ψ ˜ m , n ( · + l ) ) | L 2 ( [ 0 , 1 ] d ) 2 < .
From this and (13), we know that
M = m 0 n Z d [ 0 , 2 m 1 ] d k Z d l Z d ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n ( · + l ) ) L 2 ( [ 0 , 1 ] d )
and this series is convergent absolutely. By the rearrangement of terms, we obtain
M = l Z d m 0 n Z d [ 0 , 2 m 1 ] d k Z d ( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n ( · + k + l ) ) L 2 ( [ 0 , 1 ] d ) .
Let both f * and g * be 1-periodic functions and f * ( t ) = f ( t ) , g * ( t ) = g ( t ) ( t [ 0 , 1 ] d ) . Define two sequences of functions as
f k ( t ) = f * ( t ) χ [ 0 , 1 ] d + k ( t ) , g k ( t ) = g * ( t ) χ [ 0 , 1 ] d + k ( t ) .
So
( f , ψ m , n ( · + k ) ) L 2 ( [ 0 , 1 ] d ) = ( f 0 , ψ m , n ( · + k ) ) L 2 ( R d ) , ( g , ψ m , n ( · + k + l ) ) L 2 ( [ 0 , 1 ] d ) = ( g l , ψ ˜ m , n ( · + k ) ) L 2 ( R d ) .
Noticing that
ψ m , n ( t + k ) = ψ m , n 2 m k ( t ) , ψ ˜ m , n ( t + k ) = ψ ˜ m , n 2 m k ( t ) ,
we obtain
M = l Z d m 0 n Z d [ 0 , 2 m 1 ] d k Z d ( f 0 , ψ m , n ( · + k ) ) L 2 ( R d ) ( g l , ψ ˜ m , n ( · + k ) ) L 2 ( R d ) = l Z d m 0 n Z d [ 0 , 2 m 1 ] d k Z d ( f 0 , ψ m , n 2 m k ) L 2 ( R d ) ( g l , ψ ˜ m , n 2 m k ) L 2 ( R d ) = l Z d m 0 n Z d ( f 0 , ψ m , n ) L 2 ( R d ) ( g l , ψ ˜ m , n ) L 2 ( R d ) .
Since supp ψ ^ = s u p p ψ ˜ ^ [ π , π ] d , applying the Parseval identity of the Fourier transforms gives
( f 0 , ψ m , n ) L 2 ( R d ) = 2 d m 2 2 d π d [ 2 m π , 2 m π ] d f ^ 0 ( ω ) ψ ^ ¯ ω 2 m e i n · ω 2 m d ω , ( g l , ψ ˜ m , n ) L 2 ( R d ) = 2 d m 2 2 d π d [ 2 m π , 2 m π ] d g ^ l ( ω ) ψ ˜ ^ ¯ ω 2 m e i n · ω 2 m d ω ,
Noticing that { e i n · ω 2 m 2 d π d 2 m d 2 } n Z d is an orthonormal basis for L 2 ( [ 2 m π , 2 m π ] d ) , we expand f ^ 0 ( ω ) ψ ^ ¯ ( ω 2 m ) and g ^ l ( ω ) ψ ˜ ^ ¯ ( ω 2 m ) into Fourier series, where the associated Fourier coefficients are, respectively,
c n = 2 d m 2 2 d π d [ 2 m π , 2 m π ] d f ^ 0 ( ω ) ψ ^ ¯ ω 2 m e i n · ω 2 m d ω , d n = 2 d m 2 2 d π d [ 2 m π , 2 m π ] d g ^ l ( ω ) ψ ˜ ^ ¯ ω 2 m e i n · ω 2 m d ω ,
Comparing (16) with (17), we have
c n = 2 d π d ( f 0 , ψ m , n ) L 2 ( R d ) , d n = 2 d π d ( g l , ψ ˜ m , n ) L 2 ( R d ) .
Applying the Parseval identity of the Fourier series gives
n Z d c n d ¯ n = [ 2 m π , 2 m π ] d f ^ 0 ( ω ) g ^ ¯ l ( ω ) ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω .
From this and (18), and supp ψ ^ = supp ψ ˜ ^ [ π , π ] d , it follows that
n Z d ( f 0 , ψ m , n ) L 2 ( R d ) ( g l , ψ ˜ m , n ) L 2 ( R d ) = 1 2 d π d R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω .
Again, by (15), we obtain
M = l 1 2 d π d m 0 R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω .
Noticing that
ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m 0 , m Z ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m = 1 ( ω R d \ { 0 } ) ,
it is clear that
m 0 R d f ^ 0 ( ω ) g ^ l ( ω ) ψ ˜ ^ ω 2 m ψ ^ ω 2 m d ω = R d | f ^ 0 ( ω ) g ^ l ( ω ) | m 0 ψ ˜ ^ ω 2 m ψ ^ ω 2 m d ω R | f ^ 0 ( ω ) g ^ l ( ω ) | d ω < .
From this and (19), applying the Lebegue dominant convergence theorem gives
M = l Z d 1 2 d π d R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) m 0 ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω .
Secondly, we compute N : = ( f , A ) ( g , 1 A ) . Let
Q = l Z d 1 2 d π d R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) m < 0 ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω .
Take an auxiliary function η ( t ) L 2 ( R d ) such that
η ^ ( ω ) = A m < 0 ψ ˜ ^ ¯ ω 2 m ψ ^ ω 2 m ( ω R d \ { 0 } ) , η ^ ( 0 ) = A .
Since ψ ^ ( ω ) = 0 ( ω ( ϵ , ϵ ) d ) , for m 0 , we have ψ ^ ω 2 m = 0 ( ω ( ϵ , ϵ ) d ) . From this and (20), we have
η ^ ( ω ) = m < 0 ψ ˜ ^ ¯ ω 2 m ψ ^ ω 2 m = m Z ψ ˜ ^ ¯ ω 2 m ψ ^ ω 2 m = A f o r ω ( ϵ , ϵ ) d \ { 0 } .
Again, by η ^ ( 0 ) = A , we have
η ^ ( ω ) = A ( ω ( ϵ , ϵ ) d ) .
By supp ψ ^ [ π , π ] d ( ϵ , ϵ ) d , we deduce that m < 0 ψ ˜ ^ ¯ ( ω 2 m ) ψ ^ ( ω 2 m ) has only finitely many non-zero terms in any closed interval which does not contain the point ω = 0 . In the beginning of the proof of Lemma 1, we have shown ψ ^ ( ω ) C ( R d ) and ψ ˜ ^ ( ω ) C ( R d ) . Again by (23) and (24), we have η ^ ( ω ) C ( R d ) . By supp ψ ^ ( ω ) = supp ψ ˜ ^ ( ω ) [ π , π ] d , we have
supp η ^ ( ω ) π 2 , π 2 d .
Take the other auxiliary function η ˜ satisfying three conditions: η ˜ ^ ( ω ) C ( R d ) , supp η ˜ ^ ( ω ) [ π , π ] d , and η ˜ ^ ( ω ) = 1 A ( ω [ π 2 , π 2 ] d ) . Then, by (25) and (23), we have
η ˜ ^ ( ω ) η ^ ¯ ( ω ) = m < 0 ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m ( ω R d { 0 } ) .
From this and (22) and (25), we obtain
Q = l 1 2 d π d [ π , π ] d f ^ 0 ( ω ) g ^ ¯ l ( ω ) η ˜ ^ ( ω ) η ^ ¯ ( ω ) d ω .
Applying the Parseval identity of the Fourier series gives
Q = l Z d k Z d 1 2 d π d [ π , π ] d f ^ 0 ( ω ) η ^ ¯ ( ω ) e i k · ω d ω 1 2 d π d [ π , π ] d g ^ l ( ω ) η ˜ ^ ¯ ( ω ) e i k · ω d ω ¯ .
By supp η ^ ( ω ) [ π 2 , π 2 ] d , we obtain
1 2 d π d [ π , π ] d f ^ 0 ( ω ) η ^ ¯ ( ω ) e i k · ω d ω = 1 2 d π d R d f ^ 0 ( ω ) η ^ ¯ ( ω ) e i k · ω d ω = ( f 0 , η ( · + k ) ) L 2 ( R d ) ,
where the Parseval identity of the Fourier transform is used in the last equality. Similarly, we have
1 2 d π d [ π , π ] d g ^ l ( ω ) η ˜ ^ ¯ ( ω ) e i k · ω d ω = ( g l , η ˜ ( · + k ) ) L 2 ( R d ) .
By (26), we obtain
Q = l Z d k Z d ( f 0 , η ( · + k ) ) L 2 ( R d ) ( g l , η ˜ ( · + k ) ) L 2 ( R d ) .
By the definitions of f 0 and g k , we have
( f 0 , η ( · + k ) ) L 2 ( R d ) = R d f * ( t ) χ [ 0 , 1 ] d ( t ) η ¯ ( t + k ) d t = [ 0 , 1 ] d f ( t ) η ¯ ( t + k ) d t = ( f , η ( · + k ) ) L 2 ( [ 0 , 1 ] d ) , ( g l , η ˜ ( · + k ) ) L 2 ( R d ) = R d g l ( t ) η ˜ ¯ ( t + k ) d t = R d g * ( t ) χ [ 0 , 1 ] d + l ( t ) η ˜ ¯ ( t + k ) d t = R d g * ( t ) χ [ 0 , 1 ] d ( t ) η ˜ ¯ ( t + k + l ) d t = [ 0 , 1 ] d g ( t ) η ˜ ¯ ( t + k + l ) d t = ( g l , η ˜ ( · + k + l ) ) L 2 ( [ 0 , 1 ] d ) .
So
Q = l k ( f , η ( · + k ) ) L 2 ( [ 0 , 1 ] d ) ( g , η ˜ ( · + k + l ) ) L 2 ( [ 0 , 1 ] d ) .
Since η ^ ( ω ) , η ˜ ^ ( ω ) C ( R d ) , we know that η ( t ) , η ˜ ( t ) decay very fast, so the series (27) is absolutely convergent and then
Q = k Z d ( f , η ( · + k ) ) L 2 ( [ 0 , 1 ] d ) l Z d ( g , η ˜ ( · + l ) ) L 2 ( [ 0 , 1 ] d )
The Poisson summation formula indicates that the Fourier coefficients of η p e r ( t ) = k η ( t + k ) are
[ 0 , 1 ] d η p e r ( t ) e 2 π i k · t d t = η ^ ( 2 k π ) = A , k = 0 , 0 , k 0 .
So k η ( t + k ) = A . Similarly, k η ˜ ( t + k ) = 1 A . Again, by (27), we obtain
Q = k Z d ( f , η ( · + k ) ) L 2 ( [ 0 , 1 ] d ) l Z d ( g , η ˜ ( · + l ) ) L 2 ( [ 0 , 1 ] d ) = ( f , A ) L 2 ( [ 0 , 1 ] d ) ( g , 1 A ) L 2 ( [ 0 , 1 ] d ) .
Noticing that N = ( f , A ) L 2 ( [ 0 , 1 ] d ) ( g , 1 A ) L 2 ( [ 0 , 1 ] d ) , by (22), we obtain
N = l 1 2 d π d R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) m < 0 ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω .
Combining this and (21) and (20), we obtain
M + N = l Z d 1 2 d π d R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) m Z ψ ˜ ^ ω 2 m ψ ^ ¯ ω 2 m d ω = l Z d 1 2 d π d R d f ^ 0 ( ω ) g ^ ¯ l ( ω ) d ω = l Z d R d f 0 ( t ) g ¯ l ( t ) d t .
By the definitions of f 0 and g k , we obtain
M + N = l Z d R d f * ( t ) χ [ 0 , 1 ] d ( t ) g * ¯ ( t ) χ [ 0 , 1 ] d + l ( t ) d t = R d f * ( t ) g * ¯ ( t ) χ [ 0 , 1 ] d ( t ) d t = [ 0 , 1 ] d f ( t ) g ¯ ( t ) d t = ( f , g ) L 2 ( [ 0 , 1 ] d ) ,
Again, by the definitions of M and N, we obtain
( f , g ) L 2 ( [ 0 , 1 ] d ) = m 0 n = 0 2 m 1 ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) ( g , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) + ( f , A ) L 2 ( [ 0 , 1 ] d ) ( g , 1 A ) L 2 ( [ 0 , 1 ] d ) ,
i.e., Lemma 2 is proved. □
Finally, we present the proof of Theorem 2 as follows:
Proof of Theorem 1. 
Applying Theorem 2, the combination of Lemma 1 and Lemma 2 implies that { Ψ p e r , Ψ ˜ p e r } are a pair of dual periodic frames, i.e., Theorem 2 is proved. □

4. Optimal Frame Bounds

In Section 3, we constructed a periodic frame with only one symmetric generator. Now we will provide its optimal frame bounds.
Theorem 3. 
Under the conditions of Theorem 2, the optimal lower and upper frame bounds of Ψ p e r are A and B, respectively, and those of Ψ ˜ p e r are 1 B and 1 A , respectively.
Proof. 
Noticing that both ψ m , n p e r = k Z d ψ m , n ( t + k ) and ψ ˜ m , n p e r = k Z d ψ ˜ m , n ( t + k ) are one-periodic functions, then we expand them into Fourier series ψ m , n p e r ( t ) = k Z d c k ( m , n ) e 2 π i k · t and ψ ˜ m , n p e r ( t ) = k Z d c ˜ k ( m , n ) e 2 π i k · t , by the Poisson summation formula, the Fourier coefficients of ψ m , n p e r and ψ ˜ m , n p e r are, respectively, □
c k ( m , n ) = ψ ^ m , n ( 2 k π ) , c ˜ k ( m , n ) = ψ ˜ ^ m , n ( 2 k π ) ( k Z d ) .
By D ( ω ) = l Z | ψ ^ ( 2 l ω ) | 2 , we have D ( ω 2 m ) = D ( ω ) . Again, by (1), we obtain
ψ ˜ ^ ω 2 m = ψ ^ ω 2 m D ω 2 m ( ω 0 ) .
By ψ ^ m , n ( ω ) = 2 m d 2 ψ ^ ( ω 2 m ) e i n · ω 2 m and ψ ˜ ^ m , n ( ω ) = 2 m d 2 ψ ˜ ( ω 2 m ) e i n · ω 2 m , we obtain
ψ ˜ ^ m , n ( ω ) = ψ ^ m , n ( ω ) D ( ω ) ( ω 0 ) .
From this and (28), we obtain
c ˜ k ( m , n ) = c k ( m , n ) D ( 2 k π ) ( k 0 ) .
By ψ ^ ( 0 ) = ψ ˜ ^ ( 0 ) = 0 , we have c ˜ 0 ( m , n ) = c 0 ( m , n ) = 0 .
Denote Fourier coefficients of f ( t ) L 2 ( [ 0 , 1 ] d ) by c k ( f ) . Take a function h ( t ) L 2 ( [ 0 , 1 ] d ) , such that its Fourier coefficients c k ( h ) satisfy
c k ( h ) = c k ( f ) D ( 2 k π ) ( k 0 ) , c 0 ( h ) = 0 .
From this and D ( 2 k π ) B ( k 0 ) , we know that { c k ( h ) } k Z d l 2 ( Z d ) , and then h ( t ) is well-defined. Using the Parseval identity of the Fourier series, by (28)–(30), we obtain
( h , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) = k c k ( h ) c ˜ k ( m , n ) ¯ = k c k ( f ) c k ( m , n ) ¯ = ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) ( m 0 ; n Z d [ 0 , 2 m 1 ] d ) .
Since { Ψ p e r , Ψ ˜ p e r } are a pair of dual frames, we have
( f , h ) L 2 ( [ 0 , 1 ] d ) = m 0 n Z d [ 0 , 2 m 1 ] d ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) ( h , ψ ˜ m , n p e r ) L 2 ( [ 0 , 1 ] d ) + ( f , A ) L 2 ( [ 0 , 1 ] d ) ( h , 1 A ) L 2 ( [ 0 , 1 ] d ) = m 0 n Z d [ 0 , 2 m 1 ] d | ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) | 2 + ( f , A ) L 2 ( [ 0 , 1 ] d ) ( h , 1 A ) L 2 ( [ 0 , 1 ] d ) .
From ( h , 1 A ) L 2 ( [ 0 , 1 ] d ) = 1 A [ 0 , 1 ] d h ( t ) d t = 1 A c 0 ( h ) = 0 , it follows that
( f , h ) L 2 ( [ 0 , 1 ] d ) = m 0 n Z d [ 0 , 2 m 1 ] d | ( f , ψ m , n p e r ) | L 2 ( [ 0 , 1 ] d ) 2 .
Using the Parseval identity, by (30), we obtain
( f , h ) L 2 ( [ 0 , 1 ] d ) = k Z d c k ( f ) c ¯ k ( h ) = k 0 | c k ( f ) | 2 D ( 2 k π ) .
Noticing that ( f , A ) L 2 ( [ 0 , 1 ] d ) = [ 0 , 1 ] d A f ( t ) d t = A c 0 ( f ) , by (31) and (32), we obtain
L ( f ) : = m 0 n Z d [ 0 , 2 m 1 ] d | ( f , ψ m , n p e r ) L 2 ( [ 0 , 1 ] d ) | 2 + | ( f , A ) L 2 ( [ 0 , 1 ] d ) | 2 = k 0 | c k ( f ) | 2 D ( 2 k π ) + A | c 0 ( f ) | 2 .
Since D ( 2 k π ) = D ( 2 k π 2 l ) ( k R d \ { 0 } , l Z ) and the point set { 2 k π 2 l ( k R d \ { 0 } , l Z ) is dense in R d and D ( ω ) is continuous on R d { 0 } , we obtain
sup k 0 D ( 2 k π ) = sup l Z k Z d { 0 } D 2 k π 2 l = sup ω R d { 0 } D ( ω ) = B .
Similarly, we have
inf k 0 D ( 2 k π ) = inf l Z k Z d { 0 } D 2 k π 2 l = inf ω R d { 0 } D ( ω ) = A .
Combining (34) and (35) and (33) gives
A k 0 | c k ( f ) | 2 + A | c 0 ( f ) | 2 L ( f ) B k 0 | c k ( f ) | 2 + A | c 0 ( f ) | 2 .
Since k 0 | c k ( f ) | 2 + | c 0 ( f ) | 2 = k Z d | c k ( f ) | 2 = f L 2 ( [ 0 , 1 ] d ) 2 , we have
A f L 2 ( [ 0 , 1 ] d ) 2 L ( f ) B f L 2 ( [ 0 , 1 ] d ) 2 .
This implies by (33) that A and B are the lower and upper frame bounds for the periodic frame Ψ p e r .
We begin to show that these frame bounds are optimal. By (34), we know that for any ϵ > 0 , there exists an l 0 such that D ( 2 π l ) B ϵ . Take f ( t ) = e 2 π i l · t . By (33), it follows that
L ( f ) ( B ϵ ) | c l ( f ) | 2 = B ϵ = ( B ϵ ) f L 2 ( [ 0 , 1 ] d ) 2 .
This means that B is the optimal upper bound of Ψ p e r . Now we take f ( t ) = 1 . By (33), we have
L ( f ) = A | c 0 ( f ) | 2 = A = A f L 2 ( [ 0 , 1 ] d ) 2 .
This implies that A is the optimal lower bound of Ψ p e r .
Similarly to the above arguments, we can deduce that B 1 and A 1 are the optimal bounds of Ψ ˜ p e r . Finally, Theorem 3 is proved.

5. Conclusions

Due to their resilience to background noise, stability in sparse reconstruction, and ability to capture local time-frequency information, periodic framelets are widely utilized in data analysis. Existing periodic framelets in high-dimensional space always require an infinite number of generators. Moreover, it is very difficult to construct periodic framelets with given optimal bounds. In this study, for any given constants, A and B, satisfying 0 < A B < + , we construct a symmetric periodic frame Ψ p e r generated by integer-translates, dyadic-dilations, and periodization of a single symmetric generator ψ and its optimal frame bounds are just A and B. Since the generator ψ is symmetric, smooth, and bandlimited, the derived periodic frame Ψ p e r is also symmetric and smooth. Moreover, we present the construction of its dual frame, which has the same desirable properties as Ψ p e r . In the future, we will extend our results to periodic framelets with matrix dilation.

Funding

This research was partially supported by the European Commission Horizon 2020 Framework Program (no. 861584) and the Taishan Distinguished Professor Fund.

Data Availability Statement

Not applicable.

Conflicts of Interest

The author declares no conflict of interest.

References

  1. Mallat, S. A Wavelet Tour of Signal Processing; Academic Press: San Diego, CA, USA, 2008. [Google Scholar]
  2. Walter, G.G. Wavelet and other Orthogonal Systems with Applications; CRC Press: Boca Raton, FL, USA, 2018. [Google Scholar]
  3. Bajwa, W.U.; Pezeshki, A. Finite Frames for Sparse Signal Processing. In Finite Frames: Theory and Applications; Casazza, P., Kutyniok, G., Eds.; Birkhauser: Boston, MA, USA, 2012. [Google Scholar]
  4. Christensen, O. Frames and Pseudo-Inverses. J. Math. Anal. Appl. 1995, 195, 401. [Google Scholar] [CrossRef]
  5. Christensen, O. An Introduction to Frames and Riesz Bases; Birkhauser: Boston, CA, USA, 2003. [Google Scholar]
  6. Qin, Y.; Wang, J.; Mao, Y. Dense Framelets with Two Generators and their Application in Mechanical Fault Diagnosis. Mech. Syst. Sig. Process. 2013, 40, 483–498. [Google Scholar] [CrossRef]
  7. Antolin, A.S.; Zalik, R.A. Compactly Supported Parseval Framelets with Symmetry associated to E(2)d(Z) Matrices. Appl. Math. Comput. 2018, 325, 179–190. [Google Scholar]
  8. Daubechies, I.; Han, B.; Ron, A.; Shen, Z. Framelets: MRA-based Constructions of Wavelet Frames. Appl. Comput. Harmon. Anal. 2003, 14, 1–46. [Google Scholar] [CrossRef]
  9. Ri, C.; Paek, Y. Causal FIR symmetric paraunitary matrix extension and construction of symmetric tight M-dilated framelets. Appl. Comput. Harmon. Anal. 2021, 51, 437–460. [Google Scholar]
  10. Shi, Y.; Song, J.; Hua, X. Poissonian image deblurring method by non-local total variation and framelet regularization constraint. Comput. Electr. Eng. 2017, 62, 319–329. [Google Scholar]
  11. Benedetto, J.J.; Li, S. The theory of Multiresolution Analysis Frames and Applications to Filter Banks. Appl. Comp. Harmon. Anal. 1998, 5, 389–427. [Google Scholar]
  12. Benedetto, J.J.; Treiber, O.M. Wavelet Frame: Multiresolution Analysis and Extension Principle. In Wavelet Transforms and Time-Frequency Signal Analysis; Debnath, L., Ed.; Birkhauser: Boston, CA, USA, 2000. [Google Scholar]
  13. Kim, H.O.; Lim, J.K. On Frame Wavelets associated with Frame Multiresolution Analysis. Appl. Comput. Harmon. Anal. 2001, 10, 61–70. [Google Scholar] [CrossRef]
  14. Mu, L.; Zhang, Z.; Zhang, P. On the Higher-dimensional Wavelet Frames. Appl. Comput. Harmon. Anal. 2004, 16, 44–59. [Google Scholar]
  15. Zhang, Z. Characterization of Frequency Domains of Bandlimited Frame Multiresolution Analysis. Mathematics 2021, 9, 1050. [Google Scholar] [CrossRef]
  16. Zhang, Z.; Saito, N. Existence Theorem and Minimal Cardinality of UEP framelets and MEP bi-Framelets. Appl Comput. Harmon. Anal. 2013, 34, 297–307. [Google Scholar] [CrossRef]
  17. Zhang, Z. Framelet Sets and associated Scaling Sets. Mathematics 2021, 9, 2824. [Google Scholar] [CrossRef]
  18. Zhang, Z.; Jorgenson, P.E.T. Frame Theory in Data Science; Springer: Heidelberg, Germnay, 2023. [Google Scholar]
  19. Krivoshein, A.V. From frame-like wavelets to wavelet frames keeping approximation properties and symmetry. Appl. Math. Comput. 2019, 344–345, 204–218. [Google Scholar] [CrossRef]
  20. Dutta, P.; Ghoshal, D.; Lala, A. Enhanced symmetry of the p-adic wavelets. Phys. Lett. 2018, 783, 421–427. [Google Scholar] [CrossRef]
  21. Diao, C.; Han, B.; Lu, R. Generalized matrix spectral factorization with symmetry and applications to symmetric quasi-tight framelets. Appl. Comput. Harmon. Anal. 2023, 65, 67–111. [Google Scholar] [CrossRef]
  22. Goh, S.S.; Han, B.; Shen, Z. Tight periodic wavelet frames and approximation orders. Appl. Comput. Harmon. Anal. 2011, 31, 228–248. [Google Scholar] [CrossRef]
  23. Lebedeva, E.A.; Prestin, J. Periodic wavelet frames and time-frequency localization. Appl. Comput. Harmon. Anal. 2014, 37, 347–359. [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

Zhang, Z. High-Dimensional Periodic Framelet with Only One Symmetric Generator. Symmetry 2023, 15, 1895. https://doi.org/10.3390/sym15101895

AMA Style

Zhang Z. High-Dimensional Periodic Framelet with Only One Symmetric Generator. Symmetry. 2023; 15(10):1895. https://doi.org/10.3390/sym15101895

Chicago/Turabian Style

Zhang, Zhihua. 2023. "High-Dimensional Periodic Framelet with Only One Symmetric Generator" Symmetry 15, no. 10: 1895. https://doi.org/10.3390/sym15101895

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