基于线性迭代的DFT调制滤波器组的设计算法

该文研究了单原型的DFT调制滤波器组的设计方法。在该方法中,滤波器组的设计问题被归结为一个无约束的优化问题,其目标函数为滤波器组的传递失真、混叠失真和原型滤波器的阻带能量的加权和。结合线性化方法,原型滤波器通过迭代求解。在单步迭代中,原型滤波器的系数通过解析式求解得到。仿真表明,与传统的设计算法相比,本文方法设计所得的DFT调制滤波器组重构误差减小了约40dB,阻带衰减提高了约2dB。并且新算法的计算复杂度明显低于传统算法。     

双原型离散傅里叶变换调制滤波器组的快速设计方法

针对大规模的离散傅里叶变换(DFT)调制滤波器组设计算法复杂度高的问题,该文提出一种基于无约束优化的快速设计算法。该算法将两个原型滤波器的设计问题归结为一个无约束优化问题,将滤波器组的传递失真,混叠失真以及原型滤波器阻带能量的加权和作为目标函数。进而,采用双迭代机制来求解该优化问题。在单步迭代中,运用矩阵求逆的等效条件和Toeplitz矩阵求逆的快速算法,显著地降低了迭代的计算代价。仿真对比表明,与已有的设计算法相比,新算法计算代价低 ,可以得到整体性能更好的滤波器组,并且可以快速设计大规模的滤波器组。     

二维双原型完全过采样DFT调制滤波器组的快速设计方法

传统的2维大规模滤波器组的设计方法具有复杂度高的缺点。该文提出一种设计2维双原型滤波器组的快速方法,该方法利用近似完全重构的条件,并采用完全过采样的离散傅里叶变换(DFT)调制滤波器组来设计。新算法将两个原型滤波器的设计问题归结为一个无约束优化问题,其中目标函数为滤波器组的总体失真(传递失真和混叠失真)与原型滤波器阻带能量的加权和,利用目标函数的梯度向量,通过双迭代机制求解该优化问题。单步迭代中,利用矩阵求逆的等效条件和块Toeplitz矩阵求逆的快速算法,显著地降低了计算复杂度。理论分析和数值实验表明,新算法可以得到整体性能更好的滤波器组,计算复杂度大幅度降低,故可以快速设计大规模的2维滤波器组。     

Design of 2D oversampled linear phase DFT modulated filter banks via modified Newton's method

In this paper, the structure of the 2D oversampled DFT modulated filter banks is analyzed and a spatial-domain condition of a filter bank without transfer function distortion is derived. Based upon the spatial-domain condition, a modified Newton's method is presented for fast design of 2D oversampled linear phase (LP) DFT modulated filter banks with nearly perfect reconstruction (NPR). We formulate the design problem into an unconstrained optimization with a fourth-order objective function, which is the weighted sum of the transfer function distortion of the filter bank and the stopband energy of the prototype filter (PF). The optimization is solved by the modified Newton's method, where each of iterations updates the PF by a set of linear equations. It is proved that the iteration process fast converges to a stationary point of the objective function. Compared with the existing methods, the new method is fast in computation and can design 2D filter banks with a large number of subbands.     

一种设计近似完全重构非均匀余弦调制滤波器组的新算法

该文提出了一种设计近似完全重构非均匀余弦调制滤波器组的新算法。针对现有合并算法中非均匀滤波器组性能无法直接控制优化的缺点,新算法把非均匀滤波器组的设计问题归纳为一个关于原型滤波器的无约束优化问题,其中目标函数是非均匀滤波器组传递失真与原型滤波器阻带能量的加权和,最后利用线性迭代算法求解该优化问题。理论分析和数值实验表明,新算法获得的非均匀余弦调制滤波器组比现有算法设计的滤波器组整体性能更佳。     

Iterative method for the design of DFT filter Bank

