DSP First, 2/e. Sample the DTFT DFT. This Lecture: Lecture 17 DFT: Discrete Fourier Transform. Chapter 8, Sections 8-1, 8-2 and 8-4

Size: px
Start display at page:

Download "DSP First, 2/e. Sample the DTFT DFT. This Lecture: Lecture 17 DFT: Discrete Fourier Transform. Chapter 8, Sections 8-1, 8-2 and 8-4"

Transcription

1 DSP First READIG ASSIGMETS This ctur: Chaptr 8 Sctios 8-8- ad 8-4 ctur 7 DFT: Discrt Fourir Trasfor Aug 6-6 JH McCllla & RW Schafr ECTURE OBJECTIVES Discrt Fourir Trasfor DFT fro DTFT by frqucy saplig DFT coputatio FFT DFT pairs ad proprtis Priodicity i DFT ti & frqucy Sapl th DTFT DFT Wat coputabl Fourir trasfor Fiit sigal lgth Fiit ubr of frqucis Priodic : is th frqucy id Aug 6-6 JH McCllla & RW Schafr 4 Aug 6-6 JH McCllla & RW Schafr 5

2 Wat a Coputabl IVERSE Fourir Trasfor IVERSE Fourir Trasfor Writ th ivrs DTFT as a fiit Ria su: li ot that Propos: whr This is th ivrs Discrt Fourir Trasfor IDFT Aug JH McCllla & RW Schafr DFT b forward will Ivrs DFT wh = proof proof Copl potials ar ORTHOGOA Copl potials ar ORTHOGOA Aug 6-6 JH McCllla & RW Schafr 7 Orthogoality of Copl Epotials Epotials Th squc st: for Th squc st: for othrwis b bcaus ad l li Aug 6-6 JH McCllla & RW Schafr 8 ad l l li 4-pt DFT: urical Eapl p p Ta th 4 pt DFT of th followig sigal Ta th 4-pt DFT of th followig sigal } { 4 9 Aug 6-6 JH McCllla & RW Schafr 9 4

3 -pt DFT: urical Eapl 4-pt idft: urical Eapl Ta th -pt DFT of th ipuls { } { } Aug 6-6 JH McCllla & RW Schafr Aug 6-6 JH McCllla & RW Schafr Matri For for -pt DFT I MATAB DFT atri is dftt Obtai DFT by = dftt* Or or fficitly by = fft Fast Fourir trasfor FFT algorith latr DFT atri Sigal vctor Aug 6-6 JH McCllla & RW Schafr FFT: Fast Fourir Trasfor FFT is a algorith for coputig th DFT log vrsus opratios g Cout ultiplicatios ad additios For apl wh = 4 = ops vs. opratios tis fastr What about =56 how uch fastr? Aug 6-6 JH McCllla & RW Schafr

4 Zro-Paddig givs dsr FREQUEC SAMPIG FREQUEC SAMPIG W t l f DTFT Wat ay sapls of DTFT WH? to a a sooth plot Fiit sigal lgth Fiit ubr of frqucis Thus w d Aug 6-6 JH McCllla & RW Schafr 4 Zro-Paddig with th FFT Zro-Paddig with th FFT Gt ay sapls of DTFT Gt ay sapls of DTFT Fiit sigal lgth Fi it b f f i Fiit ubr of frqucis Thus w d I MATAB Us = fft With =lgth lss tha Dfi padto = zros-; Ta th pt DFT of padto Aug 6-6 JH McCllla & RW Schafr 5 Ta th -pt DFT of padto DFT priodic i frqucy doai frqucy doai Sic DTFT is priodic i frqucy th DFT Sic DTFT is priodic i frqucy th DFT ust also b priodic i What about gativ idics ad Cougat What about gativ idics ad Cougat Sytry? Aug 6-6 JH McCllla & RW Schafr 6 9 DFT Priodicity i Frqucy Id Frqucy Id Aug 6-6 JH McCllla & RW Schafr 7.g.

5 DFT pairs & proprtis Rcall DTFT pairs bcaus DFT is sapld DTFT S t two slids DFT acts o a fiit-lgth sigal so w ca us DTFT pairs & proprtis for fiit sigals Wat DFT proprtis rlatd to coputatio Ad w will coctrat t o o or pair: DTFT ad DFT of fiit siusoid or cp gth- sigal -pt DFT Aug 6-6 JH McCllla & RW Schafr 8 Ths sigals hav ifiit it lgth Aug 6-6 JH McCllla & RW Schafr 9 Suary of DTFT Pairs Ths proprtis ivolv circular idig Aug 6-6 JH McCllla & RW Schafr Aug 6-6 JH McCllla & RW Schafr

6 Covolutio Proprty ot th sa Alost tru for DFT: Covolutio aps to ultiplicatio of trasfors d a diffrt id of covolutio CIRCUAR COVOUTIO ATER i a advacd DSP cours iwis is for Ti-Shiftig Has to b circular Bcaus th doai is also priodic Aug 6-6 JH McCllla & RW Schafr Aug 6-6 JH McCllla & RW Schafr Dlay Proprty of DFT Rcall DTFT proprty for ti shiftig: y d Epctd DFT proprty via frqucy saplig y Idics such as odulo- bcaus d d d ust b valuatd d d d Aug 6-6 JH McCllla & RW Schafr 4 DTFT of a gth- Puls Kow DTFT of fiit rctagular puls Dirichlt for ad a liar phas tr si si othrwis Us frqucy-saplig to gt DFT si D si si si D Aug 6-6 JH McCllla & RW Schafr 5

7 DTFT of a Fiit gth Copl Epotial Copl Epotial Kow DTFT of fiit rctagular puls Kow DTFT of fiit rctagular puls Dirichlt for ad a liar phas tr si si si othrwis Us frqucy shift proprty si si D Us frqucy-shift proprty i si th i y Aug 6-6 JH McCllla & RW Schafr 6 si othrwis DTFT of a Fiit gth Copl Epotial Copl Epotial Kow DTFT so w ca sapl i frqucy Kow DTFT so w ca sapl i frqucy si si othrwis y Thus th -poit DFT is othrwis y Dirichlt Fuctio si at si si D Aug 6-6 JH McCllla & RW Schafr 7 si -pt DFT of Copl Epotial Epotial.5 si si si othrwis Aug 6-6 JH McCllla & RW Schafr 8 for so th outli is a shiftd Dirichlt si si D -pt DFT of Copl Ep: o th grid th grid si si si othrwis Aug 6-6 JH McCllla & RW Schafr 9 for so th outli is a shiftd Dirichlt si si D

8 5-pt DFT of Siusoid: zro paddig 5.4 RECA: BadPass Filtr BPF Frqucy shiftig up ad dow is do by cosi ultiplicatio i th ti doai Acos othrwis 4 4 AD AD Aug 6-6 JH McCllla & RW Schafr 5-pt DFT of Siusoid: zro paddig 5.4? BPF is frqucy shiftd vrsio of PF blow h cos si diff BP id DTFT H co BP co co co Aug 6-6 JH McCllla & RW Schafr? Zro-crossigs of Dirichlt? Width of Dirichlt? Dsity of frqucy sapls? Thus w hav a sipl BPF Aug 6-6 JH McCllla & RW Schafr

DSP First, 2/e. This Lecture: Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT. Spectrogram. Time-Dependent Fourier Transform

DSP First, 2/e. This Lecture: Lecture 19 Spectrogram: Spectral Analysis via DFT & DTFT. Spectrogram. Time-Dependent Fourier Transform DSP First, 2/ Lctur 19 Spctrogram: Spctral Aalysis via DFT & DTFT READIG ASSIGMETS This Lctur: Chaptr 8, Scts. 8-6 & 8-7 Othr Radig: FFT: Chaptr 8, Sct. 8-8 Aug 216 23-216, JH McCllla & RW Schafr 3 LECTURE

More information

2-D FOURIER TRANSFORMS. Vedat Tavşano

2-D FOURIER TRANSFORMS. Vedat Tavşano -D FOURIER Vdat Tavşao aoğlu -D Fourir Trasfors Cotiuous-Variabl Fourir Trasfor of a -D Sigal F a, f a, dd Vdat Tavşaoğlu -D Fourir Trasfors A f a, Fourir Trasfor of Rctagular Fuctio X F a Y, A X 0 Y 0

More information

Fast Fourier Transform (FFT)

Fast Fourier Transform (FFT) IC Desig Lab. Fast Fourier Trasfor FFT, - e e π π G Twiddle Factor : e π Radi- DIT FFT: IC Desig Lab. π cos si π Syetry Property Periodicity Property u u u * Cougate Syetric Property a a b b a b b a b

More information

The Inverse z-transform

The Inverse z-transform The Iverse -Trasfor I sciece oe tries to tell people, i such a way as to be uderstood by everyoe, soethig that o oe ever ew before. But i poetry, it's the eact opposite. Paul Dirac Cotet ad Figures are

More information

Outline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops

Outline. Tasks for Exercise Six. Exercise Six Goals. Task One: Kinetic Energy Table. Nested for Loops. Laboratory VI Program Control Using Loops Ercis 6 -- Loopig March 9, 6 Laboratory VI Program Cotrol Usig Loops Larry Cartto Computr Scic 6 Computig i Egirig ad Scic Outli Ercis si goals Outli tasks for rcis si Itroduc ida of std loops ad tabl

More information

EE123 Digital Signal Processing

EE123 Digital Signal Processing Last Time EE Digital Sigal Processig Lecture 7 Block Covolutio, Overlap ad Add, FFT Discrete Fourier Trasform Properties of the Liear covolutio through circular Today Liear covolutio with Overlap ad add

More information

Spectral leakage and windowing

Spectral leakage and windowing EEL33: Discrete-Time Sigals ad Systems Spectral leakage ad widowig. Itroductio Spectral leakage ad widowig I these otes, we itroduce the idea of widowig for reducig the effects of spectral leakage, ad

More information

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK

ELEG 5173L Digital Signal Processing Introduction to TMS320C6713 DSK Departmet of Electrical Egieerig Uiversity of Arasas ELEG 5173L Digital Sigal Processig Itroductio to TMS320C6713 DSK Dr. Jigia Wu wuj@uar.edu ANALOG V.S DIGITAL 2 Aalog sigal processig ASP Aalog sigal

More information

EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS

EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS Kragujevac Joural of Matheatics Volue 43(3) (019), Pages 47 441. EVEN VERTEX EQUITABLE EVEN LABELING FOR CYCLE RELATED GRAPHS A. LOURDUSAMY 1 AND F. PATRICK 1 Abstract. Let G be a graph with p vertices

More information

Lecture 1: Introduction and Strassen s Algorithm

Lecture 1: Introduction and Strassen s Algorithm 5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access

More information

Fast Fourier Transform (FFT) Algorithms

Fast Fourier Transform (FFT) Algorithms Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform

More information

G.CO.A.5 WORKSHEET #9 geometrycommoncore NAME: 1 DOUBLE REFLECTIONS OVER INTERSECTING LINES Plot each of the stages of the composite transformation.

G.CO.A.5 WORKSHEET #9 geometrycommoncore NAME: 1 DOUBLE REFLECTIONS OVER INTERSECTING LINES Plot each of the stages of the composite transformation. G.CO.A.5 WORKSHT #9 geoetrycoocore NAM: 1 OUBL RLCTIONS OVR INTRSCTING LINS Plot eac of te stages of te coposite trasforatio. 1a) r r ( ABC) Circle te resultat trasforatio fro ABC to A B C? Rotatio Reflectio

More information

IMPLEMENTATION OF FLOATING POINT MAC USING RESIDUE NUMBER SYSTEM

IMPLEMENTATION OF FLOATING POINT MAC USING RESIDUE NUMBER SYSTEM Joural of Theoretical ad Applied Iforatio Techology th April 4. Vol. 6 No. 5-4 JATIT & LLS. All rights reserved. IMPLEMENTATION OF FLOATING POINT MAC USING RESIDUE NUMER SYSTEM DHANAAL R, SARAT KUMAR SAHOO,,

More information

Chapter 9: Functions and Subroutines

Chapter 9: Functions and Subroutines Pag 5 Chaptr 9: Fuctios ad Subroutis Rusig Cod. This chaptr itroducs th us of Fuctios ad Subroutis. Programmrs crat subroutis ad fuctios to tst small parts of a program, rus ths parts whr thy ar dd, xtd

More information

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence

9.1. Sequences and Series. Sequences. What you should learn. Why you should learn it. Definition of Sequence _9.qxd // : AM Page Chapter 9 Sequeces, Series, ad Probability 9. Sequeces ad Series What you should lear Use sequece otatio to write the terms of sequeces. Use factorial otatio. Use summatio otatio to

More information

Section 7.2: Direction Fields and Euler s Methods

Section 7.2: Direction Fields and Euler s Methods Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will

More information

THE DISTANCE FROM A POINT TO A LINE IN 2- SPACE

THE DISTANCE FROM A POINT TO A LINE IN 2- SPACE MCV 4UI THE DISTNCE FOM OINT TO LINE IN - SCE LENING GOL: Be able to erive the forula for the istace fro a poit to a lie i. Be able to calculate the istace fro a poit to a lie i a the istace betwee parallel

More information

Linear Time-Invariant Systems

Linear Time-Invariant Systems 9/9/00 LIEAR TIE-IVARIAT SYSTES Uit, d Part Liear Time-Ivariat Sstems A importat class of discrete-time sstem cosists of those that are Liear Priciple of superpositio Time-ivariat dela of the iput sequece

More information

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design

Filter design. 1 Design considerations: a framework. 2 Finite impulse response (FIR) filter design Filter desig Desig cosideratios: a framework C ı p ı p H(f) Aalysis of fiite wordlegth effects: I practice oe should check that the quatisatio used i the implemetatio does ot degrade the performace of

More information

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract

On Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order

More information

NTH, GEOMETRIC, AND TELESCOPING TEST

NTH, GEOMETRIC, AND TELESCOPING TEST NTH, GEOMETRIC, AND TELESCOPING TEST Sectio 9. Calculus BC AP/Dual, Revised 08 viet.dag@humbleisd.et /4/08 0:0 PM 9.: th, Geometric, ad Telescopig Test SUMMARY OF TESTS FOR SERIES Lookig at the first few

More information

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1

COSC 1P03. Ch 7 Recursion. Introduction to Data Structures 8.1 COSC 1P03 Ch 7 Recursio Itroductio to Data Structures 8.1 COSC 1P03 Recursio Recursio I Mathematics factorial Fiboacci umbers defie ifiite set with fiite defiitio I Computer Sciece sytax rules fiite defiitio,

More information

DIGITAL FFT RECEIVER. Figure 1 Digital FFT receiver.

DIGITAL FFT RECEIVER. Figure 1 Digital FFT receiver. DIGITAL T RECEIVER Th digital T, complx vctor, I/Q rcivr show i igur compriss two ADCs digitisig sigal ad ois from th I ad Q outputs of a quadratur mixr. igur Digital T rcivr. Th mixr dow-covrts R bads

More information

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS

MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS Fura Uiversity Electroic Joural of Udergraduate Matheatics Volue 00, 1996 6-16 MAXIMUM MATCHINGS IN COMPLETE MULTIPARTITE GRAPHS DAVID SITTON Abstract. How ay edges ca there be i a axiu atchig i a coplete

More information

EVALUATION OF TRIGONOMETRIC FUNCTIONS

EVALUATION OF TRIGONOMETRIC FUNCTIONS EVALUATION OF TRIGONOMETRIC FUNCTIONS Whe first exposed to trigoometric fuctios i high school studets are expected to memorize the values of the trigoometric fuctios of sie cosie taget for the special

More information

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance

Pseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels:

The following algorithms have been tested as a method of converting an I.F. from 16 to 512 MHz to 31 real 16 MHz USB channels: DBE Memo#1 MARK 5 MEMO #18 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 1886 November 19, 24 Telephoe: 978-692-4764 Fax: 781-981-59 To: From: Mark 5 Developmet Group

More information

condition w i B i S maximum u i

condition w i B i S maximum u i ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility

More information

2) Give an example of a polynomial function of degree 4 with leading coefficient of -6

