M带均匀最大抽取滤波器组

采用同时考虑幅度和延时特性的IIR型通用参数滤波器作为构件组成滤波器组,以单个滤波器特性相互叠加为基础,设计时使相邻滤波器在交界频率点满足一定条件,并对各过渡带区的组合特性施以优化和采取抗混叠、串话措施,便可做到以一定精度逼近于信号完全重构的滤波器组,是新的设计理论和方法。     

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

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

基于DSP+Builder线性相位滤波器组格型设计与实现

分析了线性相位完全重构滤波器组(LPPRF)的分析滤波器和综合滤波器,研究了一种线性相位滤波器组设计方法,格型结构。通过求解滤波器组的Lattice系数,进行了两通道线性相位完全重构滤波器组的格型结构设计。提出一种设计方案,利用DSP Builder技术,将Matlab/simulink设计工具和QuartusⅡ设计工具结合起来,实现有限冲激响应格型滤波器组.并以一个高阶低通FIR格型滤波器组的实现为例,设计并完成软硬件仿真与验证。结果表明,该方法简单易行,能满足设计要求。     

线性相位余弦调制滤波器组研究

图像子带编码要求滤波器组具有线性相位特性，非线性相位特性可对图像编译码带来影响。现研究了一种具有线性相位的最大抽取FIR余弦调制滤波器组，该滤波器组中每一个滤波器都具有线性相位，且由原型滤波器经余弦序列调制得到。经推导这种滤波器组可以设计成具有近似准确重构（NPR）特性或准确重构（PR）特性，文中分别给出了两种情况下滤波器组应满足的条件。通过对一幅图像的二维可分离滤波实验说明了当原型滤波器满足一定条件时滤波器组是准确重构的。     

最小延迟M带余弦调制小波滤波器组设计

本文推导了最小延迟任意长度M带余弦调制小波滤波器组的完全重构条件。选择低通原型滤波器最大阻带衰减为优化的目标函数,通常的优化目标函数选用最小平方逼近的方法,本文提出了使用最佳一致逼近的方法。最后用黄金分割和牛顿迭代方法解决非线性约束优化极值问题,得到满足几乎完全重构和小波正则性条件的低通原型滤波器。     

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

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

近似完全重构IIR余弦调制滤波器组的优化设计

提出一种新的近似完全重构因果稳定的IIR余弦调制滤波器组的设计方法。基于预先给定的极点值,IIR原型滤波器的设计问题可以简化成一个凸极大值极小化的优化问题,从而采用二阶锥规划法求解。所得余弦调制滤波器组具有良好的频率特性和合理的完全重构误差。所设计的原型滤波器是因果稳定的,并且其多相因子分母相同,简化了完全重构条件,可以用来进一步优化得到的完全重构系统。     

一种基于遗传算法的混合滤波器组设计方法

针对可满足近似完全重构的双通道混合滤波器组,其中高阶数的模拟滤波器一般不容易设计优化。采用遗传算法设计5阶模拟分解滤波器,并基于逆快速傅里叶变换实现数字综合滤波器的设计优化以滤除掉镜像频谱,保证近似完全重构。文中设计了由5阶模拟分解滤波器和32阶数字综合滤波器组成的混合滤波器组,仿真结果表明:可以实现的最大失真误差为4.761 8×10-11dB,平均失真误差为-9.2×10-14dB,最大混叠误差为-154 dB,平均混叠误差为-200 dB,可满足24 bits的模数转换器系统的要求。     

两通道完全重构滤波器组的设计方法:因式分解法

本文首先研究了两通道滤波器组设计的完全重构的条件以及Euclidean多项式的性质 ,提出了基于因式分解的两通道完全重构滤波器组的设计方法 .该方法不需要进行强的非线性优化计算而可以实现真正的结构化的完全重构滤波器组 .文中描述了这种方法的推导过程 ,给出了设计步骤 ,最后通过给出的设计例子 ,说明该方法是有效的     

两通道完全重构滤波器组的设计方法:因式分解法

本文首先研究了两通道滤波器组设计的完全重构的条件以及Euclidean多项式的性质,提出了基于因式分解的两通道完全重构滤波器组的设计方法.该方法不需要进行强的非线性优化计算而可以实现真正的结构化的完全重构滤波器组.文中描述了这种方法的推导过程,给出了设计步骤,最后通过给出的设计例子,说明该方法是有效的.     

Oversampled cosine-modulated filter banks with arbitrary systemdelay

Design methods for perfect reconstruction (PR) oversampled cosine-modulated filter banks with integer oversampling factors and arbitrary delay are presented. The system delay, which is an important parameter in real-time applications, can be chosen independently of the prototype lengths. Oversampling gives us additional freedom in the filter design process, which can be exploited to find FIR PR prototypes for oversampled filter banks with much higher stopband attenuations than for critically subsampled filter banks. It is shown that for a given analysis prototype, the PR synthesis prototype is not unique. The complete set of solutions is discussed in terms of the nullspace of a matrix operator. For example, oversampling allows the design of PR filter banks having unidentical prototypes (of equal and unequal lengths) for the analysis and synthesis stage. Examples demonstrate the increased design freedom due to oversampling. Finally, it is shown that PR prototypes being designed for the oversampled case can also serve as almost-PR prototypes for critically subsampled cosine-modulated pseudo QMF banks     

