DSP-CIS. Part-IV : Filter Banks & Subband Systems. Chapter-10 : Filter Bank Preliminaries. Marc Moonen

Similar documents
Filterbanks and transforms

Module 9 AUDIO CODING. Version 2 ECE IIT, Kharagpur

Audio-coding standards

Appendix 4. Audio coding algorithms

Audio-coding standards

Pyramid Coding and Subband Coding

Pyramid Coding and Subband Coding

Digital Image Processing

Lecture 10 Video Coding Cascade Transforms H264, Wavelets

Lecture 12 Video Coding Cascade Transforms H264, Wavelets

Lecture 5: Error Resilience & Scalability

Contents. 3 Vector Quantization The VQ Advantage Formulation Optimality Conditions... 48

Perceptual coding. A psychoacoustic model is used to identify those signals that are influenced by both these effects.

Both LPC and CELP are used primarily for telephony applications and hence the compression of a speech signal.

Efficient and Low-Complexity Image Coding with the Lifting Scheme and Modified SPIHT

Graph Wavelets and Filter Banks Designs in Graph Spectral Domain

Audio Coding and MP3

Figure 1. Generic Encoder. Window. Spectral Analysis. Psychoacoustic Model. Quantize. Pack Data into Frames. Additional Coding.

Anu Kalidas Muralidharan Pillai and Håkan Johansson

PQMF Filter Bank, MPEG-1 / MPEG-2 BC Audio. Fraunhofer IDMT

Image Transformation Techniques Dr. Rajeev Srivastava Dept. of Computer Engineering, ITBHU, Varanasi

REAL-TIME DIGITAL SIGNAL PROCESSING

Lecture 16 Perceptual Audio Coding

VHDL Implementation of Multiplierless, High Performance DWT Filter Bank

The theory and design of a class of perfect reconstruction modified DFT filter banks with IIR filters

Scalable Perceptual and Lossless Audio Coding based on MPEG-4 AAC

Perfect Reconstruction FIR Filter Banks and Image Compression

Filter Banks with Variable System Delay. Georgia Institute of Technology. Abstract

CHAPTER 3 DIFFERENT DOMAINS OF WATERMARKING. domain. In spatial domain the watermark bits directly added to the pixels of the cover

LOW COMPLEXITY SUBBAND ANALYSIS USING QUADRATURE MIRROR FILTERS

Design of Orthogonal Graph Wavelet Filter Banks

Mpeg 1 layer 3 (mp3) general overview

Principles of Audio Coding

Optical Storage Technology. MPEG Data Compression

3. Lifting Scheme of Wavelet Transform

Bit or Noise Allocation

2-D Dual Multiresolution Decomposition Through NUDFB and its Application

1 Audio quality determination based on perceptual measurement techniques 1 John G. Beerends

EE482: Digital Signal Processing Applications

Reversible Wavelets for Embedded Image Compression. Sri Rama Prasanna Pavani Electrical and Computer Engineering, CU Boulder

Audio Coding Standards

Fatima Michael College of Engineering & Technology

Filter Bank Design and Sub-Band Coding

Perceptual Coding. Lossless vs. lossy compression Perceptual models Selecting info to eliminate Quantization and entropy encoding

Fast Algorithm for the Modulated Complex Lapped Transform

Digital Signal Processing with Field Programmable Gate Arrays

Spectral modeling of musical sounds

5: Music Compression. Music Coding. Mark Handley

Digital Signal Processing Lecture Notes 22 November 2010

Lecture 6: The Haar Filter Bank

DSP. Presented to the IEEE Central Texas Consultants Network by Sergio Liberman

The Design of Nonuniform Lapped Transforms

HYBRID TRANSFORMATION TECHNIQUE FOR IMAGE COMPRESSION

Multiresolution Image Processing

Module 8: Video Coding Basics Lecture 42: Sub-band coding, Second generation coding, 3D coding. The Lecture Contains: Performance Measures

Multimedia Communications. Transform Coding