2) Give an example of a polynomial function of degree 4 with leading coefficient of -6 Math 165 Read ahead some cocepts from sectios 4.1 Read the book or the power poit presetatios for this sectio to complete pages 1 ad 2 Please, do ot complete the other pages of the hadout If you wat to

More information

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion

EECS 442 Computer vision. Multiple view geometry Affine structure from Motion EECS 442 Computer visio Multiple view geometry Affie structure from Motio - Affie structure from motio problem - Algebraic methods - Factorizatio methods Readig: [HZ] Chapters: 6,4,8 [FP] Chapter: 2 Some

More information

Assignment 5; Due Friday, February 10

Assignment 5; Due Friday, February 10 Assigmet 5; Due Friday, February 10 17.9b The set X is just two circles joied at a poit, ad the set X is a grid i the plae, without the iteriors of the small squares. The picture below shows that the iteriors

More information

Alpha Individual Solutions MAΘ National Convention 2013

Alpha Individual Solutions MAΘ National Convention 2013 Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5

More information

CSE 5311 Notes 16: Matrices

CSE 5311 Notes 16: Matrices CSE 5311 Notes 16: Matrices STRASSEN S MATRIX MULTIPLICATION Matrix additio: takes scalar additios. Everyday atrix ultiply: p p Let = = p. takes p scalar ultiplies ad -1)p scalar additios. Best lower boud

