tion which provides performances comparable to that We show now that a near—perfect replica R(n) of of conventional QMF filter banks, but with a compu— x(n), with s—transform I(s) may be reconstructed tational complexity which is significantly lower from the N channel signals. This is done by insar— than with QNF banks or earlier pseudo-QMF banks. ting N-l zero-valued aamples between auccassiva...

1 Optimal Filter Banks for Multiple Description Coding: Analysis and Synthesis Pier Luigi Dragotti, Sergio D. Servetto and Martin Vetterli Abstract|Multiple Description (MD) coding is a source coding technique for information transmission over unreliable networks. In MD coding, the coder generates several di erent descriptions of the same signal and the decoder can produce a useful reconstructi...

Recently connections between the wavelet transform and lter banks have been established. We show that similar relations exist between the Gabor expansion and DFT lter banks. We introduce the \z-Zak transform" by suitably extending the discrete-time Zak transform and show its equivalence to the polyphase representation. A systematic discussion of parallels between DFT lter banks and Weyl-Heisenb...

Digital signal processing has played a key role in the development of telecommunication systems over the last two decades. In recent years digital filter banks have been occupying an increasingly important role in both wireless and wireline communication systems. In this paper we review some of these applications of filter banks with special emphasis on discrete multitone modulation which has h...

We question the role that large scale filter banks have traditionally played in texture classification. It is demonstrated that textures can be classified using the joint distribution of intensity values over extremely compact neighbourhoods (starting from as small as 3×3 pixels square), and that this outperforms classification using filter banks

Optimizing the angles for the lattice structures in the prototype filter for perfect-reconstruction cosine-modulated and modified DFT filter banks is a very difficult task because there exist several local optima. In order to get around this problem, this paper describes an efficient systematic technique for designing prototype filters in the least-mean-square sense. First, the few angles for t...

In this paper, we propose a new M-channel wavelet bases called the cosine-modulated wavelets. We first generalize the theory of two-channel biorthogonal compactly supported wavelet bases to the M-channel case. A sufficient condition for the M-channel perfect reconstruction filter banks to construct M-channel compactly supported wavelet bases is given. By using this condition, a family of orthog...

Abstrucf-A number of results in filter bank theory can be viewed using vector space notations. This simplifies the proofs of many important results. In this paper, we first introduce the framework of vector space, and then use this framework to derive some known and some new filter bank results as well. For example, the relation among the Hermitian image property, orthonormality, and the perfec...

We investigate the design of subband coders without the traditional perfect-reconstruction constraint on the filters. The coder uses scalar quantizers, and its filters and bit allocation are designed so as to optimize a rate-distortion criterion. Our results hold for a broad class of ratedistortion criteria that satisfy certain convexity properties. We begin by showing that optimality can be ac...