Multirate adaptive filters have numerous advantages such as low computational load, fast convergence, and parallelism in the adaptation. Drawbacks when using multirate processing are mainly related to aliasing and reconstruction effects. These effects can be minimized by introducing appropriate problem formulation and employing sophisticated optimization techniques. In this paper, we propose a formulation for the design of a filter bank which controls the distortion level for each frequency component directly and minimizes the inband aliasing and the residual aliasing between different subbands. The advantage of this problem formulation is that the distortion level can be weighted for each frequency depending on the particular practical application. A new iterative algorithm is proposed to optimize simultaneously over both the analysis and the synthesis filter banks. This algorithm is shown to have a unique solution for each iteration. For a fixed distortion level, the proposed algorithm yields a significant reduction in both the inband aliasing and the residual aliasing levels compared to existing methods applied to the numerical examples.     

Theory and design of signal-adapted FIR paraunitary filter banks

We study the design of signal-adapted FIR paraunitary filter banks, using energy compaction as the adaptation criterion. We present some important properties that globally optimal solutions to this optimization problem satisfy. In particular, we show that the optimal filters in the first channel of the filter bank are spectral factors of the solution to a linear semi-infinite programming (SIP) problem. The remaining filters are related to the first through a matrix eigenvector decomposition. We discuss uniqueness and sensitivity issues. The SIP problem is solved using a discretization method and a standard simplex algorithm. We also show how regularity constraints may be incorporated into the design problem to obtain globally optimal (in the energy compaction sense) filter banks with specified regularity. We also consider a problem in which the polyphase matrix implementation of the filter bank is constrained to be DCT based. Such constraints may also be incorporated into our optimization algorithm; therefore, we are able to obtain globally optimal filter banks subject to regularity and/or computational complexity constraints. Numerous experiments are presented to illustrate the main features that distinguish adapted and nonadapted filters, as well as the effects of the various constraints. The conjecture that energy compaction and coding gain optimization are equivalent design criteria is shown not to hold for FIR filter banks     

Two-Channel FIR Filter Banks Utilizing the FRM Approach

The frequency-response masking (FRM) approach has been introduced as a means of generating narrow transition band linear-phase finite impulse response (FIR) filters with a low arithmetic complexity. This paper proposes an approach for synthesizing two-channel maximally decimated FIR filter banks utilizing the FRM technique. For this purpose, a new class of FRM filters is introduced. Filters belonging to this class are used for synthesizing nonlinear-phase analysis and synthesis filters for two types of two-channel filter banks. For the first type, there exist no phase distortion and aliasing errors, but this type suffers from a small amplitude distortion as for the well-known quadrature mirror filter (QMF) banks. Compared to conventional QMF filter banks, the proposed banks lower significantly the overall arithmetic complexity at the expense of a somewhat increased overall filter bank delay in applications demanding narrow transition bands. For the second type, there are also small aliasing errors, allowing one to reduce the arithmetic complexity even further. Efficient structures are introduced for implementing the proposed filter banks, and algorithms are described for maximizing the stopband attenuations of the analysis and synthesis filters in the minimax sense subject to the given allowable amplitude and/or aliasing errors. Examples are included illustrating the benefits provided by the proposed filter banks.     

A simple design method for near-perfect-reconstruction nonuniformfilter banks

In this correspondence, we propose a simple design method for nonuniform integer-decimated filter banks based on a uniform cosine-modulated filter bank. The resulting distortion and aliasing are comparable to the stopband attenuation of the prototype filter. Examples are given to demonstrate the proposed method     

Design of NPR DFT-Modulated Filter Banks via Iterative Updating Algorithm

In this paper, an efficient algorithm is proposed to design nearly-perfect-reconstruction (NPR) DFT-modulated filter banks. First, the perfect-reconstruction (PR) condition of the oversampled DFT-modulated filter banks in the frequency domain is transformed into a set of quadratic equations with respect to the prototype filter (PF) in the time domain. Second, the design problem is formulated as an unconstrained optimization problem that involves PR condition and stopband energy of the PF. With the gradient vector of the objective function, an efficient iterative algorithm is presented to design the PF, which is updated with linear matrix equations at each iteration. The algorithm is identified as a modified Newton’s method, and its convergence is proved. Numerical examples and comparison with many other existing methods are included to demonstrate the effectiveness of the proposed method.     