More information

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the.

An (or ) is a sequence in which each term after the first differs from the preceding term by a fixed constant, called the. Sectio.2 Arithmetic Sequeces ad Series -.2 Arithmetic Sequeces ad Series Arithmetic Sequeces Arithmetic Series Key Terms: arithmetic sequece (arithmetic progressio), commo differece, arithmetic series

More information

Here are the coefficients of the terms listed above: 3,5,2,1,1 respectively.

Here are the coefficients of the terms listed above: 3,5,2,1,1 respectively. *. Operatios with Poloials: Let s start b defiig soe words. Ter: A ter is a uber, variable or the product of a uber ad variable(s). For eaple:,, z, a Coefficiet: A coefficiet is the ueric factor of the

More information

Abstract Syntax Trees. AST Data Structure. Visitor Interface. Accept methods. Visitor Methodology for AST Traversal CS412/CS413

Abstract Syntax Trees. AST Data Structure. Visitor Interface. Accept methods. Visitor Methodology for AST Traversal CS412/CS413 Abstract Syta Trees CS412/CS413 Itroductio to Copilers Ti Teitelbau Lecture 12: Visitors; Sybol Tables February 18, 2005 Separate AST costructio fro seatic checkig phase Traverse the AST ad perfor seatic

More information

. Written in factored form it is easy to see that the roots are 2, 2, i,