Time-varying analysis-synthesis systems based on filter banks andpost filtering

Perfect reconstruction (PR) time-varying analysis-synthesis filter banks are those in which the filters are allowed to change from one set of PR filter banks to another as the input signal is being processed. Such systems have the property that, in the absence of coding, they faithfully reconstruct every sample of the input. Various methods have been reported for the time-varying filter bank design; all of them, however, utilize structures for conventional PR filter banks. These conventional structures that have been applied in the past result in different limitations in each method. This paper introduces a new structure for exactly reconstructing time-varying analysis-synthesis filter banks. This structure consists of the conventional filter bank followed by a time-varying post filter. The new method requires neither the redesign of the analysis sections nor the use of any intermediate analysis filters during transition periods. It provides a simple and elegant procedure for designing time-varying filter banks without the disadvantages of the previous methods     

Design of practically perfect-reconstruction cosine-modulated filter banks: a second-order cone programming approach

Designing optimal perfect-reconstruction (PR) and near PR (NPR) cosine-modulated filter banks is essentially a constrained nonlinear minimization problem. This paper proposes two second-order cone-programming based algorithms for designing NPR and practically PR cosine-modulated filter banks with improved performance relative to several established design methods.     

Design of linear phase M-channel perfect reconstruction FIR filterbanks

We propose two approaches to design M channel nonparaunitary filter banks that satisfy perfect reconstruction (PR) and linear phase (LP) properties. In the first approach, the PR condition is imposed on only a high-pass filter. Although this method does not require nonlinear optimization, it has a demerit in that the order of a high-pass filter becomes high. In the second approach, two filters are optimized simultaneously using a Lagrange-Newton method. We can design PR filter banks that have the same length. The PR constraint is also formulated as a linear and nonlinear equation of the analysis filter coefficients. Finally, some design examples are included     

On the Design of Nearly-PR and PR FIR Cosine Modulated Filter Banks Having Approximate Cosine-Rolloff Transition Band

This paper proposes an efficient method for designing nearly perfect reconstruction (NPR) and perfect reconstruction (PR) cosine modulated filter banks (CMFBs) with prototype filters having an approximate cosine-rolloff (CR) transition band. It is shown that the flatness condition required for an NPR CMFB can be automatically satisfied by using a prototype filter with a CR transition band. The design problem is then formulated as a convex minimax optimization problem, and it can be solved by second-order cone programming (SOCP). By using the NPR CMFB so obtained as an initial guess to nonlinear optimizers such as Fmincon in Matlab, high-quality PR CMFBs can be obtained. The advantages of the proposed method are that it does not require a user-supplied initial guess of the prototype filter and bumps in the passband of the analysis filters can be effectively suppressed.     

Pade table, continued fraction expansion, and perfectreconstruction filter banks

We investigate the relationships among the Pade table, continued fraction expansions and perfect reconstruction (PR) filter banks. We show how the Pade table can be utilized to develop a new lattice structure for general two-channel bi-orthogonal perfect reconstruction (PR) filter banks. This is achieved through characterization of all two-channel biorthogonal PR filter banks. The parameterization found using this method is unique for each filter bank. Similar to any other lattice structure, the PR property is achieved structurally and the quantization of the parameters of the lattice does not effect this property. Furthermore, we demonstrate that for a given filter, the set of all complementary filters can be uniquely specified by two parameters, namely, the end-to-end delay of the system and a scalar quantity. Finally, we investigate the convergence of the successive filters found through the proposed lattice structure and develop a sufficient condition for this convergence     

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.     

General analysis of two-band QMF banks

The two-channel perfect-reconstruction quadrature-mirror-filter banks (PR QMF banks) are analyzed in detail by assuming arbitrary analysis and synthesis filters. Solutions where the filters are FIR or IIR correspond to the fact that a certain function is monomial or nonmonomial, respectively. For the monomial case, the design problem is formulated as a nonlinear constrained optimization problem. The formulation is quite robust and is able to design various two-channel filter banks such as orthogonal and biorthogonal, arbitrary delay, linear-phase filter banks, to name a few. Same formulation is used for causal and stable PR IIR filter bank solutions     

一类冗余比为2的二维DFT调制滤波器组的设计

本文构建了一类冗余比为2的二维线性相位的双原型离散傅立叶变换（DFT）调制滤波器组。利用原型滤波器的多相位分解,推导出了该滤波器组的完全重构(PR)条件。基于该PR条件,我们将滤波器组的设计归结为一个关于原型滤波器的多相位分量的无约束优化问题。由于原型滤波器是线性相位的,多相位分量之间具有一定的关系,因此我们可以简化该优化问题。仿真结果验证了滤波器组PR条件的正确性。同时,仿真表明了优化算法的有效性,设计所得的滤波器组重构误差很小、频率特性较好,基本满足实际应用的需要。