Finite equal norm Parseval Wavelet Frames over Prime Fields
Asghar Rahimi, Niloufar Seddighi

TL;DR
This paper develops a method to construct finite equal-norm Parseval wavelet frames over prime fields using a scaled DFT approach, providing new characterizations and concrete examples in wavelet analysis.
Contribution
It introduces a novel scaled DFT technique for finite wavelet frames over prime fields and characterizes subgroups forming frames, advancing wavelet frame theory.
Findings
Constructed finite equal-norm Parseval wavelet frames over prime fields.
Characterized subgroups of the cyclic multiplicative group that generate wavelet frames.
Provided concrete examples demonstrating the application of the theoretical results.
Abstract
In the framework of wave packet analysis, finite wavelet systems are particular classes of finite wave packet systems. In this paper, using a scaling matrix on a permuted version of the discrete Fourier transform (DFT) of system generator, we derive a locally-scaled version of the DFT of system genarator and obtain a finite equal-norm Parseval wavelet frame over prime fields. We also give a characterization of all multiplicative subgroups of the cyclic multiplicative group, for which the associated wavelet systems form frames. Finally, we present some concrete examples as applications of our results.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Finite equal norm Parseval Wavelet Frames over Prime Fields
Asghar Rahimi and Niloufar Seddighi∗
Asghar Rahimi, Faculty Mathematics, University of Maragheh, Maragheh, Iran.
Niloufar Seddighi, Faculty Mathematics, University of Maragheh, Maragheh, Iran.
Abstract.
In the framework of wave packet analysis, finite wavelet systems are particular classes of finite wave packet systems. In this paper, using a scaling matrix on a permuted version of the discrete Fourier transform (DFT) of system generator, we derive a locally-scaled version of the DFT of system genarator and obtain a finite equal-norm Parseval wavelet frame over prime fields. We also give a characterization of all multiplicative subgroups of the cyclic multiplicative group, for which the associated wavelet systems form frames. Finally, we present some concrete examples as applications of our results.
Keywords: Finite wavelet frames, equal-norm Parseval frames, prime fields.
MSC(2010): Primary 42C15, 42C40, 65T60; Secondary 30E05, 30E10.
††copyright: ©0: Iranian Mathematical Society
1. Introduction
The theory of frames in finite dimensional Hilbert spaces has been recognized through its central role in signal representation methods [9, 4]. The best known frames in applications including data transmission such as packet communication networks [22], multiple antenna coding [25], perfect reconstruction filter banks (PRFBs) [27], quantization error problems in quantized frame expansions [23], and some areas of quantum communication theory [7] are finite equal-norm Parseval frames (ENPFs). The potential of these types of frames is due to the high capability of erasure-resilient, speedy implementation of reconstruction as well as the structure of equal energy frame vectors. The first comprehensive review of relevant studies on general equal-norm tight frames (ENTFs), and equal-norm Parseval frames (ENPFs) as the subclasses of ENTFs have been studied in [8]. Some classes of ENPFs such as (general) harmonic frames, Gabor frames (finite discrete Gabor frames) and ENPFs with single generator or more generators which have group structures, have been also introduced in [8]. Several other classes of ENPFs can be found in [10]. Moreover, a number of constructive methods to ENTFs and ENPFs from finite sets of vectors have been considered [8, 10]. Recently, some convergent constructive methods to ENPFs have been introduced [6]. Nevertheless, there is a lack of variety in classes of structured ENPFs, obtained from some generating vectors or with a simple structure which are important in the point of low rate of computation and complexity. Furthermore, in practice, only one special class of ENPFs might not be guaranteed to be suitable for all applications.
Traditionally, the classical Gabor transforms and wavelet transforms have been used to perform time-frequency (resp. time-scale) analysis of a given function/signal in a Hilbert space, see [1, 3, 2]. In the last decades, generalized methods of Gabor transforms and wavelet transforms have been developed [14]. In the framework of wave packet analysis [11, 20], finite wavelet systems are particular classes of finite wave packet systems which have been recently introduced, see [17, 16, 18, 15]. Extending the finite wavelet frames over prime fields in [19], the analytic structure, group theoretical and abstract aspects of the nature of such systems have been studied in [19, 21, 30].
In Theorem 4.2, using a scaling matrix (not necessarily uniform) on a permuted version of the discrete Fourier transform (DFT) of a given window function (system generator) under certain conditions, we derive a locally-scaled version of the DFT of the window function and obtain a finite equal-norm Parseval wavelet frame over prime fields. In [30], we presented a matrix representation of the DFT of the window function, which was based on a generator of the cyclic multiplicative group of integers modulo , where is a prime number. This notion is a quite useful tool to determine whether a given system forms a frame. In this paper, we further apply this matrix notion. For any non-zero window function using this representation, we give a characterization of all multiplicative subgroups of the cyclic multiplicative group modulo , for which the associated wavelet systems form frames. Although, this notion depends on a generator of the cyclic multiplicative group (not necessarily a specific generator) and there is not a general method to find its generator, however this is the key point in cryptosystems.
Construction of ENPFs in such systems relies on a local modifying of the frequency components of the system generator. For a prime integer , the multiplicative group modulo is cyclic and based on that, Proposition 3.7 provides a convenient correspondence between the multiplicative subgroups and the main group. This leads us to simply manipulate the DFT of the system generator in order to obtain ENPFs of such systems.
This paper is orgonized as follows. Section 2 contains some basic definitions and results of Fourier transform on cyclic groups and finite frames. An overview for the notion and structure of finite wavelet groups appears in section 3. In section 4, we give main results of the current paper. The results will be accompanied by some concrete examples.
2. Preliminaries
Throughout this paper, is a prime positive integer. Here, we state a brief review of notations, basics and preliminaries of Fourier analysis and computational harmonic analysis over finite cyclic groups. For more details, we refer the readers to [19, 16, 18, 29]. Here we employ notations of the author in [17, 14, 13, 15, 19, 16, 18, 20, 21].
For a finite group ,
[TABLE]
is a -dimensional complex vector space. For any vector in the indices are taken to be elements in finite group . This space is a Hilbert space under the inner product
[TABLE]
for any . The induced norm is the -norm. Let denotes the cyclic group of elements . Then for , we write . Also
[TABLE]
counts non-zero entries in .
For , the translation operator is defined by
[TABLE]
For , the modulation operator is defined by
[TABLE]
These operators are unitary operators in the -norm. For any , we have and . The unitary discrete Fourier transform (DFT) of is defined by for all where for all we have Therefore, the DFT of at can be written as
[TABLE]
For , the inverse discrete Fourier transform(IDFT) is defined by
[TABLE]
By -norm, DFT is a unitary transform. Thus, for all Parseval formula satisfies. The Polarization identity implies for which is known the Plancherel formula. The unitary DFT (2.1) satisfies
[TABLE]
A finite sequence is called a frame (or finite frame) for , if there exists a positive constant such that
[TABLE]
If (2.2) satisfies only the upper bound then is a Bessel sequence. Any finite sequence in is a Bessel sequence, so that the condition in (2.2) can be reduced to
[TABLE]
for . If , then is a tight frame and if , it is called a Parseval frame. Moreover, if all the frame elements have the same norm it is called equal-norm frame and if all the elements have norm 1 it is called unit-norm frame.
If is a frame for , the synthesis operator is defined by
[TABLE]
The adjoint operator which is known as analysis operator is defined by
[TABLE]
The frame operator is defined by
[TABLE]
and The redundancy of the finite frame is defined by where .
3. Construction of Wavelet Frames over Prime Fields
In this section, we briefly state structure and basic properties of cyclic dilation operators (cf. [12, 19, 13, 26]). We shall present an overview for the notion and structure of finite wavelet groups over prime fields.
3.1. Structure of Finite Wavelet Group over Prime Fields
The set
[TABLE]
is a finite multiplicative Abelian group of order with respect to the multiplication module with the identity element . The multiplicative inverse for is satisfying for some (cf. [24]).
For , the cyclic dilation operator is defined by
[TABLE]
for and , where is the multiplicative inverse of in .
In the following propositions, we state some basic properties of the cyclic dilations.
Proposition 3.1**.**
Let be a positive prime integer. Then
- (i)
For , we have . 2. (ii)
For , we have . 3. (iii)
For , we have . 4. (iv)
For , we have .
The next result also states some properties of the cyclic dilations.
Proposition 3.2**.**
Let be a positive prime integer and . Then
- (i)
The dilation operator is a -homomorphism. 2. (ii)
The dilation operator is unitary in -norm and satisfies
[TABLE] 3. (iii)
For , we have .
The underlying set
[TABLE]
equipped with the following group operations
[TABLE]
[TABLE]
denoted by , is a finite non-Abelian group of order and it is called as finite affine group on integers or the finite wavelet group associated to the integer or simply as -wavelet group.
Next proposition states basic properties of the finite wavelet group .
Proposition 3.3**.**
Let be a positive prime integer. Then is a non-Abelian group of order which contains a copy of as a normal Abelian subgroup and a copy of as a non-normal Abelian subgroup.
3.2. Wavelet Frames over Prime Fields
A finite wavelet system for the complex Hilbert space is a family or system of the form
[TABLE]
for some window signal and a subset of .
If we put and it is called a full finite wavelet system over . A finite wavelet system which spans is a frame and is referred to as a finite wavelet frame over the prime field .
If is a window signal then for , we have
[TABLE]
The following proposition states a formulation for wavelet coefficients via Fourier transform.
Proposition 3.4**.**
Let and . Then,
[TABLE]
Proof.
See Proposition 4.1 of [19]. ∎
Using an analytic approach, the author [19] has presented a concrete formulation for the -norm of wavelet coefficients the formula of which is just stated hereby.
Theorem 3.5**.**
Let be a positive prime integer, be a divisor of , and let be a multiplicative subgroup of of order . Let be a window signal and . Then,
[TABLE]
where
[TABLE]
Proof.
See Theorem 4.2 of [19]. ∎
Remark 3.6*.*
The formulation presented in Theorem 3.5 is an analytic formulation of wavelet coefficients associated to the subgroup . In detail, that formulation originated from an analytic approach which was based on direct computations of cyclic dilations in the subgroup .
Next proposition provides a particular partition of the cyclic multiplicative group . Applying this, a constructive formulation for the -norm of wavelet coefficients has been achieved in the following theorem.
Proposition 3.7**.**
Let be a positive prime integer, be a divisor of , and let be a multiplicative subgroup of of order . Let be a generator of the cyclic group and . Then
- (i)
For , we have iff . 2. (ii)
.
Proof.
See Proposition 3.7 of [30]. ∎
The following theorem presents a constructive formultion for the norm of wavelet coeficients.
Theorem 3.8**.**
Let be a positive prime integer, be a divisor of , and let be a multiplicative subgroup of of order . Let be a generator of the cyclic group and . Let be a window signal and . Then,
[TABLE]
where for all .
Proof.
See Theorem 3.8 [30]. ∎
For a given multiplicative subgroup of , the next theorem gives necessary and sufficient conditions for a finite wavelet system over prime field to be a frame.
Theorem 3.9**.**
Let be a positive prime integer, be a generator of , be a divisor of , be a multiplicative subgroup of of order , and let . Let and be a non-zero window signal. The finite wavelet system is a frame for if and only if the following conditions hold
- (i)
** 2. (ii)
For each , there exists such that .
Proof.
See Theorem 3.9 [30] ∎
The next result, in the matrix language also gives a constructive characterization for the frame conditions of finite wavelet systems over prime fields.
Corollary 3.10**.**
Let be a positive prime integer, be a generator of , be a divisor of , be a multiplicative subgroup of of order , and let . Let and be a non-zero window signal. The finite wavelet system is a frame for if and only if and the matrix of size given by
[TABLE]
is a matrix such that each row has at least a non-zero entry.
Proof.
See Corollary 3.10 [30]. ∎
4. Finite equal norm Parseval wavelet frames over prime fields
Weight frames, controlled frames [5], and scalable frames [28] have been already applied in order to tighten and also to produce Parseval frame of a given frame. However, in general the motivation of these methods in [5, 28] have not been aimed at the norm equality of the frame vectors. These methods are applied not only in finite dimensional Hilbert spaces but also in infinite dimensions. In fact, in the case of infinite dimensions, weighted frames algorithms are designed in such a way that decrease the condition number and provide approximately a tight frame. In [28], some equivalent conditions to scalable frames have been introduced. The principal significance of the constructive approach in the next theorem is that we apply a local scaling on the DFT of a given window function. The structure of these systems allows one to simply manipulate the DFT of the system generator, in order to obtain an ENPF.
The following lemma provides an algebraic tool. This permutation depends on a multiplicative subgroup of of a given size. Note that, for each divisor of the size of a finite cyclic group, there is exactly one subgroup of that size.
Lemma 4.1**.**
Let be a positive prime integer, be a generator of , be a divisor of , and let . Then
[TABLE]
is a permutation of where denotes the floor function.
Proof.
Clearly is well-defined. In order to show that is bijective it suffices to prove that is surjective. For any there exists such that and so it is clear that . Thus the definition implies that ; in particular if , we have . We observe that is a subgroup of of order and , where for any and for any . Given an arbitrary , there exists such that and so there exists such that . One can easily check that . ∎
Here, we apply lemma 4.1, in the following theorem. At first, the permutation defined in (4.1), is served to give a regular rearrangement to frequency components of the DFT of the window function and classify them in order to set cluster scales. Next again via this permutation, we are able to reverse the locally-scaled permuted version of the DFT of the window function to merely a locally-scaled version of the window function. Since the scales are defined positive thus, still this last version fulfills the frame conditions. Under the described procedure, we are thus led to construct a finite equal-norm Parseval frame of such systems for the Hilbert space .
Theorem 4.2**.**
Let be a positive prime integer, be a generator of , be a multiplicative subgroup of of order , be the index of in , and let is defined by
[TABLE]
Let be a non-zero window signal and
[TABLE]
where
[TABLE]
is a diagonal matrix with diagonal block matrices and for , which are constant along diagonals by entries and , respectively. If satisfies the following conditions
- (i)
, 2. (ii)
for each , there exists such that ,
then is an equal-norm Parseval frame for , where .
Proof.
Let be a window function which satisfies conditions (i) and (ii) and . Then and for any , we have Thus, and are well-defined for all . By Lemma 4.1, presents a permutation of and , for any and By Theorem 3.8, we obtain
[TABLE]
Now by (4.2), we get
[TABLE]
Thus, and we have
[TABLE]
Therefore, is a Parseval frame for . Note that, for any and , the operators and are unitary operators and,
[TABLE]
Hence, is an equal-norm Parseval frame for . ∎
Next example demonstrates the design method of equal-norm Parseval finite wavelet system over prime fields, described in Theorem 4.2, in a numerical case.
Example 4.3**.**
Let and be the multiplicative group modulo 7. Then . One of its generators is 3. Consider be a subgroup of size 3 of . So
[TABLE]
We use Theorem 4.2 to choose an appropriate window signal which satisfies the conditions (i) and (ii).
For simplicity in computation, we will consider a special case with least number of non-zero components of . Since the conditions (i) and (ii) rely on the DFT of , so we use IDFT to get . Now, let
[TABLE]
Then
[TABLE]
and is a frame for . By Theorem 4.2, we have
[TABLE]
and
[TABLE]
Also
[TABLE]
By performing on we get a locally-scaled version of which yields the following signals and given by
[TABLE]
and
[TABLE]
Again using IDFT for , we get
[TABLE]
Also
[TABLE]
By Theorem 3.8 and a simple calculation for any , we have
[TABLE]
Hence, is an equal norm Parseval finite wavelet frame for .
In [30], the matrix notion presented in Corollary 3.10, have been applied as a useful tool to determine whether a finite wavelet system forms a frame for . As another application of this notion, the next result for any given window function derives a characterization of all multiplicative subgrups of , for which the associated wavelet system form frames for .
Theorem 4.4**.**
Let be a positive prime integer, such that , and let
[TABLE]
be the factorization of into prime powers, where the prime factors are distinct such that , and . Let be a generator of and
[TABLE]
Then the set of all subgroups of for which the associated finite wavelet systems are frames for consists of exactly those subgroups of of the form
[TABLE]
Hence, the order of any such is
[TABLE]
Proof.
Let . Since , so the set of divisors of is the set of numbers of the form , where for .
Suppose be an arbitrary multiplicative subgroup of . Then, we have . Let . The order of is a divisor of , thus is of the form for some , . For any such , there are two cases to consider, or .
Case . In this case, by Corollary 3.10, the frame conditions for the finite wavelet system can not be satisfied. In fact, we have some zero rows in .
Case . Again applying Corollary 3.10, is a finite wavelet frame if and only if has non-zero rows. Also if be a subgroup of such that |\mathbb{M}|=\prod_{i=1}^{k}q_{i}^{\alpha_{i}-r_{i}}\bigg{|}|\mathbb{M}^{\prime}|, i.e., is a subgroup of then . By this, if is a frame for then, is also a frame for . In other words, the remaining cases of subgroups of satisfying the frame conditions of the finite wavelet system for are those of the form, or for and . ∎
Next example gives a numerical illustration of Theorem 4.4.
Example 4.5**.**
Let and , such that
[TABLE]
where is an orthonormal basis for . Then and . Also is a generator of . The only divisors of so that are equal or less than are, 1,2,3,4. Thus by definition of , we have .
Let , then and we get
[TABLE]
Thus, is a frame for . Since is of order 3, hence the corresponding wavelet systems to subgroups of sizes 6 and 12 i.e., and are also frames for . Note that and are corresponding subgroups to and respectively. So, now we just examine in the case of . We have , and
[TABLE]
Hence, is not a frame for .
Acknowledgements
Some of the results are obtained during the second author’s appointment from the NuHAG group at the University of Vienna. We would like to thank Prof. Hans. G. Feichtinger for his valuable comments and the group for their hospitality.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A.A. Arefijamaal, R.A. Kamyabi-Gol, On the square integrability of quasi regular representation on semidirect product groups , J. Geom. Anal. 19 (3) (2009) 541-552.
- 2[2] A.A. Arefijamaal, E. Zekaee, Signal processing by alternate dual Gabor frames , Appl. Comput. Harmon. Anal. 35 (2013) 535-540.
- 3[3] A.A. Arefijamaal, E. Zekaee, Image processing by alternate dual Gabor frames , Bull. Iranian Math. Soc. 42 (6) (2016) 1305-1314.
- 4[4] P. Balazs, Frames and Finite Dimensionality: Frame Transformation, Classification and Algorithms , Appl. Math. Sci. 2 (43) (2008) 2131-2144.
- 5[5] P. Balazs, J.P. Antonio, A. Grybos, Weighted and controlled frames , Int. J. Wavelets Multiresolut. Inf. Process. 8 (1) (2010) 109-132.
- 6[6] B.G. Bodmann, P.G. Casazza, The road to equal-norm Parseval frames , J. Funct. Anal. 258 (2010) 397-420.
- 7[7] B.G. Bodmann, D.W. Kribs, V.I. Paulsen, Decoherence-insensitive quantum communications by optimal C*-encoding , IEEE Trans. Inform. Theory. 53 ( 2007) 4738-4749.
- 8[8] P.G. Casazza, J. Kova c ˇ ˇ 𝑐 \check{c} evi c ´ ´ 𝑐 \acute{c} , Equal-norm tight frames with erasures , Adv. Comput. Math. 18 (2003) 387-430.