. Written in factored form it is easy to see that the roots are 2, 2, i, CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or

More information

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions

Outline. Applications of FFT in Communications. Fundamental FFT Algorithms. FFT Circuit Design Architectures. Conclusions FFT Circuit Desig Outlie Applicatios of FFT i Commuicatios Fudametal FFT Algorithms FFT Circuit Desig Architectures Coclusios DAB Receiver Tuer OFDM Demodulator Chael Decoder Mpeg Audio Decoder 56/5/ 4/48

More information

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)

CSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS) CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a

More information

WebAssign Lesson 6-1b Geometric Series (Homework)

WebAssign Lesson 6-1b Geometric Series (Homework) WebAssig Lesso 6-b Geometric Series (Homework) Curret Score : / 49 Due : Wedesday, July 30 204 :0 AM MDT Jaimos Skriletz Math 75, sectio 3, Summer 2 204 Istructor: Jaimos Skriletz. /2 poitsrogac alcet2

More information

Introduction to Sigma Notation

Introduction to Sigma Notation Itroductio to Siga Notatio Steph de Silva //207 What is siga otatio? is the capital Greek letter for the soud s I this case, it s just shorthad for su Siga otatio is what we use whe we have a series of

More information

Chapter 4 The Datapath

Chapter 4 The Datapath The Ageda Chapter 4 The Datapath Based o slides McGraw-Hill Additioal material 24/25/26 Lewis/Marti Additioal material 28 Roth Additioal material 2 Taylor Additioal material 2 Farmer Tae the elemets that

