Nonuniform Filter Banks: New Results and open Problems

Abstract

Abstract. A nonuniform filter bank (FB) is one whose channel decimation rates need not all be equal. While the theory and design of uniform FBs is a very well developed subject, there are several interesting open issues in the area of nonuniform FBs. Most nonuniform FB designs either result in approximate or near-perfect reconstruction, or involve cascading uniform FBs in tree structures. This leaves unanswered many important theoretical issues involved in obtaining perfect reconstruction (PR) in nonuniform FBs. The purpose of this paper is to address these issues. We only study FBs with integer decimation rates, as FBs with rational decimators can also be shown to be transformable to them. The central problem of interest is as follows: Let S be a set of positive integers obeying maximal decimation (i.e., with reciprocals summing to unity). Find necessary and sufficient conditions on S for existence of a PRFB belonging to some FB class C and using S as its set of decimators. The class C is defined by some constraint on the filters of its constituent FBs; examples of interest are the class of all rational FBs (FBs with rational filters), FIR FBs, orthonormal FBs, etc. A condition that immediately suggests itself is the one stating that the integers be arrangeable in a tree so that the required PRFB can be built by cascading uniform PRFBs in a tree structure. However, this condition, while clearly sufficient, is not necessary for many classes C of interest. In fact there are sets violating it which can be used to build delay-chain PRFBs (in which all filters are delays). Many of our new results focus on the class of rational FBs. We strengthen considerably the known necessary conditions in this case, and provide new ones. The basic problem remains unresolved -necessary and sufficient conditions are still unknown, however we believe our work is an important step towards a full solution. We conclude by listing all known conditions, studying their inter-relationship, and pointing out several open problems.

Audlet Filter Banks: A Versatile Analysis/Synthesis Framework Using Auditory Frequency Scales

“…, also called the alias domain representation [16,17]. For ξ ∈ (−1/2; 1/2],X(z) reduces to the following ([20] Section 4)…”

“…More specifically, if D = lcm({d k } k ) and (H j , D) j is the equivalent uniform FB associated with (H k , d k ) k [16,20], then iterating the CG algorithm until convergence is equivalent to computing the FB synthesis with respect to the canonical dual FB of (H j , D) j , which is of the form (G j , D) j , for some sequences of filters (G j ) j (see [21]). Since convergence is achieved within numerical precision in a small number of CG steps we can assume that the proposed synthesis system is characterized by the properties of the filters (G j ) j .…”

“…The TF concentration of the filters together with the downsampling factors in the sub-bands define the TF resolution and redundancy of the transform. FBs come in various flavors and have been extensively treated in the literature (e.g., [16][17][18][19]). The mathematical theory of frames constitutes an interesting alternative background for the interpretation and implementation of FBs (e.g., [20][21][22]).…”

Frame Theory for Signal Processing in Psychoacoustics

“…Therefore, before we indulge in the frame theory of FBs, we also show how a non-uniform FB can be decomposed into its equivalent uniform FB. Such a uniform equivalent of the FB always exists [1,54] and can be obtained as shown in Fig. 9 and described below.…”

Discrete Wavelet Transforms in the Large Time-Frequency Analysis Toolbox for MATLAB/GNU Octave

“…(2) Transform the resulting filterbank to a uniform one using the identity by Akkarakaran and Vaidyanathan [2003] (summarized in Algorithm 17).…”