Design of NPR DFT-Modulated Filter Banks Using Modified Newton s Method

DUAL TREE COMPLEX WAVELETS Part 1

EFFICIENT SUBBAND ADAPTIVE FILTERING WITH OVERSAMPLED GDFT FILTER BANKS

Compression of RADARSAT Data with Block Adaptive Wavelets Abstract: 1. Introduction

What is multimedia? Multimedia. Continuous media. Most common media types. Continuous media processing. Interactivity. What is multimedia?

IT Digital Image ProcessingVII Semester - Question Bank

ECE 533 Digital Image Processing- Fall Group Project Embedded Image coding using zero-trees of Wavelet Transform

Adaptive Quantization for Video Compression in Frequency Domain

University of Saskatchewan 5-1 EE 392 Electrical Engineering Laboratory III

Parametric Coding of High-Quality Audio

Multimedia. What is multimedia? Media types. Interchange formats. + Text +Graphics +Audio +Image +Video. Petri Vuorimaa 1

MPEG-1. Overview of MPEG-1 1 Standard. Introduction to perceptual and entropy codings

Digital Communication Prof. Bikash Kumar Dey Department of Electrical Engineering Indian Institute of Technology, Bombay

Lossy compression. CSCI 470: Web Science Keith Vertanen

D. Richard Brown III Professor Worcester Polytechnic Institute Electrical and Computer Engineering Department

Fourier analysis and sampling theory

An Ultra Low-Power WOLA Filterbank Implementation in Deep Submicron Technology

ELL 788 Computational Perception & Cognition July November 2015

Mean of Power Spectrum of the Term Associated with F ij (z) in Eq. (10)

Multimedia Communications. Audio coding

Image Sampling and Quantisation

Sampled-data Control and Signal Processing

Optimised corrections for finite-difference modelling in two dimensions

Image Sampling & Quantisation

IN THIS paper we describe the application of subband

International Journal of Research in Computer and Communication Technology, Vol 4, Issue 11, November- 2015

CoE4TN3 Image Processing. Wavelet and Multiresolution Processing. Image Pyramids. Image pyramids. Introduction. Multiresolution.

MRT based Fixed Block size Transform Coding

WAVELET USE FOR IMAGE RESTORATION

Filter Bank Design for Subband Adaptive Filtering

ATRAC DSP Type-R. Sound compression Technique for Mini Disc

An M-Channel Critically Sampled Graph Filter Bank

Adaptive image matching in the subband domain

An Intuitive Explanation of Fourier Theory

D. Richard Brown III Associate Professor Worcester Polytechnic Institute Electrical and Computer Engineering Department

Digital Image Processing

Lossy compression CSCI 470: Web Science Keith Vertanen Copyright 2013

THE TRANSFORM AND DATA COMPRESSION HANDBOOK

Redundant Data Elimination for Image Compression and Internet Transmission using MATLAB

Image pyramids and their applications Bill Freeman and Fredo Durand Feb. 28, 2006

Implementation of Lifting-Based Two Dimensional Discrete Wavelet Transform on FPGA Using Pipeline Architecture

A Comparative Study of DCT, DWT & Hybrid (DCT-DWT) Transform

UNIVERSITY OF DUBLIN TRINITY COLLEGE

A New Approach to Compressed Image Steganography Using Wavelet Transform

Transcription:

DSP-CIS Part-IV Filter Banks & Subband Systems Chapter-0 Filter Bank Preliminaries Marc Moonen Dept. E.E./ESAT-STADIUS, KU Leuven marc.moonen@esat.kuleuven.be www.esat.kuleuven.be/stadius/ Part-III Filter Banks & Subband Systems Chapter-0 Chapter- Chapter-2 Chapter- Chapter- Filter Bank Preliminaries Filter Bank Set-Up Filter Bank Applications Ideal Filter Bank Operation Non-Ideal Filter Banks Perfect Reconstruction Theory Filter Bank Design Filter Bank Design Problem Statement General Perfect Reconstruction Filter Bank Design Maximally Decimated DFT-Modulated Filter Banks Oversampled DFT-Modulated Filter Banks Transmultiplexers Frequency Domain Filtering Time-Frequency Analysis & Scaling DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 2 / 0

