A Direct Design of Oversampled Perfect Reconstruction FIR Filter Banks

We address a problem to find optimal synthesis filters of oversampled uniform finite-impulse-response (FIR) filter banks (FBs) yielding perfect reconstruction (PR), when we are given an analysis FB, in the case where all the filters have the same length that is twice a factor of downsampling. We show that in this class of FBs, a synthesis FB that achieves PR can be found in closed form with elementary matrix operations, unlike conventional design methods with numerical optimization. This framework allows filter coefficients to be complex as well as real. Due to the extra degrees of freedom in a synthesis FB provided by oversampling, we can determine optimal coefficients of synthesis filters that meet certain criteria. We introduce in this paper two criteria: variance of additive noise and stopband attenuation. We show theoretical results of optimal synthesis filters that minimize these criteria and design examples of oversampled linear-phase FIR FBs and DFT-modulated FBs. Moreover, we discuss applications to signal reconstruction from incomplete channel data in transmission and inverse transform of windowed discrete Fourier transform with 50% overlapping.     

Structures, factorizations, and design criteria for oversampledparaunitary filterbanks yielding linear-phase filters

We present here a special class of oversampled filterbanks (FBs), namely, paraunitary FBs with linear-phase filters. We propose some necessary conditions for the existence of such banks, based on the repartition between type I/II and type II/IV linear-phase filters in the bank. For a subset of these FBs, we develop a factorization that leads to a minimal implementation, as well as a direct parameterization of the FBs in terms of elementary rotation angles. This factorization is applied to some design examples, with two different optimization criteria: coding gain and reconstructibility of lost coefficients     

Oversampled linear-phase perfect reconstruction filterbanks: theory, lattice structure and parameterization

The paper presents the theory, lattice structure, and parameterization for a general class of P-channel oversampled linear-phase perfect reconstruction filterbanks (OLPPRFBs) - systems with sampling factor M (P/spl ges/M) and filter length of L=KM (K/spl ges/1) each. For these OLPPRFBs, the necessary existence conditions on the number of symmetric filters, n/sub /spl beta//, and antisymmetric filters, n/sub /spl alpha//, (i.e., symmetry polarity) are first investigated. VLSI-friendly lattice structures are then developed for two types of OLPPRFBs, type I system (n/sub /spl beta//=n/sub /spl alpha//) and type II system (n/sub /spl beta///spl ne/n/sub /spl alpha//). The completeness and minimality of each type of lattice are also analyzed. Compared with existing work, the proposed lattices are the most general and efficient ones for OLPPRFBs. Besides, through the lattice structures, the sufficiency of the existence conditions is also verified. Next, lifting-based structures are proposed to parameterize a left invertible matrix and all of its left inverses, which leads to unconstrained optimization as well as robust implementation of OLPPRFBs. Finally, several design examples are presented to confirm the validity of the theory and demonstrate the versatility of synthesis filterbanks in the oversampled system.     

A class of regular biorthogonal linear-phase filterbanks: theory, structure, and application in image coding

This paper discusses a method of regularity imposition onto biorthogonal linear-phase M-band filterbanks using the lattice structure. A lifting structure is proposed for lattice matrix parameterization where regularity constraints can be imposed. The paper focuses on cases with analysis and synthesis filterbanks having up to two degrees of regularity. Necessary and sufficient conditions for regular filterbanks in terms of the filter impulse response, frequency response, scaling function, and wavelets are revisited and are derived in terms of the lattice matrices. This also leads to a constraint on the minimum filter length. Presented design examples are optimized for the purpose of image coding, i.e., the main objectives are coding gain and frequency selectivity. Simulation results from an image coding application also show that these transforms yield improvement in the perceptual quality in the reconstruction images. The approach has also been extended to the case of integer/rational lifting coefficients, which are desirable in many practical applications.     

A new class of biorthogonal wavelet systems for image transformcoding

We construct general biorthogonal Coifman wavelet systems, a new class of compactly supported biorthogonal wavelet systems with vanishing moments equally distributed for a scaling function and wavelet pair. A time-domain design method is employed and closed-form expressions for the impulse responses and the frequency responses of the corresponding dual filters are derived. The resulting filter coefficients are all dyadic fractions, which is an attractive feature in the realization of multiplication-free discrete wavelet transform. Even-ordered systems in this family are symmetric, which correspond to linear-phase dual filters. In particular, three filterbanks (FBs) in this family are systematically verified to have competitive compression potential to the 9-7 tap biorthogonal wavelet FB by Cohen et al. (1992), which is currently the most widely used one in the field of wavelet transform coding. In addition, the proposed FB's have much smaller computational complexity in terms of floating-point operations required in transformation, and therefore indicate a better tradeoff between compression performance and computational complexity.     

