Pipelined and Parallel Recursive and Adaptive Filters

Size: px
Start display at page:

Download "Pipelined and Parallel Recursive and Adaptive Filters"

Transcription

1 VLSI Digital Sigal Processig Systems Pipelied ad Parallel Recursive ad Adaptive Filters La-Da Va 范倫達, Ph. D. Departmet of Computer Sciece Natioal Chiao ug Uiversity aiwa, R.O.C. Fall, 05

2 VLSI Digital Sigal Processig Systems Outlie Itroductio Pipelie Iterleavig i Digital Filter Parallel Processig for IIR Filter Combied Pipeliig ad Parallel Processig for IIR Filters Low-Power IIR Filter Desig Usig Pipeliig ad Parallel Processig Pipelied Adaptive Digital Filters Coclusios La-Da Va VLSI-DSP-0-

3 VLSI Digital Sigal Processig Systems Itroductio type of digital filters for time ivariat system: FIR IIR IIR is preferred sice it ca be implemet i a much lower order. Pipeliig techique: look-ahead computatio ad icremetal block processig techiques relaxed look-ahead trasformatios for pipeliig of LS ad lattice adaptive filters La-Da Va VLSI-DSP-0-3

4 VLSI Digital Sigal Processig Systems Outlie Itroductio Pipelie Iterleavig i Digital Filter Parallel Processig for IIR Filter Combied Pipeliig ad Parallel Processig for IIR Filters Low-Power IIR Filter Desig Usig Pipeliig ad Parallel Processig Pipelied Adaptive Digital Filters Coclusios La-Da Va VLSI-DSP-0-4

5 VLSI Digital Sigal Processig Systems Pipelie iterleavig i Digital Filters Iefficiet sigle/multi-chael iterleavig Efficiet sigle-chael iterleavig Efficiet multi-chael iterleavig La-Da Va VLSI-DSP-0-5

6 VLSI Digital Sigal Processig Systems Iefficiet Sigle/ulti-chael Iterleavig Cosider y+=ay+bu Iteratio period= m a La-Da Va VLSI-DSP-0-6

7 VLSI Digital Sigal Processig Systems Iefficiet Sigle/ulti-chael Iterleavigcot. -stage pipelie versio:isert - additioal latched Clock period decrease timesex:=5 For a sigle time series this array will be useful for oly 0% of the time If 5 idepedet time series are available ==> fully utilized Cosequece: A sample rate times slower tha the clock rate iefficiet utilizatio of processig elemets La-Da Va VLSI-DSP-0-7

8 VLSI Digital Sigal Processig Systems Iefficiet Sigle/ulti-chael Iterleavigcot. La-Da Va VLSI-DSP-0-8

9 VLSI Digital Sigal Processig Systems Efficiet Sigle-Chael Iterleavig Usig look-ahead trasform. Cosider: y+=a[ay+bu]+bu+ Iteratio boud= m + a / La-Da Va VLSI-DSP-0-9

10 Efficiet Sigle-chael Iterleavigcot. VLSI Digital Sigal Processig Systems Aother recursio equivalet equatio: y+=a y+abu+bu+ Iteratio period boud: m + a / La-Da Va VLSI-DSP-0-0

11 Efficiet Sigle-chael Iterleavigcot. VLSI Digital Sigal Processig Systems -steps of look-ahead y a y i0 Iteratio boud: m + a / i a bu i La-Da Va VLSI-DSP-0-

12 Efficiet Sigle-chael Iterleavigcot. VLSI Digital Sigal Processig Systems I a causal system, to perform as before: y=ay0+b0 IF =5 y=a 5 y-4+bu0 u-4,u-3,,u-=0 for causality y-4=a -4 y0 y-i=a -i y0, i=,,.,- he iteratio boud ca be achieved by retimig or cutset trasform La-Da Va VLSI-DSP-0-

13 VLSI Digital Sigal Processig Systems Efficiet ulti-chael Iterleavig La-Da Va VLSI-DSP-0-3

14 VLSI Digital Sigal Processig Systems Outlie Itroductio Pipelie Iterleavig i Digital Filter Parallel Processig for IIR Filter Combied Pipeliig ad Parallel Processig for IIR Filters Low-Power IIR Filter Desig Usig Pipeliig ad Parallel Processig Pipelied Adaptive Digital Filters Coclusios La-Da Va VLSI-DSP-0-4

15 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-5 Example 0.5. /3 Cosider the followig trasfer fuctio architechturel cosider 4 - parallel, k u k u a k u a k u a k y a k y k substitutig u u a u a u a y a y i a bu y a from y u ay y az z z H i i

16 VLSI Digital Sigal Processig Systems pole: z=a ==> z=a 4 Example 0.5. /3 sice a <, a 4 < a, which is closer to the origi ==> improve robustess of the system La-Da Va VLSI-DSP-0-6

17 Next:u4k+7,u4k+8,u4k+9,u4k+0 VLSI Digital Sigal Processig Systems u4k+ u4k+ u4k La-Da Va VLSI-DSP-0-7

18 VLSI Digital Sigal Processig Systems Parallel Processig for IIR Filters Need L multiply-add operatios: hardware cost is high use icremetal block processig to simplify hardware: use y4k to compute y4k+ use y4k+ to compute y4k+ use y4k+ to compute y4k+3 La-Da Va VLSI-DSP-0-8

19 VLSI Digital Sigal Processig Systems Example 0.5. / icremetal block processig sice y+=ay+u y4k+=ay4k+u4k y4k+=ay4k++u4k+ y4k+3=ay4k++u4k+ La-Da Va VLSI-DSP-0-9

20 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-0

21 VLSI Digital Sigal Processig Systems Example /3 System rasfer Fuctio: L=3 La-Da Va VLSI-DSP-0-

22 VLSI Digital Sigal Processig Systems Example /3 La-Da Va VLSI-DSP-0-

23 VLSI Digital Sigal Processig Systems Example /3 y3k+4 y3k+3 La-Da Va VLSI-DSP-0-3

24 VLSI Digital Sigal Processig Systems Parallel Processig for IIR Filters For N-th order IIR filter, its L-level icremetal parallel processig architecture ca be obtaied by computig the first N output samples ylk,ylk+,,ylk+n- idepedetly usig loop update equatios obtaied by clustered look-ahead techique ad the computig the remaiig L-N samples ylk+n,ylk+l- icremetally usig the previous N output samples La-Da Va VLSI-DSP-0-4