Filter Bank Set-Up What we have in mind is this H() subband processing subband processing subband processing subband processing Example with number of channels = N = In practice N can be 02 or more... - Signals split into frequency channels/subbands - Per-channel/subband processing - Reconstruction synthesis of processed signal - Applications see below (audio coding etc.) - In practice, this is implemented as a multi-rate structure for higher efficiency (see next slides) H0 subband filters H H2 H DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 Filter Bank Set-Up Step- Analysis filter bank - Collection of N filters (`analysis filters, `decimation filters ) with a common input signal - Ideal (but non-practical) frequency responses = ideal bandpass filters - Typical frequency responses (overlapping, non-overlapping,) N= H0 H H2 H H() H0 H H2 H H0 H H2 H DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 2

Filter Bank Set-Up Step-2 Decimators (downsamplers) - To increase efficiency, subband sampling rate is reduced by factor D (= Nyquist sampling theorem (for passband signals) ) - Maximally decimated filter banks (=critically downsampled) D=N # subband samples = # fullband samples this sounds like maximum efficiency, but aliasing (see below)! - Oversampled filter banks (=non-critically downsampled) D<N # subband samples > # fullband samples N= D= H() PS analysis filters Hn() are now also decimation/anti-aliasing filters to avoid aliasing in subband signals after decimation (see Chapter-2) DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 5 / 0 Filter Bank Set-Up Step- Subband processing - Example coding (=compression) (transmission or storage) decoding - Filter bank design mostly assumes subband processing has `unit transfer function (output signals=input signals), i.e. mostly ignores presence of subband processing N= D= H() subband processing subband processing subband processing subband processing DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 6 / 0