Frame-theoretic analysis of oversampled filter banks

We provide a frame-theoretic analysis of oversampled finite impulse response (FIR) and infinite impulse response (FIR) uniform filter banks (FBs). Our analysis is based on a new relationship between the FBs polyphase matrices and the frame operator corresponding to an FB. For a given oversampled analysis FB, we present a parameterization of all synthesis FBs providing perfect reconstruction. We find necessary and sufficient conditions for an oversampled FB to provide a frame expansion. A new frame-theoretic procedure for the design of paraunitary FBs from given nonparaunitary FBs is formulated. We show that the frame bounds of an FB can be obtained by an eigen-analysis of the polyphase matrices. The relevance of the frame bounds as a characterization of important numerical properties of an FB is assessed by means of a stochastic sensitivity analysis. We consider special cases in which the calculation of the frame bounds and synthesis filters is simplified. Finally, simulation results are presented     

Frame-Theory-Based Analysis and Design of Oversampled Filter Banks: Direct Computational Method

This paper studies the frames corresponding to oversampled filter banks (FBs). For this class of FB frames, we present a state-space parameterization of perfect reconstruction FB frames and explicit and numerically efficient formulas to compute the tightest frame bounds, to obtain the dual FB frame, and to construct a tight (paraunitary) FB frame from a given untight (nonparaunitary) FB frame. The derivation uses well-developed techniques from modern control theory, which results in the unified formulas for generic infinite-impulse-response (IIR) and finite-impulse-response (FIR) FBs. These formulas involve only algebraic manipulations of real matrices and can be computed efficiently, reliably, and exactly without the approximation required in the existing methods for generic FBs. The results provide a unified framework for frame-theory-based analysis and systematic design of oversampled filter banks     

Framing pyramids

Burt and Adelson (1983) introduced the Laplacian pyramid (LP) as a multiresolution representation for images. We study the LP using the frame theory, and this reveals that the usual reconstruction is suboptimal. We show that the LP with orthogonal filters is a tight frame, and thus, the optimal linear reconstruction using the dual frame operator has a simple structure that is symmetric with the forward transform. In more general cases, we propose an efficient filterbank (FB) for the reconstruction of the LP using projection that leads to a proved improvement over the usual method in the presence of noise. Setting up the LP as an oversampled FB, we offer a complete parameterization of all synthesis FBs that provide perfect reconstruction for the LP. Finally, we consider the situation where the LP scheme is iterated and derive the continuous-domain frames associated with the LP.     

Linear-phase perfect reconstruction filter bank: lattice structure,design, and application in image coding

A lattice structure for an M-channel linear-phase perfect reconstruction filter bank (LPPRFB) based on the singular value decomposition (SVD) is introduced. The lattice can be proven to use a minimal number of delay elements and to completely span a large class of LPPRFBs: all analysis and synthesis filters have the same FIR length, sharing the same center of symmetry. The lattice also structurally enforces both linear-phase and perfect reconstruction properties, is capable of providing fast and efficient implementation, and avoids the costly matrix inversion problem in the optimization process. From a block transform perspective, the new lattice can be viewed as representing a family of generalized lapped biorthogonal transform (GLBT) with an arbitrary number of channels M and arbitrarily large overlap. The relaxation of the orthogonal constraint allows the GLBT to have significantly different analysis and synthesis basis functions, which can then be tailored appropriately to fit a particular application. Several design examples are presented along with a high-performance GLBT-based progressive image coder to demonstrate the potential of the new transforms     

A simple method to build oversampled filter banks and tight frames.

This paper presents conditions under which the sampling lattice for a filter bank can be replaced without loss of perfect reconstruction. This is the generalization of common knowledge that removing up/downsampling will not lose perfect reconstruction. The results provide a simple way of building oversampled filter banks. If the original filter banks are orthogonal, these oversampled banks construct tight frames of l2 (Z(n)) when iterated. As an example, a quincunx lattice is used to replace the rectangular one of the standard wavelet transform. This replacement leads to a tight frame that has a higher sampling in both time and frequency. The frame transform is nearly shift invariant and has intermediate scales. An application of the transform to image fusion is also presented.     