25 VLSI Digital Sigal Processig Systems Outlie Itroductio Pipelie Iterleavig i Digital Filter Parallel Processig for IIR Filter Combied Pipeliig ad Parallel Processig for IIR Filters Low-Power IIR Filter Desig Usig Pipeliig ad Parallel Processig Pipelied Adaptive Digital Filters Coclusios La-Da Va VLSI-DSP-0-5

26 VLSI Digital Sigal Processig Systems Cosider: =4,L=3 Example 0.6. /3 H z az La-Da Va VLSI-DSP-0-6

27 VLSI Digital Sigal Processig Systems Example 0.6. /3 La-Da Va VLSI-DSP-0-7

28 VLSI Digital Sigal Processig Systems f 3k+9 f 3k+6 La-Da Va VLSI-DSP-0-8

29 VLSI Digital Sigal Processig Systems Outlie Itroductio Pipelie Iterleavig i Digital Filter Parallel Processig for IIR Filter Combied Pipeliig ad Parallel Processig for IIR Filters Low-Power IIR Filter Desig Usig Pipeliig ad Parallel Processig Pipelied Adaptive Digital Filters Coclusios La-Da Va VLSI-DSP-0-9

30 VLSI Digital Sigal Processig Systems Example 0.7. / Cosider: V 0 =5V,V t =V H z.5548z z z.4996z 0.848z by scattered look - ahead techique with power- of - decompositio : N z z z Z.4996z 0.848z.88z 0.46Z z 0.794z 4 D z z z 8.337z z 8 La-Da Va VLSI-DSP-0-30

31 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP where, where, ,, where, tage use lower supply vol ca smaller capacitace path shorter cretical pipelie: 4 - level arg 0 arg 0 0 seq pip pip s pip pip pip total par seq s seq seq total seq pip e ch pip e ch t total P P Ratio m f C m C P m f C m C P V V k C V k C V V k V C Example 0.7. /

32 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-3 Cosider L=3 9.6% , 3 sice propogatio delay 0.6, seq par s o s o par s o seq o seq par t o o par t o o seq t o P P Ratio f V C f V C P f V C P V V V V k V C V V k V C V V V V u u u y y y Example 0.7. /

33 VLSI Digital Sigal Processig Systems Example 0.7. / La-Da Va VLSI-DSP-0-33

34 VLSI Digital Sigal Processig Systems Outlie Itroductio Pipelie Iterleavig i Digital Filter Parallel Processig for IIR Filter Combied Pipeliig ad Parallel Processig for IIR Filters Low-Power IIR Filter Desig Usig Pipeliig ad Parallel Processig Pipelied Adaptive Digital Filters Coclusios La-Da Va VLSI-DSP-0-34

35 VLSI Digital Sigal Processig Systems Itroductio to a Adaptive Algorithm Adaptive filter: filter with adaptive coefficiet geeral filter block coefficiet update block Widely used i commuicatio, DSP, ad cotrol system Determiistic gradiet / least square algorithm Steepest descet algorithm RLS algorithm Stochastic gradiet algorithm LS algorithm, DLS algorithm Block LS algorithm Gradiet Lattice algorithm Difficult to pipelie due to the presece of log feedback loops Relaxed look-ahead trasformatio techique is used to pipelie the adaptive filter with little or o icrease i hardware at the expese of margial degradatio i the adaptive behavior La-Da Va VLSI-DSP-0-35

36 VLSI Digital Sigal Processig Systems Adaptive Applicatios Chael equalizer System idetificatio Image ehacemet Echo caceller Noise cacellatio Predictor Lie ehacemet Beamformer IO-ODF: V-BLAS La-Da Va VLSI-DSP-0-36

37 VLSI Digital Sigal Processig Systems Notatio. Iput Sigal: X. Desired Output: d 3. Weight Vector: W 4. Adaptatio Factor: μ 5. Error: e 6. isadjustmet: adj 7. ap Number: N 8. Autocorrelatio atrix: R 9. Eigevalue:λ 0. Diagoal atrix : La-Da Va VLSI-DSP-0-37

38 VLSI Digital Sigal Processig Systems where Steepest Descet Algorithm y W X X [ x x... x N ] Note: W [ w0 w... w N ] SSS Strict-sese statioary: A stochastic process xt is called SSS if its statistical properties are ivariat to a shift of the origi. WSS Wide-sese statioary: E{ x t} E{ x t x * t} R La-Da Va VLSI-DSP-0-38

39 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-39 Steepest Descet Algorithm /8 W X d X W d y d e W X X W W X d d e he error at the -th time is