Filter Bank Set-Up Step-&5 Expanders (upsamplers) & synthesis filter bank - Restore original fullband sampling rate by D-fold upsampling - Upsampling has to be followed by interpolation filtering (to fill the eroes & remove spectral images, see Chapter-2) - Collection of N filters (`synthesis, `interpolation ) with summed output - Frequency responses preferably `matched to frequency responses of the analysis filters (see below) G0 G G2 G N= D= H() subband processing subband processing subband processing subband processing G0() G() G2() G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 7 / 0 Filter Bank Set-Up So this is the picture to keep in mind... analysis bank (analysis & anti-aliasing) downsampling/decimation upsampling/expansion synthesis bank (synthesis/interpolation) N= D= H() subband processing subband processing subband processing subband processing G0() G() G2() G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 8 / 0

Filter Bank Set-Up A crucial concept concept will be Perfect Reconstruction (PR) Assume subband processing does not modify subband signals (e.g. lossless coding/decoding) The overall aim would then be to have PR, i.e. that the output signal is equal to the input signal up to at most a delay y[k]=u[k-d] But downsampling introduces aliasing, so achieving PR will be nontrivial N= D= H() output = input output = input output = input output = input G0() G() G2() G() y[k]=u[k-d]? DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 9 / 0 Subband coding Filter Bank Applications Coding = Fullband signal split into subbands & downsampled subband signals separately encoded (e.g. subband with smaller energy content encoded with fewer bits) Decoding = reconstruction of subband signals, then fullband signal synthesis (expanders synthesis filters) Example Image coding (e.g. wavelet filter banks) Example Audio coding e.g. digital compact cassette (DCC), MiniDisc, MPEG,... Filter bandwidths and bit allocations chosen to further exploit perceptual properties of human hearing (perceptual coding, masking, etc.) DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 0 / 0 5

Filter Bank Applications Subband adaptive filtering - Example Acoustic echo cancellation Adaptive filter models (time-varying) acoustic echo path and produces a copy of the echo, which is then subtracted from microphone signal. = Difficult problem! long acoustic impulse responses time-varying DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 Filter Bank Applications - Subband filtering = N (simpler) subband modeling problems instead of one (more complicated) fullband modeling problem - Perfect Reconstruction (PR) guarantees distortion-free desired near-end speech signal N= D= H() H() ad.filter ad.filter ad.filter ad.filter G0() G() G2() G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 2 / 0 6

Ideal Filter Bank Operation D = N = (*) With ideal analysis/synthesis filters, filter bank operates as follows () H() analysis filters input signal spectrum H() subband processing subband processing subband processing G0() G() G2() subband processing G() DSP-CIS (*) Similar 206 figures / Part-IV for / Chapter other 0 D,N Filter & oversampled Bank Preliminaries (D<N) case / 0 Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows (2) H() x x H() subband processing subband processing subband processing subband processing PS analysis filter lowpass anti-aliasing filter G0() G() G2() G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 7

Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows () x H() (ideal subband processing) x x subband processing G0() subband processing G() subband processing G2() subband processing G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 5 / 0 Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows () x H() subband processing x G0() subband processing G() subband processing G2() subband processing G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 6 / 0 8

Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows (5) G0() G() G2() G() x H() subband processing subband processing subband processing subband processing PS G0() synthesis filter lowpass interpolation filter x G0() G() G2() G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 7 / 0 Ideal Filter Bank Operation With ideal analysis/synthesis filters, FB operates as follows (6) H() x2 x2 H() subband processing subband processing subband processing subband processing PS H() analysis filter bandpass anti-aliasing filter G0() G() G2() G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 8 / 0 9

Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows (7) x 2 H() subband processing x 2 x 2 subband processing subband processing G0() G() G2() subband processing G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 9 / 0 Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows (8) x 2 H() subband processing G0() x 2 subband processing G() subband processing G2() subband processing G() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 20 / 0 0

Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows (9) G0() G() G2() G() x 2 H() subband processing subband processing subband processing subband processing PS G() synthesis filter bandpass interpolation filter G0() G() G2() G() x 2 DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 2 / 0 Ideal Filter Bank Operation With ideal analysis/synthesis filters, filter bank operates as follows (0) = H() =Perfect Reconstruction subband processing G0() subband processing G() subband processing G2() subband processing G() Now try this with non-ideal filters? DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 22 / 0

Non-Ideal Filter Bank Operation Question Can y[k]=u[k-d] be achieved with non-ideal filters i.e. in the presence of aliasing? Answer YES!! Perfect Reconstruction Filter Banks (PR-FB) with synthesis bank designed to remove aliasing effects! N= D= H() output = input output = input output = input output = input G0() G() G2() G() y[k]=u[k-d]? DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 2 / 0 Non-Ideal Filter Bank Operation A very simple PR-FB is constructed as follows - Starting point is this As y[k]=u[k-d] this can be viewed as a ( st ) (maximally decimated) PR-FB (with lots of aliasing in the subbands!) All analysis/synthesis filters are seen to be pure delays, hence are not frequency selective (i.e. far from ideal case with ideal bandpass filters, not yet very interesting.) DSP-CIS (*) Similar 206 figures / Part-IV for / Chapter other 0 D=N Filter Bank Preliminaries 2 / 0 D = N = (*) 0,0,0,u[0],0,0,0,u[],0,0,0,... 0,0,u[-],0,0,0,u[],0,0,0,0,... u[k-] 0,u[-2],0,0,0,u[2],0,0,0,0,0,... u[-],0,0,0,u[],0,0,0,0,0,0,... 2

Non-Ideal Filter Bank Operation - Now insert DFT-matrix (discrete Fourier transform) and its inverse (I-DFT)... é v F as F.F = I this clearly does not change the input-output relation (hence PR property preserved) F é FF v u[k-] DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 25 / 0 Non-Ideal Filter Bank Operation - and reverse order of decimators/expanders and DFTmatrices (not done in an efficient implementation!) F F u[k-] =analysis filter bank =synthesis filter bank This is the `DFT/IDFT filter bank It is a first (or 2 nd ) example of a (maximally decimated) PR-FB! DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 26 / 0