More information

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure.

SAMPLE VERSUS POPULATION. Population - consists of all possible measurements that can be made on a particular item or procedure. SAMPLE VERSUS POPULATION Populatio - cosists of all possible measuremets that ca be made o a particular item or procedure. Ofte a populatio has a ifiite umber of data elemets Geerally expese to determie

More information

Computer Graphics (CS 543) Lecture 4a: Introduction to Transformations

Computer Graphics (CS 543) Lecture 4a: Introduction to Transformations Coputer Graphics (CS 543) Lecture 4a: Introduction to Transforations Prof Eanuel Agu Coputer Science Dept. Worcester Polytechnic Institute (WPI) Hidden-Surface Reoval If ultiple surfaces overlap, we want

More information

CSE 417: Algorithms and Computational Complexity

CSE 417: Algorithms and Computational Complexity Time CSE 47: Algorithms ad Computatioal Readig assigmet Read Chapter of The ALGORITHM Desig Maual Aalysis & Sortig Autum 00 Paul Beame aalysis Problem size Worst-case complexity: max # steps algorithm

More information

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS

APPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful

More information

Some topological indices of graphs and some inequalities

Some topological indices of graphs and some inequalities Iraia Joral of athatical Chistr, Vol, No, Fbrar 0, pp7 80 IJC So topological idics of graphs ad so iqalitis OHARRAB, AND B KHZRI OHADDA Dpartt of athatics, Prsia lf Uirsit, Bshhr7569, Ira Dpartt of athatics,

More information

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns

K-NET bus. When several turrets are connected to the K-Bus, the structure of the system is as showns K-NET bus The K-Net bus is based o the SPI bus but it allows to addressig may differet turrets like the I 2 C bus. The K-Net is 6 a wires bus (4 for SPI wires ad 2 additioal wires for request ad ackowledge

More information

ECE4050 Data Structures and Algorithms. Lecture 6: Searching

ECE4050 Data Structures and Algorithms. Lecture 6: Searching ECE4050 Data Structures ad Algorithms Lecture 6: Searchig 1 Search Give: Distict keys k 1, k 2,, k ad collectio L of records of the form (k 1, I 1 ), (k 2, I 2 ),, (k, I ) where I j is the iformatio associated

More information

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s-

Our starting point is the following sketch of part of one of these polygons having n vertexes and side-length s- PROPERTIES OF REGULAR POLYGONS The simplest D close figures which ca be costructe by the cocateatio of equal legth straight lies are the regular polygos icluig the equilateral triagle, the petago, a the

More information

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design

CSC 220: Computer Organization Unit 11 Basic Computer Organization and Design College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:

More information

Computation of DFT. W has a specific structure and because

Computation of DFT. W has a specific structure and because DSP 7 Computatio of DFT CTU EE Computatio of DFT Efficiet algoithms fo computig DFT Fast Fouie Tasfom. a Compute oly a few poits out of all poits b Compute all poits hat ae the efficiecy citeia? umbe of

More information

Numerical Methods Lecture 6 - Curve Fitting Techniques

Numerical Methods Lecture 6 - Curve Fitting Techniques Numerical Methods Lecture 6 - Curve Fittig Techiques Topics motivatio iterpolatio liear regressio higher order polyomial form expoetial form Curve fittig - motivatio For root fidig, we used a give fuctio

More information

Lecture 18. Optimization in n dimensions

Lecture 18. Optimization in n dimensions Lecture 8 Optimizatio i dimesios Itroductio We ow cosider the problem of miimizig a sigle scalar fuctio of variables, f x, where x=[ x, x,, x ]T. The D case ca be visualized as fidig the lowest poit of

More information

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions:

Solution printed. Do not start the test until instructed to do so! CS 2604 Data Structures Midterm Spring, Instructions: CS 604 Data Structures Midterm Sprig, 00 VIRG INIA POLYTECHNIC INSTITUTE AND STATE U T PROSI M UNI VERSI TY Istructios: Prit your ame i the space provided below. This examiatio is closed book ad closed

More information

Weston Anniversary Fund

Weston Anniversary Fund Westo Olie Applicatio Guide 2018 1 This guide is desiged to help charities applyig to the Westo to use our olie applicatio form. The Westo is ope to applicatios from 5th Jauary 2018 ad closes o 30th Jue

More information

A Very Simple Approach for 3-D to 2-D Mapping

A Very Simple Approach for 3-D to 2-D Mapping A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics

More information

MULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ

MULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ MULTIBEAM SONAR RECORDS DATA DECIMATION USING HIERARCHICAL SPLINE INTERPOLATION JERZY DEMKOWICZ Gdask Uiversity of Techology Narutowicza 11/12, 8-233 Gdask, Polad dejot@eti.pg.gda.pl Multibea soar records

More information

Pattern Recognition Systems Lab 1 Least Mean Squares

Pattern Recognition Systems Lab 1 Least Mean Squares Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig

More information

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0

Polynomial Functions and Models. Learning Objectives. Polynomials. P (x) = a n x n + a n 1 x n a 1 x + a 0, a n 0 Polyomial Fuctios ad Models 1 Learig Objectives 1. Idetify polyomial fuctios ad their degree 2. Graph polyomial fuctios usig trasformatios 3. Idetify the real zeros of a polyomial fuctio ad their multiplicity

More information

Chapter 3 Classification of FFT Processor Algorithms

Chapter 3 Classification of FFT Processor Algorithms Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As

More information

Computation of DFT. point DFT. W has a specific structure and because

Computation of DFT. point DFT. W has a specific structure and because DSP 5 Spig Computatio of DFT CTU EE Computatio of DFT Efficiet algoithms fo computig DFT Fast Fouie Tasfom. a Compute oly a few poits out of all poits b Compute all poits hat ae the efficiecy citeia? umbe

More information

CMPT 125 Assignment 2 Solutions

CMPT 125 Assignment 2 Solutions CMPT 25 Assigmet 2 Solutios Questio (20 marks total) a) Let s cosider a iteger array of size 0. (0 marks, each part is 2 marks) it a[0]; I. How would you assig a poiter, called pa, to store the address

More information

c) Did doing the transformations in a different order matter? Explain why?

c) Did doing the transformations in a different order matter? Explain why? G.O..5 WORKSHEET #8 geoetrycoocore NME: 1 OMPOSITE TRNSFORMTIONS DOES ORDER MTTER Use the coposite trasforatio to plot ad 1a) T 3,5 r ( ) y axis b) y axis T 3,5 (6,-1) (6,-1) (3,-4) (3,-4) (5,-7) (5,-7)

More information

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved.

Chapter 11. Friends, Overloaded Operators, and Arrays in Classes. Copyright 2014 Pearson Addison-Wesley. All rights reserved. Chapter 11 Frieds, Overloaded Operators, ad Arrays i Classes Copyright 2014 Pearso Addiso-Wesley. All rights reserved. Overview 11.1 Fried Fuctios 11.2 Overloadig Operators 11.3 Arrays ad Classes 11.4

More information

Region Segmentation Region Segmentation

Region Segmentation Region Segmentation /7/ egion Segentation Lecture-7 Chapter 3, Fundaentals of Coputer Vision Alper Yilaz,, Mubarak Shah, Fall UCF egion Segentation Alper Yilaz,, Mubarak Shah, Fall UCF /7/ Laer epresentation Applications

More information

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4

9 x and g(x) = 4. x. Find (x) 3.6. I. Combining Functions. A. From Equations. Example: Let f(x) = and its domain. Example: Let f(x) = and g(x) = x x 4 1 3.6 I. Combiig Fuctios A. From Equatios Example: Let f(x) = 9 x ad g(x) = 4 f x. Fid (x) g ad its domai. 4 Example: Let f(x) = ad g(x) = x x 4. Fid (f-g)(x) B. From Graphs: Graphical Additio. Example:

