The theory and design of arbitrary-length cosine-modulated filterbanks and wavelets, satisfying perfect reconstruction

It is well known that FIR filter banks that satisfy the perfect-reconstruction (PR) property can be obtained by cosine modulation of a linear-phase prototype filter of length N=2mM, where M is the number of channels. In this paper, we present a PR cosine-modulated filter bank where the length of the prototype filter is arbitrary. The design is formulated as a quadratic-constrained least-squares optimization problem, where the optimized parameters are the prototype filter coefficients. Additional regularity conditions are imposed on the filter bank to obtain the cosine-modulated orthonormal bases of compactly supported wavelets. Design examples are given     

Time-domain modified DFT modulated filter banks for multi-carrier transceiver systems

A time domain designing method is proposed for discrete Fourier transform （DFT） modulated filter banks （DFT-FBs） for application in multi-carrier transceiver systems. Instead of using the time-reversed pair limitation between the transmitting /receiving filter pair, the receiving filters in the proposed filter banks are derived from transmitting filters in accordance with the Moore-Penrose generalized inverse matrix. It can be freely obtained to design the transmitting prototype filter, which mainly affects the level of spectral containment. Furthermore, the symbol error rate （SER） performance of the proposed filter bank based trans-multiplexer with one tap equalizer is investigated in ideal channel and multi-path channel environments respectively. Simulation shows that the proposed approach can achieve significant SER reductions when square root raised cosine （RRC） prototype filter is used for comparing with the orthogonal frequency division multiplexing （OFDM） and the general DFT-FBs based applications.     

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     

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     

Modulated, perfect reconstruction filterbanks with integercoefficients

We present design methods for perfect reconstruction (PR) integer-modulated filterbanks, including biorthogonal (low-delay) filterbanks. Both the prototype filter and the modulation sequences are composed of integers, thus allowing efficient hardware implementations and fast computation. To derive such filterbanks, we first start with the PR conditions known for cosine modulation and extend them to more general, integer modulation schemes. For the design of biorthogonal PR integer prototypes, a lifting strategy is introduced. To find suitable integer modulation schemes, new algebraic methods are presented. We show solutions where the PR conditions on the prototype filters and the modulation matrices are entirely decoupled and where some simple coupling is introduced. Both even and odd numbers of channels are considered. Design examples are presented for both cases     

Stable, causal, perfect reconstruction, IIR uniform DFT filterbanks