Non-Ideal Filter Bank Operation What do analysis filters look like? (N-channel case) N= F " # H 0 () H () H 2 () H N () % " W 0 W 0 W 0... W 0 % " = W 0 W W... W (N ) W 0 W W... W (N ) N. & W 0 W (N ) W (N )... W (N )2 k # & # j /N W = e N % & This is seen/known to represent a collection of filters Ho(),H(),..., each of which is a frequency shifted version of Ho() H n (e jω ) = H 0 (e j(ω n.( /N )) ) H 0 () = N.(... N ) i.e. the Hn are obtained by uniformly shifting the `prototype Ho over the frequency axis. DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 27 / 0 Non-Ideal Filter Bank Operation The prototype filter Ho() is a not-so-great lowpass filter with significant sidelobes. Ho() and Hi() s are thus far from ideal lowpass/bandpass filters. Synthesis filters are shown to be equal to analysis filters (up to a scaling) Ho() H() N= Hence (maximal) decimation introduces significant ALIASG in the decimated subband signals Still, we know this is a PR-FB (see construction previous slides), which means the synthesis filters can apparently restore the aliasing distortion. This is remarkable, it means PR can be achieved even with non-ideal filters! DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 28 / 0

Perfect Reconstruction Theory Now comes the hard part(?) 2-channel case Simple (maximally decimated, D=N) example to start with N-channel case Polyphase decomposition based approach DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 29 / 0 Perfect Reconstruction 2-Channel Case 2 2 F0() H() 2 2 F() D = N = 2 y[k] It is proved that... (try it!) Y ( ) =.{ H 0( ). F0 ( ) H( ) F ( )}. U ( ).{ H 0( ). F0 ( ) H( ) F ( )}. U ( )! 2!!!! #!!!!! "! 2!!!! #!!!!!! " T ( ) A( ) U(-) represents aliased signals (*), hence A() is referred to as `alias transfer function T() referred to as `distortion function (amplitude & phase distortion) Note that T() is also the transfer function obtained after removing the up- and downsampling (up to a scaling) (!) DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries (*) U( ) =e jω =U( e jω ) =U(e 0 / jω 0 ) 5

Perfect Reconstruction 2-Channel Case 2 2 H() Requirement for `alias-free filter bank A( ) = 0 If A()=0, then Y()=T().U() hence the complete filter bank behaves as a LTI system (despite/without up- & downsampling)! Requirement for `perfect reconstruction filter bank (= alias-free distortion-free) 2 2 F0() F() y[k] A( ) = 0 δ T ( ) = DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 Perfect Reconstruction 2-Channel Case A solution is as follows (ignore details) [Smith&Barnwell 98] [Minter 985] i) F0 ( ) = H( ), F ( ) = H0( ) J so that (alias cancellation) A( ) =... = 0 ii) `power symmetric Ho() (real coefficients case) 2 j( ω ) j( ω ) 2 2 H0 ( e ) H0( e ) = k iii) h[ k] = ( ). h0[ L k] J so that (distortion function) T ( ) =... = ignore the details! This is a so-called`paraunitary perfect reconstruction bank (see below), based on a lossless system Ho,H 2 2 H ( e jω ) H ( e jω ) 2 0 = This is already pretty complicated DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 2 / 0 6