More information

COMPOSITE TRANSFORMATIONS. DOES ORDER MATTER Use the composite transformation to plot A B C and A B C. 1a)

COMPOSITE TRANSFORMATIONS. DOES ORDER MATTER Use the composite transformation to plot A B C and A B C. 1a) U3 L1 HW OMPOSITE TRNSFORMTIONS DOES ORDER MTTER Use the coposite trasforatio to plot ad 1a) T 3,5 ry axis ( ) b) ry axis T 3,5 ( ) c) Did doig the trasforatios i a differet order atter? Explai why? 2a)

More information

Chapter 18: Ray Optics Questions & Problems

Chapter 18: Ray Optics Questions & Problems Chapter 18: Ray Optics Questios & Problems c -1 2 1 1 1 h s θr= θi 1siθ 1 = 2si θ 2 = θ c = si ( ) + = m = = v s s f h s 1 Example 18.1 At high oo, the su is almost directly above (about 2.0 o from the

More information

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation

Improvement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity

More information

INTERSECTION CORDIAL LABELING OF GRAPHS

INTERSECTION CORDIAL LABELING OF GRAPHS INTERSECTION CORDIAL LABELING OF GRAPHS G Meea, K Nagaraja Departmet of Mathematics, PSR Egieerig College, Sivakasi- 66 4, Virudhuagar(Dist) Tamil Nadu, INDIA meeag9@yahoocoi Departmet of Mathematics,

More information

BASED ON ITERATIVE ERROR-CORRECTION

BASED ON ITERATIVE ERROR-CORRECTION A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity

More information

So we find a sample mean but what can we say about the General Education Statistics

So we find a sample mean but what can we say about the General Education Statistics So we fid a ample mea but what ca we ay about the Geeral Educatio Statitic populatio? Cla Note Cofidece Iterval for Populatio Mea (Sectio 9.) We will be doig early the ame tuff a we did i the firt ectio

More information

Ones Assignment Method for Solving Traveling Salesman Problem

Ones Assignment Method for Solving Traveling Salesman Problem Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:

More information

Sparse seismic deconvolution by method of orthogonal matching pursuit

Sparse seismic deconvolution by method of orthogonal matching pursuit From the SelectedWorks of Michael Broadhead 21 Sparse seismic decovolutio by method of orthogoal matchig pursuit Michael Broadhead Available at: https://works.bepress.com/michael_broadhead/13/ P395 Sparse

More information

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.

Chapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved. Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3

More information

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com)

PLEASURE TEST SERIES (XI) - 04 By O.P. Gupta (For stuffs on Math, click at theopgupta.com) wwwtheopguptacom wwwimathematiciacom For all the Math-Gya Buy books by OP Gupta A Compilatio By : OP Gupta (WhatsApp @ +9-9650 350 0) For more stuffs o Maths, please visit : wwwtheopguptacom Time Allowed

More information

Math Section 2.2 Polynomial Functions

Math Section 2.2 Polynomial Functions Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably

More information

The isoperimetric problem on the hypercube

The isoperimetric problem on the hypercube The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose

More information

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics

ENGI 4421 Probability and Statistics Faculty of Engineering and Applied Science Problem Set 1 Descriptive Statistics ENGI 44 Probability ad Statistics Faculty of Egieerig ad Applied Sciece Problem Set Descriptive Statistics. If, i the set of values {,, 3, 4, 5, 6, 7 } a error causes the value 5 to be replaced by 50,

More information

Introduction to aberrations

Introduction to aberrations Itroductio to aberratios Lectures 9 Topics Trasverse ray aberratios RMS spot size Spot diagras Ray fas Specia ocatios aog the spherica aberratio caustic Trasverse ray aberratio O Ж 5 3 Trasverse ray aberratio

More information

Analysis of Algorithms

Analysis of Algorithms Aalysis of Algorithms Ruig Time of a algorithm Ruig Time Upper Bouds Lower Bouds Examples Mathematical facts Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite

More information

Designing a learning system

Designing a learning system CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try

More information

Sharing Collections. Share a Collection via . Share a Collection via Google Classroom. Quick Reference Guide

Sharing Collections. Share a Collection via  . Share a Collection via Google Classroom. Quick Reference Guide Quick Referece Guide Share a Collectio via Email Sharig your collectio with others is a great way to collaborate. You ca easily sed a lik to your colleagues, studets, classmates ad frieds. Recipiets do

More information

: Mesh Processing. Chapter 6

