# Orthogonal Multiwavelet Frames inL2Rd

Authors: Liu Zhanwei; Hu Guoen; Wu Guochang
Journal: Journal of Applied Mathematics
 (2012)

---

## Abstract

We characterize the orthogonal frames and orthogonal multiwavelet frames inL2Rd with matrix dilations of the form (Df)(x)=detAf(Ax), where A is an arbitrary expanding d×d matrix with integer coefficients. Firstly, through two arbitrarily multiwavelet frames, we give a simple construction of a pair of orthogonal multiwavelet frames. Then, by using the unitary extension principle, we present an algorithm for the construction of arbitrarily many orthogonal multiwavelet tight frames. Finally, we give a general construction algorithm for orthogonal multiwavelet tight frames from a scaling function.


---

## Body

## 1. Introduction

Wavelets are mathematical functions that take account into the resolutions and the frequencies simultaneously [1–4]. Moreover, wavelets could cut up data into different frequency components such that people can study each component with a resolution matched to its scale.The classical MRA scaler wavelets are probably the most important class of orthonormal wavelets. However, the scalar wavelets cannot have the orthogonality, compact support, and symmetry at the same time (except the Haar wavelet). It is a disadvantage for signal processing. Multiwavelets have attracted much attention in the research community, since multiwavelets have more desired properties than any scalar wavelet function, such as orthogonality, short compact support, symmetry, and high approximation order [5–7]. It is natural, therefore, to develop the multiwavelets theory that can produce systems having these properties.Although many compression applications of wavelets use wavelet or multiwavelet bases, the redundant representation offered by wavelet frames has already been put to good use for signal denoising and image compression. In fact, the concept of frame was introduced a long time ago [8] and has received much attention recently due to the development and study of wavelet theory [9, 10]. In particular, inspired by these and other applications, many people are interested in some types of frames, such as tight wavelet frames, dual wavelet frames, and orthogonal frames [11–19].In [16], Weber proposed orthogonal wavelet frames, which are useful in multiple access communication systems and superframes. Later in [17], authors discussed a pair of orthogonal frames to be orthogonal in a shift-invariant space. In [18], authors presented sufficient conditions for the construction of orthogonal MRA wavelet frames in L2(R). This led them to a vector-valued discrete wavelet transform. But all these results just base on 2 dilation wavelet transform. In this paper, we present the construction of orthogonal multiwavelet frames in L2(Rd) with matrix dilation, where the basic ingredients consists of two fixed multiwavelet basis and a paraunitary matrix of an appropriate size. Furthermore, by using the unitary extension principle, we present an algorithm for the construction of orthogonal multiwavelet tight frames from two suitable functions and give a general construction algorithm for orthogonal multiwavelet tight frames from a scaling function. These constructions lead to filter banks in l2(Zd) with similar orthogonality relations.Let us now describe the organization of the material that follows. Section2 contains some definitions in this paper. Also, we review some relative notations. In Section 3, we describe the construction of orthogonal multiwavelet frames and present different algorithms for the construction of orthogonal multiwavelet tight frames in L2(Rd) with matrix dilation.


## 2. Preliminaries