Perfect Reconstruction N-Channel Case It is proved that... (try it!) N D=N= H() Y () = N.{ H ().F () n n }.U() n=0 N. { H (.W n n ).F n ()}.U(.W n ) n= n=0 T() A n () 2nd term represents aliased signals, hence all `alias transfer functions An() should ideally be ero (for all n ) T() is referred to as `distortion function (amplitude & phase distortion). For perfect reconstruction, T() should be a pure delay DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 N F0() F() F2() F() N Sigh!!Too Complicated!!... y[k] D = N Perfect Reconstruction Theory D = N A simpler analysis results from a polyphase description E( ) R( ) N-by-N N-by-N ( N )!!!!! E #!!!!! " N N H 0( ) E0 0( )... E0 N ( ) =. N N H N ( ) EN 0 ( )... EN N ( ) T F0 ( ) FN ( ) D=N= = ( N ) ( N ) n-th row of E() has N-fold (=D-fold) polyphase components of Hn() n-th column of R() has N-fold polyphase components of Fn() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries / 0 R( N )!!!!! #!!!!! " T N N R0 0 ( )... RN 0 ( ). N N R0 N ( )... RN N ( ) Do not continue until you understand how formulae correspond to block scheme! u[k-] 7

Perfect Reconstruction Theory With the `noble identities, this is equivalent to D=N= E () R() u[k-] Necessary & sufficient conditions for i) alias cancellation ii) perfect reconstruction are then derived, based on the product R( ). E( ) DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 5 / 0 Perfect Reconstruction Theory E () R() Necessary & sufficient condition for alias-free FB is R( ). E( ) = `pseudo - circulant a pseudo-circulant matrix is a circulant matrix with the additional feature that elements below the main diagonal are multiplied by /, i.e. D=N= D=N= p0( ) =. p( ) R( ). E( ). p2( ). p( ) p ( ) p ( ) 0. p. p2 ( ) ( ) p ( ) p ( ) p ( ) 0. p & then st row of R().E() are polyphase cmpnts of `distortion function T() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 6 / 0 2 ( ) p( ) p 2( ) p ( ) p0( ) u[k-] Read on è 8

Perfect Reconstruction Theory Read on è This can be verified as follows First, previous block scheme is equivalent to (cfr. Noble identities) D=N= R( ). E( ) Then (iff R.E is pseudo-circ.) So that finally.. R( ). E( ).. U( ) =... =.( p0( ) p( ) p2( ) p( )). U( )!!!!!!!! #!!!!!!!! " T ( ) T () D=N= DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 7 / 0 T()*u[k-] Perfect Reconstruction Theory D=N= E () R() Necessary & sufficient condition for PR is then (i.e. where T()=pure delay, hence pr()=pure delay, and all other pn()=0) In is nxn identity matrix, r is arbitrary δ 0 I N r R( ). E( ) =, 0 r N δ. Ir 0 u[k-] Example (r=0) R( ). E( ) = δ I N for conciseness, will use this from now on! è PR-FB design in chapter- Beautifully simple!! (compared to page ) DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 8 / 0 9

Perfect Reconstruction Theory A similar PR condition can be derived for oversampled FBs The polyphase description (compare to p.) is then D < N D= N=6 E( ) N-by-D R( ) D-by-N u[k-] " # " # H 0 () H N () F 0 () F N ()!##### E( " D ##### ) % " E 0 0 ( D )... E 0 D ( D % ) " =. & E N 0 ( D )... E N D ( D ) # & # T % & " = # (D ) (D ) % &!##### R( " D ##### ) T % " R 0 0 ( D )... R N 0 ( D % ). R & 0 D ( D )... R N D ( D ) # & n-th row of E() has D-fold polyphase components of Hn() n-th column of R() has D-fold polyphase components of Fn() DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 9 / 0 Note that E is an N-by-D ( tall-thin ) matrix, R is a D-by-N ( short-fat ) matrix! Perfect Reconstruction Theory Simplified (r=0 on p.8) condition for PR is then D= N=6 E( ) N-by-D R( ) D-by-N u[k-] R().E() = δ I D DxN NxD DxD In the D=N case (p.8), the PR condition has a product of square matrices. PR-FB design (Chapter ) will then involve matrix inversion, which is mostly problematic. In the D<N case, the PR condition has a product of a short-fat matrix and a tallthin matrix. This will lead to additional PR-FB design flexibility (see Chapter ). Again beautifully simple!! (compared to page ) DSP-CIS 206 / Part-IV / Chapter 0 Filter Bank Preliminaries 0 / 0 20