Designs of Orthogonal Filter Banks and Orthogonal Cosine-Modulated Filter Banks
|
|
- Aubrey Morrison
- 6 years ago
- Views:
Transcription
1 1 / 45 Designs of Orthogonal Filter Banks and Orthogonal Cosine-Modulated Filter Banks Jie Yan Department of Electrical and Computer Engineering University of Victoria April 16, 2010
2 2 / 45 OUTLINE 1 INTRODUCTION 2 LS DESIGN OF ORTHOGONAL FILTER BANKS AND WAVELETS 3 MIMINAX DESIGN OF ORTHOGONAL FILTER BANKS AND WAVELETS 4 DESIGN OF ORTHOGONAL COSINE-MODULATED FILTER BANKS 5 CONCLUSIONS AND FUTURE RESEARCH
3 3 / INTRODUCTION A two-channel conjugate quadrature (CQ) filter bank where H 0 (z) = N 1 n=0 h nz n H 1 (z) = z (N 1) H 0 ( z 1 ) G 0 (z) = H 1 ( z) G 1 (z) = H 0 ( z) H ( z) 0 G ( z) 0 H ( z) 1 Analysis Filter Bank G ( z) 1 Synthesis Filter Bank
4 4 / 45 Two-Channel Orthogonal Filter Banks Perfect reconstruction (PR) condition N 1 2m n=0 h n h n+2m = δ m for m = 0, 1,..., (N 2)/2 Vanishing moment (VM) requirement: A CQ filter has L vanishing moments if N 1 ( 1) n n l h n = 0 for l = 0, 1,..., L 1 n=0
5 5 / 45 Two-Channel Orthogonal Filter Banks Cont d A least squares (LS) design of CQ lowpass filter H 0 (z) having L VMs minimize subject to: π H 0 (e jω ) 2 dω ω a PR condition and VM requirement The LS problem above can be expressed as minimize subject to: h T Qh N 1 2m n=0 h n h n+2m = δ m for m = 0, 1,..., (N 2)/2 N 1 ( 1) n n l h n = 0 for l = 0, 1,..., L 1 n=0
6 6 / 45 Two-Channel Orthogonal Filter Banks Cont d A minimax design minimizes the maximum instantaneous power of H 0 (z) over its stopband minimize subject to: maximize H 0 (e jω ) ω a ω π PR condition and VM requirement The minimax problem can be further cast as minimize subject to: η T(ω) h η for ω Ω N 1 2m n=0 h n h n+2m = δ m for m = 0, 1,..., (N 2)/2 N 1 ( 1) n n l h n = 0 for l = 0, 1,..., L 1 n=0
7 7 / 45 Orthogonal Cosine-Modulated Filter Banks An orthogonal cosine-modulated (OCM) filter bank [ ( π h k (n) = 2h(n) cos k + 1 ) ( n D ) + ( 1) k π ] M [ ( π f k (n) = 2h(n) cos k + 1 ) ( n D ) ( 1) k π ] M for 0 k M 1 and 0 n N 1 x(n) H 0 (z) M M F 0 (z) + y(n) H 1 (z) M M F 1 (z) H M-1 (z) M M F M-1 (z)
8 8 / 45 Orthogonal Cosine-Modulated Filter Banks Cont d An M-channel OCM filter bank is uniquely characterized by its prototype filter (PF) The design of the PF of an OCM filter bank can be formulated as minimize subject to: π ω s H 0 (e jω ) 2 dω PR condition As the PF has linear phase, h is symmetrical. The design problem can be reduced to minimize e 2 (ĥ) = ĥt ˆPĥ subject to: a l,n (ĥ) = ĥt ˆQl,n ĥ c n = 0 for 0 n m 1 and 0 l M/2 1 where the design variables are reduced by half to ĥ = [h 0 h 1 h N/2 1 ] T.
9 9 / 45 Overview and Contribution of the Thesis Overview We have formulated three nonconvex optimization problems LS design of CQ filter banks Minimax design of CQ filter banks Design of OCM filter banks Contribution of the thesis Several improved local design methods for the three problems Several strategies proposed for potentially GLOBAL solutions of the three problems
10 10 / 45 Global Design Method at a Glance Multiple local solutions exist for a nonconvex problem Algorithms in finding a locally optimal solution are available Start the local design algorithm from a good initial point How do we secure such a good initial point?
11 11 / LS DESIGN OF ORTHOGONAL FILTER BANKS AND WAVELETS A least squares (LS) design of a conjugate quadrature (CQ) filter of length-n with L vanishing moments (VMs) can be cast as minimize subject to: h T Qh N 1 2m n=0 h n h n+2m = δ m for m = 0, 1,..., (N 2)/2 N 1 ( 1) n n l h n = 0 for l = 0, 1,..., L 1 n=0
12 12 / 45 Local LS Design of CQ Filter Banks An effective direct design method is recently proposed by W.-S. Lu and T. Hinamoto Based on the direct design technique, we develop two local methods Sequential convex-programming (SCP) method Sequential quadratic-programming (SQP) method Both methods produce improved local designs than the direct method
13 13 / 45 Local LS Design of CQ Filter Banks Cont d Sequential Convex-Programming Method Suppose we are in the kth iteration to compute δ h so that h k+1 = h k + δ h reduces the filter s stopband energy and better satisfies the constraints, then h T k+1qh k+1 = δ T h Qδ h + 2δ T h Qh k + h T k Qh k N 1 N 1 ( 1) n n l (δ h ) n = ( 1) n n l (h k ) n n=0 n=0 N 1 2m n=0 (h k ) n (δ h ) n+2m + N 1 2m n=0 N 1 2m δ m (h k ) n (h k ) n+2m n=0 (h k ) n+2m (δ h ) n
14 Local LS Design of CQ Filter Banks Cont d With h bounded to be small, the kth iteration assumes the form minimize subject to: δ T h Qδ h + δ T h g k A k δ h = a k Cδ h b By using SVD to remove the equality constraint, the problem is reduced to minimize subject to: x T ˆQx + xtĝ k Ĉx ˆb We modify the problem to make it always feasible as minimize subject to: x T ˆQx + xtĝ k Fx a which is a convex QP problem. 14 / 45
15 15 / 45 Local LS Design of CQ Filter Banks Cont d Sequential Quadratic-Programming Method The design problem is a general nonlinear optimization problem minimize subject to: f (h) a i (h) = 0 for i = 1, 2,..., p By using the first-order necessary conditions of a local minimizer, the problem can be reduced to minimize subject to: 1 2 δt h W k δ h + δ T h g k A k δ h = a k δ h is small
16 16 / 45 Local LS Design of CQ Filter Banks Cont d where p W k = 2 hf (h k ) (λ k ) i 2 ha i (h k ) i=1 A k = [ h a 1 (h k ) h a 2 (h k ) h a p (h k ) ] T g k = h f (h k ) a k = [ a 1 (h k ) a 2 (h k ) a p (h k ) ] T (13a) (13b) (13c) (13d) By removing the equality constraint using the SVD or QR decomposition, the problem assumes the form of a QP problem. Once the minimizer δ h is found, the next iterate is set to h k+1 = h k + δ h, λ k+1 = (A k A T k ) 1 A k (W k δ h + g k )
17 17 / 45 Global LS Design of Low-Order CQ Filter Banks The LS design problem is a polynomial optimization problem (POP) Two recent breakthroughs in solving POPs Global solutions of POPs are made available by Lasserre s method Sparse SDP relaxation is proposed for global solutions of POPs of relatively larger scales MATLAB toolbox SparsePOP and GloptiPoly can be used to find global solutions of POPs, but only for POPs of limited sizes
18 18 / 45 Global LS Design of Low-Order CQ Filter Banks Cont d Example: Design a globally optimal LS CQ filter with N = 6, L = 2 and ω a = 0.56π MATLAB toolbox GloptiPoly and SparsePOP are utilized to produce the globally optimal solution h (6,2) LS = However, GloptiPoly and SparsePOP fail to work as long as the filter length N is greater than or equal to 18
19 19 / 45 Global LS Design of High-Order CQ Filter Banks A common pattern shared among globally optimal low-order impulse responses. 0.8 N = 6, L = N = 8, L = 2 N = 10, L =
20 20 / 45 Global LS Design of High-Order CQ Filter Banks Cont d h 6 : Globally optimal impulse response when N = 6 h zp 8 : Impulse response generated by zero-padding h 6 h 8 : Globally optimal impulse response when N = h 6 (N=6, L=2) zp 0.7 h 8 h (N=8, L=2) Generate initial point by zero-padding!
21 21 / 45 Global LS Design of High-Order CQ Filter Banks Cont d Global design strategy in brief: 1 Design a globally optimal CQ filter of short length, say 4, using e.g. GloptiPoly 2 Generating an impulse response for higher order design by zero-padding 3 Apply the SCP or SQP method with the zero-padded impulse response as the initial point to obtain the optimal impulse response of higher order 4 Follow this concept in an iterative way, until desired filter length is reached
22 22 / 45 Global LS Design of High-Order CQ Filter Banks Cont d The designs obtained are quite likely to be globally optimal because: 1 Zero-padded initial point sufficiently close to the global minimizer. 2 The local design methods are known to converge to a nearby minimizer.
23 23 / 45 Design Examples Potentially globally optimal design of an LS CQ filter with N = 96, L = 3 and ω = 0.56π Normalized frequency
24 24 / 45 Design Examples Cont d Comparisons Global design Global design based on SCP Energy in stopband e-9 Largest eq. error 1e-14 Local design Local design based on SCP Energy in stopband e-9 Largest eq. error 1e-14
25 25 / 45 Design Examples Cont d Zero-pole plots Imaginary Part Real Part Global design Imaginary Part Real Part Local design The globally optimal LS CQ filter possesses minimum phase
26 26 / MIMINAX DESIGN OF ORTHOGONAL FILTER BANKS AND WAVELETS A minimax design of a conjugate quadrature (CQ) filter of length-n with L vanishing moments (VMs) can be cast as minimize subject to: η T(ω) h η for ω Ω N 1 2m n=0 h n h n+2m = δ m for m = 0, 1,..., (N 2)/2 N 1 ( 1) n n l h n = 0 for l = 0, 1,..., L 1 n=0
27 27 / 45 Local Minimax Design of CQ Filter Banks Like the LS design, an effective direct design method is recently proposed by W.-S. Lu and T. Hinamoto Based on the direct design technique, we develop an improved method named the SCP-GN method The SCP-GN method can achieve convergence at a small tolerance ε, by implementing two techniques 1 Constructing Ω by locating magnitude-response peaks 2 A Gauss-Newton method with adaptively controlled weights
28 Local Minimax Design of CQ Filter Banks Cont d In the kth iteration, the problem assumes the form minimize subject to: η T(ω)(h k + δ h) η for ω Ω A kδ h = a k Cδ h b By using SVD of matrix A k to remove the equality constraints, the problem can be reduced to minimize subject to: η T k(ω)x + e k(ω) η for ω Ω Ĉx ˆb As a technical remedy to make the above problem to be always feasible, we modify the problem as minimize subject to: η T k(ω)x + e k(ω) η for ω Ω Fx a which is a second-order cone programming (SOCP) problem for which efficient solvers such as SeDuMi exist. 28 / 45
29 Global Minimax Design of Low-Order CQ Filter Banks Example: Design a globally optimal minimax CQ filter with N = 4, L = 1 and ω a = 0.56π Since the Minimax design problem is a POP, GloptiPoly and SparsePOP can be used to produce the globally optimal solution h (4,1) minimax = However, GloptiPoly and SparsePOP fail to work as long as the filter length N is greater than or equal to 6 29 / 45
30 30 / 45 Global Minimax Design of High-Order CQ Filter Banks Method 1 Globally optimal minimax impulse responses appear to exhibit a pattern similar to that in the LS case Thus, we proposed method 1 in spirit similar to that utilized in the global LS designs by passing the zero-padded impulse response as the initial point for the SCP-GN local method in each round of iteration Method 2 We simply pass the impulse response of the globally optimal LS filter as an initial point for the SCP-GN method to design an optimal minimax filter with the same design specifications
31 31 / 45 Design Examples Potentially globally optimal design of a minimax CQ filter with N = 96, L = 3 and ω = 0.56π Normalized frequency
32 32 / 45 Design Examples Cont d Comparisons Global design Maximum instantaneous energy in stopband Largest eq. error Local design Maximum instantaneous energy in stopband Largest eq. error Global design based on Method e-9 <1e-15 Local design based on SCP-GN e-8 2.9e-14
33 33 / 45 Design Examples Cont d Zero-pole plots Imaginary Part Imaginary Part Real Part Real Part Global design Local design The globally optimal minimax CQ filter possesses minimum phase
34 34 / DESIGN OF ORTHOGONAL COSINE-MODULATED FILTER BANKS We have formulated the design of the prototype filter (PF) of an orthogonal cosine-modulated (OCM) filter bank as minimize e 2 (ĥ) = ĥt ˆPĥ subject to: a l,n (ĥ) = ĥt ˆQl,n ĥ c n = 0 for 0 n m 1 and 0 l M/2 1
35 35 / 45 Local Design of OCM Filter Banks We improved an effective direct design method proposed by W.-S. Lu, T. Saramäki and R. Bregović Gauss-Newton method with adaptively controlled weights was applied for the algorithm to converge to a highly accurate solution
36 Local Design of OCM Filter Banks Cont d Suppose we are in the kth iteration to compute δ so that ĥk+1 = ĥk + δ reduces the PF s stopband energy and better satisfies the PR conditions. Then, ĥ T k+1ˆpĥk+1 = δ T ˆPδ + 2δ T ˆPĥ k + ĥt k ˆPĥk And the kth iteration assumes the form a l,n (ĥk + δ) a l,n (ĥk) + g T l,n (ĥk)δ = 0 for 0 n m 1 and 0 l M/2 1 minimize subject to: δ T ˆPδ + δ T b k G k δ = a k δ is small 36 / 45
37 37 / 45 Local Design of OCM Filter Banks Cont d The equality constraint can be eliminated via SVD of G k = UΣV as Thus, the problem can be cast as δ = V e φ + δ s (18) minimize subject to: φ T Pk φ + φ T bk φ is small The Gauss-Newton technique with adaptively controlled weights is used as a post-processing step to achieve convergence at a small tolerance.
38 Global Design of Low-Order OCM Filter Banks Example: Design a globally optimal OCM filter bank with M = 2, m = 1 and ρ = 1 GloptiPoly and SparsePOP can be used to produce the globally optimal solution h (2,1) = The software was found to work only for the following cases: a) M = 2, 1 m 5; b) M = 4, 1 m 3; c) M = 6, m = 1; d) M = 8, m = / 45
39 39 / 45 Global Design of High-Order OCM Filter Banks Two observations: 1 For a fixed M, the impulse responses with different m exhibit a similar pattern and are close to each other 2 For m = 1, the impulse responses with different M also exhibit a similar shape m=1,m=2 m=2,m=2 m=3,m=2 m=4,m=2 m=1,m=4 m=2,m=
40 Global Design of High-Order OCM Filter Banks Cont d m=1,m=4 zp h 0 m=2,m= m=1,m=2 int h 0 m=1,m= Effect of zero-padding when M = 4 Effect of linear interpolation when m = 1 40 / 45
41 41 / 45 Global Design of High-Order OCM Filter Banks Cont d An improvement in initial point when m = 1, by downshifting h int 0 by a constant value d computed using the Gauss-Newton method with adaptively controlled weights h 0 int h 0 h 0.4 d
42 42 / 45 Global Design of High-Order OCM Filter Banks Cont d An order-recursive algorithm in brief 1 Obtaining a low-order global design; 2 Using zero-padding/linear interpolation in conjuction of the G-N method with adaptively controlled weights of the impulse response to produce a desirable initial point for PF of slightly increased order, and carrying out the design by a locally optimal method; 3 Repeating step 2 until the filter order reaches the targeted value.
43 43 / 45 Design Examples Design of an OCM filter bank with m = 20, M = 4 and ρ = 1. Shown below are the impulse responses of the PF from global and local design, respectively Normalized frequency Normalized frequency Global design Local design
44 44 / 45 Design Examples Cont d Performance comparison for OCM filter banks with m = 20, M = 4 and ρ = 1 Global design Local design Energy in stopband 8.226e e-10 Largest eq. error 1.839e e-10 By comparing the OCM filter banks reported in the literature, the OCM filter bank designed using our proposed algorithm offers the BEST performance, because it is a globally optimal design.
45 45 / CONCLUSIONS AND FUTURE RESEARCH We have investigated three design problems, 1 LS design of orthogonal filter banks and wavelets 2 Minimax design of orthogonal filter banks and wavelet 3 Design of OCM filter banks Improved local design methods for the three problems Several strategies proposed for GLOBAL designs of the three design scenarios Future research Theoretical proof of the global optimality of our proposed method
Towards Global Design of Orthogonal Filter Banks and Wavelets
Towards Global Design of Orthogonal Filter Banks and Wavelets Jie Yan and Wu-Sheng Lu Department of Electrical and Computer Engineering University of Victoria Victoria, BC, Canada V8W 3P6 jyan@ece.uvic.ca,
More informationDirect Design of Orthogonal Filter Banks and Wavelets
Direct Design of Orthogonal Filter Banks and Wavelets W.-S. Lu T. Hinamoto Dept. of Electrical & Computer Engineering Graduate School of Engineering University of Victoria Hiroshima University Victoria,
More informationA Unified Approach to the Design of Interpolated and Frequency Response Masking FIR Filters
A Unified Approach to the Design of Interpolated and Frequency Response Masking FIR Filters Wu Sheng Lu akao Hinamoto University of Victoria Hiroshima University Victoria, Canada Higashi Hiroshima, Japan
More informationPerfect Reconstruction Two- Channel FIR Filter Banks
Perfect Reconstruction Two- Channel FIR Filter Banks A perfect reconstruction two-channel FIR filter bank with linear-phase FIR filters can be designed if the power-complementary requirement e jω + e jω
More informationReconstruction of Block-Sparse Signals by Using an l 2/p -Regularized Least-Squares Algorithm
Reconstruction of Block-Sparse Signals by Using an l 2/p -Regularized Least-Squares Algorithm Jeevan K. Pant, Wu-Sheng Lu, and Andreas Antoniou University of Victoria May 21, 2012 Compressive Sensing 1/23
More informationMultirate signal processing
Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including
More informationCourse and Wavelets and Filter Banks. Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations.
Course 18.327 and 1.130 Wavelets and Filter Banks Filter Banks (contd.): perfect reconstruction; halfband filters and possible factorizations. Product Filter Example: Product filter of degree 6 P 0 (z)
More informationEnhanced Steiglitz-McBride Procedure for. Minimax IIR Digital Filters
Enhanced Steiglitz-McBride Procedure for Minimax IIR Digital Filters Wu-Sheng Lu Takao Hinamoto University of Victoria Hiroshima University Victoria, Canada Higashi-Hiroshima, Japan May 30, 2018 1 Outline
More informationFilter Banks II. Prof. Dr.-Ing. G. Schuller. Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing. G. Schuller Fraunhofer IDMT & Ilmenau University of Technology Ilmenau, Germany Page Modulated Filter Banks Extending the DCT The DCT IV transform can be seen as modulated
More informationQuadrature-Mirror Filter Bank
Quadrature-Mirror Filter Bank In many applications, a discrete-time signal x[n] is split into a number of subband signals { v k [ n]} by means of an analysis filter bank The subband signals are then processed
More informationDirect Design of Orthogonal Filter Banks and Wavelets by Sequential Convex Quadratic Programming
Direct Design of Orthogonl Filter Bnks nd Wvelets by Sequentil Convex Qudrtic Progrmming W.-S. Lu Dept. of Electricl nd Computer Engineering University of Victori, Victori, Cnd September 8 1 Abstrct Two-chnnel
More informationDesign of High-Performance Filter Banks for Image Coding
Design of High-Performance Filter Banks for Image Coding Di Xu and Michael D. Adams Dept. of Elec. and Comp. Engineering, University of Victoria PO Box 3055, STN CSC, Victoria, BC, V8W 3P6, Canada dixu@ece.uvic.ca
More informationPreliminary Examination in Numerical Analysis
Department of Applied Mathematics Preliminary Examination in Numerical Analysis August 7, 06, 0 am pm. Submit solutions to four (and no more) of the following six problems. Show all your work, and justify
More informationIterative reweighted l 1 design of sparse FIR filters
Iterative reweighted l 1 design of sparse FIR filters Cristian Rusu, Bogdan Dumitrescu Abstract Designing sparse 1D and 2D filters has been the object of research in recent years due mainly to the developments
More informationFast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma
Fast Algorithms for SDPs derived from the Kalman-Yakubovich-Popov Lemma Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 8 September 2003 European Union RTN Summer School on Multi-Agent
More informationResearch Article Design of Optimal Quincunx Filter Banks for Image Coding
Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 27, Article ID 83858, 8 pages doi:.55/27/83858 Research Article Design of Optimal Quincunx Filter Banks for Image
More informationDesign of Stable IIR filters with prescribed flatness and approximately linear phase
Design of Stable IIR filters with prescribed flatness and approximately linear phase YASUNORI SUGITA Nagaoka University of Technology Dept. of Electrical Engineering Nagaoka city, Niigata-pref., JAPAN
More informationFilter Banks II. Prof. Dr.-Ing Gerald Schuller. Fraunhofer IDMT & Ilmenau Technical University Ilmenau, Germany
Filter Banks II Prof. Dr.-Ing Gerald Schuller Fraunhofer IDMT & Ilmenau Technical University Ilmenau, Germany Prof. Dr.-Ing. G. Schuller, shl@idmt.fraunhofer.de Page Modulated Filter Banks Extending the
More informationMULTIRATE DIGITAL SIGNAL PROCESSING
MULTIRATE DIGITAL SIGNAL PROCESSING Signal processing can be enhanced by changing sampling rate: Up-sampling before D/A conversion in order to relax requirements of analog antialiasing filter. Cf. audio
More informationRecovery of Sparse Signals from Noisy Measurements Using an l p -Regularized Least-Squares Algorithm
Recovery of Sparse Signals from Noisy Measurements Using an l p -Regularized Least-Squares Algorithm J. K. Pant, W.-S. Lu, and A. Antoniou University of Victoria August 25, 2011 Compressive Sensing 1 University
More informationDigital Image Processing Lectures 15 & 16
Lectures 15 & 16, Professor Department of Electrical and Computer Engineering Colorado State University CWT and Multi-Resolution Signal Analysis Wavelet transform offers multi-resolution by allowing for
More informationVariable Fractional Delay FIR Filters with Sparse Coefficients
Variable Fractional Delay FIR Filters with Sparse Coefficients W.-S. Lu T. Hinamoto Dept. of Electrical & Computer Engineering Graduate School of Engineering University of Victoria Hiroshima University
More informationResearch Reports on Mathematical and Computing Sciences
ISSN 1342-284 Research Reports on Mathematical and Computing Sciences Exploiting Sparsity in Linear and Nonlinear Matrix Inequalities via Positive Semidefinite Matrix Completion Sunyoung Kim, Masakazu
More informationx[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e
More informationMultiscale Image Transforms
Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract
More informationSolving linear equations with Gaussian Elimination (I)
Term Projects Solving linear equations with Gaussian Elimination The QR Algorithm for Symmetric Eigenvalue Problem The QR Algorithm for The SVD Quasi-Newton Methods Solving linear equations with Gaussian
More informationElectronic Circuits EE359A
Electronic Circuits EE359A Bruce McNair B26 bmcnair@stevens.edu 21-216-5549 Lecture 22 578 Second order LCR resonator-poles V o I 1 1 = = Y 1 1 + sc + sl R s = C 2 s 1 s + + CR LC s = C 2 sω 2 s + + ω
More informationDigital Speech Processing Lecture 10. Short-Time Fourier Analysis Methods - Filter Bank Design
Digital Speech Processing Lecture Short-Time Fourier Analysis Methods - Filter Bank Design Review of STFT j j ˆ m ˆ. X e x[ mw ] [ nˆ m] e nˆ function of nˆ looks like a time sequence function of ˆ looks
More informationConstrained Nonlinear Optimization Algorithms
Department of Industrial Engineering and Management Sciences Northwestern University waechter@iems.northwestern.edu Institute for Mathematics and its Applications University of Minnesota August 4, 2016
More informationCourse Outline. FRTN10 Multivariable Control, Lecture 13. General idea for Lectures Lecture 13 Outline. Example 1 (Doyle Stein, 1979)
Course Outline FRTN Multivariable Control, Lecture Automatic Control LTH, 6 L-L Specifications, models and loop-shaping by hand L6-L8 Limitations on achievable performance L9-L Controller optimization:
More informationE5295/5B5749 Convex optimization with engineering applications. Lecture 8. Smooth convex unconstrained and equality-constrained minimization
E5295/5B5749 Convex optimization with engineering applications Lecture 8 Smooth convex unconstrained and equality-constrained minimization A. Forsgren, KTH 1 Lecture 8 Convex optimization 2006/2007 Unconstrained
More informationThe basic structure of the L-channel QMF bank is shown below
-Channel QMF Bans The basic structure of the -channel QMF ban is shown below The expressions for the -transforms of various intermediate signals in the above structure are given by Copyright, S. K. Mitra
More informationMultiresolution image processing
Multiresolution image processing Laplacian pyramids Some applications of Laplacian pyramids Discrete Wavelet Transform (DWT) Wavelet theory Wavelet image compression Bernd Girod: EE368 Digital Image Processing
More informationOPTIMIZED PROTOTYPE FILTER BASED ON THE FRM APPROACH
CIRCUITS SYSTEMS SIGNAL PROCESSING c Birkhäuser Boston (2003) VOL. 22, NO. 2,2003, PP. 193 210 OPTIMIZED PROTOTYPE FILTER BASED ON THE FRM APPROACH FOR COSINE-MODULATED FILTER BANKS* Miguel B. Furtado
More informationIntroduction to Wavelets and Wavelet Transforms
Introduction to Wavelets and Wavelet Transforms A Primer C. Sidney Burrus, Ramesh A. Gopinath, and Haitao Guo with additional material and programs by Jan E. Odegard and Ivan W. Selesnick Electrical and
More informationINFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters 4. THE BUTTERWORTH ANALOG FILTER
INFINITE-IMPULSE RESPONSE DIGITAL FILTERS Classical analog filters and their conversion to digital filters. INTRODUCTION 2. IIR FILTER DESIGN 3. ANALOG FILTERS 4. THE BUTTERWORTH ANALOG FILTER 5. THE CHEBYSHEV-I
More informationEECS 123 Digital Signal Processing University of California, Berkeley: Fall 2007 Gastpar November 7, Exam 2
EECS 3 Digital Signal Processing University of California, Berkeley: Fall 7 Gastpar November 7, 7 Exam Last name First name SID You have hour and 45 minutes to complete this exam. he exam is closed-book
More informationPart 4: IIR Filters Optimization Approach. Tutorial ISCAS 2007
Part 4: IIR Filters Optimization Approach Tutorial ISCAS 2007 Copyright 2007 Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 24, 2007 Frame # 1 Slide # 1 A. Antoniou Part4: IIR Filters
More informationNeural Network Algorithm for Designing FIR Filters Utilizing Frequency-Response Masking Technique
Wang XH, He YG, Li TZ. Neural network algorithm for designing FIR filters utilizing frequency-response masking technique. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 4(3): 463 471 May 009 Neural Network
More informationSecond-order cone programming
Outline Second-order cone programming, PhD Lehigh University Department of Industrial and Systems Engineering February 10, 2009 Outline 1 Basic properties Spectral decomposition The cone of squares The
More informationLecture 13: Constrained optimization
2010-12-03 Basic ideas A nonlinearly constrained problem must somehow be converted relaxed into a problem which we can solve (a linear/quadratic or unconstrained problem) We solve a sequence of such problems
More informationA New Penalty-SQP Method
Background and Motivation Illustration of Numerical Results Final Remarks Frank E. Curtis Informs Annual Meeting, October 2008 Background and Motivation Illustration of Numerical Results Final Remarks
More informationOrganization of This Pile of Lecture Notes. Part V.F: Cosine-Modulated Filter Banks
Part V.F: Cosine-Modulated s This part shows how to efficiently implement a multichannel (M > ) analysis synthesis bank using a single prototype filter a proper cosine modulation scheme. It is mostly based
More informationSDP APPROXIMATION OF THE HALF DELAY AND THE DESIGN OF HILBERT PAIRS. Bogdan Dumitrescu
SDP APPROXIMATION OF THE HALF DELAY AND THE DESIGN OF HILBERT PAIRS Bogdan Dumitrescu Tampere International Center for Signal Processing Tampere University of Technology P.O.Box 553, 3311 Tampere, FINLAND
More informationMINIMUM PEAK IMPULSE FIR FILTER DESIGN
MINIMUM PEAK IMPULSE FIR FILTER DESIGN CHRISTINE S. LAW AND JON DATTORRO Abstract. Saturation pulses rf(t) are essential to many imaging applications. Criteria for desirable saturation profile are flat
More informationEfficient algorithms for the design of finite impulse response digital filters
1 / 19 Efficient algorithms for the design of finite impulse response digital filters Silviu Filip under the supervision of N. Brisebarre and G. Hanrot (AriC, LIP, ENS Lyon) Journées Nationales de Calcul
More informationNAME: 11 December 2013 Digital Signal Processing I Final Exam Fall Cover Sheet
NAME: December Digital Signal Processing I Final Exam Fall Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Three 8.5 x crib sheets allowed Calculators NOT allowed. This test contains four
More informationUniversity of Illinois at Chicago Spring ECE 412 Introduction to Filter Synthesis Homework #4 Solutions
Problem 1 A Butterworth lowpass filter is to be designed having the loss specifications given below. The limits of the the design specifications are shown in the brick-wall characteristic shown in Figure
More informationHow to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization
CS-11-01 How to generate weakly infeasible semidefinite programs via Lasserre s relaxations for polynomial optimization Hayato Waki Department of Computer Science, The University of Electro-Communications
More informationBBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints
BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh March, 2018 Abstract.
More informationDiscrete-time Symmetric/Antisymmetric FIR Filter Design
Discrete-time Symmetric/Antisymmetric FIR Filter Design Presenter: Dr. Bingo Wing-Kuen Ling Center for Digital Signal Processing Research, Department of Electronic Engineering, King s College London. Collaborators
More information14. Nonlinear equations
L. Vandenberghe ECE133A (Winter 2018) 14. Nonlinear equations Newton method for nonlinear equations damped Newton method for unconstrained minimization Newton method for nonlinear least squares 14-1 Set
More informationOptimal Design of Real and Complex Minimum Phase Digital FIR Filters
Optimal Design of Real and Complex Minimum Phase Digital FIR Filters Niranjan Damera-Venkata and Brian L. Evans Embedded Signal Processing Laboratory Dept. of Electrical and Computer Engineering The University
More information1 Number Systems and Errors 1
Contents 1 Number Systems and Errors 1 1.1 Introduction................................ 1 1.2 Number Representation and Base of Numbers............. 1 1.2.1 Normalized Floating-point Representation...........
More informationLike bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform.
Inversion of the z-transform Focus on rational z-transform of z 1. Apply partial fraction expansion. Like bilateral Laplace transforms, ROC must be used to determine a unique inverse z-transform. Let X(z)
More informationA DESIGN OF FIR FILTERS WITH VARIABLE NOTCHES CONSIDERING REDUCTION METHOD OF POLYNOMIAL COEFFICIENTS FOR REAL-TIME SIGNAL PROCESSING
International Journal of Innovative Computing, Information and Control ICIC International c 23 ISSN 349-498 Volume 9, Number 9, September 23 pp. 3527 3536 A DESIGN OF FIR FILTERS WITH VARIABLE NOTCHES
More informationCast of Characters. Some Symbols, Functions, and Variables Used in the Book
Page 1 of 6 Cast of Characters Some s, Functions, and Variables Used in the Book Digital Signal Processing and the Microcontroller by Dale Grover and John R. Deller ISBN 0-13-081348-6 Prentice Hall, 1998
More informationAPPLIED SIGNAL PROCESSING
APPLIED SIGNAL PROCESSING DIGITAL FILTERS Digital filters are discrete-time linear systems { x[n] } G { y[n] } Impulse response: y[n] = h[0]x[n] + h[1]x[n 1] + 2 DIGITAL FILTER TYPES FIR (Finite Impulse
More informationStrange Behaviors of Interior-point Methods. for Solving Semidefinite Programming Problems. in Polynomial Optimization
CS-08-02 Strange Behaviors of Interior-point Methods for Solving Semidefinite Programming Problems in Polynomial Optimization Hayato Waki, Maho Nakata, and Masakazu Muramatsu Department of Computer Science,
More informationNumerical solutions of nonlinear systems of equations
Numerical solutions of nonlinear systems of equations Tsung-Ming Huang Department of Mathematics National Taiwan Normal University, Taiwan E-mail: min@math.ntnu.edu.tw August 28, 2011 Outline 1 Fixed points
More informationDesign of Nearly Linear-Phase Recursive Digital Filters by Constrained Optimization
Design of Nearly Linear-Phase Recursive Digital Filters by Constrained Optimization by David Guindon B.Eng., University of Victoria, 2001 A Thesis Submitted in Partial Fulfillment of the Requirements for
More informationThe Q-parametrization (Youla) Lecture 13: Synthesis by Convex Optimization. Lecture 13: Synthesis by Convex Optimization. Example: Spring-mass System
The Q-parametrization (Youla) Lecture 3: Synthesis by Convex Optimization controlled variables z Plant distubances w Example: Spring-mass system measurements y Controller control inputs u Idea for lecture
More informationDesign of Nonuniform Filter Banks with Frequency Domain Criteria
Blekinge Institute of Technology Research Report No 24:3 Design of Nonuniform Filter Banks with Frequency Domain Criteria Jan Mark de Haan Sven Nordholm Ingvar Claesson School of Engineering Blekinge Institute
More informationMinimax Design of Complex-Coefficient FIR Filters with Low Group Delay
Minimax Design of Complex-Coefficient FIR Filters with Low Group Delay Wu-Sheng Lu Takao Hinamoto Dept. of Elec. and Comp. Engineering Graduate School of Engineering University of Victoria Hiroshima University
More informationPeriodic discrete-time frames: Design and applications for image restoration
Periodic discrete-time frames: Design and applications for image restoration Amir Averbuch Pekka eittaanmäki Valery Zheludev School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel Department
More informationDesign and Application of Quincunx Filter Banks
Design and Application of Quincunx Filter Banks by Yi Chen B.Eng., Tsinghua University, China, A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of MASTER OF APPLIED SCIENCE
More informationCOMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS
COMPLEX WAVELET TRANSFORM IN SIGNAL AND IMAGE ANALYSIS MUSOKO VICTOR, PROCHÁZKA ALEŠ Institute of Chemical Technology, Department of Computing and Control Engineering Technická 905, 66 8 Prague 6, Cech
More informationNUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING
NUMERICAL COMPUTATION IN SCIENCE AND ENGINEERING C. Pozrikidis University of California, San Diego New York Oxford OXFORD UNIVERSITY PRESS 1998 CONTENTS Preface ix Pseudocode Language Commands xi 1 Numerical
More informationLecture 16: Multiresolution Image Analysis
Lecture 16: Multiresolution Image Analysis Harvey Rhody Chester F. Carlson Center for Imaging Science Rochester Institute of Technology rhody@cis.rit.edu November 9, 2004 Abstract Multiresolution analysis
More information2 Regularized Image Reconstruction for Compressive Imaging and Beyond
EE 367 / CS 448I Computational Imaging and Display Notes: Compressive Imaging and Regularized Image Reconstruction (lecture ) Gordon Wetzstein gordon.wetzstein@stanford.edu This document serves as a supplement
More informationTitle Perfect reconstruction modulated filter banks with sum of powers-of-two coefficients Author(s) Chan, SC; Liu, W; Ho, KL Citation IEEE International Symposium on Circuits and Systems Proceedings,
More informationFRTN10 Multivariable Control, Lecture 13. Course outline. The Q-parametrization (Youla) Example: Spring-mass System
FRTN Multivariable Control, Lecture 3 Anders Robertsson Automatic Control LTH, Lund University Course outline The Q-parametrization (Youla) L-L5 Purpose, models and loop-shaping by hand L6-L8 Limitations
More information( ) John A. Quinn Lecture. ESE 531: Digital Signal Processing. Lecture Outline. Frequency Response of LTI System. Example: Zero on Real Axis
John A. Quinn Lecture ESE 531: Digital Signal Processing Lec 15: March 21, 2017 Review, Generalized Linear Phase Systems Penn ESE 531 Spring 2017 Khanna Lecture Outline!!! 2 Frequency Response of LTI System
More informationMultidimensional digital signal processing
PSfrag replacements Two-dimensional discrete signals N 1 A 2-D discrete signal (also N called a sequence or array) is a function 2 defined over thex(n set 1 of, n 2 ordered ) pairs of integers: y(nx 1,
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science Discrete-Time Signal Processing Fall 2005
1 MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.341 Discrete-Time Signal Processing Fall 2005 FINAL EXAM Friday, December 16, 2005 Walker (50-340) 1:30pm
More information1 The Continuous Wavelet Transform The continuous wavelet transform (CWT) Discretisation of the CWT... 2
Contents 1 The Continuous Wavelet Transform 1 1.1 The continuous wavelet transform (CWT)............. 1 1. Discretisation of the CWT...................... Stationary wavelet transform or redundant wavelet
More information7.17. Determine the z-transform and ROC for the following time signals: Sketch the ROC, poles, and zeros in the z-plane. X(z) = x[n]z n.
Solutions to Additional Problems 7.7. Determine the -transform and ROC for the following time signals: Sketch the ROC, poles, and eros in the -plane. (a) x[n] δ[n k], k > 0 X() x[n] n n k, 0 Im k multiple
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationOptimum Design of Frequency-Response-Masking Filters Using Convex-Concave Procedure. Haiying Chen
Optimum Design of Frequency-Response-Masking Filters Using Convex-Concave Procedure by Haiying Chen B.Eng., University of Electrical Science and Technology of China, 2013 A Dissertation Submitted in partial
More informationFinal Examination. CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University
Final Examination CS 205A: Mathematical Methods for Robotics, Vision, and Graphics (Fall 2013), Stanford University The exam runs for 3 hours. The exam contains eight problems. You must complete the first
More informationNumerical Linear Algebra Primer. Ryan Tibshirani Convex Optimization
Numerical Linear Algebra Primer Ryan Tibshirani Convex Optimization 10-725 Consider Last time: proximal Newton method min x g(x) + h(x) where g, h convex, g twice differentiable, and h simple. Proximal
More informationAMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences)
AMS526: Numerical Analysis I (Numerical Linear Algebra for Computational and Data Sciences) Lecture 19: Computing the SVD; Sparse Linear Systems Xiangmin Jiao Stony Brook University Xiangmin Jiao Numerical
More informationApplied Machine Learning for Biomedical Engineering. Enrico Grisan
Applied Machine Learning for Biomedical Engineering Enrico Grisan enrico.grisan@dei.unipd.it Data representation To find a representation that approximates elements of a signal class with a linear combination
More informationOptimization: Nonlinear Optimization without Constraints. Nonlinear Optimization without Constraints 1 / 23
Optimization: Nonlinear Optimization without Constraints Nonlinear Optimization without Constraints 1 / 23 Nonlinear optimization without constraints Unconstrained minimization min x f(x) where f(x) is
More informationMay 9, 2014 MATH 408 MIDTERM EXAM OUTLINE. Sample Questions
May 9, 24 MATH 48 MIDTERM EXAM OUTLINE This exam will consist of two parts and each part will have multipart questions. Each of the 6 questions is worth 5 points for a total of points. The two part of
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #21 Friday, October 24, 2003 Types of causal FIR (generalized) linear-phase filters: Type I: Symmetric impulse response: with order M an even
More informationTrust-region methods for rectangular systems of nonlinear equations
Trust-region methods for rectangular systems of nonlinear equations Margherita Porcelli Dipartimento di Matematica U.Dini Università degli Studi di Firenze Joint work with Maria Macconi and Benedetta Morini
More informationNumerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018
Numerical Analysis Preliminary Exam 1 am to 1 pm, August 2, 218 Instructions. You have three hours to complete this exam. Submit solutions to four (and no more) of the following six problems. Please start
More informationGlobal Optimization with Polynomials
Global Optimization with Polynomials Geoffrey Schiebinger, Stephen Kemmerling Math 301, 2010/2011 March 16, 2011 Geoffrey Schiebinger, Stephen Kemmerling (Math Global 301, 2010/2011) Optimization with
More informationSolving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets
Solving Global Optimization Problems with Sparse Polynomials and Unbounded Semialgebraic Feasible Sets V. Jeyakumar, S. Kim, G. M. Lee and G. Li June 6, 2014 Abstract We propose a hierarchy of semidefinite
More informationElectronic Circuits EE359A
Electronic Circuits EE359A Bruce McNair B26 bmcnair@stevens.edu 21-216-5549 Lecture 22 569 Second order section Ts () = s as + as+ a 2 2 1 ω + s+ ω Q 2 2 ω 1 p, p = ± 1 Q 4 Q 1 2 2 57 Second order section
More informationFilter Banks with Variable System Delay. Georgia Institute of Technology. Atlanta, GA Abstract
A General Formulation for Modulated Perfect Reconstruction Filter Banks with Variable System Delay Gerald Schuller and Mark J T Smith Digital Signal Processing Laboratory School of Electrical Engineering
More informationFast Wavelet/Framelet Transform for Signal/Image Processing.
Fast Wavelet/Framelet Transform for Signal/Image Processing. The following is based on book manuscript: B. Han, Framelets Wavelets: Algorithms, Analysis Applications. To introduce a discrete framelet transform,
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationZ - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.
Z - Transform The z-transform is a very important tool in describing and analyzing digital systems. It offers the techniques for digital filter design and frequency analysis of digital signals. Definition
More information! Downsampling/Upsampling. ! Practical Interpolation. ! Non-integer Resampling. ! Multi-Rate Processing. " Interchanging Operations
Lecture Outline ESE 531: Digital Signal Processing Lec 10: February 14th, 2017 Practical and Non-integer Sampling, Multirate Sampling! Downsampling/! Practical Interpolation! Non-integer Resampling! Multi-Rate
More informationConvex Optimization and l 1 -minimization
Convex Optimization and l 1 -minimization Sangwoon Yun Computational Sciences Korea Institute for Advanced Study December 11, 2009 2009 NIMS Thematic Winter School Outline I. Convex Optimization II. l
More informationDigital Signal Processing Lecture 8 - Filter Design - IIR
Digital Signal Processing - Filter Design - IIR Electrical Engineering and Computer Science University of Tennessee, Knoxville October 20, 2015 Overview 1 2 3 4 5 6 Roadmap Discrete-time signals and systems
More informationPreliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012
Instructions Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012 The exam consists of four problems, each having multiple parts. You should attempt to solve all four problems. 1.
More informationA Julia JuMP-based module for polynomial optimization with complex variables applied to ACOPF
JuMP-dev workshop 018 A Julia JuMP-based module for polynomial optimization with complex variables applied to ACOPF Gilles Bareilles, Manuel Ruiz, Julie Sliwak 1. MathProgComplex.jl: A toolbox for Polynomial
More information