40 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-40 Steepest Descet Algorithm /8 } { } { } { } { } { RW W W P d E W X X E W W X d E d E e E J.. } { N x d x d x d E X d E P

41 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-4 Steepest Descet Algorithm 3/ } { * * * r L r L r L r r r L r r r X X E R } { x * x E r

42 VLSI Digital Sigal Processig Systems Steepest Descet Algorithm 4/8 ake gradiet J P RW Let J 0 W opt R P Wieer-Hopf equatio 949 or Wieer Filter ca be obtaied!! La-Da Va VLSI-DSP-0-4

43 VLSI Digital Sigal Processig Systems Steepest Descet Algorithm 5/8 J E{ d } mi P Wopt J J mi E{ W W opt R W W opt } C W W opt J J mi E{ C RC } La-Da Va VLSI-DSP-0-43

44 VLSI Digital Sigal Processig Systems Steepest Descet Algorithm 6/8 Assume :Symmetricad PositiveDefiitive for Iput Sigal R QQ QQ where diag[ 0... L ] ad Q are orthogoal matrix of R J J J mi mi E{ V E{ C wherev Q V} QQ C C } La-Da Va VLSI-DSP-0-44

45 VLSI Digital Sigal Processig Systems Steepest Descet Algorithm 7/8 Each chage i the weight vector proportioal to the egative of the gradiet vector W W J W P RW La-Da Va VLSI-DSP-0-45

46 VLSI Digital Sigal Processig Systems Steepest Descet Algorithm 8/8 W W J Wopt R P C W Wopt V V V V V 0 I V I - k for all k V max La-Da Va VLSI-DSP-0-46

47 VLSI Digital Sigal Processig Systems LS Algorithm A efficiet implemetatio i software of steepest descet usig measured or estimated gradiets he gradiet of the square of a sigle error sample W W ˆ J ˆ J e X W W μex w0, w, w0 La-Da Va VLSI-DSP-0-47

48 VLSI Digital Sigal Processig Systems Summary of LS Adaptive Algorithm 960 y w x e d y w w e x La-Da Va VLSI-DSP-0-48

49 VLSI Digital Sigal Processig Systems Block Diagram of a Adaptive FIR Filter Drive by the LS Algorithm x z x x x N z z w w w w N 0 y d e La-Da Va VLSI-DSP-0-49

50 VLSI Digital Sigal Processig Systems Adaptive Digital Filter Structure La-Da Va VLSI-DSP-0-50

51 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-5 Relaxed Look-Ahead /6 Cosider: ] [ 0 0 u i u j a y i a y u y a y i i j i

52 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-5 Relaxed Look-Ahead /6 Product Relaxatio ] [ to zero close is if to uity close is a if i i j i i u y a y i u i u j a i u a a i a

53 VLSI Digital Sigal Processig Systems Relaxed Look-Ahead 3/6 Aother approximatio: La-Da Va VLSI-DSP-0-53

54 VLSI Digital Sigal Processig Systems Relaxed Look-Ahead 4/6 Sum relaxatio if u varies slowly over cycles the i0 u i u if u is close to zero the u ca be approximated by u La-Da Va VLSI-DSP-0-54

55 VLSI Digital Sigal Processig Systems Relaxed Look-Ahead 5/6 La-Da Va VLSI-DSP-0-55

56 VLSI Digital Sigal Processig Systems Relaxed Look-Ahead 6/6 Delay relaxatio -level look-ahead pipelied versio assume that the product au is more or less costat over samples La-Da Va VLSI-DSP-0-56

57 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-57 Pipelied LS Adaptive Filter /3 ' : ' over samples,use sum relaxatio much ot chage assume that thegradiet estimate eu does : delay relaxatio -stage look - ahead e tomiimize ˆ i i i i U i e W W i U i e W W i U i e W W U e W W U W d d d e

58 VLSI Digital Sigal Processig Systems La-Da Va VLSI-DSP-0-58 Pipelied LS Adaptive Filter /3 by ad replace small sufficietly is assume ] [ ˆ ' 0 U W d e W W U i U i e W d U W d d d e i

59 VLSI Digital Sigal Processig Systems Pipelied LS Adaptive Filter 3/3 La-Da Va VLSI-DSP-0-59

60 VLSI Digital Sigal Processig Systems Coclusios Itroduce the pipelie filter desig Itroduce the parallel filter desig Explore Relax-Look ahead techiques Demostrate the cocept ad desig of adaptive filters La-Da Va VLSI-DSP-0-60

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations

ECE-S352 Introduction to Digital Signal Processing Lecture 3A Direct Solution of Difference Equations ECE-S352 Itroductio to Digital Sigal Processig Lecture 3A Direct Solutio of Differece Equatios Discrete Time Systems Described by Differece Equatios Uit impulse (sample) respose h() of a DT system allows

More information

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution

Discrete-Time Systems, LTI Systems, and Discrete-Time Convolution EEL5: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we begi our mathematical treatmet of discrete-time s. As show i Figure, a discrete-time operates or trasforms some iput sequece x [

More information

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals.

Discrete-Time Signals and Systems. Discrete-Time Signals and Systems. Signal Symmetry. Elementary Discrete-Time Signals. Discrete-ime Sigals ad Systems Discrete-ime Sigals ad Systems Dr. Deepa Kudur Uiversity of oroto Referece: Sectios. -.5 of Joh G. Proakis ad Dimitris G. Maolakis, Digital Sigal Processig: Priciples, Algorithms,

More information

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE

Run-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE Geeral e Image Coder Structure Motio Video (s 1,s 2,t) or (s 1,s 2 ) Natural Image Samplig A form of data compressio; usually lossless, but ca be lossy Redudacy Removal Lossless compressio: predictive

More information

Applications of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review

Applications of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review pplicatios of Distriuted rithmetic to Digital Sigal Processig: Tutorial Review Ref: Staley. White, pplicatios of Distriuted rithmetic to Digital Sigal Processig: Tutorial Review, IEEE SSP Magazie, July,

More information

ADVANCED DIGITAL SIGNAL PROCESSING

ADVANCED DIGITAL SIGNAL PROCESSING ADVANCED DIGITAL SIGNAL PROCESSING PROF. S. C. CHAN (email : sccha@eee.hku.hk, Rm. CYC-702) DISCRETE-TIME SIGNALS AND SYSTEMS MULTI-DIMENSIONAL SIGNALS AND SYSTEMS RANDOM PROCESSES AND APPLICATIONS ADAPTIVE

More information

An Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation

An Improved Proportionate Normalized Least Mean Square Algorithm with Orthogonal Correction Factors for Echo Cancellation 202 Iteratioal Coferece o Electroics Egieerig ad Iformatics (ICEEI 202) IPCSI vol. 49 (202) (202) IACSI Press, Sigapore DOI: 0.7763/IPCSI.202.V49.33 A Improved Proportioate Normalized Least Mea Square

More information

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals

Analog and Digital Signals. Introduction to Digital Signal Processing. Discrete-time Sinusoids. Analog and Digital Signals Itroductio to Digital Sigal Processig Chapter : Itroductio Aalog ad Digital Sigals aalog = cotiuous-time cotiuous amplitude digital = discrete-time discrete amplitude cotiuous amplitude discrete amplitude

More information

Dept. of Biomed. Eng. BME801: Inverse Problems in Bioengineering Kyung Hee Univ.

Dept. of Biomed. Eng. BME801: Inverse Problems in Bioengineering Kyung Hee Univ. Dept of Biomed Eg BME801: Iverse Problems i Bioegieerig Kyug ee Uiv Adaptive Filters - Statistical digital sigal processig: i may problems of iterest, the sigals exhibit some iheret variability plus additive

More information

Warped, Chirp Z-Transform: Radar Signal Processing

Warped, Chirp Z-Transform: Radar Signal Processing arped, Chirp Z-Trasform: Radar Sigal Processig by Garimella Ramamurthy Report o: IIIT/TR// Cetre for Commuicatios Iteratioal Istitute of Iformatio Techology Hyderabad - 5 3, IDIA Jauary ARPED, CHIRP Z

More information

ECE 308 Discrete-Time Signals and Systems

ECE 308 Discrete-Time Signals and Systems ECE 38-5 ECE 38 Discrete-Time Sigals ad Systems Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa ECE 38-5 1 Additio, Multiplicatio, ad Scalig of Sequeces Amplitude Scalig: (A Costat

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004.

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science. BACKGROUND EXAM September 30, 2004. MASSACHUSETTS INSTITUTE OF TECHNOLOGY Departmet of Electrical Egieerig ad Computer Sciece 6.34 Discrete Time Sigal Processig Fall 24 BACKGROUND EXAM September 3, 24. Full Name: Note: This exam is closed

More information

Pipelining and Parallel Processing

Pipelining and Parallel Processing Pipelining and Parallel Processing ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall, 010 ldvan@cs.nctu.edu.tw http://www.cs.nctu.edu.tw/~ldvan/ Outlines

More information

Polynomial Multiplication and Fast Fourier Transform

Polynomial Multiplication and Fast Fourier Transform Polyomial Multiplicatio ad Fast Fourier Trasform Com S 477/577 Notes Ya-Bi Jia Sep 19, 2017 I this lecture we will describe the famous algorithm of fast Fourier trasform FFT, which has revolutioized digital

More information

Module 11: Applications : Linear prediction, Speech Analysis and Speech Enhancement Prof. Eliathamby Ambikairajah Dr. Tharmarajah Thiruvaran School

Module 11: Applications : Linear prediction, Speech Analysis and Speech Enhancement Prof. Eliathamby Ambikairajah Dr. Tharmarajah Thiruvaran School Module : Applicatios : Liear predictio, Speech Aalysis ad Speech Ehacemet Prof. Eliathamby Ambiairajah Dr. Tharmarajah Thiruvara School of Electrical Egieerig & Telecommuicatios The Uiversity of New South

More information

Ω ). Then the following inequality takes place:

Ω ). Then the following inequality takes place: Lecture 8 Lemma 5. Let f : R R be a cotiuously differetiable covex fuctio. Choose a costat δ > ad cosider the subset Ωδ = { R f δ } R. Let Ωδ ad assume that f < δ, i.e., is ot o the boudary of f = δ, i.e.,

More information

Introduction to Optimization Techniques. How to Solve Equations

Introduction to Optimization Techniques. How to Solve Equations Itroductio to Optimizatio Techiques How to Solve Equatios Iterative Methods of Optimizatio Iterative methods of optimizatio Solutio of the oliear equatios resultig form a optimizatio problem is usually

More information

5. Fast NLMS-OCF Algorithm

5. Fast NLMS-OCF Algorithm 5. Fast LMS-OCF Algorithm The LMS-OCF algorithm preseted i Chapter, which relies o Gram-Schmidt orthogoalizatio, has a compleity O ( M ). The square-law depedece o computatioal requiremets o the umber

More information

Time-Domain Representations of LTI Systems

Time-Domain Representations of LTI Systems 2.1 Itroductio Objectives: 1. Impulse resposes of LTI systems 2. Liear costat-coefficiets differetial or differece equatios of LTI systems 3. Bloc diagram represetatios of LTI systems 4. State-variable

More information

Complex Algorithms for Lattice Adaptive IIR Notch Filter

Complex Algorithms for Lattice Adaptive IIR Notch Filter 4th Iteratioal Coferece o Sigal Processig Systems (ICSPS ) IPCSIT vol. 58 () () IACSIT Press, Sigapore DOI:.7763/IPCSIT..V58. Complex Algorithms for Lattice Adaptive IIR Notch Filter Hog Liag +, Nig Jia

More information

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed)