A simple design procedure for stable, causal and perfect reconstruction infinite impulse response parallel uniform discrete Fourier transform filter banks (DFT FBs) based on a new polyphase decomposition, the `polyphase-oversampled' FB, is presented. The proposed design results in causal and stable analysis and synthesis filters that are all derived from a single prototype filter, resulting in efficient realisations. A discussion of the FB numerical properties and some design examples are provided     

Joint use of time-domain and windowed method for design of modulated DFT filter banks

A novel and efficient technique to design modulated discrete Fourier transform （DFT） filter banks is introduced in this paper. The proposed method first relaxes the limits that the synthesis filters are the time-reversed version of the analysis filters and then adopts the time domain formula of the perfect reconstruction property as the solution to design the synthesis filters. The prototype filter in analysis filter banks is designed based on Fourier-Kaiser window approach. Simulation results show that the designed filter banks approximately satisfy the perfect reconstruction with controllable reconstruction errors.     

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

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

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.     

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

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

Linear phase cosine modulated maximally decimated filter banks withperfect reconstruction

We propose a novel way to design maximally decimated FIR cosine modulated filter banks, in which each analysis and synthesis filter has a linear phase. The system can be designed to have either the approximate reconstruction property (pseudo-QMF system) or perfect reconstruction property (PR system). In the PR case, the system is a paraunitary filter bank. As in earlier work on cosine modulated systems, all the analysis filters come from an FIR prototype filter. However, unlike in any of the previous designs, all but two of the analysis filters have a total bandwidth of 2π/M rather than π/M (where 2M is the number of channels in our notation). A simple interpretation is possible in terms of the complex (hypothetical) analytic signal corresponding to each bandpass subband. The coding gain of the new system is comparable with that of a traditional M-channel system (rather than a 2M-channel system). This is primarily because there are typically two bandpass filters with the same passband support. Correspondingly, the cost of the system (in terms of complexity of implementation) is also comparable with that of an M-channel system. We also demonstrate that very good attenuation characteristics can be obtained with the new system     

Methods for designing efficient parallel‐recursive filter structures for computing discrete transforms

Analytical and numerical approaches are presented for the design of first‐order and second‐order recursive digital filter banks for computing linear, discrete transforms. This subject has been studied extensively for the case of trigonometric transforms. The focus of this paper is on discrete polynomial transforms, and Clenshaw's recurrence formulae are used to design the second‐order filters. The efficiency of the implementation for a specific transform is dependent upon the characteristics of recurrence relations for the transform basis vectors. Efficient implementations are derived for the discrete cosine transform and the inverse discrete Legendre transform from analytical expressions for basis vector recurrence relations. A numerical procedure is presented to search for the existence and parameters of an efficient implementation when analytical expressions for the basis vector recurrence relations are unknown. This revised version was published online in June 2006 with corrections to the Cover Date.     

An efficient digital implementation of multicarrier CDMA system based on generalized DFT filter Banks

In this paper, an efficient digital implementation of multicarrier transmission scheme based on generalized discrete Fourier transform (DFT) filter banks is presented for multicarrier code-division multiple-access (MC-CDMA) systems. Generalized DFT filter banks has been traditionally discussed for very high-speed digital subscriber lines (VDSL) wireline systems, received interest also for wireless applications. The design of the generalized DFT modulated filter banks is investigated and its fast implementation is derived in the time-domain for arbitrary integer sampling rate. Through the utilization of the generalized DFT modulated filter banks, one or more subcarriers, even noncontiguous subcarriers can be easily supported by system in both uplink and downlink, which facilitates the users to access the network in a frequency-division multiple-access manner. Simulation results show that the overall bit-error-rate performance of the proposed multicarrier transmission scheme well approaches that of a single-carrier system due to the negligible intercarrier interference introduced by an appropriate design of the generalized DFT modulated filter banks.     

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.      

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

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

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

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

Multidimensional multirate filters and filter banks derived fromone-dimensional filters

A method by which every multidimensional (M-D) filter with an arbitrary parallelepiped-shaped passband support can be designed and implemented efficiently is presented. It is shown that all such filters can be designed starting from an appropriate one-dimensional prototype filter and performing a simple transformation. With D denoting the number of dimensions, the complexity of design and implementation of the M-D filter are reduced from O(N^D) to O(N). Using the polyphase technique, an implementation with complexity of only 2N is obtained in the two-dimensional. Even though the filters designed are in general nonseparable, they have separable polyphase components. One special application of this method is in M-D multirate signal processing, where filters with parallelepiped-shaped passbands are used in decimation, interpolation, and filter banks. Some generalizations and other applications of this approach, including M-D uniform discrete Fourier transform (DFT) quadrature mirror filter banks that achieve perfect reconstruction, are studied. Several design example are given     

Discrete Lagrangian Methods for Designing Multiplierless Two-Channel PR-LP Filter Banks

In this paper, we present a new search method based on the theory of discrete Lagrange multipliers for designing multiplierless PR (perfect reconstruction) LP (linear phase) filter banks. To satisfy the PR constraints, we choose a lattice structure that, under certain conditions, can guarantee the resulting two filters to be a PR pair. Unlike the design of multiplierless QMF filter banks that represents filter coefficients directly using PO2 (powers-of-two) form (also called Canonical Signed Digit or CSD representation), we use PO2 forms to represent the parameters associated with the lattice structure. By representing these parameters as sums or differences of powers of two, multiplications can be carried out as additions, subtractions, and shifts. Using the lattice representation, we decompose the design problem into a sequence of four subproblems. The first two subproblems find a good starting point with continuous parameters using a single-objective, multi-constraint formulation. The last two subproblems first transform the continuous solution found by the second subproblem into a PO2 form, then search for a design in a mixed-integer space. We propose a new search method based on the theory of discrete Lagrange multipliers for finding good designs, and study methods to improve its convergence speed by adjusting dynamically the relative weights between the objective and the Lagrangian part. We show that our method can find good designs using at most four terms in PO2 form in each lattice parameter. Our approach is unique because our results are the first successful designs of multiplierless PR-LP filter banks. It is general because it is applicable to the design of other types of multiplierless filter banks.     

利用频率掩蔽法设计均匀和非均匀余弦调制滤波器组

给出了一种均匀非均匀余弦调制滤波器组的设计方法。采用了频率掩蔽法设计原型滤波器,利用迭代算法优化原型滤波器的脉冲响应系数,目标函数表示为脉冲响应系数的四次方,非均匀余弦调制滤波器组通过合并均匀余弦调制滤波器组的相邻的滤波器得到,这种方法简单有效。最后的Matlab实例仿真验证了此算法的有效性。