A. Basics of Discrete Fourier Transform
|
|
- Anastasia Lamb
- 6 years ago
- Views:
Transcription
1 A. Basics of Discrete Fourier Trasform A.1. Defiitio of Discrete Fourier Trasform (8.5) A.2. Properties of Discrete Fourier Trasform (8.6) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier Trasform (1.1, 1.2) A.4. Covolutio Usig Discrete Fourier Trasform (8.6, 8.7) A.5. Samplig of Discrete-Time Fourier Trasform (8.4, 8.5)
2 A.1. Defiitio of Discrete Fourier Trasform Let x() be a fiite-legth sequece over 1. The discrete Fourier trasform of x() is defied as X(k) x() k x()exp X(k)exp 2 j 2 j k, k, (A.2) is called the iverse discrete Fourier trasform. 1. A.1.1. Derivatio of Iverse Discrete Fourier Trasform Let us derive (A.2) from (A.1). (A.1) is rewritte as k 1. ote that X(k) is a fiite-legth sequece over k1. x() ca be recostructed from X(k), i.e., (A.1) (A.2)
3 1 k X(k) X(k) exp 1 m 2 j x(m) exp k 1 k 2 j 1 m km, k 2 x(m) exp j 1. k( m). (A.3) Multiplyig both the sides of (A.3) by exp(j2k/), 1, ad the summig both the sides with respect to k, we obtai (A.4) Chagig the order of the two summatios o the right side of (A.4), we obtai 1 k X(k) exp j 2 k 1 m x(m) 1 k exp j 2 k( m). (A.5) Sice 1 2, m exp j k( m) k, m, (A.6)
4 we obtai 1 k X(k) exp 2 j k x(). (A.7) (A.2), the iverse discrete Fourier trasform, is derived by dividig both the sides of (A.7) by. A.1.2. Relatio of Discrete Fourier Trasform to Discrete-Time Fourier Series Let us assume that X(k) is the discrete Fourier trasform of x(), x() is x() exteded with period, ad X(k) is the discrete-time Fourier series coefficiet of x(). The, X(k) is equal to X(k) over period k1 multiplied by, i.e., X(k)=X(k), k1. Figure A.1 illustrates this relatio. (A.8)
5 x() x() X(k) A A X(k) Figure A.1. Relatio to Discrete-Time Fourier Series. A.1.3. Relatio of Discrete Fourier Trasform to Discrete-Time Fourier Trasform We assume that X(k) ad X() are the discrete Fourier trasform ad the discrete-time Fourier trasform of x(), respectively. The, X(k) equals the samples of X() over period [, 2) at iterval 2/, i.e., k k
6 X(k) 2 X k, k 1. (A.9) Figure A.2 illustrates this relatio. x() X(k) k X() 2 Figure A.2. Relatio to Discrete-Time Fourier Trasform.
7 If is too small, X(k) may ot reflect X() well. Example. Assume x()=1, M1. (A.1) (1) Fid X(k), the -poit discrete Fourier trasform of x(), where M. (2) Fid X(), the discrete-time Fourier trasform of x(). If =M, does X(k) reflect X() well? Example. The samplig iterval of x() is secod. Fid the legth rage of the discrete Fourier trasform such that the samplig iterval of X(k) is 2 radias/secod at the most. A.2. Properties of Discrete Fourier Trasform A.2.1. Liearity If x 1 ()X 1 (k) ad x 2 ()X 2 (k), the
8 a 1 x 1 ()+a 2 x 2 ()a 1 X 1 (k)+a 2 X 2 (k), (A.11) where a 1 ad a 2 are two arbitrary costats. (A.11) holds whe x 1 () ad x 2 () have the same legth iitially or after zero paddig. A.2.2. Circular Shift Assume that x() is a fiite-legth sequece over 1. The circular shift of x() by is defied as x( )=x( ), 1, where x() is x() exteded with period. (A.12) The circular shift ca be carried out i the followig steps (figure A.3). (1) Exted x() with period to obtai x(). (2) Shift x() by to obtai x( ). (3) Limit x( ) to period 1 to obtai x( ).
9 x() x() m m x(2) x(2) m m x(2) x(2) m Figure A.3. Circular Shift. m The circular shift ca also be carried out by shiftig ad wrappig
10 x() (figure A.3). If x()x(k), the 2 ( ) X(k) exp j k, x where is a arbitrary iteger. If x()x(k), the 2 x() exp j k X(kk ), where k is a arbitrary iteger. A.2.3. Reversal If x()x(k), the x(), 1X(k), k1, (A.13) (A.14) (A.15)
11 where x() ad X(k) are, respectively, x() ad X(k) exteded with period. A.2.4. Cojugatio If x()x(k), the x * ()X(k) *, k1, where X(k) is X(k) exteded with period. From (A.16), the followig coclusios ca be draw: (1) Im[x()]= X(k)=X(k) *, k1. (2) Re[x()]= X(k)=X(k) *, k1. If x()x(k), the x() *, 1X * (k), where x() is x() exteded with period. (A.16) (A.17)
12 From (A.17), the followig coclusios ca be draw: (1) Im[X(k)]= x()=x() *, 1. (2) Re[X(k)]= x()=x() *, 1. Example. X(k) is the 512-poit discrete Fourier trasform of x(). X(11)=2(1+j). Fid X(51). (1) x() is real. (2) x() is purely imagiary or. A.2.5. Symmetry If x()x(k), the X()x(k), k1, where x() is x() exteded with period. If x()x(k), the (A.18)
13 X()/, 1x(k), where X(k) is X(k) exteded with period. A.2.6. Circular Covolutio (Sectio A.4) A.2.7. Parseval s Equatio If x()x(k), the (A.19) 1 x() k X(k) 2. (A.2) A.3. Spectral Aalysis of Cotiuous-Time Sigals Usig Discrete Fourier Trasform A.3.1. Frame The discrete Fourier trasform ca be used i the spectral aalysis of a cotiuous-time sigal (figure A.4).
14 x c (t) C/D x() y() DFT Y(k) w() Figure A.4. Spectral Aalysis of a Cotiuous- Time Sigal Usig Discrete Fourier Trasform. Each step is discussed as follows (figure A.5). (1) Samplig. Let X c () be the cotiuous-time Fourier trasform of x c (t), X() be the discrete-time Fourier trasform of x() ad T be the samplig iterval. The, X() equals X c () exteded with period 2/T, divided by T ad the expressed i terms of, i.e., X 1 T X. m c 2m T (A.21)
15 A X c () A/T X() 2 Y() 2 Y(k) 1 k Figure A.5. Illustratio of X c (), X(), Y() ad Y(k).
16 (2) Widowig. Assume that W() ad Y() are the discrete-time Fourier trasforms of w() ad y(), respectively. The, Y() equals the periodic covolutio of X() ad W() divided by 2, i.e., Y( ) X( )W( )d. (A.22) (3) Discrete Fourier Trasform. Assume that Y(k) is the -poit discrete Fourier trasform of y(). The, Y(k) equals the samples of Y() over period [, 2) at iterval 2/, i.e., Y(k) Y 2 A.3.2. Effects of Widowig k, k 1. Let us ivestigate the effects of the above widowig further. (A.23) Let x i ()=A i exp(j i ) be a frequecy compoet of x(). The, the discrete-time Fourier trasform of x i () is
17 X ( ) i m 2A ( i i 2m). (A.24) Assume that y i () is the compoet of y() obtaied by widowig x i (), i.e., y i ()=x i ()w(). The, y i () has the discrete-time Fourier trasform Y i ()=A i W( i ). That is, Y i () equals W() shifted by i ad multiplied by A i. (A.25) From (A.24) ad (A.25), we see that compared with X i (), Y i () has the followig features (figure A.6). 1. Y i () has a distributio bad. (1) The width of the distributio bad equals the width of the mai lobe of W(). I order for Y i () to have a arrow distributio bad, W() should have a arrow mai lobe. (2) The width of the mai lobe of W() depeds o the shape ad the legth of w(). A loger w() results i a arrower mai lobe.
18 x i () A i X i () 2A i i i + i w() W() E y i () Y i () A i E i i i + Figure A.6. Differeces betwee X i () ad Y i ().
19 2. Y i () has leakages. (1) The relative amplitudes of the leakages equal the relative amplitudes of the side lobes of W(). For Y i () to have leakages of small relative amplitudes, W() should have side lobes of small relative amplitudes. (2) The relative amplitudes of the side lobes of W() deped o the shape of w() oly. A.3.3. Widows The rectagular widow is defied as 1, w(), The Bartlett widow is defied as 1. otherwise (A.26) w() 2 /( 1), 2 2 /( 1),, ( 1) / 2 ( 1)/2 1. otherwise (A.27)
20 The Ha widow is defied as.5.5 cos w(), The Hammig widow is defied as.54.46cos w(), The Blackma widow is defied as.42.5cos w(), 2.8cos 1 2, 1 1. otherwise 2, 1 1. otherwise 4, 1 1. otherwise The above widows are illustrated i figure A.7. (A.28) (A.29) (A.3)
21 Figure A.7. Shapes of Commoly Used Widows.
22 Table A.1 gives the features of these widows. It ca be see that whe the legth of the widow is fixed, a arrow distributio bad correspods to leakages of large relative amplitudes, ad therefore there exists a tradeoff betwee the width of the distributio bad ad the relative amplitudes of the leakages. Shape of Widow Width of Distributio Bad Peak Relative Amplitude of Leakages Rectagular 4/ 13 db Bartlett 8/(1) 25 db Ha 8/(1) 31 db Hammig 8/(1) 41 db Blackma 12/(1) 57 db Table A.1. Features of Commoly Used Widows.
23 The Kaiser widow is defied as w() I, 1 I ( ) 2, 1. otherwise (A.31) Here I ( ) is the zero-order modified Bessel fuctio of the first kid ad is a shape parameter. A.4. Covolutio Usig Discrete Fourier Trasform A.4.1. Defiitio of Circular Covolutio Suppose that x 1 () ad x 2 () are two fiite-legth sequeces over 1, ad x 1 () ad x 2 () are x 1 () ad x 2 () exteded with period, respectively. The circular covolutio of x 1 () ad x 2 () is defied as the periodic covolutio of x 1 () ad x 2 () over a period
24 1, i.e., x1() x2() x(m)x 1 2( m), 1, which is also writte as m 1 x1() x 2() x (m)x 1 2( m), 1. m (A.32) (A.33) Several poits should be oted about the circular covolutio: (1) x 1 () ad x 2 () should have the same legth iitially or after zero paddig to carry out the circular covolutio. (2) The circular covolutio possesses the commutative property, the associative property ad the distributive property. The circular covolutio ca be carried out i the followig steps. (1) Exted x 2 (m) with period to obtai x 2 (m).
25 (2) Reflect x 2 (m) about the origi to obtai x 2 (m). (3) Shift x 2 (m) by to obtai x 2 (m). This is equivalet to the shiftig ad the wrappig of x 2 (m), m1. (4) Calculate the circular covolutio at. Example. Fid the circular covolutio of the two sequeces i the followig table. 1 2 otherwise x 1 () 1 x 2 () A.4.2. Circular Covolutio Usig Discrete Fourier Trasform If x 1 ()X 1 (k) ad x 2 ()X 2 (k), the
26 x1() x2() X 1(k)X2(k). (A.34) If x 1 ()X 1 (k) ad x 2 ()X 2 (k), the 1 x1()x 2() X1(k) X2(k). (A.35) (A.34) shows that the circular covolutio ca be carried out usig the discrete Fourier trasform (figure A.8). x 1 () DFT IDFT x1() x 2() x 2 () DFT Figure A.8. Circular Covolutio Usig Discrete Fourier Trasform.
27 A.4.3. Covolutio Usig Discrete Fourier Trasform I this sectio, we will study the relatio betwee covolutio ad circular covolutio ad cosider how to carry out covolutio usig the discrete Fourier trasform. Let x 1 () ad x 2 () be two fiite-legth sequeces over 1 1 ad 2 1, respectively. If f() ad g() are the covolutio ad the -poit circular covolutio of x 1 () ad x 2 (), respectively, the we have g() f ( i i), 1. (A.36) That is, g() equals f() exteded with period ad limited to period 1. Sice f() is a fiite-legth sequece over , we ca draw the followig coclusios. If , g() equals f(). Otherwise, aliasig occurs. The relatio betwee f() ad g() is illustrated i figure A.9.
28 f() f() m m m m g() g() m m < Figure A.9. Relatio betwee Covolutio ad Circular Covolutio.
29 (A.36) is proved as follows. Assume that x 2 () is x 2 () exteded with period. The, g() 1 m x (m)x 1 2( m), 1. (A.37) Sice x () 2 i x 2 ( i), (A.38) we obtai x ( m) 2 i x 2 ( i m). Substitutig (A.39) ito (A.37), we obtai (A.39) g() 1 m i x1(m)x2( i m), 1. (A.4)
30 Chagig the order of the summatios, we obtai g() 1 im Sice x 1 ()= outside 1, x1(m)x 2( i m), 1. (A.41) f () 1 m x 1 (m)x 2 ( m). (A.42) Thus, f ( i) 1 m x 1 (m)x 2 ( i m). (A.43) Accordig to (A.41) ad (A.43), we ca obtai the relatio betwee f() ad g(), i.e., g() f ( i i), 1. (A.44)
31 As we kow, the circular covolutio ca be carried out usig the discrete Fourier trasform. The, the covolutio ca also be carried out usig the discrete Fourier trasform because it equals the circular covolutio with (figure A.1). This will be sigificat because the discrete Fourier trasform ca be implemeted by a class of fast algorithms. x 1 () 1 x 2 () 2 Zero Paddig Zero Paddig DFT DFT IDFT x 1 ()x 2 () Figure A.1. Covolutio Usig Discrete Fourier Trasform.
32 A.4.4. Covolutio of a Log Sequece with a short Sequece Usig Discrete Fourier Trasform Assume that x 1 () is a log sequece ad x 2 () is a short sequece over 2 1. The, the two followig methods are usually used to carry out the covolutio of x 1 () ad x 2 (). 1. Overlap-Add Method (figure A.11): (1) x 1 () is segmeted, ad each segmet has legth 1. (2) Each segmet is padded with to poits (= ). x 2 () is also padded with to poits. Each segmet is covolved with x 2 () usig the discrete Fourier trasform. (3) These covolutios are added. 2. Overlap-Save Method (figure A.12). (1) x 1 () is segmeted, ad each segmet has legth 1. (2) Each segmet is padded with subsequet samples to poits (= ). x 2 () is padded with to poits. Each segmet is circularly covolved with x 2 () usig the discrete Fourier trasform. (3) The oaliasig segmets of these
33 1 1 1 x 1 () x 11 () x 11 () x 2 () x 12 () x 12 () x 2 () x 13 () x 13 () x 2 () x 1 () x 2 () Figure A.11. Overlap-Add Method.
34 1 1 1 x 1 () 1 x 12 () x 13 () x 11 () x 11 () x 2 () 2 1 x 12 () x 2 () x 13 () x 2 () x 1 () x 2 () Figure A.12. Overlap-Save Method.
35 circular covolutios are combied. A.5. Samplig of Discrete-Time Fourier Trasform If X() is the discrete-time Fourier trasform of x(), X(k) is the samples of X() over period [, 2) at iterval 2/L, ad x() is the iverse discrete Fourier trasform of X(k), the x() i That is, x() equals x() exteded with period L ad the limited to period L1. If x() is withi L1, the x() equals x(). Otherwise aliasig happes. Figure A.13 shows the relatio betwee x() ad x(). (A.45) is proved as follows. x() 1 L L 1 k x( il), X (k)exp 2 j L L 1. k, L 1 (A.45)
36 x() m 1 X() 2 x() X(k) 1 L m 2/L 2 x() X(k) L 1 m 2/L 2 Figure A.13. Samplig of Discrete-Time Fourier Trasform.
37 L 1 1 L k 2 X L k exp j 2 L k, L 1. (A.46) Sice X( ) m x(m) exp( jm), (A.47) we obtai 2 X k L m x(m) exp 2 j L Substitutig (A.48) ito (A.46), we obtai km. (A.48) x () 1 L L1 m k m x(m) 2 x(m) exp j L 1 L L1 k 2 exp j L k( k( m), m), L 1 L 1. (A.49)
38 Sice L , m il exp j k( m), L k L, otherwise (A.5) we obtai x() i x( il), L 1. (A.51)
Chapter 8. DFT : The Discrete Fourier Transform
Chapter 8 DFT : The Discrete Fourier Trasform Roots of Uity Defiitio: A th root of uity is a complex umber x such that x The th roots of uity are: ω, ω,, ω - where ω e π /. Proof: (ω ) (e π / ) (e π )
More informationSpring 2014, EE123 Digital Signal Processing
Aoucemets EE3 Digital Sigal Processig Last time: FF oday: Frequecy aalysis with DF Widowig Effect of zero-paddig Lecture 9 based o slides by J.M. Kah Spectral Aalysis with the DF Spectral Aalysis with
More informationFall 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 informationFinite-length Discrete Transforms. Chapter 5, Sections
Fiite-legth Discrete Trasforms Chapter 5, Sectios 5.2-50 5.0 Dr. Iyad djafar Outlie The Discrete Fourier Trasform (DFT) Matrix Represetatio of DFT Fiite-legth Sequeces Circular Covolutio DFT Symmetry Properties
More informationPractical Spectral Anaysis (continue) (from Boaz Porat s book) Frequency Measurement
Practical Spectral Aaysis (cotiue) (from Boaz Porat s book) Frequecy Measuremet Oe of the most importat applicatios of the DFT is the measuremet of frequecies of periodic sigals (eg., siusoidal sigals),
More informationFrequency 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 informationThe Discrete Fourier Transform
The iscrete Fourier Trasform The discrete-time Fourier trasform (TFT) of a sequece is a cotiuous fuctio of!, ad repeats with period. I practice we usually wat to obtai the Fourier compoets usig digital
More informationZ - 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 informationSignal Processing in Mechatronics. Lecture 3, Convolution, Fourier Series and Fourier Transform
Sigal Processig i Mechatroics Summer semester, 1 Lecture 3, Covolutio, Fourier Series ad Fourier rasform Dr. Zhu K.P. AIS, UM 1 1. Covolutio Covolutio Descriptio of LI Systems he mai premise is that the
More informationEE123 Digital Signal Processing
Aoucemets HW solutios posted -- self gradig due HW2 due Friday EE2 Digital Sigal Processig ham radio licesig lectures Tue 6:-8pm Cory 2 Lecture 6 based o slides by J.M. Kah SDR give after GSI Wedesday
More informationSpring 2014, EE123 Digital Signal Processing
Aoucemets EE3 Digital Sigal Processig Lecture 9 Lab part I ad II posted will post III today or tomorrow Lab-bash uesday -3pm Cory hree shorter Midterms: / i class / i class /3 (or BD) i class / or / (BD)
More information2D 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 informationFilter 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 informationFrequency 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 informationFIR Filter Design: Part II
EEL335: Discrete-Time Sigals ad Systems. Itroductio I this set of otes, we cosider how we might go about desigig FIR filters with arbitrary frequecy resposes, through compositio of multiple sigle-peak
More informationLinear 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 informationDiscrete-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 informationMASSACHUSETTS 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 informationFFTs 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 informationThe 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 informationTime-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 informationCh3 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 informationCOMM 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 informationUNIT-I. 2. A real valued sequence x(n) is anti symmetric if a) X(n)=x(-n) b) X(n)=-x(-n) c) A) and b) d) None Ans: b)
DIGITAL SIGNAL PROCESSING UNIT-I 1. The uit ramp sequece is Eergy sigal b) Power sigal c) Either Eergy or Power sigal d) Neither a Power sigal or a eergy sigal As: d) 2. A real valued sequece x() is ati
More informationModule 18 Discrete Time Signals and Z-Transforms Objective: Introduction : Description: Discrete Time Signal representation
Module 8 Discrete Time Sigals ad Z-Trasforms Objective:To uderstad represetig discrete time sigals, apply z trasform for aalyzigdiscrete time sigals ad to uderstad the relatio to Fourier trasform Itroductio
More informationBlock-by Block Convolution, FFT/IFFT, Digital Spectral Analysis
Lecture 9 Outlie: Block-by Block Covolutio, FFT/IFFT, Digital Spectral Aalysis Aoucemets: Readig: 5: The Discrete Fourier Trasform pp. 3-5, 8, 9+block diagram at top of pg, pp. 7. HW 6 due today with free
More informationAdvanced Training Course on FPGA Design and VHDL for Hardware Simulation and Synthesis
265-25 Advaced Traiig Course o FPGA esig ad VHL for Hardware Simulatio ad Sythesis 26 October - 2 ovember, 29 igital Sigal Processig The iscrete Fourier Trasform Massimiliao olich EEI Facolta' di Igegeria
More information3. Z Transform. Recall that the Fourier transform (FT) of a DT signal xn [ ] is ( ) [ ] = In order for the FT to exist in the finite magnitude sense,
3. Z Trasform Referece: Etire Chapter 3 of text. Recall that the Fourier trasform (FT) of a DT sigal x [ ] is ω ( ) [ ] X e = j jω k = xe I order for the FT to exist i the fiite magitude sese, S = x [
More informationELEG 4603/5173L Digital Signal Processing Ch. 1 Discrete-Time Signals and Systems
Departmet of Electrical Egieerig Uiversity of Arasas ELEG 4603/5173L Digital Sigal Processig Ch. 1 Discrete-Time Sigals ad Systems Dr. Jigxia Wu wuj@uar.edu OUTLINE 2 Classificatios of discrete-time sigals
More informationSignals and Systems. Problem Set: From Continuous-Time to Discrete-Time
Sigals ad Systems Problem Set: From Cotiuous-Time to Discrete-Time Updated: October 5, 2017 Problem Set Problem 1 - Liearity ad Time-Ivariace Cosider the followig systems ad determie whether liearity ad
More informationM2.The Z-Transform and its Properties
M2.The Z-Trasform ad its Properties Readig Material: Page 94-126 of chapter 3 3/22/2011 I. Discrete-Time Sigals ad Systems 1 What did we talk about i MM1? MM1 - Discrete-Time Sigal ad System 3/22/2011
More informationThe Z-Transform. (t-t 0 ) Figure 1: Simplified graph of an impulse function. For an impulse, it can be shown that (1)
The Z-Trasform Sampled Data The geeralied fuctio (t) (also kow as the impulse fuctio) is useful i the defiitio ad aalysis of sampled-data sigals. Figure below shows a simplified graph of a impulse. (t-t
More informationSpectral Analysis. This week in lab. Next classes: 3/26 and 3/28. Your next experiment Homework is to prepare
Spectral Aalysis This week i lab Your ext experimet Homework is to prepare Next classes: 3/26 ad 3/28 Aero Testig, Fracture Toughess Testig Read the Experimets 5 ad 7 sectios of the course maual Spectral
More informationThe Discrete-Time Fourier Transform (DTFT)
EEL: Discrete-Time Sigals ad Systems The Discrete-Time Fourier Trasorm (DTFT) The Discrete-Time Fourier Trasorm (DTFT). Itroductio I these otes, we itroduce the discrete-time Fourier trasorm (DTFT) ad
More informationECE-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 informationWeb Appendix O - Derivations of the Properties of the z Transform
M. J. Roberts - 2/18/07 Web Appedix O - Derivatios of the Properties of the z Trasform O.1 Liearity Let z = x + y where ad are costats. The ( z)= ( x + y )z = x z + y z ad the liearity property is O.2
More informationSolutions. Number of Problems: 4. None. Use only the prepared sheets for your solutions. Additional paper is available from the supervisors.
Quiz November 4th, 23 Sigals & Systems (5-575-) P. Reist & Prof. R. D Adrea Solutios Exam Duratio: 4 miutes Number of Problems: 4 Permitted aids: Noe. Use oly the prepared sheets for your solutios. Additioal
More informationOlli 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 information62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +
62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of
More information(, ) (, ) (, ) ( ) ( )
PROBLEM ANSWER X Y x, x, rect, () X Y, otherwise D Fourier trasform is defied as ad i D case it ca be defied as We ca write give fuctio from Eq. () as It follows usig Eq. (3) it ( ) ( ) F f t e dt () i(
More informationChapter 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 informationSolution 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 informationSolutions of Chapter 5 Part 1/2
Page 1 of 8 Solutios of Chapter 5 Part 1/2 Problem 5.1-1 Usig the defiitio, compute the -trasform of x[] ( 1) (u[] u[ 8]). Sketch the poles ad eros of X[] i the plae. Solutio: Accordig to the defiitio,
More informationDiscrete-Time Signals and Systems. Signals and Systems. Digital Signals. Discrete-Time Signals. Operations on Sequences: Basic Operations
-6.3 Digital Sigal Processig ad Filterig..8 Discrete-ime Sigals ad Systems ime-domai Represetatios of Discrete-ime Sigals ad Systems ime-domai represetatio of a discrete-time sigal as a sequece of umbers
More informationx[0] x[1] x[2] Figure 2.1 Graphical representation of a discrete-time signal.
x[ ] x[ ] x[] x[] x[] x[] 9 8 7 6 5 4 3 3 4 5 6 7 8 9 Figure. Graphical represetatio of a discrete-time sigal. From Discrete-Time Sigal Processig, e by Oppeheim, Schafer, ad Buck 999- Pretice Hall, Ic.
More informationEE / EEE SAMPLE STUDY MATERIAL. GATE, IES & PSUs Signal System. Electrical Engineering. Postal Correspondence Course
Sigal-EE Postal Correspodece Course 1 SAMPLE STUDY MATERIAL Electrical Egieerig EE / EEE Postal Correspodece Course GATE, IES & PSUs Sigal System Sigal-EE Postal Correspodece Course CONTENTS 1. SIGNAL
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2016 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values of the variable it cotais The relatioships betwee
More informationChapter 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 informationAdditional Notes on Power Series
Additioal Notes o Power Series Mauela Girotti MATH 37-0 Advaced Calculus of oe variable Cotets Quick recall 2 Abel s Theorem 2 3 Differetiatio ad Itegratio of Power series 4 Quick recall We recall here
More informationDigital signal processing: Lecture 5. z-transformation - I. Produced by Qiangfu Zhao (Since 1995), All rights reserved
Digital sigal processig: Lecture 5 -trasformatio - I Produced by Qiagfu Zhao Sice 995, All rights reserved DSP-Lec5/ Review of last lecture Fourier trasform & iverse Fourier trasform: Time domai & Frequecy
More informationGeneralizing the DTFT. The z Transform. Complex Exponential Excitation. The Transfer Function. Systems Described by Difference Equations
Geeraliig the DTFT The Trasform M. J. Roberts - All Rights Reserved. Edited by Dr. Robert Akl 1 The forward DTFT is defied by X e jω = x e jω i which = Ω is discrete-time radia frequecy, a real variable.
More informationECEN 644 HOMEWORK #5 SOLUTION SET
ECE 644 HOMEWORK #5 SOUTIO SET 7. x is a real valued sequece. The first five poits of its 8-poit DFT are: {0.5, 0.5 - j 0.308, 0, 0.5 - j 0.058, 0} To compute the 3 remaiig poits, we ca use the followig
More informationGeneralized Semi- Markov Processes (GSMP)
Geeralized Semi- Markov Processes (GSMP) Summary Some Defiitios Markov ad Semi-Markov Processes The Poisso Process Properties of the Poisso Process Iterarrival times Memoryless property ad the residual
More informationLecture Chapter 6: Convergence of Random Sequences
ECE5: Aalysis of Radom Sigals Fall 6 Lecture Chapter 6: Covergece of Radom Sequeces Dr Salim El Rouayheb Scribe: Abhay Ashutosh Doel, Qibo Zhag, Peiwe Tia, Pegzhe Wag, Lu Liu Radom sequece Defiitio A ifiite
More informationEECE 301 Signals & Systems
EECE 301 Sigals & Systems Prof. Mark Fowler Note Set #8 D-T Covolutio: The Tool for Fidig the Zero-State Respose Readig Assigmet: Sectio 2.1-2.2 of Kame ad Heck 1/14 Course Flow Diagram The arrows here
More information1.3 Convergence Theorems of Fourier Series. k k k k. N N k 1. With this in mind, we state (without proof) the convergence of Fourier series.
.3 Covergece Theorems of Fourier Series I this sectio, we preset the covergece of Fourier series. A ifiite sum is, by defiitio, a limit of partial sums, that is, a cos( kx) b si( kx) lim a cos( kx) b si(
More informationSEQUENCE AND SERIES NCERT
9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of
More information2.4 - Sequences and Series
2.4 - Sequeces ad Series Sequeces A sequece is a ordered list of elemets. Defiitio 1 A sequece is a fuctio from a subset of the set of itegers (usually either the set 80, 1, 2, 3,... < or the set 81, 2,
More informationChapter 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 informationREVISION SHEET FP1 (MEI) ALGEBRA. Identities In mathematics, an identity is a statement which is true for all values of the variables it contains.
the Further Mathematics etwork wwwfmetworkorguk V 07 The mai ideas are: Idetities REVISION SHEET FP (MEI) ALGEBRA Before the exam you should kow: If a expressio is a idetity the it is true for all values
More informationChapter 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 information1. By using truth tables prove that, for all statements P and Q, the statement
Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3
More informationDefinition of z-transform.
- Trasforms Frequecy domai represetatios of discretetime sigals ad LTI discrete-time systems are made possible with the use of DTFT. However ot all discrete-time sigals e.g. uit step sequece are guarateed
More informationClassification of DT signals
Comlex exoetial A discrete time sigal may be comlex valued I digital commuicatios comlex sigals arise aturally A comlex sigal may be rereseted i two forms: jarg { z( ) } { } z ( ) = Re { z ( )} + jim {
More informationPHY4905: Nearly-Free Electron Model (NFE)
PHY4905: Nearly-Free Electro Model (NFE) D. L. Maslov Departmet of Physics, Uiversity of Florida (Dated: Jauary 12, 2011) 1 I. REMINDER: QUANTUM MECHANICAL PERTURBATION THEORY A. No-degeerate eigestates
More informationSignals & Systems Chapter3
Sigals & Systems Chapter3 1.2 Discrete-Time (D-T) Sigals Electroic systems do most of the processig of a sigal usig a computer. A computer ca t directly process a C-T sigal but istead eeds a stream of
More informationADVANCED 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 informationRun-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 information2. Fourier Series, Fourier Integrals and Fourier Transforms
Mathematics IV -. Fourier Series, Fourier Itegrals ad Fourier Trasforms The Fourier series are used for the aalysis of the periodic pheomea, which ofte appear i physics ad egieerig. The Fourier itegrals
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING ECE 06 Summer 07 Problem Set #5 Assiged: Jue 3, 07 Due Date: Jue 30, 07 Readig: Chapter 5 o FIR Filters. PROBLEM 5..* (The
More informationVibratory Motion. Prof. Zheng-yi Feng NCHU SWC. National CHung Hsing University, Department of Soil and Water Conservation
Vibratory Motio Prof. Zheg-yi Feg NCHU SWC 1 Types of vibratory motio Periodic motio Noperiodic motio See Fig. A1, p.58 Harmoic motio Periodic motio Trasiet motio impact Trasiet motio earthquake A powerful
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationAPPENDIX F Complex Numbers
APPENDIX F Complex Numbers Operatios with Complex Numbers Complex Solutios of Quadratic Equatios Polar Form of a Complex Number Powers ad Roots of Complex Numbers Operatios with Complex Numbers Some equatios
More informationDiscrete Fourier Transform
Discrete Fourier Trasform V 3. November 5, 27 Christia Koll, christia.koll@tugraz.at, Josef Kulmer, kulmer@tugraz.at, Christia Stetco, stetco@studet.tugraz.at Sigal Processig ad Speech Commuicatio Laboratory,
More informationCALCULUS BASIC SUMMER REVIEW
CALCULUS BASIC SUMMER REVIEW NAME rise y y y Slope of a o vertical lie: m ru Poit Slope Equatio: y y m( ) The slope is m ad a poit o your lie is, ). ( y Slope-Itercept Equatio: y m b slope= m y-itercept=
More informationChapter 3. z-transform
Chapter 3 -Trasform 3.0 Itroductio The -Trasform has the same role as that played by the Laplace Trasform i the cotiuous-time theorem. It is a liear operator that is useful for aalyig LTI systems such
More informationThe Discrete Fourier Transform
The Discrete Fourier Trasform Complex Fourier Series Represetatio Recall that a Fourier series has the form a 0 + a k cos(kt) + k=1 b k si(kt) This represetatio seems a bit awkward, sice it ivolves two
More informationSubject: Differential Equations & Mathematical Modeling-III
Power Series Solutios of Differetial Equatios about Sigular poits Subject: Differetial Equatios & Mathematical Modelig-III Lesso: Power series solutios of differetial equatios about Sigular poits Lesso
More informationCHAPTER 10 INFINITE SEQUENCES AND SERIES
CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece
More informationFall 2013 MTH431/531 Real analysis Section Notes
Fall 013 MTH431/531 Real aalysis Sectio 8.1-8. Notes Yi Su 013.11.1 1. Defiitio of uiform covergece. We look at a sequece of fuctios f (x) ad study the coverget property. Notice we have two parameters
More information6.003 Homework #12 Solutions
6.003 Homework # Solutios Problems. Which are rue? For each of the D sigals x [] through x 4 [] below), determie whether the coditios listed i the followig table are satisfied, ad aswer for true or F for
More informationDiscrete-time signals and systems See Oppenheim and Schafer, Second Edition pages 8 93, or First Edition pages 8 79.
Discrete-time sigals ad systems See Oppeheim ad Schafer, Secod Editio pages 93, or First Editio pages 79. Discrete-time sigals A discrete-time sigal is represeted as a sequece of umbers: x D fxœg; <
More informationFIR Filter Design by Windowing
FIR Filter Desig by Widowig Take the low-pass filter as a eample of filter desig. FIR filters are almost etirely restricted to discretetime implemetatios. Passbad ad stopbad Magitude respose of a ideal
More informationDefinition 4.2. (a) A sequence {x n } in a Banach space X is a basis for X if. unique scalars a n (x) such that x = n. a n (x) x n. (4.
4. BASES I BAACH SPACES 39 4. BASES I BAACH SPACES Sice a Baach space X is a vector space, it must possess a Hamel, or vector space, basis, i.e., a subset {x γ } γ Γ whose fiite liear spa is all of X ad
More informationMost text will write ordinary derivatives using either Leibniz notation 2 3. y + 5y= e and y y. xx tt t
Itroductio to Differetial Equatios Defiitios ad Termiolog Differetial Equatio: A equatio cotaiig the derivatives of oe or more depedet variables, with respect to oe or more idepedet variables, is said
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationThe second is the wish that if f is a reasonably nice function in E and φ n
8 Sectio : Approximatios i Reproducig Kerel Hilbert Spaces I this sectio, we address two cocepts. Oe is the wish that if {E, } is a ierproduct space of real valued fuctios o the iterval [,], the there
More informationCEMTool Tutorial. Fourier Analysis
CEMTool Tutorial Fourier Aalysis Overview This tutorial is part of the CEMWARE series. Each tutorial i this series will teach you a specific topic of commo applicatios by explaiig theoretical cocepts ad
More informationECE 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 information6.003 Homework #12 Solutions
6.003 Homework # Solutios Problems. Which are rue? For each of the D sigals x [] through x 4 [] (below), determie whether the coditios listed i the followig table are satisfied, ad aswer for true or F
More informationPH 411/511 ECE B(k) Sin k (x) dk (1)
Fall-26 PH 4/5 ECE 598 A. La Rosa Homework-2 Due -3-26 The Homework is iteded to gai a uderstadig o the Heiseberg priciple, based o a compariso betwee the width of a pulse ad the width of its spectral
More informationDigital Signal Processing
Digital Sigal Processig Z-trasform dftwave -Trasform Backgroud-Defiitio - Fourier trasform j ω j ω e x e extracts the essece of x but is limited i the sese that it ca hadle stable systems oly. jω e coverges
More informationSolution 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 informationAppendix F: Complex Numbers
Appedix F Complex Numbers F1 Appedix F: Complex Numbers Use the imagiary uit i to write complex umbers, ad to add, subtract, ad multiply complex umbers. Fid complex solutios of quadratic equatios. Write
More information: Transforms and Partial Differential Equations
Trasforms ad Partial Differetial Equatios 018 SUBJECT NAME : Trasforms ad Partial Differetial Equatios SUBJECT CODE : MA 6351 MATERIAL NAME : Part A questios REGULATION : R013 WEBSITE : wwwharigaeshcom
More informationCS / MCS 401 Homework 3 grader solutions
CS / MCS 401 Homework 3 grader solutios assigmet due July 6, 016 writte by Jāis Lazovskis maximum poits: 33 Some questios from CLRS. Questios marked with a asterisk were ot graded. 1 Use the defiitio of
More informationTopic 9: Sampling Distributions of Estimators
Topic 9: Samplig Distributios of Estimators Course 003, 2018 Page 0 Samplig distributios of estimators Sice our estimators are statistics (particular fuctios of radom variables), their distributio ca be
More informationSequences and Series of Functions
Chapter 6 Sequeces ad Series of Fuctios 6.1. Covergece of a Sequece of Fuctios Poitwise Covergece. Defiitio 6.1. Let, for each N, fuctio f : A R be defied. If, for each x A, the sequece (f (x)) coverges
More informationI. Review of 1D continuous and discrete convolution. A. Continuous form: B. Discrete form: C. Example interface and review:
Lecture : Samplig Theorem ad Iterpolatio Learig Objectives: Review of cotiuous ad discrete covolutio Review of samplig with focus o sigal restoratio Applicatio of sigal iterpolatio I. Review of D cotiuous
More information