Let us now establish some basic notations.We denote byTd the d-dimensional torus. By L2(Td), we denote the space of all Zd-periodic functions f (i.e., f is 1-periodic in each variable) such that ∫Td|f(x)|2dx<+∞. The subsets of Rd invariant under Zd translations and the subsets of Td are often identified.We use the Fourier transform in the form(2.1)f̂(ω)=∫Rdf(x)e-2πi〈x,ω〉dx,
where 〈·,·〉 denotes the standard inner product in Rd. The Fourier inverse transform is defined by(2.2)f(x)=f̂(ω)̌=∫Rdf̂(ω)e2πi〈x,ω〉dω.LetEd denote the set of all expanding d×d matrices A with integer coefficients. The expanding matrices mean that all eigenvalues have magnitude greater than 1. For A∈Ed, we denote by B the transpose of A. It is obvious that B∈Ed.A collection of elements{ϕj:j∈J} in a Hilbert space H is called a frame if there exist constants a and b, 0<a≤b<∞, such that(2.3)a‖f‖2≤∑j∈J|〈f,ϕj〉|2≤b‖f‖2,forallf∈H.
If {ϕj:j∈J} satisfies the second inequality, then {ϕj:j∈J} is called a Bessel sequence. Let a0 the supremum of all such numbers a and b0 the infimum of all such numbers b, then a0 and b0 are called the frame bounds of the frame {ϕj:j∈J}. When a0=b0, we say that the frame is tight. When a0=b0=1, we say the frame is a Parseval frame.In this paper, we will work with two families of unitary operators onL2(Rd). The first one consists of all translation operators Tk:L2(Rd)→L2(Rd),k∈Zd, defined by (Tkf)(x)=f(x-k). The second one consists of all integer powers of the dilation operator DA:L2(Rd)→L2(Rd) defined by (Df)(x)=|A|f(Ax) with A∈Ed.Let us now fix an arbitrary matrixA∈Ed. For Ψ={ψ1,…,ψr}⊂L2(Rd), we will consider the affine system X(Ψ) defined by(2.4)X(Ψ)={ψj,kl(x)∣ψj,kl(x)=|det⁡A|j/2ψl(Ajx-k):j∈Z;k∈Zd;l=1,…,r}.Then, we define the multiwavelet frame, the multiwavelet tight frame, the multiwavelet tight frame, and the filter.Definition 2.1.
We say thatX(Ψ)⊂L2(Rd) is a multiwavelet frame if the system (2.4) is a frame for L2(Rd).Definition 2.2.
We say thatX(Ψ)⊂L2(Rd) is a multiwavelet tight frame if the system (2.4) is a tight frame for L2(Rd).Definition 2.3.
We say thatX(Ψ)⊂L2(Rd) is a multiwavelet tight frame if the system (2.4) is a Parseval frame for L2(Rd).We turn to the concept of multiresolution analysis (MRA) inL2(Rd) which is a useful tool in our study.Definition 2.4.
Let{Vm}m∈Z be a sequence of closed subspaces of L2(Rd) satisfying:(1)
Vj⊂Vj+1,(2)
⋃j∈Z¯Vj=L2(Rd),(3)
⋂j∈ZVj={0},(4)
f(x)∈Vj⇔f(Ax)∈Vj+1,j∈Z, where A∈Ed,(5)
There exists a functionϕ(x)∈V0 such that {ϕ(x-k)}k∈Zd is a frame of V0. Then, {Vj}j∈Z is called an MRA and the function ϕ in (5) a scaling function.There is a standard procedure for constructing multiwavelets from a given MRA(Vj). Firstly, one defines Wj=Vj+1⊖Vj for all j∈Z. As an easy consequence of conditions (1)–(4) from Definition 2.4, one obtains L2(Rd)=⊕j∈ZWj¯ and Wj+1=DWj, for all j∈Z. Suppose now that there exist functions Ψ⊂W0 such that the system E(Ψ)∶={ψ(·-k):k∈Zd,ψ∈Ψ} is a frame for W0. Then, {DjTkψ:k∈Zd,ψ∈Ψ} is a frame for Wj, for all j∈Z, and, consequently, {DjTkψ:j∈Z,k∈Zd,ψ∈Ψ} is a frame for L2(Rd).In the following, we will borrow some notations from [17, 18] which will be used in this paper.LetX be a (countable) Bessel system for a separable Hilbert space H over the complex field C. The synthesis operator TX:l2(X)→H, which is well known to be bounded, is defined by TXa∶=∑h∈Xahh for a={ah}h∈X. The adjoint operator TX* of TX, called the analysis operator, is TX*:H→l2(X);TX*f∶={〈f,h〉}h∈X. Recall that X is a frame for H if and only SX∶=TXTX*:H→H, the frame operator or dual Gramian, is bounded and has a bounded inverse [20, 21], and it is a tight frame (with frame bound 1) if and only if SX is the identity operator. The system X is a Riesz system (for span¯X) if and only its Gramian GX∶=TX*TX is bounded and has a bounded inverse; it is an orthonormal system of H if and only if GX is the identity operator.Definition 2.5.
LetX and Y=RX, where R:h→Rh is a bijection between X and Y, be two frame for H. We call X and Y a dual frames for H if TYTX*=I, that is, ∑h∈X〈f,h〉Rh=f for all f∈H.Definition 2.6.
LetX and Y=RX, where R:h→Rh is a bijection between X and Y, be two frames for H. We call X and Y a pair of orthogonal frames for H if TYTX*=0, that is, ∑h∈X〈f,h〉Rh=0 for all f∈H.Definition 2.7.
A closed subspaceV⊂L2(Rd) is shift invariant if forallf∈V implies Tkf∈V for any k∈Zd.We consider orthogonal frames in a shift-invariant subspace ofL2(Rd). Let Φ be a countable subset of L2(Rd), and E(Φ)∶={ϕ(·-k):k∈Zd,ϕ∈Φ}. Define S(Φ)∶=span¯E(Φ), the smallest closed subspace that contains E(Φ). Throughout the rest of this paper, we assume that E(Φ) is a Bessel sequence for S(Φ). This assumption settles most of the convergence issues. The space S(Φ) is called the shift-invariant space generated by Φ and Φ a generating set for S(Φ). Shift-invariant spaces have been studied extensively in the literature, for example, [22, 23].Forω∈Rd, we define the pre-Gramian by(2.5)JΦ(ω)=(ϕ̂(ω+α))α∈Zd,ϕ∈Φ,
where ϕ̂ is the Fourier transform of ϕ. Note that the domain of the pre-Gramian matrix as an operator is l2(Φ) and its codomain is l2(Zd). The pre-Gramian can be regarded as the synthesis operator represented in Fourier domain as it was extensively studied in [22].LetΦ and Ψ=RΦ, where R is a bijection satisfying R(ϕ(·-k))=(Rϕ)(·-k), be countable subsets of L2(Rd). Suppose that S(Φ)=S(Ψ) and that both E(Φ) and E(Ψ) are frames for S(Φ). Then, by definition, E(Φ) and E(Ψ) are a pair of orthogonal frames for S(Φ) if and only if for all f∈S(Φ),(2.6)Sf∶=TE(Ψ)TE(Φ)*=0.We define the mixed dual Gramian asG̃(ω)=JΨ(ω)JΦ*(ω) and Gramians as(2.7)GΦ(ω)=JΦ*(ω)JΦ(ω),GΨ(ω)=JΨ*(ω)JΨ(ω).
Then, it is proven in [24] that, for any f∈L2(Rd),(2.8)(Sf̂)|ω+α=G̃(ω)f̂|ω+α,
where f̂|ω+α is the column vector (f̂(ω+α))α∈ZdT. By (2.8), one can prove easily that Sf=0 for all f∈L2(Rd) if and only if G̃(ω)=0 for a.e. ω∈Rd.