M-Channel Nonlinear Phase Filter Banks in Image Compression: Structure, Design, and Signal Extension

This paper describes a transform coding technique based on M-channel perfect reconstruction filter banks with a nonlinear phase. In contrast with linear-phase filter banks, the nonlinearity provides an extra degree of freedom that can be used to design a more efficient transform. We present new lattice structures of paraunitary and perfect reconstruction (biorthogonal) filter banks, which can be implemented with a lower computational complexity and/or represented by a few free parameters, through the decomposition of the lattice blocks and the displacement across the delay block. We further discuss a smooth extension method for nonlinear-phase filter banks to obtain a nonexpansive transform. The promise of our proposed approaches is demonstrated through several design examples, extended signals and compression results     

Design of M‐Channel IIR Uniform DFT Filter Banks Using Recursive Digital Filters

In this paper, we propose a method for designing a class of M‐channel, causal, stable, perfect reconstruction, infinite impulse response (IIR), and parallel uniform discrete Fourier transform (DFT) filter banks. It is based on a previously proposed structure by Martinez et al. [1] for IIR digital filter design for sampling rate reduction. The proposed filter bank has a modular structure and is therefore very well suited for VLSI implementation. Moreover, the current structure is more efficient in terms of computational complexity than the most general IIR DFT filter bank, and this results in a reduced computational complexity by more than 50% in both the critically sampled and oversampled cases. In the polyphase oversampled DFT filter bank case, we get flexible stop‐band attenuation, which is also taken care of in the proposed algorithm.     

一种最优去噪线性相位滤波器组的FPGA实现

格型结构是一种可以快速高效设计过采样线性相位完全重建滤波器组的方法。一旦分析滤波器组设定后,对应的综合滤波器结构也就确定,但综合滤波器组参数却有很大的灵活性,从中可以找出具有最优去噪效果的综合滤波器组,构成一个完整的滤波器组。对于求解出的具有最优去噪效果的过采样线性相位完全重构滤波器组,文中用DSP Builder在FPGA上予以实现,并用modelsim进行功能仿真。     

DS/CDMA signature sequences based on PR-QMF banks

In this paper, we propose two classes of multivalued signature sequences for direct sequence code division multiple access (DS/CDMA) systems. The proposed classes are obtained from the coefficients of the subbands of perfect reconstruction quadrature mirror filterbanks (PR-QMF). The first and second classes are derived from the tree and lattice structure PR-QMF banks, respectively, and they both have perfect correlation properties for synchronous DS/CDMA systems. The second class, in addition, has generally better correlation properties than other well-known sequences in asynchronous DS/CDMA systems. Some numerical results for the performance of the asynchronous DS/CDMA systems with several sequences, including the second class of sequences, are obtained.     

Orthonormal FBs With Rational Sampling Factors and Oversampled DFT-Modulated FBs: A Connection and Filter Design

Methods widely used to design filters for uniformly sampled filter banks (FBs) are not applicable for FBs with rational sampling factors and oversampled discrete Fourier transform (DFT)-modulated FBs. In this paper, we show that the filter design problem (with regularity factors/vanishing moments) for these two types of FBs is the same. Following this, we propose two finite-impulse-response (FIR) filter design methods for these FBs. The first method describes a parameterization of FBs with a single regularity factor/vanishing moment. The second method, which can be used to design FBs with an arbitrary number of regularity factors/vanishing moments, uses results from frame theory. We also describe how to modify this method so as to obtain linear phase filters. Finally, we discuss and provide a motivation for iterated DFT-modulated FBs.     

Efficient design of oversampled NPR GDFT filterbanks

We propose a flexible, efficient design technique for the prototype filter of an oversampled near perfect reconstruction (NPR) generalized discrete Fourier transform (GDFT) filterbank. Such filterbanks have several desirable properties for subband processing systems that are sensitive to aliasing, such as subband adaptive filters. The design criteria for the prototype filter are explicit bounds (derived herein) on the aliased components in the subbands and the output, the distortion induced by the filterbank, and the imaged subband errors in the output. It is shown that the design of an optimal prototype filter can be transformed into a convex optimization problem, which can be efficiently solved. The proposed design technique provides an efficient and effective tool for exploring many of the inherent tradeoffs in the design of the prototype filter, including the tradeoff between aliasing in the subbands and the distortion induced by the filterbank. We calculate several examples of these tradeoffs and demonstrate that the proposed method can generate filters with significantly better performance than filters obtained using current design methods.     