An efficient algorithm for the design of weighted minimax M-channelcosine-modulated filter banks

This correspondence presents an efficient algorithm for the design of M-channel cosine-modulated filter banks. Our algorithm needs only a few iterations to obtain a weighted minimax solution and provides flexible control of the ripples in the filter's stopband, the overall filter bank transfer function, and the aliasing components     

Numerically efficient optimal design of cosine-modulated filter banks with peak-constrained least-squares behavior

Several current applications related to signal compression and representation and high-speed transmission require very selective filter banks/transmultiplexers. A possible solution is to employ the cosine-modulated filter banks/transmultiplexers (CMFBTs) where the prototype filters satisfy demanding constraints with respect to both the total stopband energy and maximum stopband ripple. This work proposes an efficient procedure to design nearly-perfect reconstruction CMFBT prototype filters with peak-constrained least-squares characteristics using a modified weighted least-squares algorithm. Substantial flexibility is added in the design of the magnitude response of the prototype filter, ranging from minimum stopband energy to minimum stopband ripple, which may be required in many applications. Some constraints are imposed to the CMFBTs in order to control the direct transfer and aliasing distortion functions, related to the intercarrier and intersymbol interferences. Algebraic simplifications are also provided on the overall objective function and associated constraints, leading to substantial reduction on the computational burden of the optimization process. The procedure is proven to be very powerful in designing CMFBT systems satisfying multiple constraints as indicated by numerical examples.     

Near-perfect-reconstruction pseudo-QMF banks

A novel approach to the design of M-channel pseudo-quadrature mirror filter (QMF) banks is presented. In this approach, the prototype filter is constrained to be a linear-phase spectral-factor of a 2Mth band filter. As a result, the overall transfer function of the analysis/synthesis system is a delay. Moreover, the aliasing cancellation (AC) constraint is derived such that all the significant aliasing terms are canceled. Consequently, the aliasing level at the output is comparable to the stopband attenuation of the prototype filter. In other words, the only error at the output of the analysis/synthesis system is the aliasing error which is at the level of stopband attenuation. Using this approach, it is possible to design a pseudo-QMF bank where the stopband attenuation of the analysis (and thus synthesis) filters is on the order of -100 dB. Moreover, the resulting reconstruction error is also on the order of -100 dB. Several examples are included     

Design of Time–Frequency Localized Filter Banks: Transforming Non-convex Problem into Convex Via Semidefinite Relaxation Technique

We present a method for designing optimal biorthogonal wavelet filter banks (FBs). Joint time–frequency localization of the filters has been chosen as the optimality criterion. The design of filter banks has been cast as a constrained optimization problem. We design the filter either with the objective of minimizing its frequency spread (variance) subject to the constraint of prescribed time spread or with the objective of minimizing the time spread subject to the fixed frequency spread. The optimization problems considered are inherently non-convex quadratic constrained optimization problems. The non-convex optimization problems have been transformed into convex semidefinite programs (SDPs) employing the semidefinite relaxation technique. The regularity constraints have also been incorporated along with perfect reconstruction constraints in the optimization problem. In certain cases, the relaxed SDPs are found to be tight. The zero duality gap leads to the global optimal solutions. The design examples demonstrate that reasonably smooth wavelets can be designed from the proposed filter banks. The optimal filter banks have been compared with popular filter banks such as Cohen–Daubechies–Feauveau biorthogonal wavelet FBs, time–frequency optimized half-band pair FBs and maximally flat half-band pair FBs. The performance of optimal filter banks has been found better in terms of joint time–frequency localization.     

Efficient Design of High-Complexity Cosine Modulated Filter Banks Using $2 M$th Band Conditions

This paper presents several new properties of biorthogonal cosine modulated filter banks (CMFBs) and efficient algorithms for designing CMFBs with a very large number of subbands and very long filters. For a biorthogonal CMFB, we find the periodicity and symmetry of its overall transfer function and aliasing transfer functions which can be efficiently computed based on a decimated uniform discrete Fourier transform (DFT) analysis filter bank. By exploiting gradient information and $2 M$th band conditions, efficient algorithms are proposed for designing both orthogonal and biorthogonal CMFBs. In addition, an efficient matrix inversion algorithm with $O(N^{2} )$ complexity is also presented. Several numerical examples and comparisons with many other existing methods are included to demonstrate the design performance and efficiency of the algorithms.      