## 3. Orthogonal Multiwavelet Frames

In this section, we present a simple construction of a pair of orthogonal multiwavelet frames from two arbitrarily multiwavelet frames and get some interesting properties about the orthogonal multiwavelet frames. We also show different algorithms for the construction of arbitrarily many orthogonal multiwavelet tight frames.Firstly, we give a lemma, which has been obtained by Weber in [16].Lemma 3.1.
LetΨ1∶={ψ11,ψ21,…,ψr1} and  Ψ2∶={ψ12,ψ22,…,ψr2}. Suppose that  X(Ψ1) and  X(Ψ2) are multiwavelet frames for  L2(Rd).  X(Ψ1) and  X(Ψ2) are a pair of orthogonal frames for  L2(Rd) if and only if the following two equations are satisfied a.e.:
(3.1)∑i=1r∑j∈Zψi1̂(Bjω)ψi2̂(Bjω)¯=0,a.e.,∑i=1r∑j=0+∞ψi1̂(Bjω)ψi2̂(Bj(ω+q))¯=0,a.e.,∀k∈Zd,q∈Zd∖BZd.From Lemma3.1, by Theorem 2.3 [17], we can construct a pair of orthogonal multiwavelet frames easily.Theorem 3.2.
LetΨ1∶={ψ11,ψ21,…,ψr1}andΨ2∶={ψ12,ψ22,…,ψr2}∈L2(Rd) for some positive integer r. Suppose that  X(Ψ1) and  X(Ψ2) are multiwavelet frames for  L2(Rd). Let  V∶=(V1;V2) be a  2r×2r constant unitary matrix, where  V1 is the submatrix of the first r columns and  V2 the remaining r columns. Then,  X(Ψ11) and  X(Ψ22) are a pair of orthogonal multiwavelet frames for  L2(Rd), where  Ψ11∶=V1Ψ1 and  Ψ22∶=V2Ψ2.Proof.
Assume thatV is a constant matrix such that Ψ̂11∶=V1Ψ̂1 and Ψ̂22∶=V2Ψ̂2. Then, one can directly calculate the dual Gramians of Xq(Ψ11) and Xq(Ψ22). It follows from the fact that the double sums in (3.1) are the entries of the dual Gramian of the affine systems [24].
LetV=(vlm)1≤l,m≤2r. For a fixed q∈Zd∖BZd, i∈1,2, we have
(3.2)∑l=12r∑m≥0ψliî¯(Bmω)ψliî(Bm(ω+q))=∑l=12r∑m≥0∑n=1rvl,n¯ψnî¯(Bmω)∑n′=1rvl,n′ψn′î(Bm(ω+q))=∑m≥0∑n=1rψnî¯(Bmω)∑n′=1rψn′î(Bm(ω+q))∑l=12rvl,n¯vl,n′=∑m≥0∑n=1rψnî¯(Bmω)ψnî(Bm(ω+q)),
where we used the fact that the double sums converge absolutely a.e., V*V=I2r, and that X(Ψ1) and X(Ψ2) are frames for L2(Rd). Moreover,
(3.3)∑l=12r∑m∈Zψliî¯(Bmω)ψliî(Bmω)=∑l=12r∑m∈Z∑n=1rvl,n¯ψnî¯(Bmω)∑n′=1rvl,n′ψn′î(Bmω)=∑m∈Z∑n=1rψnî¯(Bmω)∑n′=1rψn′î(Bmω)∑l=12rvl,n¯vl,n′=∑m∈Z∑n=1rψnî¯(Bmω)ψnî(Bmω).
From the above results, by using the dual Gramian characterization of frames in [25, Corollary 5.7], then X(Ψ11) and X(Ψ22) are frames for L2(Rd).
We now show that the multiwavelet systems generated byΨ11 and Ψ22 are a pair of orthogonal frames for L2(Rd). We apply Lemma 3.1 to Ψ11:={ψ111,ψ211,…,ψ2r11} and Ψ22:={ψ122,ψ222,…,ψ2r22}. Let V=(vlm)1≤l,m≤2r. For all q∈Zd∖BZd, we have
(3.4)∑l=12r∑m≥0ψl11̂¯(Bmω)ψl22̂(Bm(ω+q))=∑l=12r∑m≥0∑n=1rvl,n¯ψn1̂¯(Bmω)∑n′=1rvl,r+n′ψn′2̂(Bm(ω+q))=∑m≥0∑n=1rψn1̂¯(Bmω)∑n′=1rψn′2̂(Bm(ω+q))∑l=12rvl,n¯vl,r+n′=∑m≥0∑n=1rψn1̂¯(Bmω)∑n′=1rψn′2̂(Bm(ω+q))×0=0,
where we used the orthogonality of the columns of V.
Moreover,(3.5)∑l=12r∑m∈Zψl11̂¯(Bmω)ψl22̂(Bm(ω))=∑l=12r∑m∈Z∑n=1rvl,n¯ψn1̂¯(Bmω)∑n′=1rvl,r+n′ψn′2̂(Bm(ω))=∑m∈Z∑n=1rψn1̂¯(Bmω)∑n′=1rψn′2̂(Bm(ω))∑l=12rvl,m¯vl,r+n′=∑m∈Z∑n=1rψn1̂¯(Bmω)∑n′=1rψn′2̂(Bm(ω))×0=0,
by Lemma 3.1, Ψ11 and Ψ22 generate a pair of orthogonal frames.The following results give some properties of the orthogonal frames.Proposition 3.3.
Suppose thatE(ψi) and  E(ψj) are a pair of orthogonal affine Bessel sequences in  L2(Rd). If  α∈L2(Rd) is a  Zd-periodic function, then  E(ψi) and  E(αψj) are a pair of orthogonal affine Bessel sequences.Proof.
Suppose thatE(ψi) and E(ψj) are a pair of orthogonal affine Bessel sequences in L2(Rd). Then, for all f∈L2(Rd), we have
(3.6)Sf(x)=∑m∈Zd〈f(x),ψi(x+m)〉ψj(x+m)=0.
Let ψj′:=αψj. Since α is a Zd-periodic function, then E(ψj′) is an affine Bessel sequence for L2(Rd) from the fact that, for all f∈L2(Rd),
(3.7)∑k∈Zd|〈f(x),α(x-k)ψj(x-k)〉|2=∑k∈Zd|〈α(x)¯f(x),ψj(x-k)〉|2≤B‖α¯f‖2≤B‖α¯‖2‖f‖2=B′‖f‖2.
Again byα being a Zd-periodic function, we have the following equation:
(3.8)Sf(x)=∑m∈Zd〈f(x),ψi(x+m)〉ψj(x+m)′=∑m∈Zd〈f(x),ψi(x+m)〉ψj(x+m)α(x+m)=α(x)∑m∈Zd〈f(x),ψi(x+m)〉ψj(x+m)=0.
Hence, E(ψi) and E(αψj) are a pair of orthogonal affine Bessel sequences in L2(Rd).Proposition 3.4.
Suppose thatE(ψi) and  E(ψj) are a pair of orthogonal frames for  H⊂L2(Rd). Let  α∈L2(Rd) be a  Zd-periodic function. If  E(αψj) is a frame for  H, then  E(ψi) and  E(αψj) are a pair of orthogonal frames for  H.Proof.
Similar to the proof in Proposition3.3, we have the desired result.Then, we recall a result from [26] that characterizes unitary extension principle (UEP) associated with more general matrix dilations in L2(Rd).Lemma 3.5.
SupposeΦ=(ϕj)j∈J is a refinable vector with a mask  Γ such that
(3.9)∑j∈J‖φj‖2=∫Rd‖Φ̂(ξ)‖l2(J)2dξ<∞,lim⁡j→∞‖Φ̂(B-jξ)‖=1,fora.e.ξ∈Rd.
Suppose also that Ψ=(ψj)j∈J̃, where J̃={1,…,N} is finite, is given by
(3.10)Ψ̂(Bξ)=H(ξ)Φ̂(ξ),
where H=(hi,j)i∈J̃,i∈J is a Zd-periodic, measurable matrix function satisfying
(3.11)Γ*(ξ)Γ(ξ+d)+H*(ξ)H(ξ+d)=Ω(ξ)δ0,d,fora.e.ξ,
and for any d∈Υ, where Υ consists of representatives of distinct cosets of B-1Zd/Zd, then Ψ⊂L2(Rd) is a multiwavelet tight frame.We callm a filter if m∈L∞([0,1)d). We shall call m a low-pass filter if m(0)=1, and we shall call m a high-pass filter if m(0)=0. Though not necessary, we will assume that every filter is continuous on a neighborhood of 0, so there will be no ambiguity in these definitions. Given a collection of filter M′={m0,m1,…,mr}⊂L∞([0,1)d), let M′(ξ) and M′̃(ξ) be the matrices(3.12)M′(ξ)=(m0(ξ)m0(ξ+β)m1(ξ)m1(ξ+β)⋮⋮mr(ξ)mr(ξ+β)),M′̃(ξ)=(m1(ξ)m1(ξ+β)m2(ξ)m2(ξ+β)⋮⋮mr(ξ)mr(ξ+β)),
where β∈Υ. In the remainder of the paper, the filter banks will be composed of a single low-pass filter (with index 0) and a number of high-pass filters.With the above definitions, we present an algorithm for the construction of arbitrarily many orthogonal multiwavelet tight frames.Theorem 3.6.
Suppose thatϕ1,ϕ2∈L2(Rd) are refinable functions which satisfy the conditions of the unitary extension principe, and let  m1(ξ),m2(ξ) be the associated low-pass filter. Let  M={m0(ξ),m1(ξ),…,mr(ξ)} and  N={n0(ξ),n1(ξ),…,nr(ξ)} be filter banks with  m0(ξ)=m1(ξ),n0(ξ)=m2(ξ). For all  β∈Υ, suppose that the following matrix equations hold: (a)
M*(ξ)M(ξ)=I2 for almost every  ξ,(b)
N*(ξ)N(ξ)=I2 for almost every  ξ,(c)
M̃*(ξ)Ñ(ξ)=0 for almost every  ξ.Let  η̂k(Bξ)=nk(ξ)ϕ̂2(ξ) and  ψ̂k(Bξ)=mk(ξ)ϕ̂1(ξ),1≤k≤r. Then,  {ψ1,…,ψr} and  {η1,…,ηr} generate orthogonal multiwavelet tight frames.Proof.
For Items (a) and (b), by Lemma3.5, then {ψ1,…,ψr} and {η1,…,ηr} generate multiwavelet tight frames. We use the characterization equations of Lemma 3.1 to prove orthogonality.
Let us focus on∑k=1r∑j∈Zψ̂k(Bjξ)η̂k(Bjξ)¯. For each k, by Hölder’s inequality and virtue of the fact that ψk and ηk generate Bessel sequences [4, Theorem 8.3.2], we have
(3.13)∑j∈Z|ψ̂k(Bjξ)η̂k(Bjξ)¯|≤∑j∈Z|ψ̂k(Bjξ)|2∑j∈Z|η̂k(Bjξ)|2<∞,
then the order of summation can be reversed. With this, by Item (c),
(3.14)∑k=1r∑j∈Zψ̂k(Bjξ)η̂k(Bjξ)¯=∑k=1r∑j∈Zmk(Bjξ)ϕ̂1(Bjξ)nk(Bjξ)ϕ̂2(Bjξ)¯=∑j∈Zϕ̂1(Bjξ)ϕ̂2(Bjξ)¯∑k=1rmk(Bjξ)nk(Bjξ)¯=0
holds for almost every ξ.
Likewise, forq∈Zd∖BZd, by item (c),
(3.15)∑k=1r∑j=0∞ψ̂k(Bjξ)η̂k(Bj(ξ+q))¯=∑k=1r∑j=0∞mk(Bj-1ξ)ϕ̂1(Bj-1ξ)nk(Bj-1(ξ+q))ϕ̂2(Bj-1(ξ+q))¯=∑j=0∞ϕ̂1(Bjω)ϕ̂2(Bj(ω+B-1q))¯∑k=1rmk(Bjω)nk(Bjω+Bj-1q))¯=0,
where ω=B-1ξ.The following results show the relationship between a pair of orthogonal MRA multiwavelet frames.Theorem 3.7.
Suppose thatX(Ψi) and  X(Ψj) are a pair of orthogonal MRA multiwavelet frames, where  Ψi∶={ψ1i,ψ2i,…,ψri},  Ψj∶={ψ1j,ψ2j,…,ψrj}. If  S(Ψi)=S(Ψj) and there exist functions  p,w∈L2(Rd) such that  ΨiP∶={ψ1ip,ψ2ip,…,ψrip} and  ΨjP∶={ψ1jw,ψ2jw,…,ψrjw} are multiwavelet frames, where  ψlp and  ψlw defined by  ψlip(ω)̂=ψ̂li(ω)p̂(ω),  ψljw(ω)̂=ψ̂lj(ω)ŵ(ω),1≤l≤r respectively, then  X(Ψip) and  X(Ψjw) are a pair of orthogonal multiwavelet frames for  L2(Rd).Proof.
Suppose thatX(Ψi), X(Ψj) are a pair of orthogonal MRA multiwavelet frames and S(Ψi)=S(Ψj), then, by the property of MRA multiwavelet frames, for any n≠m∈Z, we have S(AmΨi)⊥S(AnΨi). Hence, for all f1∈S(Ψi)(3.16)0=Sf1(x)=∑l=1r∑k∈Zd∑s∈Z〈f1(x),ψli(Asx-k)〉ψlj(Asx-k)=∑l=1r∑k∈Zd〈f1(x),ψli(x-k)〉ψlj(x-k).
For anyf∈L2(Rd), define f=f1+f2, where f1∈S(Ψi),f2∈(L2(Rd)∖S(Ψi)), then, 〈f1,f2〉=0. With this, we get
(3.17)Sf2(x)=∑l=1r∑k∈Zd〈f2(x),ψli(x-k)〉ψlj(x-k)=0.
Hence, for all f∈L2(Rd), the following equation holds:
(3.18)Sf(x)=∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉ψlj(x-k)=∑l=1r∑k∈Zd〈f1(x),ψli(x-k)〉ψlj(x-k)+∑l=1r∑k∈Zd〈f2(x),ψli(x-k)〉ψlj(x-k)=0.
Notice thatΨj:={ψ1j,…,ψrj}, since ψljw(ξ)̂=ψ̂j(ξ)ŵ(ξ),1≤l≤r, by Sf(x)=0, then
(3.19)0=Sf(x)̂=∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉ψlĵ(ω)e-2πikω=∑l=1r∑k∈Zd〈f1(x),ψli(x-k)〉ψlĵ(ω)e-2πikω+∑l=1r∑k∈Zd〈f2(x),ψli(x-k)〉ψlĵ(ω)e-2πikω=w(ω)(∑l=1r∑k∈Zd〈f1(x),ψli(x-k)〉ψlĵ(ω)e-2πikω+∑l=1r∑k∈Zd〈f2(x),ψli(x-k)〉ψlĵ(ω)e-2πikω)=∑l=1r∑k∈Zd〈f1(x),ψli(x-k)〉ψljŵ(ω)e-2πikω+∑l=1r∑k∈Zd〈f2(x),ψli(x-k)〉ψljŵ(ω)e-2πikω=∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉ψljŵ(ω)e-2πikω.
Applying Fourier inverse transform on (3.19), we have
(3.20)0=Sf(x)̂̌=∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉ψljŵ̌(ω)e-2πikω=∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉ψljw(x-k).
From the above result, we get the following equation:(3.21)∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉〈f(x),ψljw(x-k)〉=〈f(x),∑l=1r∑k∈Zd〈f(x),ψli(x-k)〉ψljw(x-k)〉=〈f(x),0〉=〈f(x),∑l=1r∑k∈Zd〈f(x),ψljw(x-k)〉ψli(x-k)〉,
hence,
(3.22)∑l=1r∑k∈Zd〈f(x),ψljw(x-k)〉ψli(x-k)=0.
Similar to the calculation of (3.19), clearly
(3.23)∑l=1r∑k∈Zd〈f(x),ψljw(x-k)〉ψlip(x-k)=0.
For anys∈Z,
(3.24)∑l=1r∑k∈Zd〈f(x),ψljw(Asx-k)〉ψlip(Asx-k)=A-s∑l=1r∑k∈Zd〈f(A-sx′),ψljw(x′-k)〉ψlip(x′-k).
Let g(x):=f(A-sx). Define operator T:L2(Rd)→L2(Rd);Tf(x)=g(x), obviously T is a surjection operator. If s is fixed, for all g∈L2(Rd), we get
(3.25)∑l=1r∑k∈Zd〈f(x),ψljw(Asx-k)〉ψlip(Asx-k)=A-s(∑l=1r∑k∈Zd〈g(x′),ψljw(x′-k)〉ψlip(x′-k))=0.
Putting everything together, we have(3.26)∑l=1r∑s∈Z∑k∈Zd〈f(x),ψljw(Asx-k)〉ψlip(Asx-k)=0,
then, X(Ψip) and X(Ψjw) are a pair of orthogonal multiwavelet frames.The following theorem describes a general construction algorithm for orthogonal multiwavelet tight frames.Theorem 3.8.
SupposeK(ξ) is an  r×r paraunitary matrix with  B-1Zd-periodic entries  ak,s(ξ); let  Kj(ξ) denote the jth column. For all  β∈Υ, suppose  M={m0(ξ),m1(ξ),…,mr(ξ)} and  M*(ξ)M(ξ)=I2 hold for almost every  ξ, where  m0 and  {m1,…,ml} are low- and high-pass filters, respectively, for a multiwavelet tight frame with scaling function  ϕ. For  j=1,…,r, define new filters via
(3.27)(n1,1j(ξ)⋮n1,rj(ξ)⋮nl,1j(ξ)⋮nl,rj(ξ))=(Kj(ξ)m1(ξ)⋮Kj(ξ)ml(ξ)).
Then, for j=1,…,r, the affine systems generated by Ψj={ψi,tj:i=1,…,l,t=1,…,r} obtained via
(3.28)ψ̂i,tj(Bξ)=ni,tj(ξ)ϕ̂(ξ)
are multiwavelet tight frames and are pairwise orthogonal.Proof.
Firstly, we prove thatX(Ψj),1≤j≤r, are multiwavelet tight frames. Assume Mj={m0(ξ),n1,1j(ξ),…,n1,rj(ξ),…,nl,1j(ξ),…,nl,rj(ξ)}. Define Mj(ξ) according to (3.12):
(3.29)Mj(ξ)=(m0(ξ)m0(ξ+β)n1,1j(ξ)n1,1j(ξ+β)⋮⋮n1,rj(ξ)n1,rj(ξ+β)⋮⋮nl,1j(ξ)nl,1j(ξ+β)⋮⋮nl,rj(ξ)nl,rj(ξ+β)),
where β∈Υ. Then, Mj*(ξ)Mj(ξ) is a 2×2 matrix. Next, we examine the entries of Mj*(ξ)Mj(ξ) individually. Note that the columns of K(ξ) have length 1, by M*(ξ)M(ξ)=I2, it follows that
(3.30)[Mj*(ξ)Mj(ξ)]1,1=|m0(ξ)|2+∑k=1r∑t=1l|ak,j(ξ)mt(ξ)|2=|m0(ξ)|2+∑k=1r|ak,j(ξ)|2∑t=1l|mt(ξ)|2=|m0(ξ)|2+∑t=1l|mt(ξ)|2=1,
where [Mj*(ξ)Mj(ξ)]1,1 means the (1,1) entry of the matrix Mj*(ξ)Mj(ξ).
Similarly,(3.31)[Mj*(ξ)Mj(ξ)]2,2=|m0(ξ+β)|2+∑k=1r∑t=1l|ak,j(ξ+β)mt(ξ+β)|2=|m0(ξ+β)|2+∑k=1r|ak,j(ξ+β)|2∑t=1l|mt(ξ+β)|2=|m0(ξ+β)|2+∑t=1l|mt(ξ+β)|2=1.
Now, since the entries ofK(ξ) are B-1Zd-periodic, again by M*(ξ)M(ξ)=I2,
(3.32)[Mj*(ξ)Mj(ξ)]1,2=m0(ξ+β)m0(ξ)¯+∑k=1r∑t=1lak,j(ξ)mt(ξ)¯ak,j(ξ+β)mt(ξ+β)=m0(ξ+β)m0(ξ)¯+∑k=1r|ak,j(ξ)|2∑t=1lmt(ξ)¯mt(ξ+β)=m0(ξ+β)m0(ξ)¯+∑t=1lmt(ξ)¯mt(ξ+β)=0.
Finally, the (2,1)-entry must be zero by conjugate symmetry of Mj*(ξ)Mj(ξ). Hence,
(3.33)Mj*(ξ)Mj(ξ)=I2,1≤j≤r.
Putting everything together, from Theorem 3.6, the affine systems generated by {ψi,tj:i=1,…,l,t=1,…,r} obtained via
(3.34)ψ̂i,tj(Bξ)=ni,tj(ξ)ϕ̂(ξ)
are multiwavelet tight frames.
For orthogonality, according to (3.12), for j=1,…,r, we have
(3.35)M̃j(ξ)=(n1,1j(ξ)n1,1j(ξ+β)⋮⋮n1,rj(ξ)n1,rj(ξ+β)⋮⋮nl,1j(ξ)nl,1j(ξ+β)⋮⋮nl,rj(ξ)nl,rj(ξ+β))=(Kj(ξ)m1(ξ)Kj(ξ+β)m1(ξ+β)⋮⋮Kj(ξ)ml(ξ)Kj(ξ+β)ml(ξ+β)).
If 1≤j≠j′≤r, then
(3.36)M̃j*(ξ)M̃j′(ξ)=(Kj(ξ)m1(ξ)Kj(ξ+β)m1(ξ+β)⋮⋮Kj(ξ)ml(ξ)Kj(ξ+β)ml(ξ+β))*(Kj′(ξ)m1(ξ)Kj′(ξ+β)m1(ξ+β)⋮⋮Kj′(ξ)ml(ξ)Kj′(ξ+β)ml(ξ+β))=(Kj*(ξ)Kj′(ξ)∑t=1l|mt(ξ)|2Kj*(ξ)Kj′(ξ+β)∑t=1lmt(ξ)¯mt(ξ+β)Kj*(ξ+β)Kj′(ξ)∑t=1lmt(ξ+β)¯mt(ξ)Kj*(ξ+β)Kj′(ξ+β)∑t=1lmt(ξ+β)¯mt(ξ+β))=(Kj*(ξ)Kj′(ξ)∑t=1l|mt(ξ)|2Kj*(ξ)Kj′(ξ)∑t=1lmt(ξ)¯mt(ξ+β)Kj*(ξ)Kj′(ξ)∑t=1lmt(ξ+β)¯mt(ξ)Kj*(ξ)Kj′(ξ)∑t=1lmt(ξ+β)¯mt(ξ+β))=0,
where we use the fact that the product of the two matrices Kj*(ξ)Kj′(ξ) is 0 by the orthogonality of the columns of K(ξ). By Theorem 3.6, we have the desired result.The following proposition is directly related to the construction algorithm in Theorem3.8.Proposition 3.9.
Ifϕ is compactly supported, the paraunitary matrix K in Theorem 3.8 must have entries which are  B-1Zd-periodic.Proof.
The proof will follow the notation of Theorem3.8. For 1≤j≤r, for all ξ∈B-1Zd/Zd, the matrix
(3.37)Mj(ξ)=(m0(ξ)m0(ξ+β)a1,j(ξ)m1(ξ)a1,j(ξ+β)m1(ξ+β)⋮⋮ar,j(ξ)m1(ξ)ar,j(ξ+β)m1(ξ+β)⋮⋮a1,j(ξ)ml(ξ)a1,j(ξ+β)ml(ξ+β)⋮⋮ar,j(ξ)ml(ξ)ar,j(ξ+β)ml(ξ+β))
satisfies the equation
(3.38)Mj*(ξ)Mj(ξ)=I2a.e.ξ.
Then, for almost every ξ, the following equation
(3.39)m0(ξ+β)m0(ξ)¯+∑k=1rak,j(ξ)¯ak,j(ξ+β)∑t=1lmt(ξ)¯mt(ξ+β)=0
must hold. Notice that m0 and {m1,…,ml} are low- and high-pass filters, respectively, which meet Theorem 3.8. Then,
(3.40)m0(ξ+β)m0(ξ)¯+∑t=1lmt(ξ)¯mt(ξ+β)=0.
Thus, we have
(3.41)m0(ξ+β)m0(ξ)¯=-∑t=1lmt(ξ)¯mt(ξ+β).
From the above results, we get the following equation:(3.42)0=m0(ξ+β)m0(ξ)¯+∑k=1rak,j(ξ)¯ak,j(ξ+β)∑t=1lmt(ξ)¯mt(ξ+β)=-∑t=1lmt(ξ)¯mt(ξ+β)+∑k=1rak,j(ξ)¯ak,j(ξ+β)∑t=1lmt(ξ)¯mt(ξ+β)=(∑k=1rak,j(ξ)¯ak,j(ξ+β)-1)∑t=1lmt(ξ)¯mt(ξ+β).
Hence,∑t=1lmt(ξ)¯mt(ξ+β)=0 or ∑k=1rak,j(ξ)¯ak,j(ξ+β)=1. If ϕ is compactly supported, then the first possibility is eliminated except possibly on a set of measure 0, whence the second must hold almost everywhere. Now, the sum is precisely the inner product of the two vectors ak,j(ξ) and ak,j(ξ+β), each of which has length 1. Applying Cauchy-Schwarz inequation yields that the two vectors must be identical for almost every ξ.


## 4. Conclusion

In this paper, motivated by the notion of orthogonal frames, we present the construction of orthogonal multiwavelet frames inL2(Rd) with matrix dilation, where the basic ingredients consist of two fixed multiwavelet basis and a paraunitary matrix of an appropriate size. The number of orthogonal multiwavelet frames that can be constructed is arbitrary, and is determined by the size of the paraunitary matrix. Moreover, by using the unitary extension principle, we present an algorithm for the construction of orthogonal multiwavelet tight frames and give a general construction algorithm for orthogonal multiwavelet tight frames from a scaling function.



---

*Source: 846852-2011-12-15.xml*