Exam. Notes: A single A4 sheet of paper (double sided; hand-written or computer typed) Exam February 8th, 8 Sigals & Systems (5-575-) Prof. R. D Adrea Exam Exam Duratio: 5 Mi Number of Problems: 5 Number of Poits: 5 Permitted aids: Importat: Notes: A sigle A sheet of paper (double sided;

More information

Chapter 7: The z-transform. Chih-Wei Liu

Chapter 7: The z-transform. Chih-Wei Liu Chapter 7: The -Trasform Chih-Wei Liu Outlie Itroductio The -Trasform Properties of the Regio of Covergece Properties of the -Trasform Iversio of the -Trasform The Trasfer Fuctio Causality ad Stability

More information

Linear time invariant systems

Linear time invariant systems Liear time ivariat systems Alejadro Ribeiro Dept. of Electrical ad Systems Egieerig Uiversity of Pesylvaia aribeiro@seas.upe.edu http://www.seas.upe.edu/users/~aribeiro/ February 25, 2016 Sigal ad Iformatio

More information

Image Processing on the extreme Processing Platform

Image Processing on the extreme Processing Platform PACT Muich, Germay August 2002 Image Processig o the extreme Processig Platform Robert Strzodka Numerical Aalysis ad Scietific Computig Uiversity of Duisburg http://www.umerik.math.ui-duisburg.de strzodka@math.ui-duisburg.de

More information

EE 505. Lecture 28. ADC Design SAR

EE 505. Lecture 28. ADC Design SAR EE 505 Lecture 28 ADC Desig SAR Review from Last Lecture Elimiatio of Iput S/H C LK X IN S/H Stage 1 r 1 Stage 2 r 2 Stage k r k Stage m r m 1 2 k m Pipelied Assembler (Shift Register

More information

Applications of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review

Applications of Distributed Arithmetic to Digital Signal Processing: A Tutorial Review pplicatios of Distriuted rithmetic to Digital Sigal Processig: Tutorial Review Ref: Staley. White, pplicatios of Distriuted rithmetic to Digital Sigal Processig: Tutorial Review, IEEE SSP Magazie, July,

More information

Internal Information Representation and Processing

Internal Information Representation and Processing Iteral Iformatio Represetatio ad Processig CSCE 16 - Fudametals of Computer Sciece Dr. Awad Khalil Computer Sciece & Egieerig Departmet The America Uiversity i Cairo Decimal Number System We are used to

More information

Chapter 4 : Laplace Transform

Chapter 4 : Laplace Transform 4. Itroductio Laplace trasform is a alterative to solve the differetial equatio by the complex frequecy domai ( s = σ + jω), istead of the usual time domai. The DE ca be easily trasformed ito a algebraic

More information

Chapter 2 Systems and Signals

Chapter 2 Systems and Signals Chapter 2 Systems ad Sigals 1 Itroductio Discrete-Time Sigals: Sequeces Discrete-Time Systems Properties of Liear Time-Ivariat Systems Liear Costat-Coefficiet Differece Equatios Frequecy-Domai Represetatio

More information

Orthogonal Gaussian Filters for Signal Processing

Orthogonal Gaussian Filters for Signal Processing Orthogoal Gaussia Filters for Sigal Processig Mark Mackezie ad Kiet Tieu Mechaical Egieerig Uiversity of Wollogog.S.W. Australia Abstract A Gaussia filter usig the Hermite orthoormal series of fuctios

More information

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals.

Z - Transform. It offers the techniques for digital filter design and frequency analysis of digital signals. Z - Trasform The -trasform is a very importat tool i describig ad aalyig digital systems. It offers the techiques for digital filter desig ad frequecy aalysis of digital sigals. Defiitio of -trasform:

More information

ELEG3503 Introduction to Digital Signal Processing

ELEG3503 Introduction to Digital Signal Processing ELEG3503 Itroductio to Digital Sigal Processig 1 Itroductio 2 Basics of Sigals ad Systems 3 Fourier aalysis 4 Samplig 5 Liear time-ivariat (LTI) systems 6 z-trasform 7 System Aalysis 8 System Realizatio

More information

Solution of Linear Constant-Coefficient Difference Equations

Solution of Linear Constant-Coefficient Difference Equations ECE 38-9 Solutio of Liear Costat-Coefficiet Differece Equatios Z. Aliyazicioglu Electrical ad Computer Egieerig Departmet Cal Poly Pomoa Solutio of Liear Costat-Coefficiet Differece Equatios Example: Determie

More information

Solution of Differential Equation from the Transform Technique

Solution of Differential Equation from the Transform Technique Iteratioal Joural of Computatioal Sciece ad Mathematics ISSN 0974-3189 Volume 3, Number 1 (2011), pp 121-125 Iteratioal Research Publicatio House http://wwwirphousecom Solutio of Differetial Equatio from

More information

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations

Modified Decomposition Method by Adomian and. Rach for Solving Nonlinear Volterra Integro- Differential Equations Noliear Aalysis ad Differetial Equatios, Vol. 5, 27, o. 4, 57-7 HIKARI Ltd, www.m-hikari.com https://doi.org/.2988/ade.27.62 Modified Decompositio Method by Adomia ad Rach for Solvig Noliear Volterra Itegro-

More information

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI

OFDM Precoder for Minimizing BER Upper Bound of MLD under Imperfect CSI MIMO-OFDM OFDM Precoder for Miimizig BER Upper Boud of MLD uder Imperfect CSI MCRG Joit Semiar Jue the th 008 Previously preseted at ICC 008 Beijig o May the st 008 Boosar Pitakdumrogkija Kazuhiko Fukawa

More information

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3

ELEC1200: A System View of Communications: from Signals to Packets Lecture 3 ELEC2: A System View of Commuicatios: from Sigals to Packets Lecture 3 Commuicatio chaels Discrete time Chael Modelig the chael Liear Time Ivariat Systems Step Respose Respose to sigle bit Respose to geeral

More information

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j

The z-transform. 7.1 Introduction. 7.2 The z-transform Derivation of the z-transform: x[n] = z n LTI system, h[n] z = re j The -Trasform 7. Itroductio Geeralie the complex siusoidal represetatio offered by DTFT to a represetatio of complex expoetial sigals. Obtai more geeral characteristics for discrete-time LTI systems. 7.

More information

Solution of EECS 315 Final Examination F09

Solution of EECS 315 Final Examination F09 Solutio of EECS 315 Fial Examiatio F9 1. Fid the umerical value of δ ( t + 4ramp( tdt. δ ( t + 4ramp( tdt. Fid the umerical sigal eergy of x E x = x[ ] = δ 3 = 11 = ( = ramp( ( 4 = ramp( 8 = 8 [ ] = (

More information

Monte Carlo Integration

Monte Carlo Integration Mote Carlo Itegratio I these otes we first review basic umerical itegratio methods (usig Riema approximatio ad the trapezoidal rule) ad their limitatios for evaluatig multidimesioal itegrals. Next we itroduce

More information

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems

ECE4270 Fundamentals of DSP. Lecture 2 Discrete-Time Signals and Systems & Difference Equations. Overview of Lecture 2. More Discrete-Time Systems ECE4270 Fudametals of DSP Lecture 2 Discrete-Time Sigals ad Systems & Differece Equatios School of ECE Ceter for Sigal ad Iformatio Processig Georgia Istitute of Techology Overview of Lecture 2 Aoucemet

More information

Discrete Orthogonal Moment Features Using Chebyshev Polynomials

Discrete Orthogonal Moment Features Using Chebyshev Polynomials Discrete Orthogoal Momet Features Usig Chebyshev Polyomials R. Mukuda, 1 S.H.Og ad P.A. Lee 3 1 Faculty of Iformatio Sciece ad Techology, Multimedia Uiversity 75450 Malacca, Malaysia. Istitute of Mathematical

More information

EE260: Digital Design, Spring n Binary Addition. n Complement forms. n Subtraction. n Multiplication. n Inputs: A 0, B 0. n Boolean equations:

EE260: Digital Design, Spring n Binary Addition. n Complement forms. n Subtraction. n Multiplication. n Inputs: A 0, B 0. n Boolean equations: EE260: Digital Desig, Sprig 2018 EE 260: Itroductio to Digital Desig Arithmetic Biary Additio Complemet forms Subtractio Multiplicatio Overview Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi

More information

Classification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc)

Classification of problem & problem solving strategies. classification of time complexities (linear, logarithmic etc) Classificatio of problem & problem solvig strategies classificatio of time complexities (liear, arithmic etc) Problem subdivisio Divide ad Coquer strategy. Asymptotic otatios, lower boud ad upper boud:

More information

Research Article A Unified Weight Formula for Calculating the Sample Variance from Weighted Successive Differences

Research Article A Unified Weight Formula for Calculating the Sample Variance from Weighted Successive Differences Discrete Dyamics i Nature ad Society Article ID 210761 4 pages http://dxdoiorg/101155/2014/210761 Research Article A Uified Weight Formula for Calculatig the Sample Variace from Weighted Successive Differeces

More information

DIGITAL FILTER ORDER REDUCTION

DIGITAL FILTER ORDER REDUCTION DIGITAL FILTER RDER REDUTI VAHID RAISSI DEHKRDI, McGILL UIVERSITY, AADA, vahid@cim.mcgill.ca AMIR G. AGHDAM, RDIA UIVERSITY, AADA, aghdam@ece.cocordia.ca ABSTRAT I this paper, a method is proposed to reduce

More information

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5

Olli Simula T / Chapter 1 3. Olli Simula T / Chapter 1 5 Sigals ad Systems Sigals ad Systems Sigals are variables that carry iformatio Systemstake sigals as iputs ad produce sigals as outputs The course deals with the passage of sigals through systems T-6.4

More information

COMM 602: Digital Signal Processing

COMM 602: Digital Signal Processing COMM 60: Digital Sigal Processig Lecture 4 -Properties of LTIS Usig Z-Trasform -Iverse Z-Trasform Properties of LTIS Usig Z-Trasform Properties of LTIS Usig Z-Trasform -ve +ve Properties of LTIS Usig Z-Trasform

More information

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser

FIR Filters. Lecture #7 Chapter 5. BME 310 Biomedical Computing - J.Schesser FIR Filters Lecture #7 Chapter 5 8 What Is this Course All About? To Gai a Appreciatio of the Various Types of Sigals ad Systems To Aalyze The Various Types of Systems To Lear the Skills ad Tools eeded

More information

Sequential Monte Carlo Methods - A Review. Arnaud Doucet. Engineering Department, Cambridge University, UK

Sequential Monte Carlo Methods - A Review. Arnaud Doucet. Engineering Department, Cambridge University, UK Sequetial Mote Carlo Methods - A Review Araud Doucet Egieerig Departmet, Cambridge Uiversity, UK http://www-sigproc.eg.cam.ac.uk/ ad2/araud doucet.html ad2@eg.cam.ac.uk Istitut Heri Poicaré - Paris - 2

More information

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and

Filter banks. Separately, the lowpass and highpass filters are not invertible. removes the highest frequency 1/ 2and Filter bas Separately, the lowpass ad highpass filters are ot ivertible T removes the highest frequecy / ad removes the lowest frequecy Together these filters separate the sigal ito low-frequecy ad high-frequecy

More information

Ch3 Discrete Time Fourier Transform

Ch3 Discrete Time Fourier Transform Ch3 Discrete Time Fourier Trasform 3. Show that the DTFT of [] is give by ( k). e k 3. Determie the DTFT of the two sided sigal y [ ],. 3.3 Determie the DTFT of the causal sequece x[ ] A cos( 0 ) [ ],

More information

A new iterative algorithm for reconstructing a signal from its dyadic wavelet transform modulus maxima

A new iterative algorithm for reconstructing a signal from its dyadic wavelet transform modulus maxima ol 46 No 6 SCIENCE IN CHINA (Series F) December 3 A ew iterative algorithm for recostructig a sigal from its dyadic wavelet trasform modulus maxima ZHANG Zhuosheg ( u ), LIU Guizhog ( q) & LIU Feg ( )

More information

Linear Algebra Issues in Wireless Communications

Linear Algebra Issues in Wireless Communications Rome-Moscow school of Matrix Methods ad Applied Liear Algebra August 0 September 18, 016 Liear Algebra Issues i Wireless Commuicatios Russia Research Ceter [vladimir.lyashev@huawei.com] About me ead of

More information

Lyapunov Stability Analysis for Feedback Control Design

Lyapunov Stability Analysis for Feedback Control Design Copyright F.L. Lewis 008 All rights reserved Updated: uesday, November, 008 Lyapuov Stability Aalysis for Feedbac Cotrol Desig Lyapuov heorems Lyapuov Aalysis allows oe to aalyze the stability of cotiuous-time

More information

A New Class of Ternary Zero Correlation Zone Sequence Sets Based on Mutually Orthogonal Complementary Sets

A New Class of Ternary Zero Correlation Zone Sequence Sets Based on Mutually Orthogonal Complementary Sets IOSR Joural of Electroics ad Commuicatio Egieerig (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 0, Issue 3, Ver. I (May - Ju.205), PP 08-3 www.iosrjourals.org A New Class of Terary Zero Correlatio

More information

Chapter 7 z-transform

Chapter 7 z-transform Chapter 7 -Trasform Itroductio Trasform Uilateral Trasform Properties Uilateral Trasform Iversio of Uilateral Trasform Determiig the Frequecy Respose from Poles ad Zeros Itroductio Role i Discrete-Time

More information

AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS

AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC MAPS http://www.paper.edu.c Iteratioal Joural of Bifurcatio ad Chaos, Vol. 1, No. 5 () 119 15 c World Scietific Publishig Compay AN OPEN-PLUS-CLOSED-LOOP APPROACH TO SYNCHRONIZATION OF CHAOTIC AND HYPERCHAOTIC

More information

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2

CS 270 Algorithms. Oliver Kullmann. Growth of Functions. Divide-and- Conquer Min-Max- Problem. Tutorial. Reading from CLRS for week 2 Geeral remarks Week 2 1 Divide ad First we cosider a importat tool for the aalysis of algorithms: Big-Oh. The we itroduce a importat algorithmic paradigm:. We coclude by presetig ad aalysig two examples.

More information

Quantum Annealing for Heisenberg Spin Chains

Quantum Annealing for Heisenberg Spin Chains LA-UR # - Quatum Aealig for Heiseberg Spi Chais G.P. Berma, V.N. Gorshkov,, ad V.I.Tsifriovich Theoretical Divisio, Los Alamos Natioal Laboratory, Los Alamos, NM Istitute of Physics, Natioal Academy of

More information

Lainiotis filter implementation. via Chandrasekhar type algorithm

Lainiotis filter implementation. via Chandrasekhar type algorithm Joural of Computatios & Modellig, vol.1, o.1, 2011, 115-130 ISSN: 1792-7625 prit, 1792-8850 olie Iteratioal Scietific Press, 2011 Laiiotis filter implemetatio via Chadrasehar type algorithm Nicholas Assimais

More information

Fall 2011, EE123 Digital Signal Processing

Fall 2011, EE123 Digital Signal Processing Lecture 5 Miki Lustig, UCB September 14, 211 Miki Lustig, UCB Motivatios for Discrete Fourier Trasform Sampled represetatio i time ad frequecy umerical Fourier aalysis requires a Fourier represetatio that

More information

Digital Signal Processing, Fall 2006

Digital Signal Processing, Fall 2006 Digital Sigal Processig, Fall 26 Lecture 1: Itroductio, Discrete-time sigals ad systems Zheg-Hua Ta Departmet of Electroic Systems Aalborg Uiversity, Demark zt@kom.aau.dk 1 Part I: Itroductio Itroductio

More information

Frequency Response of FIR Filters

Frequency Response of FIR Filters EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we itroduce the idea of the frequecy respose of LTI systems, ad focus specifically o the frequecy respose of FIR filters.. Steady-state

More information

The Method of Least Squares. To understand least squares fitting of data.

The Method of Least Squares. To understand least squares fitting of data. The Method of Least Squares KEY WORDS Curve fittig, least square GOAL To uderstad least squares fittig of data To uderstad the least squares solutio of icosistet systems of liear equatios 1 Motivatio Curve

More information

Frequency Domain Filtering

Frequency Domain Filtering Frequecy Domai Filterig Raga Rodrigo October 19, 2010 Outlie Cotets 1 Itroductio 1 2 Fourier Represetatio of Fiite-Duratio Sequeces: The Discrete Fourier Trasform 1 3 The 2-D Discrete Fourier Trasform

More information

FFTs in Graphics and Vision. The Fast Fourier Transform

FFTs in Graphics and Vision. The Fast Fourier Transform FFTs i Graphics ad Visio The Fast Fourier Trasform 1 Outlie The FFT Algorithm Applicatios i 1D Multi-Dimesioal FFTs More Applicatios Real FFTs 2 Computatioal Complexity To compute the movig dot-product

More information

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It

The z-transform can be used to obtain compact transform-domain representations of signals and systems. It 3 4 5 6 7 8 9 10 CHAPTER 3 11 THE Z-TRANSFORM 31 INTRODUCTION The z-trasform ca be used to obtai compact trasform-domai represetatios of sigals ad systems It provides ituitio particularly i LTI system

More information

Math 312 Lecture Notes One Dimensional Maps

Math 312 Lecture Notes One Dimensional Maps Math 312 Lecture Notes Oe Dimesioal Maps Warre Weckesser Departmet of Mathematics Colgate Uiversity 21-23 February 25 A Example We begi with the simplest model of populatio growth. Suppose, for example,

More information

Basic Iterative Methods. Basic Iterative Methods

Basic Iterative Methods. Basic Iterative Methods Abel s heorem: he roots of a polyomial with degree greater tha or equal to 5 ad arbitrary coefficiets caot be foud with a fiite umber of operatios usig additio, subtractio, multiplicatio, divisio, ad extractio

More information

Machine Learning Regression I Hamid R. Rabiee [Slides are based on Bishop Book] Spring

Machine Learning Regression I Hamid R. Rabiee [Slides are based on Bishop Book] Spring Machie Learig Regressio I Hamid R. Rabiee [Slides are based o Bishop Book] Sprig 015 http://ce.sharif.edu/courses/93-94//ce717-1 Liear Regressio Liear regressio: ivolves a respose variable ad a sigle predictor

More information

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary

Recursive Algorithm for Generating Partitions of an Integer. 1 Preliminary Recursive Algorithm for Geeratig Partitios of a Iteger Sug-Hyuk Cha Computer Sciece Departmet, Pace Uiversity 1 Pace Plaza, New York, NY 10038 USA scha@pace.edu Abstract. This article first reviews the

More information

Analysis of the Chow-Robbins Game with Biased Coins

Analysis of the Chow-Robbins Game with Biased Coins Aalysis of the Chow-Robbis Game with Biased Cois Arju Mithal May 7, 208 Cotets Itroductio to Chow-Robbis 2 2 Recursive Framework for Chow-Robbis 2 3 Geeralizig the Lower Boud 3 4 Geeralizig the Upper Boud

More information

Chapter 9 Computer Design Basics

Chapter 9 Computer Design Basics Logic ad Computer Desig Fudametals Chapter 9 Computer Desig Basics Part 1 Datapaths Overview Part 1 Datapaths Itroductio Datapath Example Arithmetic Logic Uit (ALU) Shifter Datapath Represetatio Cotrol

More information

Disjoint set (Union-Find)

Disjoint set (Union-Find) CS124 Lecture 7 Fall 2018 Disjoit set (Uio-Fid) For Kruskal s algorithm for the miimum spaig tree problem, we foud that we eeded a data structure for maitaiig a collectio of disjoit sets. That is, we eed

More information

2D DSP Basics: 2D Systems

2D DSP Basics: 2D Systems - Digital Image Processig ad Compressio D DSP Basics: D Systems D Systems T[ ] y = T [ ] Liearity Additivity: If T y = T [ ] The + T y = y + y Homogeeity: If The T y = T [ ] a T y = ay = at [ ] Liearity

More information

sensors ISSN

sensors ISSN Sesors 0,, 686-684; doi:0.3390/s070686 OPE ACCESS sesors ISS 44-80 www.mdpi.com/joural/sesors Article A Iovatios-Based oise Cacellig Techique o Iverse Kepstrum Whiteig Filter ad Adaptive FIR Filter i Beamformig

More information

EE Midterm Test 1 - Solutions

EE Midterm Test 1 - Solutions EE35 - Midterm Test - Solutios Total Poits: 5+ 6 Bous Poits Time: hour. ( poits) Cosider the parallel itercoectio of the two causal systems, System ad System 2, show below. System x[] + y[] System 2 The

More information

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0.

MAS160: Signals, Systems & Information for Media Technology. Problem Set 5. DUE: November 3, (a) Plot of u[n] (b) Plot of x[n]=(0. MAS6: Sigals, Systems & Iformatio for Media Techology Problem Set 5 DUE: November 3, 3 Istructors: V. Michael Bove, Jr. ad Rosalid Picard T.A. Jim McBride Problem : Uit-step ad ruig average (DSP First

More information

Computational Tutorial of Steepest Descent Method and Its Implementation in Digital Image Processing

Computational Tutorial of Steepest Descent Method and Its Implementation in Digital Image Processing Computatioal utorial of Steepest Descet Method ad Its Implemetatio i Digital Image Processig Vorapoj Pataavijit Departmet of Electrical ad Electroic Egieerig, Faculty of Egieerig Assumptio Uiversity, Bagkok,

More information

6.003 Homework #3 Solutions

6.003 Homework #3 Solutions 6.00 Homework # Solutios Problems. Complex umbers a. Evaluate the real ad imagiary parts of j j. π/ Real part = Imagiary part = 0 e Euler s formula says that j = e jπ/, so jπ/ j π/ j j = e = e. Thus the

More information

THE KALMAN FILTER RAUL ROJAS

THE KALMAN FILTER RAUL ROJAS THE KALMAN FILTER RAUL ROJAS Abstract. This paper provides a getle itroductio to the Kalma filter, a umerical method that ca be used for sesor fusio or for calculatio of trajectories. First, we cosider

More information

Chapter 9 Computer Design Basics

Chapter 9 Computer Design Basics Logic ad Computer Desig Fudametals Chapter 9 Computer Desig asics Part Datapaths Charles Kime & Thomas Kamiski 008 Pearso Educatio, Ic. (Hyperliks are active i View Show mode) Overview Part Datapaths Itroductio

More information

Detailed derivation of multiplicative update rules for NMF

Detailed derivation of multiplicative update rules for NMF 1 Itroductio Detailed derivatio of multiplicative update rules for NMF Jua José Burred March 2014 Paris, Frace jjburred@jjburredcom The goal of No-egative Matrix Factorizatio (NMF) is to decompose a matrix

More information

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Problem Set 11 Solutions.

Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Problem Set 11 Solutions. Massachusetts Istitute of Techology Departmet of Electrical Egieerig ad Computer Sciece Issued: Thursday, December 8, 005 6.341: Discrete-Time Sigal Processig Fall 005 Problem Set 11 Solutios Problem 11.1

More information

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c

Direction of Arrival Estimation Method in Underdetermined Condition Zhang Youzhi a, Li Weibo b, Wang Hanli c 4th Iteratioal Coferece o Advaced Materials ad Iformatio Techology Processig (AMITP 06) Directio of Arrival Estimatio Method i Uderdetermied Coditio Zhag Youzhi a, Li eibo b, ag Hali c Naval Aeroautical

More information

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences A Uiversity of Califoria at Berkeley College of Egieerig Departmet of Electrical Egieerig ad Computer Scieces U N I V E R S T H E I T Y O F LE T TH E R E B E LI G H T C A L I F O R N 8 6 8 I A EECS : Sigals

More information

Algorithm Analysis. Chapter 3

Algorithm Analysis. Chapter 3 Data Structures Dr Ahmed Rafat Abas Computer Sciece Dept, Faculty of Computer ad Iformatio, Zagazig Uiversity arabas@zu.edu.eg http://www.arsaliem.faculty.zu.edu.eg/ Algorithm Aalysis Chapter 3 3. Itroductio

More information

Spectral Observer with Reduced Information Demand

Spectral Observer with Reduced Information Demand Spectral Observer with Reduced Iformatio Demad Gy. Orosz, L. Sujbert, G. Péceli Departmet of Measuremet ad Iformatio Systems, Budapest Uiversity of Techology ad Ecoomics Magyar tudósok krt. 2., -52 Budapest,

More information

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity

LINEAR REGRESSION ANALYSIS. MODULE IX Lecture Multicollinearity LINEAR REGRESSION ANALYSIS MODULE IX Lecture - 9 Multicolliearity Dr Shalabh Departmet of Mathematics ad Statistics Idia Istitute of Techology Kapur Multicolliearity diagostics A importat questio that

More information

2D DSP Basics: Systems Stability, 2D Sampling

2D DSP Basics: Systems Stability, 2D Sampling - Digital Iage Processig ad Copressio D DSP Basics: Systes Stability D Saplig Stability ty Syste is stable if a bouded iput always results i a bouded output BIBO For LSI syste a sufficiet coditio for stability:

More information

Homework Set #3 - Solutions

Homework Set #3 - Solutions EE 15 - Applicatios of Covex Optimizatio i Sigal Processig ad Commuicatios Dr. Adre Tkaceko JPL Third Term 11-1 Homework Set #3 - Solutios 1. a) Note that x is closer to x tha to x l i the Euclidea orm

More information

Element sampling: Part 2

Element sampling: Part 2 Chapter 4 Elemet samplig: Part 2 4.1 Itroductio We ow cosider uequal probability samplig desigs which is very popular i practice. I the uequal probability samplig, we ca improve the efficiecy of the resultig

More information

Numerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets

Numerical Solution of the Two Point Boundary Value Problems By Using Wavelet Bases of Hermite Cubic Spline Wavelets Australia Joural of Basic ad Applied Scieces, 5(): 98-5, ISSN 99-878 Numerical Solutio of the Two Poit Boudary Value Problems By Usig Wavelet Bases of Hermite Cubic Splie Wavelets Mehdi Yousefi, Hesam-Aldie

More information

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur

Module 5 EMBEDDED WAVELET CODING. Version 2 ECE IIT, Kharagpur Module 5 EMBEDDED WAVELET CODING Versio ECE IIT, Kharagpur Lesso 4 SPIHT algorithm Versio ECE IIT, Kharagpur Istructioal Objectives At the ed of this lesso, the studets should be able to:. State the limitatios

More information

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016

Lecture 3. Digital Signal Processing. Chapter 3. z-transforms. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev. 2016 Lecture 3 Digital Sigal Processig Chapter 3 z-trasforms Mikael Swartlig Nedelko Grbic Begt Madersso rev. 06 Departmet of Electrical ad Iformatio Techology Lud Uiversity z-trasforms We defie the z-trasform

More information

CSE Introduction to Parallel Processing. Chapter 3. Parallel Algorithm Complexity

CSE Introduction to Parallel Processing. Chapter 3. Parallel Algorithm Complexity Dr. Izadi CSE-40533 Itroductio to Parallel Processig Chapter 3 Parallel Algorithm Complexity Review algorithm complexity ad various complexity classes Itroduce the otios of time ad time-cost optimality

More information

Parallel Vector Algorithms David A. Padua

Parallel Vector Algorithms David A. Padua Parallel Vector Algorithms 1 of 32 Itroductio Next, we study several algorithms where parallelism ca be easily expressed i terms of array operatios. We will use Fortra 90 to represet these algorithms.

More information

Chapter 2. Simulation Techniques. References:

Chapter 2. Simulation Techniques. References: Simulatio Techiques Refereces: Chapter 2 S.M.Kay, Fudametals of Statistical Sigal Processig: Estimatio Theory, Pretice Hall, 993 C.L.Nikias ad M.Shao, Sigal Processig with Alpha-Stable Distributio ad Applicatios,

More information

Ch3. Asymptotic Notation

Ch3. Asymptotic Notation Ch. Asymptotic Notatio copyright 006 Preview of Chapters Chapter How to aalyze the space ad time complexities of program Chapter Review asymptotic otatios such as O, Ω, Θ, o for simplifyig the aalysis

More information