Frequency Domain Representations of Sampled and Wrapped Signals
|
|
- Belinda Marilyn Young
- 5 years ago
- Views:
Transcription
1 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
2 You are free: to Share to copy, distribute and transmit this work to Remix to adapt this work Subject to conditions outlined in the license. his work is licensed under the Creative Commons Attribution 3.0 Unported License. o view a copy of this license, visit org/licenses/by/3.0/ or send a letter to Creative Commons, 171 Second Street, Suite 300, San Francisco, California, 94105, USA. Revision History: v1.2: Creative Commons licence, minor updates (colourful equations v1c: Updated : Initial release
3 Frequency Domain Representations of Sampled and Wrapped Signals 1 1 Introduction hese notes examine the relationships between frequency domain representations of discrete-time and wrapped signals derived from a continuous-time signal. he first part of these notes develops the relationships for periodic signals which allow for the analysis of periodic signals within the framework of the Fourier transform. he second part examines the relationships between the Fourier series, the Discrete-ime Fourier ransform (DF and the Discrete Fourier ransform (DF. hroughout this document, round brackets are used for functions of continuous variables (examples: v(t and V(ω; square brackets are used for functions of discrete variables (example: v[n]. In the first part of this document, the equations shown within boxes are results that are used in the developments leading to formulations for the Fourier transform of periodic signals. In the second part of this document, the equations shown within boxes are results which appear on the diagram relating the Fourier domain representations of sampled and wrapped signals. 2 Continuous-ime Fourier ransform he Fourier transform of a continuous-time signal is given by V(F = v(te j2πft dt. (1 his is well-defined (converges if v(t satisfies the Dirichlet conditions (absolute integrability, finite number of finite discontinuities in a finite time interval, finite number of extrema in a finite interval. he inverse transform is v(t = V(Fe j2πft df. (2 Other functions which do not satisfy the Dirichlet conditions are admissible if we allow the use of delta functions. 2.1 Dirac Delta Function he Dirac delta (impulse function can be defined in terms of its properties [1]. he sampling property of the delta function (more properly a distribution is v(0 0 A v(tδ(t dt = (3 0 0 / t A. A
4 Frequency Domain Representations of Sampled and Wrapped Signals 2 From this characterization, the delta function can be shown to be zero everywhere except at the origin, yet it has unit area, δ(t = 0 for t = 0, δ(t dt = 1. (4 he formal operations involving the delta function in an integral give us v(t t o δ(t dt = v(tδ(t+t o dt (5 and v(atδ(t dt = 1 v(tδ(t/a dt. (6 a Fourier ransforms of Delta Functions Using the sampling property of the delta function, the Fourier transform of the delta function evaluates to a constant, he inverse Fourier transform gives us δ(te j2πft dt = 1. (7 e j2πft df = δ(t. (8 his integral must be evaluated using the Cauchy principal value, i.e. as the limit /2 lim e j2πft df. (9 /2 ote that since δ(t behaves like a symmetric function, the exponent in the integral can have either sign. he inverse transform giving a delta function gives us a relation for the integral of a complex exponential. Here we restate the result using symbols which do not evoke time or frequency, e ±j2πux du = δ(x. ( Fourier Series Continuous-ime Signals A periodic function (subject to conditions of absolutely integrability over a period, a finite number of finite discontinuities in a finite interval, and a finite number of extrema in a finite interval has
5 Frequency Domain Representations of Sampled and Wrapped Signals 3 a Fourier series expansion in complex exponentials [2]. Consider a periodic function ṽ(t with period. he Fourier series expansion for ṽ(t is ṽ(t = he Fourier series coefficients are found from v m = 1 v m e j2πmt/. (11 m= /2 /2 2.3 Fourier ransform of a Continuous-ime Periodic Signal ṽ(te j2πmt/ dt. (12 We can now plunge ahead and express the Fourier transform of ṽ(t in terms of the Fourier series coefficients, V p (F = = = ṽ(te j2πft dt v m m= v m δ m= ( F m e j2πt(f m/ dt. (13 We have used Eq. (10 to evaluate the integral of the complex exponential. Summarizing, the Fourier transform of a periodic function is a sequence of delta functions in the frequency domain (at the harmonics of the periodic signal repetition rate. he areas of the delta functions are given by the Fourier series coefficients, V p (F = ( v m δ F m. (14 m= 2.4 Fourier ransform of a Periodic Impulse rain Consider the periodic impulse train (period, ṽ(t = he Fourier series coefficients for this signal are given by v m = 1 /2 /2 k= δ(t k. (15 k= ( δ t k e j2πmt/ dt. (16
6 Frequency Domain Representations of Sampled and Wrapped Signals 4 We see that the only delta function within the integration range is the one for k = 0. Using the sampling property of the delta function, the integral evaluates to unity. hen the Fourier series coefficients are constant (v m = 1/ and the Fourier transform of the impulse train is V p (F = 1 ( δ F m. (17 m= Periodic functions have delta functions in their Fourier transforms and delta functions have periodic functions in their Fourier transforms. Because of the duality between the forward and inverse Fourier transforms (if v(t V(F, then V(t v( F, this gives us the result that an impulse train (periodic and delta functions must have as its Fourier transform another impulse train (delta functions and periodic. We have an alternate formulation for the Fourier transform (or inverse Fourier transform of an impulse train. he Fourier transform for a delayed delta function δ(t k is e j2πkf. hen the Fourier transform pair is δ(t k e j2πkf. (18 k= k= An finally using the time-frequency duality of the Fourier transform, we get k= δ(t k = 1 e j2πmt/ m= k= e j2πkf = 1 ( δ F m. (19 m= 2.5 Periodic Wrapped Continuous-ime Signals Consider forming a periodic signal ṽ(t from a (non-periodic signal v(t as follows ṽ(t = v(t k= δ(t k = v(t k. (20 k= We refer to this process which forms a time-aliased periodic signal as wrapping. 1 Using the fact that a convolution in the time-domain corresponds to a product in the frequency domain, the Fourier transform of ṽ(t is k= v(t k V(F 1 ( δ F m = 1 m= ( m ( V δ F m= m. (21 1 he continuous-time signal can be considered to be wrapped onto a circle of circumference with all the superimposed intervals being added.
7 Frequency Domain Representations of Sampled and Wrapped Signals 5 his shows that the Fourier series coefficients are just V(F/ evaluated at the harmonic frequencies. Here V(F is the Fourier transform of v(t, where v(t can be longer than. We can also get the Fourier series coefficients directly from Eq. (12. We note that this equation is just a scaled version of the Fourier transform, v m = 1 V ( m, (22 where V (F is the Fourier transform of one period of ṽ(t. Given a signal v(t which is wrapped to become ṽ(t, there are two ways to get the coefficients of the frequency response of ṽ(t. he first is to take the Fourier transform of v(t (which can be longer than and then sample the frequency response at F = m/. he second is to take the Fourier transform of one period of ṽ(t and then sample the frequency response at F = m/ Poisson Sum Formula From Eq. (21, one can take the term-by-term inverse Fourier transform of the extreme righthand side expression and equate it to the lefthand side. his gives the Poisson sum formula, v(t k = 1 ( m V e k= m= j2πtm/. (23 3 Discrete-ime Fourier ransform he discrete-time Fourier transform (DF is given by V(ω = v[n]e jωn. (24 n= his sum converges if v[n] is absolutely summable. he frequency response is periodic, with period 2π. his sum can be considered to be a Fourier series expansion of the periodic signal V(ω. he inverse discrete-time Fourier transform is the computation of the Fourier series coefficients, 3.1 Fourier ransform of a Discrete-ime Periodic Signal v[n] = 1 π V(ωe jωn dω. (25 2π π Let ṽ[n] be periodic with period, ṽ[n+ ] = ṽ[n]. (26
8 Frequency Domain Representations of Sampled and Wrapped Signals 6 Let us evaluate the Fourier transform of this signal. V p ω = = = ṽ[n]e jωn n= 1 p= q=0 e p= ṽ[p + q]e jω(p+q 1 jωp q=0 ṽ[q]e jωq. (27 he second line of this equation is a result of substituting n = p + q. he third line results from exploiting the periodicity of ṽ[n]. he second factor of the result above is the DF of one period of ṽ[n]. In the last line, the first factor (sum of complex exponentials can be expressed in terms of an impulse train. he form of the sum is a little different than that encountered earlier. Appendix A recasts the earlier results in terms of radian frequency. hen from Eq. (63 with =, p= e jωp = 2π ( δ k= ω 2πk. (28 Finally we can write where V p (ω = 2π V k = 1 k= ( V k δ ω 2πk, (29 1 ṽ[n]e j2πnk/. (30 n=0 he coefficients V k are periodic with period. hey are obtained as the DF of one period of ṽ[n], evaluated at ω = 2πk/. As we will see later, these coefficients are the same as the discrete Fourier transform, except for a scale factor.
9 Frequency Domain Representations of Sampled and Wrapped Signals Fourier Series Discrete-ime Signals he Fourier series expansion for a discrete time signal can be obtained by taking the inverse transform of Eq. (29, ṽ[n] = 1 2π = = π k= π V(ωe jωn dω V k 2π ǫ ǫ 1 V k e j2πkn/. k=0 ( δ ω 2πk e jωn dω (31 In the second line, the limits of the integration have been shifted so that the delta functions for k = 0 to k = 1 fall within the limits. his is possible because the integrand is periodic with period 2π. he result is a Fourier series expansion with Fourier series coefficients V k, ṽ[n] = 3.3 Fourier ransform of a Discrete-ime Pulse rain Consider the discrete-time pulse train ṽ[n] = 1 V k e j2πkn/. (32 k=0 δ[n k]. (33 k= Here the delta function with square brackets is the unit pulse, equal to one if its argument is zero, and equal to zero otherwise. he Fourier series coefficients for this signal are constants at 1/, giving the Fourier series representation, k= δ[n k] = 1 1 e j2πnk/. (34 k=0 he DF of this pulse train can be found term-by-term for the left-hand side of the equation above, V p (ω = e jωk. (35 k=
10 Frequency Domain Representations of Sampled and Wrapped Signals 8 We can find a impulse train representation for this expression from Eq. (63 in Appendix A. his gives the following representations of a discrete-time pulse train. k= δ[n k] = 1 1 e j2πnm/ m=0 k= e jωk = 2π ( δ m= ω 2πm his expression has discrete-time pulses on the left and delta functions on the right.. ( Periodic Wrapped Discrete-ime Signals Consider forming a periodic signal ṽ[n] from v[n], ṽ[n] = v[n] k= δ[n k] = v[n k]. (37 k= Using the fact that a convolution in the time-domain corresponds to a product in the frequency domain, the DF of ṽ[n] is k= v[n k] V(ω 2π ( δ m= ω 2πm = 2π V m= ( 2πm ( δ ω 2πm. (38 Given a signal v[n] which is wrapped to become ṽ[n], there are two ways to get the coefficients of the frequency response. he first is to take the Fourier transform of v[n] and then sample the frequency response at ω = 2πm/. he second is to take the Fourier transform of one period of ṽ[n] and then sample the frequency response at ω = 2πm/. 3.5 Poisson Sum Formula For discrete-time signals we can find a result similar to the Poisson sum formula for continuoustime signals. In this case, taking the term-by-term inverse Fourier transform of the extreme righthand side of the equation above, k= v[n k] = 1 V m= ( 2πm e j2πnm/. (39
11 Frequency Domain Representations of Sampled and Wrapped Signals 9 4 Discrete Fourier ransform he discrete Fourier transform (DF for a finite length sequence x[n] is [3] V[k] = 1 v[n]e j2πnk. (40 n=0 he DF coefficients V[k] are periodic with period. he inverse discrete Fourier transform is v[n] = 1 1 V[k]e j2πnk. (41 k=0 In this equation, v[n] becomes periodic with period. With this view, we see that the DF formula Eq. (40 can be considered to operate on a finite length signal, or alternately, can be considered to operate on one period of a periodic signal. In the latter interpretation, the DF formula essentially calculates the Fourier series coefficients of the periodic signal. he DF formula differs from the Fourier series formula in Eq. (31 only in scale factor. he Fourier series coefficient V k is related to the DF coefficient as V[k] = V k. (42 5 Relationships Between the Frequency-Domain Representations he previous results put us in a good position to examine the relationships between the frequency representations of continuous-time signals, sampled signals, and periodic signals. Figure 1 shows a schematic form of the relationships. Consider the time-domain signals shown in that figure. On the left side of the diagram, the signal x[n] is formed by sampling x(t with sampling interval. he signal x[n] is formed by wrapping x[n] with period. On the right side of the diagram, the signal x(t is formed by wrapping x(t with period. Sampling x(t with period closes the loop and gives us x[n]. hus sampling then wrapping (on the left side is the same as wrapping and then sampling (on the right side with the proviso that wrapping period is times the sampling interval. 5.1 Sampling a Continuous-ime Signal: x(t x[n] We can model the sampling of a continuous-time signal as the multiplication of the continuoustime signal by a impulse train. he areas of the resulting impulses are the sample values, x s (t = x(t k= δ(t k = x(kδ(t k. (43 k=
12 Frequency Domain Representations of Sampled and Wrapped Signals m X( X c m 2 wrap xn [ ] xn ( sample Xc ( F xt ( F 1 m X m X c sample xt ( xt ( k k wrap X( DF xn [ ] xt ( FS Xm wrap xn [ ] xn [ k ] k sample 2 k Xk [ ] X xn [ ] Xk [ ] DF sample xn [ ] xn ( wrap Xk [ ] Xk m m Fig. 1 Relationships between the frequency domain representations of continuoustime signals, sampled signals, and periodic signals. F is the (continuous-time Fourier transform, DF is the discrete-time Fourier transform, FS is the Fourier series, and DF is the discrete Fourier transform.
13 Frequency Domain Representations of Sampled and Wrapped Signals 11 he Fourier transform X s (F can be computed using the relationship that a product in the time domain corresponds to a convolution in the frequency domain. x s (t = x(t δ(t k X s (F = X c (F 1 k= ( δ F m = 1 m= ( X c F m. (44 m= his frequency response is periodic with period 1/. In this form we see that sampling in the time domain corresponds to wrapping in the frequency domain. he resulting frequency response will not have aliasing (overlapping responses if the baseband signal X c (F is bandlimited to F < 1/(2. here is another expression for X s (F. his time we take the Fourier transform term by term of the second form of the time domain expression in Eq. (43, x s (t = x(kδ(t k X s (F = x(ke j2πkf. (45 k= k= In discrete-time, x[n] = x(n. (46 he DF of x[n] is X(ω which is periodic with period 2π. If we compare the definition for the DF (Eq. (24 with Eq. (45, we see that X(ω = X x (F F=ω/(2π = x[k]e jωk (47 k= he mapping between F for the continuous-time Fourier transform and ω for the discrete-time Fourier transform is ω = 2πF. With this mapping, when F increases by 1/, ω increases by 2π. as, Returning to the wrapped form of the frequency response in Eq. (44, the DF can be written X(ω = 1 m= ( ω 2πm X c. (48 2π As pointed out earlier, the x[n] X(ω relationship is that of Fourier series coefficients x[n] corresponding to a periodic signal X(ω.
14 Frequency Domain Representations of Sampled and Wrapped Signals Wrapping a Continuous-ime Signal: x(t x(t he frequency-domain consequences of wrapping a continuous-time signal have been explored in Section 2.5. hat result is reproduced here with the appropriate change of variables, x(t = x(t k 1 m ( X c( δ F m. (49 k= m= In the diagram, the frequency domain representation of the wrapped sequence is given in terms of its continuous-time Fourier series coefficients, x m = 1 m c( X. ( Wrapping a Discrete-ime Signal: x[n] x[n] he frequency-domain consequences of wrapping a discrete-time signal have been explored in Section 3.4. hat result is reproduced here with the appropriate change of variables, x[n] = k= x[n k] 2π X m= he discrete-time Fourier series coefficients for x[n] are ( 2πm ( δ ω 2πm. (51 X m = 1 ( 2πm X. (52 We can substitute for X(ω from Eq. (48 to get an expression for the Fourier series coefficients directly in terms of wrapped samples of the continuous-time Fourier transform X c (F, X k = 1 m= ( k m X c. (53 In the figure, the corresponding relationship is expressed in terms of the discrete Fourier transform coefficients (X[k] = X k, X[k] = X hese coefficients are the DF for one period of x[n]. ( 2πk. (54
15 Frequency Domain Representations of Sampled and Wrapped Signals Sampling a Continuous-ime Periodic Signal: x(t x[n] he periodic signal x(t is represented by its Fourier series coefficients x m in Eq. (50. he periodic discrete-time signal x[n] is likewise represented by its Fourier series coefficients X m in Eq. (53. he relationship between these is X k = x k m. (55 m= Finally, the DF coefficients expressed in terms of the Fourier series coefficients of x(t are given by X[k] = m= x k m. ( Frequency Domain Relationships Reversibility he diagram showing the frequency domain relationships shows that sampling in one domain corresponds to wrapping in the other domain. he diagram shows directed arrows for the sampling and wrapping operations. Under some circumstances, one can reverse the operation. For instance, sampling is reversible if a time signal is appropriately bandlimited. Similarly, wrapping a time signal is reversible if the signal is time limited to less than the wrapping period. However to reach the DF from the Fourier transform involves both sampling and wrapping. he combination is not reversible since a signal cannot be simultaneously bandlimited and time limited Periodic x(t Consider a periodic continuous-time signal x(t. Sampling this signal is well-defined. However, wrapping this signal can result in the sum becoming infinite. Since going from continuous-time to the DF input x[n] involves both sampling and wrapping, this is generally not possible for periodic x(t. Consider x(t = e j2πf ot. (57 his periodic signal a Fourier series with a single term and thus has a Fourier transform consisting of a single delta function at F = F o. Sampling x(t at k results in a DF which has a delta functions at ω = 2πF o + 2πm. here is a single delta function in any interval of length 2π. ow consider a more general periodic signal which has an unbounded number of harmonics, x(t = x m e j2πmfot. (58 m=
16 Frequency Domain Representations of Sampled and Wrapped Signals 14 If we sample this signal at k, there are two cases. If F o = M/ where M and are relatively prime, then the discrete-time signal will be periodic with period. Since the Fourier series expansion for a periodic signal with period has at most terms, the DF will contain at most delta functions in every interval of length 2π. If Fo is irrational, the DF can potentially contain an infinite number of delta functions in every interval of length 2π. he conclusion is that sampled periodic signals have a DF consisting of a finite number of delta function per 2π interval if the sampled signal is itself periodic (requires the sampling interval be synchronized with the period, or if the periodic signal has a finite number of harmonics (Fourier series expansion with a finite number of terms. 6 Summary hese notes has shown that the Fourier transform can be applied to periodic continuous-time or discrete-time signals. his allows for a unified analysis of signals containing both non-periodic and periodic components. he second part of these notes have examined the frequency domain relationships for signals derived by sampling and/or wrapping a continuous-time signal.
17 Frequency Domain Representations of Sampled and Wrapped Signals 15 Appendix A Continuous-ime Results Expressed in Radian Measure In this appendix, we restate the results derived earlier for continuous-time signals using radian frequency. Using radian frequency (Ω, the Fourier transform is he inverse transform is V(Ω = v(te jωt dt. (59 v(t = 1 V(Ωe jωt dω. (60 2π he integral representation for a delta function in Eq. (10 has a 2π factor in the exponent. Absorbing this factor into the variable u, a modified integral representation is e ±jux du = 2πδ(x. (61 Using this result, the Fourier transform of a periodic sequence expressed in terms of Ω is (c.f. Eq. (14 V p (Ω = 2π m= ( v m δ Ω 2πm, (62 where v m is given in Eq. (12. he Fourier transform of the periodic impulse train is (c.f. Eq. (19 k= δ(t k = 1 e j2πmt/ m= k= e jkω = 2π ( δ m= Ω 2πm he Poisson sum formula for the Fourier transform with radian argument is (c.f. Eq. (23 k= v(t k = 1 V m=. (63 ( 2πm e j2πtm/. (64
18 Frequency Domain Representations of Sampled and Wrapped Signals 16 References [1] A. Papoulis, he Fourier Integral and its Applications, McGraw-Hill, 1962 (ISB [2] A. V. Oppenheim and A. S. Willsky, with S. H. awab, Signals and Systems, 2nd edition, Prentice-Hall, 1996 (ISB [3] A. V. Oppenheim and R. W. Schafer, Discrete-ime Signal Processing, 3rd edition, Pearson, 2010 (ISB
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
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:
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 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 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 informationIntroduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example
Introduction to Fourier ransforms Lecture 7 ELE 3: Signals and Systems Fourier transform as a limit of the Fourier series Inverse Fourier transform: he Fourier integral theorem Prof. Paul Cuff Princeton
More informationSignals & Systems. Lecture 5 Continuous-Time Fourier Transform. Alp Ertürk
Signals & Systems Lecture 5 Continuous-Time Fourier Transform Alp Ertürk alp.erturk@kocaeli.edu.tr Fourier Series Representation of Continuous-Time Periodic Signals Synthesis equation: x t = a k e jkω
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 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 informationVer 3808 E1.10 Fourier Series and Transforms (2014) E1.10 Fourier Series and Transforms. Problem Sheet 1 (Lecture 1)
Ver 88 E. Fourier Series and Transforms 4 Key: [A] easy... [E]hard Questions from RBH textbook: 4., 4.8. E. Fourier Series and Transforms Problem Sheet Lecture. [B] Using the geometric progression formula,
More informationLecture 7 ELE 301: Signals and Systems
Lecture 7 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 22 Introduction to Fourier Transforms Fourier transform as
More informationUp-Sampling (5B) Young Won Lim 11/15/12
Up-Sampling (5B) Copyright (c) 9,, Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version. or any later version
More informationENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University
ENSC327 Communications Systems 2: Fourier Representations Jie Liang School of Engineering Science Simon Fraser University 1 Outline Chap 2.1 2.5: Signal Classifications Fourier Transform Dirac Delta Function
More information1 Signals and systems
978--52-5688-4 - Introduction to Orthogonal Transforms: With Applications in Data Processing and Analysis Signals and systems In the first two chapters we will consider some basic concepts and ideas as
More informationThen r (t) can be expanded into a linear combination of the complex exponential signals ( e j2π(kf 0)t ) k= as. c k e j2π(kf0)t + c k e j2π(kf 0)t
.3 ourier Series Definition.37. Exponential ourier series: Let the real or complex signal r t be a periodic signal with period. Suppose the following Dirichlet conditions are satisfied: a r t is absolutely
More informationCT Rectangular Function Pairs (5B)
C Rectangular Function Pairs (5B) Continuous ime Rect Function Pairs Copyright (c) 009-013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU
More informationDown-Sampling (4B) Young Won Lim 11/15/12
Down-Sampling (B) /5/ Copyright (c) 9,, Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version. or any later
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 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 informationDigital 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 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 informationAspects of Continuous- and Discrete-Time Signals and Systems
Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the
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 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 informationTLT-5200/5206 COMMUNICATION THEORY, Exercise 1, Fall 2012
Problem 1. a) Derivation By definition, we can write the inverse Fourier transform of the derivative of x(t) as d d jπ X( f ) { e } df d jπ x() t X( f ) e df jπ j π fx( f ) e df Again, by definition of
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 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 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 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 informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
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 informationTopic 3: Fourier Series (FS)
ELEC264: Signals And Systems Topic 3: Fourier Series (FS) o o o o Introduction to frequency analysis of signals CT FS Fourier series of CT periodic signals Signal Symmetry and CT Fourier Series Properties
More informationApproximation of the Continuous Time Fourier Transform. Signals & Systems Lab 8
Approximation of the Continuous Time Fourier Transform Signals & Systems Lab 8 Continuous Time Fourier Transform (CTFT) X f = x t e j2πft dt x t = X f e j2πft df Uncle Fourier Riemann Definite Integral
More informationFourier transforms. Definition F(ω) = - should know these! f(t).e -jωt.dt. ω = 2πf. other definitions exist. f(t) = - F(ω).e jωt.
Fourier transforms This is intended to be a practical exposition, not fully mathematically rigorous ref The Fourier Transform and its Applications R. Bracewell (McGraw Hill) Definition F(ω) = - f(t).e
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 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 informationDIGITAL SIGNAL PROCESSING LECTURE 1
DIGITAL SIGNAL PROCESSING LECTURE 1 Fall 2010 2K8-5 th Semester Tahir Muhammad tmuhammad_07@yahoo.com Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000
More informationSignals and Systems I Have Known and Loved. Andrew W. Eckford
Signals and Systems I Have Known and Loved Andrew W. Eckford Department of Electrical Engineering and Computer Science York University, oronto, Ontario, Canada Version: September 2, 216 Copyright c 215
More informationESS Finite Impulse Response Filters and the Z-transform
9. Finite Impulse Response Filters and the Z-transform We are going to have two lectures on filters you can find much more material in Bob Crosson s notes. In the first lecture we will focus on some of
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Fourier Series Representation of Periodic Signals Let x(t) be a CT periodic signal with period T, i.e., xt ( + T) = xt ( ), t R Example: the rectangular
More informationFourier Analysis Overview (0B)
CTFS: Continuous Time Fourier Series CTFT: Continuous Time Fourier Transform DTFS: Fourier Series DTFT: Fourier Transform DFT: Discrete Fourier Transform Copyright (c) 2009-2016 Young W. Lim. Permission
More informationLecture 6 January 21, 2016
MATH 6/CME 37: Applied Fourier Analysis and Winter 06 Elements of Modern Signal Processing Lecture 6 January, 06 Prof. Emmanuel Candes Scribe: Carlos A. Sing-Long, Edited by E. Bates Outline Agenda: Fourier
More informationCS-9645 Introduction to Computer Vision Techniques Winter 2018
Table of Contents Spectral Analysis...1 Special Functions... 1 Properties of Dirac-delta Functions...1 Derivatives of the Dirac-delta Function... 2 General Dirac-delta Functions...2 Harmonic Analysis...
More informationDown-Sampling (4B) Young Won Lim 10/25/12
Down-Sampling (4B) /5/ Copyright (c) 9,, Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version. or any later
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 informationChapter 2: The Fourier Transform
EEE, EEE Part A : Digital Signal Processing Chapter Chapter : he Fourier ransform he Fourier ransform. Introduction he sampled Fourier transform of a periodic, discrete-time signal is nown as the discrete
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 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 informationEE 438 Essential Definitions and Relations
May 2004 EE 438 Essential Definitions and Relations CT Metrics. Energy E x = x(t) 2 dt 2. Power P x = lim T 2T T / 2 T / 2 x(t) 2 dt 3. root mean squared value x rms = P x 4. Area A x = x(t) dt 5. Average
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 informationReview of Analog Signal Analysis
Review of Analog Signal Analysis Chapter Intended Learning Outcomes: (i) Review of Fourier series which is used to analyze continuous-time periodic signals (ii) Review of Fourier transform which is used
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 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 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 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 informationCommunication Signals (Haykin Sec. 2.4 and Ziemer Sec Sec. 2.4) KECE321 Communication Systems I
Communication Signals (Haykin Sec..4 and iemer Sec...4-Sec..4) KECE3 Communication Systems I Lecture #3, March, 0 Prof. Young-Chai Ko 년 3 월 일일요일 Review Signal classification Phasor signal and spectra Representation
More informationRepresenting a Signal
The Fourier Series Representing a Signal The convolution method for finding the response of a system to an excitation takes advantage of the linearity and timeinvariance of the system and represents the
More informationChapter 4 The Fourier Series and Fourier Transform
Chapter 4 The Fourier Series and Fourier Transform Representation of Signals in Terms of Frequency Components Consider the CT signal defined by N xt () = Acos( ω t+ θ ), t k = 1 k k k The frequencies `present
More informationSignals and Systems: Part 2
Signals and Systems: Part 2 The Fourier transform in 2πf Some important Fourier transforms Some important Fourier transform theorems Convolution and Modulation Ideal filters Fourier transform definitions
More informationChapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited
Chapter 6 THE SAMPLING PROCESS 6.1 Introduction 6.2 Fourier Transform Revisited Copyright c 2005 Andreas Antoniou Victoria, BC, Canada Email: aantoniou@ieee.org July 14, 2018 Frame # 1 Slide # 1 A. Antoniou
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 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 informationFourier Representations of Signals & LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n] 2. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
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 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 informationNyquist sampling a bandlimited function. Sampling: The connection from CT to DT. Impulse Train sampling. Interpolation: Signal Reconstruction
Sampling: he connection rom C to D Nyquist sampling a bandlimited unction ( Consider as an example sampling the bandlimited signal sinc 2 (5t F 1 5 Λ 5 An ininite number o waveorms could exactly pass through
More information2.161 Signal Processing: Continuous and Discrete Fall 2008
MIT OpenCourseWare http://ocw.mit.edu 2.6 Signal Processing: Continuous and Discrete Fall 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. MASSACHUSETTS
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 informationEE 3054: Signals, Systems, and Transforms Summer It is observed of some continuous-time LTI system that the input signal.
EE 34: Signals, Systems, and Transforms Summer 7 Test No notes, closed book. Show your work. Simplify your answers. 3. It is observed of some continuous-time LTI system that the input signal = 3 u(t) produces
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 31, 2017 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationRadar Systems Engineering Lecture 3 Review of Signals, Systems and Digital Signal Processing
Radar Systems Engineering Lecture Review of Signals, Systems and Digital Signal Processing Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course Review Signals, Systems & DSP // Block Diagram of
More informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 6: January 30, 2018 Inverse z-transform Lecture Outline! z-transform " Tie up loose ends " Regions of convergence properties! Inverse z-transform " Inspection " Partial
More informationComments on Hilbert Transform Based Signal Analysis
Brigham Young University Department of Electrical and Computer Engineering 459 Clyde Building Provo, Utah 84602 Comments on Hilbert Transform Based Signal Analysis David G. Long, Ph.D. Original: 15 June
More informationMEDE2500 Tutorial Nov-7
(updated 2016-Nov-4,7:40pm) MEDE2500 (2016-2017) Tutorial 3 MEDE2500 Tutorial 3 2016-Nov-7 Content 1. The Dirac Delta Function, singularity functions, even and odd functions 2. The sampling process and
More information2. CONVOLUTION. Convolution sum. Response of d.t. LTI systems at a certain input signal
2. CONVOLUTION Convolution sum. Response of d.t. LTI systems at a certain input signal Any signal multiplied by the unit impulse = the unit impulse weighted by the value of the signal in 0: xn [ ] δ [
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 informationLINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding
LINEAR SYSTEMS Linear Systems 2 Neural coding and cognitive neuroscience in general concerns input-output relationships. Inputs Light intensity Pre-synaptic action potentials Number of items in display
More informationFourier Series and Transforms. Revision Lecture
E. (5-6) : / 3 Periodic signals can be written as a sum of sine and cosine waves: u(t) u(t) = a + n= (a ncosπnft+b n sinπnft) T = + T/3 T/ T +.65sin(πFt) -.6sin(πFt) +.6sin(πFt) + -.3cos(πFt) + T/ Fundamental
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 information16.362: Signals and Systems: 1.0
16.362: Signals and Systems: 1.0 Prof. K. Chandra ECE, UMASS Lowell September 1, 2016 1 Background The pre-requisites for this course are Calculus II and Differential Equations. A basic understanding of
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 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 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 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 informationDiscussion Section #2, 31 Jan 2014
Discussion Section #2, 31 Jan 2014 Lillian Ratliff 1 Unit Impulse The unit impulse (Dirac delta) has the following properties: { 0, t 0 δ(t) =, t = 0 ε ε δ(t) = 1 Remark 1. Important!: An ordinary function
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 informationApplication of Simple Harmonics Modeling a Shock
Undergraduate Journal of Mathematical Modeling: One + Two Volume 8 2017 Fall 2017 Issue 1 Article 1 Application of Simple Harmonics Modeling a Shock Kai Raymond University of South Florida Advisors: Thomas
More informationCh 2: Linear Time-Invariant System
Ch 2: Linear Time-Invariant System A system is said to be Linear Time-Invariant (LTI) if it possesses the basic system properties of linearity and time-invariance. Consider a system with an output signal
More informationEA2.3 - Electronics 2 1
In the previous lecture, I talked about the idea of complex frequency s, where s = σ + jω. Using such concept of complex frequency allows us to analyse signals and systems with better generality. In this
More informationCh.11 The Discrete-Time Fourier Transform (DTFT)
EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution
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 informationCombinatorial Coding and Lexicographic Ordering
Combinatorial Coding and Lexicographic Ordering Peter Kabal Department of Electrical & Computer Engineering McGill University Montreal, Canada Version 1, February 2018 c 2018 Peter Kabal 2018/02/19 You
More informationSignals & Systems Handout #4
Signals & Systems Handout #4 H-4. Elementary Discrete-Domain Functions (Sequences): Discrete-domain functions are defined for n Z. H-4.. Sequence Notation: We use the following notation to indicate the
More informationLAST Name FOURIER FIRST Name Jean Baptiste Joseph Lab Time 365/24/7
EECS 20N: Structure and Interpretation of Signals and Systems Final Exam Sol. Department of Electrical Engineering and Computer Sciences 13 December 2005 UNIVERSITY OF CALIFORNIA BERKELEY LAST Name FOURIER
More informationEach of these functions represents a signal in terms of its spectral components in the frequency domain.
N INTRODUCTION TO SPECTRL FUNCTIONS Revision B By Tom Irvine Email: tomirvine@aol.com March 3, 000 INTRODUCTION This tutorial presents the Fourier transform. It also discusses the power spectral density
More informationContinuous-time Signals. (AKA analog signals)
Continuous-time Signals (AKA analog signals) I. Analog* Signals review Goals: - Common test signals used in system analysis - Signal operations and properties: scaling, shifting, periodicity, energy and
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 information4.1 Introduction. 2πδ ω (4.2) Applications of Fourier Representations to Mixed Signal Classes = (4.1)
4.1 Introduction Two cases of mixed signals to be studied in this chapter: 1. Periodic and nonperiodic signals 2. Continuous- and discrete-time signals Other descriptions: Refer to pp. 341-342, textbook.
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 information