M带离散时间子波变换

二带连续时间子波变换可由无限级树形正交镜像滤波器（ＱＭＦ）组产生,类似地,二带离散时间子波变换可表示为有限级树形ＱＭＦ组,该文对二带离散时间子波变换进行了推广,给出了Ｍ带离散时间子波变换,并研究了Ｍ带离散时间子波变换与Ｍ带仿酉滤波器组之间的关系。结果表明,在Ｌ级Ｍ带树形滤波器组中,如果每级滤波器组仿酉滤波器组,则该树形滤波器组所产生的离散时间子波基是正交基。     

用于信号逼近的最佳正交子波选择方法

离散子波变换将离散时间信号分解为一系列分辨率下的离散逼近和离散细节。紧支的正交规范子波与完全重建正交镜象滤波器组相对应。本文提出一种用于信号最佳逼近的正交子波选择方法,即选择满足一定条件的滤波器的方法。通过对滤波器参数化,可以将带约束的最优化问题转化为无约束最优化问题,通过对参数在一定范围内的搜索,得到最优解。文中给出了计算机模拟的结果。     

一种二维离散子波变换的滤波器结构

子波变换具有良好的时间（空间）频率局部化性能，在图象子带编码中二维离散子波变换是一种接近理想的子带分析／综合子系统．本文提出一种利用一维离散子波变换实现二维有限长离散子波变换的方法，同时给出了二维离散子波正变换（DWT）和反变换（IDWT）的滤波器实现结构．实验结果表明新的方法具有良好的重构性，完全适用于图象压缩编码系统中的分析／综合子系统．     

用余弦调制PR—FIR方法构造正交小波基

离散小波变换将离散时间信号分解为一系列不同分辨率下的离散近似信号和离散细节．紧支的正交规范小波与完全重构正交镜象滤波器（PR-QMF)相对应。本文在“二带”正交小波基的构造条件下．利用余弦调制完全重构滤波器组的方法．实现了正交小波基的构造，计算模拟表明该方法非常简单、有效。     

用于信号逼近的最佳正交子波选择方法

离散子波变换将离散时间信号分解为一系列分辨率下的离散逼近和离散细节，紧支的正交规范子波与完全重建正交镜象滤波器组相对应。本文提出一种用于信号最佳逼近的正交子波选择方法，即选择满足一定条件的滤波器的方法。通过对滤波器参数化，可以将带约束的最佳化问题转化为无约束最优化问题，通过对参数在一定范围内的搜索，得到最优解，文中给出了计算机模拟的结果。     

用余弦调制PR－FIR方法构造正交小波基

离散小波变换将离散时间信号分解为一系列不同分辨率下的离散近似信号和离散细节，紧支的正交规范小波与完全重构正交镜象滤波器（ＰＲ－ＱＭＦ）相对应。本文在“二带”正交小波基的构造条件下，利用余弦调制完全重构滤波器组的方法，实现了正交小波基的构造，计算模拟表明该方法非常简单、有效。     

加窗全相位半带滤波器在PR QMF组中的应用

研究了一种可以完全重建输入信号的滤波器,称之为正交镜像滤波器(Quadrature Mirror Filter,QMF)。这种滤波器在重建信号方面非常有效。文中设计采用一种对加窗全相位半带滤波器直接进行谱因式分解的方法来完全重建(Perfect Reconstruction,以下简称PR)输入信号的二通带QMF组。通过Matlab实例仿真,得到通带波纹小、阻带衰减大的QMF组,滤波器性能得到明显改善。     

基于数字图像的子带编码的研究

子带编码(SBC)是图像编码中的一种有前途的编码方法。本文主要论述了图像的子带分解与重建原理，重点讨论了适合于子带编码的正交镜像滤波器组(QMF)的设计方法，包括一维与二维滤波器组，该成果很适合在ATM网络中应用。     

离散子波分解的专用芯片设计及CPLD实现

子波变换是信号处理和图像压缩等诸多领域中一个非常有效的数学分析工具。日前,其实现方式多为软件编程。本文针对子波变换与滤波器组的关系,在卷积滤波、下二采样过程中,将数据按一定规律重排,用复杂可编程逻辑器件(CPLD)设计了一种专用芯片(ASIC)可完成离散子波分解,具有一定的实用价值。     

基于提升方法的滤波器组因子分解

讨论了FIR滤波器组的分解.2通道完全重构FIR 子波变换分解可为有限步的提升步骤,使用Laurent多项式的辗转相除法给出了这种分解的一个代数方法的证明;证明了二通道子波变换的分解定理不能平行推广到2M通道滤波器组.提出使用M-通道滤波器组构造2M-通道滤波器组,它由多相矩阵的分块化和提升方法实现,这种方法易于构造非线性滤波器组,如整数变换.     

On orthonormal wavelets and paraunitary filter banks

The known result that a binary-tree-structured filter bank with the same paraunitary polyphase matrix on all levels generates an orthonormal basis is generalized to binary trees having different paraunitary matrices on each level. A converse result that every orthonormal wavelet basis can be generated by a tree-structured filter bank having paraunitary polyphase matrices is then proved. The concept of orthonormal bases is extended to generalized (nonbinary) tree structures, and it is seen that a close relationship exists between orthonormality and paraunitariness. It is proved that a generalized tree structure with paraunitary polyphase matrices produces an orthonormal basis. Since not all phases can be generated by tree-structured filter banks, it is proved that if an orthonormal basis can be generated using a tree structure, it can be generated specifically by a paraunitary tree     