Design and multiplier-less implementation of a class of two-channel PR FIR filterbanks and wavelets with low system delay

A new method for designing two-channel PR FIR filterbanks with low system delay is proposed. It is based on the generalization of the structure previously proposed by Phoong et al. (1995) Such structurally PR filterbanks are parameterized by two functions (/spl beta/(z) and /spl alpha/(z)) that can be chosen as linear-phase FIR or allpass functions to construct FIR/IIR filterbanks with good frequency characteristics. The case of using identical /spl beta/(z) and /spl alpha/(z) was considered by Phoong et al. with the delay parameter M chosen as 2N-1. In this paper, the more general ease of using different nonlinear-phase FIR functions for /spl beta/(z) and /spl alpha/(z) is studied. As the linear-phase constraint is relaxed, the lengths of /spl beta/(z) and /spl alpha/(z) are no longer restricted by the delay parameters of the filterbanks. Hence, higher stopband attenuation can still be achieved at low system delay. The design of the proposed low-delay filterbanks is formulated as a complex polynomial approximation problem, which can be solved by the Remez exchange algorithm or analytic formula with very low complexity. In addition, the orders and delay parameters can be estimated from the given filter specifications using a simple empirical formula. Therefore, low-delay two-channel PR filterbanks with flexible stopband attenuation and cutoff frequencies can be designed using existing filter design algorithms. The generalization of the present approach to the design of a class of wavelet bases associated with these low-delay filterbanks and its multiplier-less implementation using the sum of powers-of-two coefficients are also studied.     

Tree-structured oversampled filterbanks as joint source-channel codes: application to image transmission over erasure channels

This paper studies oversampled filterbanks for robust transmission of multimedia signals over erasure channels. Oversampled filterbanks implement frame expansions of signals in l/sup 2/(Z). The dependencies between the expansion coefficients introduced by the oversampled filterbank are first characterized both in the z-domain and in the time-domain. Conditions for recovery of some typical erasure patterns like bursty erasure patterns are derived. The analysis leads to the design of two erasure recovery algorithms that are first studied without quantization noise. The reconstruction algorithm derived from the time-domain analysis exploits the fact that an oversampled filterbank represents signals with more than one set of basis functions. The erased samples are first reconstructed from the received ones, and then, signal space projection is applied. The effect of quantization noise on the reconstructed signal is studied for both algorithms. Using image signals, the theoretical results are validated for a number of erasure patterns, considering unequal error protection enabled tree-structured decompositions.     

Biorthogonal Butterworth wavelets derived from discreteinterpolatory splines

We present a new family of biorthogonal wavelet transforms and a related library of biorthogonal periodic symmetric waveforms. For the construction, we used the interpolatory discrete splines, which enabled us to design a library of perfect reconstruction filterbanks. These filterbanks are related to Butterworth filters. The construction is performed in a “lifting” manner. The difference from the conventional lifting scheme is that all the transforms are implemented in the frequency domain with the use of the fast Fourier transform (FFT). Two ways to choose the control filters are suggested. The proposed scheme is based on interpolation, and as such, it involves only samples of signals, and it does not require any use of quadrature formulas. These filters have a linear-phase property, and the basic waveforms are symmetric. In addition, these filters yield refined frequency resolution     

Variable-length lapped transforms with a combination of multiple synthesis filter banks for image coding.

A class of lapped transforms for image coding, which are characterized by variable-length synthesis filters, is introduced. In this class, the synthesis filter bank (FB) is first defined with an arbitrary combination of finite impulse response synthesis filters of perfect reconstruction FBs. An analysis FB is then obtained using direct matrix inversion or iterative implementation of Neumann series expansion. Moreover, to improve compression, we introduce a unitary transform that follows the analysis FB. This class enables a greater freedom of design than previously presented variable-length lapped transforms. We illustrate several design examples and present experimental results for image coding, which indicate that the proposed transforms are promising and comparable with conventional subband transforms including wavelets.