: Mesh Processing. Chapter 6 600.657: Msh Procssing Chaptr 6 Quad-Dominant Rmshing Goal: Gnrat a rmshing of th surfac that consists mostly of quads whos dgs align with th principal curvatur dirctions. [Marinov t al. 04] [Alliz t al.

More information

Overview Chapter 12 A display model

Overview Chapter 12 A display model Overview Chapter 12 A display model Why graphics? A graphics model Examples Bjare Stroustrup www.stroustrup.com/programmig 3 Why bother with graphics ad GUI? Why bother with graphics ad GUI? It s very

More information

Message Authentication Codes. Reading: Chapter 4 of Katz & Lindell

Message Authentication Codes. Reading: Chapter 4 of Katz & Lindell Message Autheticatio Codes Readig: Chapter 4 of Katz & Lidell 1 Message autheticatio Bob receives a message m from Alice, he wats to ow (Data origi autheticatio) whether the message was really set by Alice.

More information

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only

Bezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of

More information

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS :

CONTINUI TY. JEE-Mathematics. Illustration 1 : Solution : Illustration 2 : 1. CONTINUOUS FUNCTIONS : J-Mathematics. CONTINUOUS FUNCTIONS : CONTINUI TY A fuctio for which a small chage i the idepedet variable causes oly a small chage ad ot a sudde jump i the depedet variable are called cotiuous fuctios.

More information

Learning to Shoot a Goal Lecture 8: Learning Models and Skills

Learning to Shoot a Goal Lecture 8: Learning Models and Skills Learig to Shoot a Goal Lecture 8: Learig Models ad Skills How do we acquire skill at shootig goals? CS 344R/393R: Robotics Bejami Kuipers Learig to Shoot a Goal The robot eeds to shoot the ball i the goal.

More information

Data Structures and Algorithms. Analysis of Algorithms

Data Structures and Algorithms. Analysis of Algorithms Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output

More information

Some cycle and path related strongly -graphs

Some cycle and path related strongly -graphs Some cycle ad path related strogly -graphs I. I. Jadav, G. V. Ghodasara Research Scholar, R. K. Uiversity, Rajkot, Idia. H. & H. B. Kotak Istitute of Sciece,Rajkot, Idia. jadaviram@gmail.com gaurag ejoy@yahoo.co.i

More information

Mean cordiality of some snake graphs

Mean cordiality of some snake graphs Palestie Joural of Mathematics Vol. 4() (015), 49 445 Palestie Polytechic Uiversity-PPU 015 Mea cordiality of some sake graphs R. Poraj ad S. Sathish Narayaa Commuicated by Ayma Badawi MSC 010 Classificatios:

More information

Consider the following population data for the state of California. Year Population

Consider the following population data for the state of California. Year Population Assigmets for Bradie Fall 2016 for Chapter 5 Assigmet sheet for Sectios 5.1, 5.3, 5.5, 5.6, 5.7, 5.8 Read Pages 341-349 Exercises for Sectio 5.1 Lagrage Iterpolatio #1, #4, #7, #13, #14 For #1 use MATLAB

More information

The number n of subintervals times the length h of subintervals gives length of interval (b-a).

The number n of subintervals times the length h of subintervals gives length of interval (b-a). Simulator with MadMath Kit: Riema Sums (Teacher s pages) I your kit: 1. GeoGebra file: Ready-to-use projector sized simulator: RiemaSumMM.ggb 2. RiemaSumMM.pdf (this file) ad RiemaSumMMEd.pdf (educator's

More information

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today

Administrative UNSUPERVISED LEARNING. Unsupervised learning. Supervised learning 11/25/13. Final project. No office hours today Admiistrative Fial project No office hours today UNSUPERVISED LEARNING David Kauchak CS 451 Fall 2013 Supervised learig Usupervised learig label label 1 label 3 model/ predictor label 4 label 5 Supervised

More information

MOTIF XF Extension Owner s Manual

MOTIF XF Extension Owner s Manual MOTIF XF Extesio Ower s Maual Table of Cotets About MOTIF XF Extesio...2 What Extesio ca do...2 Auto settig of Audio Driver... 2 Auto settigs of Remote Device... 2 Project templates with Iput/ Output Bus

More information

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle:

Recursion. Recursion. Mathematical induction: example. Recursion. The sum of the first n odd numbers is n 2 : Informal proof: Principle: Recursio Recursio Jordi Cortadella Departmet of Computer Sciece Priciple: Reduce a complex problem ito a simpler istace of the same problem Recursio Itroductio to Programmig Dept. CS, UPC 2 Mathematical

More information

Parabolic Path to a Best Best-Fit Line:

Parabolic Path to a Best Best-Fit Line: Studet Activity : Fidig the Least Squares Regressio Lie By Explorig the Relatioship betwee Slope ad Residuals Objective: How does oe determie a best best-fit lie for a set of data? Eyeballig it may be

More information