Design of prefilters for discrete multiwavelet transforms

The pyramid algorithm for computing single wavelet transform coefficients is well known. The pyramid algorithm can be implemented by using tree-structured multirate filter banks. The authors propose a general algorithm to compute multiwavelet transform coefficients by adding proper premultirate filter banks before the vector filter banks that generate multiwavelets. The proposed algorithm can be thought of as a discrete vector-valued wavelet transform for certain discrete-time vector-valued signals. The proposed algorithm can be also thought of as a discrete multiwavelet transform for discrete-time signals. The authors then present some numerical experiments to illustrate the performance of the algorithm, which indicates that the energy compaction for discrete multiwavelet transforms may be better than the one for conventional discrete wavelet transforms     

Smooth wavelets, transform coding, and Markov-1 processes

This paper compares the energy compacting properties of unitary transforms from transform coders and two-band paraunitary filter banks from subband coders using a cost criterion that is proposed. Stationary processes for which paraunitary filters have better energy compaction than unitary filters are denoted as subband optimal, and all subband optimal processes are analytically characterized for the case of length-4 filters. It is shown analytically for length-4 filters and empirically for longer-length filters that Markov-1 processes are subband optimal and that the Daubechies (1988) maximally smooth wavelet sequences achieve better energy compaction than the best unitary filters for Markov-1 inputs     

Discrete wavelet transform based on cyclic convolutions

A filterbank in which cyclic convolutions are used in place of linear convolutions will be referred to as a cyclic convolution filterbank (CCFB). A dyadic tree-structured CCFB can be used to perform a discrete wavelet transform suitable for coding based on symmetric extension methods. This paper derives two types of efficient implementation techniques for the tree-structured CCFB: one using complex arithmetic and one using only real arithmetic. In addition, the present paper analyzes in detail the perfect reconstruction (PR) condition for the two-channel CCFB and shows that this condition is much less restrictive than that of usual two-channel filterbanks. When each of the two-channel CCFBs constituting a tree-structured CCFB is designed to be PR, the whole system is PR. A quadrature mirror filter (QMF) CCFB having the PR property is demonstrated to be easily designed using a standard filter design subroutine. In contrast, designing a linear-phase PR FIR QMF bank that has good frequency response is not possible when filters are realized by linear convolutions.     

Optimum design of vector-quantized subband codecs

This article provides an approach for representing an optimum vector quantizer by a scalar nonlinear gain-plus-additive noise model. The validity and accuracy of this analytic model is confirmed by comparing the calculated model quantization errors with actual simulation of the optimum Linde-Buzo-Gray (1980) vector quantizer. Using this model, we form an MSE measure of an M-band filter bank codec in terms of the equivalent scalar quantization model and find the optimum FIR filter coefficients for each channel in the M-band structure for a given bit rate, filter length, and input signal correlation model. Specific design examples are worked out for four-tap filters in the two-band paraunitary case. These theoretical results are confirmed by extensive Monte Carlo simulation     

Coding gain in paraunitary analysis/synthesis systems

A formal proof that bit allocation results hold for the entire class of paraunitary subband coders is presented. The problem of finding an optimal paraunitary subband coder, so as to maximize the coding gain of the system, is discussed. The bit allocation problem is analyzed for the case of the paraunitary tree-structured filter banks, such as those used for generating orthonormal wavelets. The even more general case of nonuniform filter banks is also considered. In all cases it is shown that under optimal bit allocation, the variances of the errors introduced by each of the quantizers have to be equal. Expressions for coding gains for these systems are derived     

基于PR-QMF的扩频序列

利用小波或者小波包的变换与反变换可以构造出具有完全重构性质的滤波器组,提出一种基于完全重构正交镜像滤波器组的新型扩频序列,它不同于传统的扩频序列的二值特性,是一种多值序列。分析与仿真结果表明,小波函数与尺度函数的正交性以及滤波器组的完全重构特性使的这种新型扩频序列具有更好的抗干扰能力和组网能力。     

Multirate filter banks with block sampling

Multirate filter banks with block sampling were recently studied by Khansari and Leon-Garcia (1993). In this paper, we want to systematically study multirate filter banks with block sampling by studying general vector filter banks where the input signals and transfer functions in conventional multirate filter banks are replaced by vector signals and transfer matrices, respectively. We show that multirate filter banks with block sampling studied by Khansari and Leon-Garcia are special vector filter banks where the transfer matrices are pseudocirculant. We present some fundamental properties for the basic building blocks, such as Noble identities, interchangeability of down/up sampling, polyphase representations of M-channel vector filter banks, and multirate filter banks with block sampling. We then present necessary and sufficient conditions for the alias-free property, finite impulse response (FIR) systems with FIR inverses, paraunitariness, and lattice structures for paraunitary vector filter banks. We also present a necessary and sufficient condition for paraunitary multirate filter banks with block sampling. As an application of this theory, we present all possible perfect reconstruction delay chain systems with block sampling. We also show some examples that are not paraunitary for conventional multirate filter banks but are paraunitary for multirate filter banks with proper block sampling. In this paper, we also present a connection between vector filter banks and vector transforms studied by Li. Vector filter banks also play important roles in multiwavelet transforms and vector subband coding