基于QPSO算法的准完全重构余弦调制滤波器组的优化设计

提出了一种准完全重构的余弦调制滤波器组的设计方法,使用优化方法设计原型滤波器。该方法固定原型滤波器的阻带截止频率为ωs=π/M,以通带截止频率ωp为参数变量,用量子粒子群优化算法(QPSO)优化满足重构条件的目标函数,间接设计原型滤波器,然后通过调制得到余弦调制滤波器组。稍微放宽余弦调制滤波器组的精确条件,从而大大降低了设计的复杂性,减少运行时间。仿真实验结果表明,该算法简单有效,可获得具有高阻带衰减、低混叠误差和重构误差的余弦调制滤波器组。     

Uniform FIR filterbank optimization with group delay specifications

We characterize the delay properties of uniformly modulated finite impulse response (FIR) filterbanks. Conditions on the permissable delay are developed for this class of filterbanks when the perfect reconstruction condition is relaxed. Accurate linear approximations for the phase and the group delay of the total filterbank are derived. These approximations allow linear phase or group delay constraints to be introduced in the filter optimization problem. A tractable quadratic optimization problem for the design of optimal analysis and synthesis filter prototypes is proposed. The problem involves the minimization of the aliasing distortion while constraining group delay and amplitude distortion. Thus, a new algorithm is presented to solve this optimization problem for the analysis and synthesis filterbanks simultaneously. Numerical examples are presented that confirm the theoretical results and verify that the approximations used are highly accurate.     

Minimax design of two-channel nonuniform-division filterbanks using IIR allpass filters

The design of two-channel linear-phase nonuniform-division filter (NDF) banks constructed by infinite impulse response (IIR) digital allpass filters (DAFs) in the sense of L/sub /spl infin// error criteria is considered. First, the theory of two-channel NDF bank structures using two IIR DAFs is developed. Then, the design problem is appropriately formulated to result in a simple optimization problem. Utilizing a variant of Karmarkar's algorithm, we can efficiently solve the optimization problem through a frequency sampling and iterative approximation method to find the coefficients for the IIR DAFs. The resulting two-channel NDF banks can possess approximately linear-phase response without magnitude distortion. The effectiveness of the proposed technique is achieved by forming an appropriate Chebyshev approximation of a desired phase response and then to find its solution from a linear subspace in a few iterations. Several simulation examples are presented for illustration and comparison.     

Design of Biorthogonal Filter Banks Using a Multi-objective Genetic Algorithm for an Image Coding Scheme

In this paper, we present an optimization method based on a multi-objective Genetic Algorithm (GA) for the design of linear phase filter banks for an image coding scheme. To be effective, the filter banks should satisfy a number of desirable criteria related to such a scheme. Instead of imposing the entire PR condition as in conventional designs, we introduce flexibility in the design by relaxing the Perfect Reconstruction (PR) condition and defining a PR violation measure as an objective criterion to maintain near perfect reconstruction (N-PR) filter banks. Particularly in this work, the designed filter banks are near-orthogonal. This has been made possible by minimizing the deviation from the orthogonality in the optimization process. The optimization problem is formulated as a constrained multi-objective, and a modified Nondominated Sorting Genetic Algorithm NSGAII is proposed in this work to find the Pareto optimal solutions that achieve the best compromise between the different objective criteria. The experimental results show that the filter banks designed with the proposed method outperform significantly the 9/7 filter bank of JPEG2000 in most cases. Furthermore, the filter banks are near orthogonal. This is very helpful, especially where embedded coding is required.     

Aliasing reduction in sub-bands of cascaded filter banks with decimation

A method for the reduction of aliasing in sub-band signals of cascaded filter banks with decimation is presented. The aliasing reduction is achieved by simple butterfly operations between filter bank outputs without influencing the reconstruction properties of analysis/synthesis systems.<>