ECE-700 Review. Phil Schniter. January 5, x c (t)e jωt dt, x[n]z n, Denoting a transform pair by x[n] X(z), some useful properties are
|
|
- Roberta Cunningham
- 5 years ago
- Views:
Transcription
1 ECE-7 Review Phil Schniter January 5, 7 ransforms Using x c (t) to denote a continuous-time signal at time t R, Laplace ransform: X c (s) x c (t)e st dt, s C Continuous-ime Fourier ransform (CF): ote that: X c (j) x c (t) x c (t)e jt dt, X c (j)e jt d, R t R X c (j) is the Laplace transform evaluated at s j. x c (t) R implies X c (j) Xc ( j), i.e., conjugate symmetry. x c (t) is bandlimited to if X c (j) for all >. Using x[n] to denote a discrete-time signal at index n Z, z-transform: X(z) x[n]z n, z C Denoting a transform pair by x[n] X(z), some useful properties are x[ n] X(z ) ( ) n x[n] X( z) c P. Schniter,
2 Discrete-ime Fourier ransform (DF): ote that: X(e jω ) x[n] x[n]e jωn, ω R X(e jω )e jωn dω, n Z X(e jω ) is the z-transform evaluated on the unit circle in C-plane: z e jω. X(e jω ) is -periodic in ω. x[n] R implies X(e jω ) X (e jω ), i.e., conjugate symmetry. Other DF properties are: x[ n] X(e jω ) x [n] X (e jω ) x[n l] X(e jω )e jωl x[n]e jω n X(e j(ω ω) ) x[n]y[n] X(ejθ )Y (e j(ω θ) )dθ x[n] y[n] X(e jω )Y (e jω ) n x[n] X(ejω ) dω where denotes linear convolution: x[n] y[n] m x[m] y[n m]. Uniform Sampling Say that x[n] is sampled from x c (t) with uniform sampling interval : x[n] x c (n), n Z Let us define the continuous-time impulse train p(t) δ(t n) where δ(t) denotes the Dirac delta function, defined by the properties δ(t)dt unit area f(t)δ(t τ)dt f(τ) sifting property Using Fourier series, it can be shown that p(t) k e j kt c P. Schniter,
3 x c (t) x s (t) t x[n] t Figure : Signals used in sampling theorem. n Multiplying x c (t) by the impulse train yields the continuous-time sampled signal x s (t) which will help us to derive the sampling theorem. (See Fig..) aking the CF of x s (t), X s (j) x s (t) x c (t) x c (t) ( k k x c (t) k δ(t n) k e j kt e j kt )e jt dt x c (t)e j( k)t dt X c ( j( k)) () otice that X s (j) is a summation of scaled and shifted copies of X c (j). When X c (j) is bandlimited to rad/s the spectral copies do not overlap, and we say there is no c P. Schniter, 3
4 aliasing. Aliasing may result when X c (j) is not bandlimited to. (See Fig..) he frequency rad/s, i.e., Hz, is often called the yquist frequency. X c (j) X c (j) X s (j) / images X s (j) / images Figure : Example of no aliasing (left) and aliasing (right) in X s (j). We now investigate the relationship between the CF and the DF: X(e jω ) x[n]e jωn x c (n)e jωn ( x c (t) x c (t)δ(t n)dt ) e jωn x c (t)δ(t n)e jωn dt }{{} nonzero iff n t/. x c (t)δ(t n)e jω t dt δ(t n) e j ω t dt }{{} x s (t) ( X s j ω ) () c P. Schniter, 4
5 Plugging () into () yields X(e jω ) k ( ω k ) X c (j ) otice that the DF of the sampled signal x[n] is a summation of scaled, stretched, and shifted copies of the CF of the continuous signal x c (t). As implied by (), the DF may show evidence of aliasing when x c (t) is not bandlimited to the yquist frequency. (See Fig. 3.) X c (j ω ) X c (j ω ) ω ω X(e jω ) / images X(e jω ) / images ω ω Figure 3: Example of no aliasing (left) and aliasing (right) in X(e jω ). 3 Reconstruction Fig. 4 illustrates the theoretical procedure by which a yquist-bandlimited x c (t) can be perfectly reconstructed from its sampled representation x[n]. Essentially, it is a reversal of the sampling process. First, the discrete-time sequence x[n] is convolved with a continuous-time Dirac delta to obtain x s (t). x s (t) x[n]δ(t n) As we know, X s (j) contains unwanted spectral copies, or images, and is scaled by a factor of / relative to X c (j). hus, the second step in the reconstruction procedure is to remove these images and scale by. his can be accomplished by a brick-wall analog lowpass filter with cutoff at and DC gain of. he time-domain impulse response of this filter is given by h b (t) H b (j)e jt d / e jt d sin(t/) / t/ c P. Schniter, 5
6 See Fig. 5 for an illustration. hus, the reconstructed signal can be written x c (t) x s (t) h b (t) x[n] sin( (t n)) (t n) (3) x[n] δ(t) x s (t) h b (t) sin(t/) t/ x c (t) x[n] x s (t) x c (t) n t t X(e jω ) X s (j) X c (j) / / ω Figure 4: Ideal reconstruction of yquist-bandlimited signal. H b (j) h b (t) sin(t/) t/ t Figure 5: Brick-wall analog reconstruction lowpass filter. c P. Schniter, 6
7 In practice, it is not possible to generate Dirac deltas for the creation of x s (t). So, instead of convolving with δ(t), we might convolve with a rectangular pulse of width, known as a zero-order hold (ZOH) function and denoted by h z (t). his yields x z (t): x z (t) x[n]h z (t n) Unwanted spectral copies in X z (j) can be removed by a final stage of lowpass filtering. he two-step procedure is illustrated in Fig. 6. o be consistent with the Dirac delta, we assume a ZOH function with unit area, requiring that the analog reconstruction lowpass filter has DC gain. x[n] ZOH DAC h z(t) x z (t) reconstruction filter h r (t) x c (t) x[n] x z (t) x c (t) n t t X(e jω ) X droop z (j) X c (j) / / Figure 6: ZOH reconstruction of yquist-bandlimited signal. Unlike convolution with δ(t), convolution with the ZOH function h z (t) introduces passband droop and out-of-band attenuation. his results from the fact that the frequency response magnitude of the ZOH function is not constant in : H z (j) h z (t)e jt dt e jt dt sin(/) / e j/ (See Fig. 7 for an illustration.) hus, for perfect reconstruction, the analog reconstruction filter H r (j) must invert the ZOH response H z (j) over the passband [, ). he left side of Fig. 8 shows the ideal H r (j). c P. Schniter, 7
8 / h z (t) H z (j) t 4 4 Figure 7: ZOH function. It is difficult to build analog reconstruction filters with sharp cutoff. Instead, one hopes that the desired signal is bandlimited to less than the yquist frequency (as in Fig. 6), so that there is an absence of unwanted spectral energy in a region around ±/. In this case, the analog reconstruction filter H r (j) may be designed with a wider transition band, such as on the right side of Fig. 8. H r (j) H r (j) Figure 8: Ideal (left) and practical (right) reconstruction filters for ZOH. c P. Schniter, 8
9 4 Discrete Fourier ransform -point Discrete-Fourier ransform (DF): X[k] x[n] n x[n]e j kn, k... X[k]e j kn, n... k ote that: X[k] is the DF evaluated at ω k for k.... Zero-padding x[n] to M samples (where M > ) prior to an M-pt DF yields an M-point uniformly sampled version of the DF: X(e j M k ) n x[n]e j M kn M n x zp [n]e j M kn X zp [k], k...m his can be used to compute a densely sampled DF of any -pt sequence. An -pt DF can be interpolated to reconstruct the DF of an -pt sequence. X(e jω ) n n x[n]e jωn X[k]e j kn e jωn k X[k] k X[k] k n e j(ω k)n sin ( ω k sin ( ω k ) ) e j(ω k) sin ( ( sin ω ω ) ) 4 Figure 9: Dirichlet sinc c P. Schniter, 9
10 he DF has a convenient matrix representation. X[] e j e j e j e j... x[] X[] e j e j e j e j 3... x[]. e j e j e j 4 e j X[ ] x[ ] }{{}}{{}}{{} X W x where W has the following properties: [W] k,n e j kn W is symmetric, i.e., W W t. W is unitary, i.e., ( W)( W) H ( W) H ( W) I. W W, where W is called the IDF matrix. W is a Vandermonde matrix, i.e., the n th column of W is formed by raising e j n to the powers k,,...,. he Vandermonde property implies that W is full rank. For m with m, the FF algorithm can be used to compute the DF using approximately log, rather than, operations. 5 Miscellaneous savings factor Linear Phase: A linear-phase filter H(z) has a phase response that is linear in frequency. Specifically, the DF of a linear phase filter can be written as { H(e jω ) e jωd H(e jω d R ), H(e jω ) R When d, we refer to the filter as zero-phase. It can be shown that a filter is zero-phase iff its impulse response is conjugate symmetric around the origin, i.e., h[m] h [ m] m. (See the proof below.) Since symmetric length- causal filters exhibit coefficient symmetry around the index, the same arguments can be used to show that such filters are linear phase with d. c P. Schniter,
11 Proof. If H(e jω ) is real-valued, then following must hold ω: { } Im h[n]e jnω Im { h i [] + If f(ω) ω, then ( hr [n] + jh i [n] )( cos(nω) j sin(nω) )} h i [n] cos(nω) h r [n] sin(nω) ( hi [n] + h i [ n] ) cos(nω) ( h r [n] h r [ n] ) sin(nω) n lim ω ω Using f(ω) Im{H(e jω )}, we find that Similarly, if f(ω) ω, then lim ω ω ω f(ω)sin(ωm)dω m h r [m] h r [ m] m. ω Using f(ω) Im{H(e jω )}, we find that ω ω f(ω)cos(ωm)dω m h i [m] + h i [ m] m Z +. Putting the real/imaginary coefficient requirements together, we have h[m] h [ m] m Z +. hus we have shown that a real-valued DF implies conjugate symmetric coefficients (with symmetry around the origin). o prove the other direction, assume h[m] h [ m] m Z +. hen H(e jω ) h[] + h[] + h[n]e jnω h[n]e jnω + h[ n]e jnω n (h[n]e jnω ) + (h[n]e jnω ) n { } h[] + Re h[n]e jnω R ω since the conjugate symmetry implies that h[] R. hus we have shown that conjugate symmetric coefficients (with symmetry around the origin) imply a real-valued DF. n c P. Schniter,
12 Group-Delay Response: he group-delay response of a discrete-time linear system H(z) is defined as the negative derivative of the phase response of the DF H(e jw ). In other words, if we write H(e jω ) H(e jω ) e jφ(ω) where φ(ω) denotes the phase response, then the group-delay response g(ω) is g(ω) φ(ω) ω Functionally, g(ω) describes the delay (in samples) imposed by H(z) on input signal components with frequency ω. Recall that the DF of a symmetric causal length- filter can be written in terms of real-valued H(e jω ) as H(e jω ) H(e jω j )e ω from which it is evident that H(e jω ) H(e jω ) sgn{ H(e jω )} H(e jω ). hus H(e jω ) H(e jω ) sgn{ H(e jω j )}e ω which implies that φ(ω) g(ω) { ω ω s.t. sgn{ H(e jω )} ω + ω s.t. sgn{ H(e jω )} { ω s.t. H(e jω ) undefined ω s.t. H(e jω ) ote that this group-delay response is constant with respect to frequency, implying that all input components not completely attenuated by the system will be delayed by the same amount. c P. Schniter,
Digital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationLecture 8: Signal Reconstruction, DT vs CT Processing. 8.1 Reconstruction of a Band-limited Signal from its Samples
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 8: Signal Reconstruction, D vs C Processing Oct 24, 2001 Prof: J. Bilmes
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 20) Final Examination December 9, 20 Name: Kerberos Username: Please circle your section number: Section Time 2 am pm 4 2 pm Grades will be determined by the correctness of your answers (explanations
More informationIB Paper 6: Signal and Data Analysis
IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informationECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.
ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.
ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114. The exam for both sections of ECE 301 is conducted in the same room, but the problems are completely different. Your ID will
More informationSensors. Chapter Signal Conditioning
Chapter 2 Sensors his chapter, yet to be written, gives an overview of sensor technology with emphasis on how to model sensors. 2. Signal Conditioning Sensors convert physical measurements into data. Invariably,
More informationDefinition of Discrete-Time Fourier Transform (DTFT)
Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science. Fall Solutions for Problem Set 2
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science Issued: Tuesday, September 5. 6.: Discrete-Time Signal Processing Fall 5 Solutions for Problem Set Problem.
More informationA.1 THE SAMPLED TIME DOMAIN AND THE Z TRANSFORM. 0 δ(t)dt = 1, (A.1) δ(t)dt =
APPENDIX A THE Z TRANSFORM One of the most useful techniques in engineering or scientific analysis is transforming a problem from the time domain to the frequency domain ( 3). Using a Fourier or Laplace
More information3 Fourier Series Representation of Periodic Signals
65 66 3 Fourier Series Representation of Periodic Signals Fourier (or frequency domain) analysis constitutes a tool of great usefulness Accomplishes decomposition of broad classes of signals using complex
More informationEC Signals and Systems
UNIT I CLASSIFICATION OF SIGNALS AND SYSTEMS Continuous time signals (CT signals), discrete time signals (DT signals) Step, Ramp, Pulse, Impulse, Exponential 1. Define Unit Impulse Signal [M/J 1], [M/J
More informationX. Chen More on Sampling
X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,
More information2 Fourier Transforms and Sampling
2 Fourier ransforms and Sampling 2.1 he Fourier ransform he Fourier ransform is an integral operator that transforms a continuous function into a continuous function H(ω) =F t ω [h(t)] := h(t)e iωt dt
More informationELEN E4810: Digital Signal Processing Topic 11: Continuous Signals. 1. Sampling and Reconstruction 2. Quantization
ELEN E4810: Digital Signal Processing Topic 11: Continuous Signals 1. Sampling and Reconstruction 2. Quantization 1 1. Sampling & Reconstruction DSP must interact with an analog world: A to D D to A x(t)
More informationDESIGN OF CMOS ANALOG INTEGRATED CIRCUITS
DESIGN OF CMOS ANALOG INEGRAED CIRCUIS Franco Maloberti Integrated Microsistems Laboratory University of Pavia Discrete ime Signal Processing F. Maloberti: Design of CMOS Analog Integrated Circuits Discrete
More informationFinal Exam of ECE301, Section 3 (CRN ) 8 10am, Wednesday, December 13, 2017, Hiler Thtr.
Final Exam of ECE301, Section 3 (CRN 17101-003) 8 10am, Wednesday, December 13, 2017, Hiler Thtr. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, and
More informationBridge between continuous time and discrete time signals
6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems
More informationGrades will be determined by the correctness of your answers (explanations are not required).
6.00 (Fall 2011) Final Examination December 19, 2011 Name: Kerberos Username: Please circle your section number: Section Time 2 11 am 1 pm 4 2 pm Grades will be determined by the correctness of your answers
More informationEE 224 Signals and Systems I Review 1/10
EE 224 Signals and Systems I Review 1/10 Class Contents Signals and Systems Continuous-Time and Discrete-Time Time-Domain and Frequency Domain (all these dimensions are tightly coupled) SIGNALS SYSTEMS
More informationFrequency Domain Representations of Sampled and Wrapped Signals
Frequency Domain Representations of Sampled and Wrapped Signals Peter Kabal Department of Electrical & Computer Engineering McGill University Montreal, Canada v1.5 March 2011 c 2011 Peter Kabal 2011/03/11
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationFinal Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105.
Final Exam of ECE301, Prof. Wang s section 1 3pm Tuesday, December 11, 2012, Lily 1105. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address,
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationx[n] = x a (nt ) x a (t)e jωt dt while the discrete time signal x[n] has the discrete-time Fourier transform x[n]e jωn
Sampling Let x a (t) be a continuous time signal. The signal is sampled by taking the signal value at intervals of time T to get The signal x(t) has a Fourier transform x[n] = x a (nt ) X a (Ω) = x a (t)e
More informationUNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 9th, 011 Examination hours: 14.30 18.30 This problem set
More informationFinal Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129.
Final Exam of ECE301, Prof. Wang s section 8 10am Tuesday, May 6, 2014, EE 129. 1. Please make sure that it is your name printed on the exam booklet. Enter your student ID number, e-mail address, and signature
More informationChap 4. Sampling of Continuous-Time Signals
Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion
More informationEE Homework 13 - Solutions
EE3054 - Homework 3 - Solutions. (a) The Laplace transform of e t u(t) is s+. The pole of the Laplace transform is at which lies in the left half plane. Hence, the Fourier transform is simply the Laplace
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture : Design of Digital IIR Filters (Part I) Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 008 K. E. Barner (Univ.
More informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationReview of Fundamentals of Digital Signal Processing
Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download
More informationECE 301. Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3
ECE 30 Division 2, Fall 2006 Instructor: Mimi Boutin Midterm Examination 3 Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out
More informationDiscrete-Time Fourier Transform (DTFT)
Discrete-Time Fourier Transform (DTFT) 1 Preliminaries Definition: The Discrete-Time Fourier Transform (DTFT) of a signal x[n] is defined to be X(e jω ) x[n]e jωn. (1) In other words, the DTFT of x[n]
More information1.1 SPECIAL FUNCTIONS USED IN SIGNAL PROCESSING. δ(t) = for t = 0, = 0 for t 0. δ(t)dt = 1. (1.1)
SIGNAL THEORY AND ANALYSIS A signal, in general, refers to an electrical waveform whose amplitude varies with time. Signals can be fully described in either the time or frequency domain. This chapter discusses
More information6.003: Signals and Systems. Sampling and Quantization
6.003: Signals and Systems Sampling and Quantization December 1, 2009 Last Time: Sampling and Reconstruction Uniform sampling (sampling interval T ): x[n] = x(nt ) t n Impulse reconstruction: x p (t) =
More informationDiscrete-Time Signals and Systems
ECE 46 Lec Viewgraph of 35 Discrete-Time Signals and Systems Sequences: x { x[ n] }, < n
More informationTable 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients
able : Properties of the Continuous-ime Fourier Series x(t = e jkω0t = = x(te jkω0t dt = e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period and fundamental
More informationChapter 6: Applications of Fourier Representation Houshou Chen
Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationMultirate signal processing
Multirate signal processing Discrete-time systems with different sampling rates at various parts of the system are called multirate systems. The need for such systems arises in many applications, including
More informationSinc Functions. Continuous-Time Rectangular Pulse
Sinc Functions The Cooper Union Department of Electrical Engineering ECE114 Digital Signal Processing Lecture Notes: Sinc Functions and Sampling Theory October 7, 2011 A rectangular pulse in time/frequency
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationChapter 5 Frequency Domain Analysis of Systems
Chapter 5 Frequency Domain Analysis of Systems CT, LTI Systems Consider the following CT LTI system: xt () ht () yt () Assumption: the impulse response h(t) is absolutely integrable, i.e., ht ( ) dt< (this
More informationLecture 3 January 23
EE 123: Digital Signal Processing Spring 2007 Lecture 3 January 23 Lecturer: Prof. Anant Sahai Scribe: Dominic Antonelli 3.1 Outline These notes cover the following topics: Eigenvectors and Eigenvalues
More informationThe Johns Hopkins University Department of Electrical and Computer Engineering Introduction to Linear Systems Fall 2002.
The Johns Hopkins University Department of Electrical and Computer Engineering 505.460 Introduction to Linear Systems Fall 2002 Final exam Name: You are allowed to use: 1. Table 3.1 (page 206) & Table
More informationDiscrete-Time David Johns and Ken Martin University of Toronto
Discrete-Time David Johns and Ken Martin University of Toronto (johns@eecg.toronto.edu) (martin@eecg.toronto.edu) University of Toronto 1 of 40 Overview of Some Signal Spectra x c () t st () x s () t xn
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 8: February 12th, 2019 Sampling and Reconstruction Lecture Outline! Review " Ideal sampling " Frequency response of sampled signal " Reconstruction " Anti-aliasing
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 9: February 13th, 2018 Downsampling/Upsampling and Practical Interpolation Lecture Outline! CT processing of DT signals! Downsampling! Upsampling 2 Continuous-Time
More informationStability Condition in Terms of the Pole Locations
Stability Condition in Terms of the Pole Locations A causal LTI digital filter is BIBO stable if and only if its impulse response h[n] is absolutely summable, i.e., 1 = S h [ n] < n= We now develop a stability
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu.6 Signal Processing: Continuous and Discrete Fall 008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS
More informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More informationDiscrete-Time Fourier Transform
C H A P T E R 7 Discrete-Time Fourier Transform In Chapter 3 and Appendix C, we showed that interesting continuous-time waveforms x(t) can be synthesized by summing sinusoids, or complex exponential signals,
More informationOverview of Sampling Topics
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationHomework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt
Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL and COMPUTER ENGINEERING
GEORGIA INSIUE OF ECHNOLOGY SCHOOL of ELECRICAL and COMPUER ENGINEERING ECE 6250 Spring 207 Problem Set # his assignment is due at the beginning of class on Wednesday, January 25 Assigned: 6-Jan-7 Due
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationso mathematically we can say that x d [n] is a discrete-time signal. The output of the DT system is also discrete, denoted by y d [n].
ELEC 36 LECURE NOES WEEK 9: Chapters 7&9 Chapter 7 (cont d) Discrete-ime Processing of Continuous-ime Signals It is often advantageous to convert a continuous-time signal into a discrete-time signal so
More information[ ], [ ] [ ] [ ] = [ ] [ ] [ ]{ [ 1] [ 2]
4. he discrete Fourier transform (DF). Application goal We study the discrete Fourier transform (DF) and its applications: spectral analysis and linear operations as convolution and correlation. We use
More informationEE 521: Instrumentation and Measurements
Aly El-Osery Electrical Engineering Department, New Mexico Tech Socorro, New Mexico, USA November 1, 2009 1 / 27 1 The z-transform 2 Linear Time-Invariant System 3 Filter Design IIR Filters FIR Filters
More informationTable 1: Properties of the Continuous-Time Fourier Series. Property Periodic Signal Fourier Series Coefficients
able : Properties of the Continuous-ime Fourier Series x(t = a k e jkω0t = a k = x(te jkω0t dt = a k e jk(/t x(te jk(/t dt Property Periodic Signal Fourier Series Coefficients x(t y(t } Periodic with period
More informationTutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling
2.39 utorial Sheet #2 discrete vs. continuous functions, periodicity, sampling We will encounter two classes of signals in this class, continuous-signals and discrete-signals. he distinct mathematical
More informationDiscrete Time Fourier Transform
Discrete Time Fourier Transform Recall that we wrote the sampled signal x s (t) = x(kt)δ(t kt). We calculate its Fourier Transform. We do the following: Ex. Find the Continuous Time Fourier Transform of
More informationReview of Fourier Transform
Review of Fourier Transform Fourier series works for periodic signals only. What s about aperiodic signals? This is very large & important class of signals Aperiodic signal can be considered as periodic
More informationHomework 8 Solutions
EE264 Dec 3, 2004 Fall 04 05 HO#27 Problem Interpolation (5 points) Homework 8 Solutions 30 points total Ω = 2π/T f(t) = sin( Ω 0 t) T f (t) DAC ˆf(t) interpolated output In this problem I ll use the notation
More informationDiscrete-time Signals and Systems in
Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationProperties of Fourier Series - GATE Study Material in PDF
Properties of Fourier Series - GAE Study Material in PDF In the previous article, we learnt the Basics of Fourier Series, the different types and all about the different Fourier Series spectrums. Now,
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationFourier Transform for Continuous Functions
Fourier Transform for Continuous Functions Central goal: representing a signal by a set of orthogonal bases that are corresponding to frequencies or spectrum. Fourier series allows to find the spectrum
More informationsummable Necessary and sufficient for BIBO stability of an LTI system. Also see poles.
EECS 206 DSP GLOSSARY c Andrew E. Yagle Fall 2005 absolutely impulse response: h[n] is finite. EX: n=0 ( 3 4 )n = 1 = 4 but 1 3 n=1 1 n. 4 summable Necessary and sufficient for BIBO stability of an LI
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
More informationEE 225a Digital Signal Processing Supplementary Material
EE 225A DIGITAL SIGAL PROCESSIG SUPPLEMETARY MATERIAL EE 225a Digital Signal Processing Supplementary Material. Allpass Sequences A sequence h a ( n) ote that this is true iff which in turn is true iff
More informationEE123 Digital Signal Processing
EE23 Digital Signal Processing Lecture 7B Sampling What is this Phenomena? https://www.youtube.com/watch?v=cxddi8m_mzk Sampling of Continuous ime Signals (Ch.4) Sampling: Conversion from C. (not quantized)
More informationELEN 4810 Midterm Exam
ELEN 4810 Midterm Exam Wednesday, October 26, 2016, 10:10-11:25 AM. One sheet of handwritten notes is allowed. No electronics of any kind are allowed. Please record your answers in the exam booklet. Raise
More informationFourier series for continuous and discrete time signals
8-9 Signals and Systems Fall 5 Fourier series for continuous and discrete time signals The road to Fourier : Two weeks ago you saw that if we give a complex exponential as an input to a system, the output
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More informationECE 301 Division 1, Fall 2008 Instructor: Mimi Boutin Final Examination Instructions:
ECE 30 Division, all 2008 Instructor: Mimi Boutin inal Examination Instructions:. Wait for the BEGIN signal before opening this booklet. In the meantime, read the instructions below and fill out the requested
More informationNAME: ht () 1 2π. Hj0 ( ) dω Find the value of BW for the system having the following impulse response.
University of California at Berkeley Department of Electrical Engineering and Computer Sciences Professor J. M. Kahn, EECS 120, Fall 1998 Final Examination, Wednesday, December 16, 1998, 5-8 pm NAME: 1.
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationMultirate Digital Signal Processing
Multirate Digital Signal Processing Basic Sampling Rate Alteration Devices Up-sampler - Used to increase the sampling rate by an integer factor Down-sampler - Used to decrease the sampling rate by an integer
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More informationContinuous Fourier transform of a Gaussian Function
Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain
More information