A3. Frequency Representation of Continuous Time and Discrete Time Signals

Size: px
Start display at page:

Download "A3. Frequency Representation of Continuous Time and Discrete Time Signals"

Transcription

1 A3. Frequency Representation of Continuous Time and Discrete Time Signals Objectives Define the magnitude and phase plots of continuous time sinusoidal signals Extend the magnitude and phase plots to discrete time signals Define aliasing for sampled sinusoids State the sampling theorem for sinusoidal signals Extend the sampling theorem to general signals of interest 1. Introduction We begin this section with a frequency representation of sinusoids both in continuous time and discrete time, to extend it to more general signals. The goals of this development are twofold: a. provide an early introduction to the frequency spectrum with minimal mathematical bacground and b. introduce the sampling theorem, at the basis of any Digital Signal Processing implementation. 2. Frequency Representation of Sinusoids: Continuous Time VIDEO: Frequency Representation of Continuous Time Sinusoids (18:13) We have seen that a sinusoidal signal with amplitude A, frequency F and phase α is represented in terms of complex exponentials as A jα j2π F t A jα j2πft x( 2πF t + α) = e e + e e 2 2 As we loo at this signal, we see that it is the superposition of two complex exponentials with frequencies F and F. Each complex exponential is multiplied by a complex jα number A e ± depending on magnitude and phase only. This leads to a graphical 2 representation of the signal in terms of magnitude A / 2 and phase ± α versus frequency, as shown in the figure below.

2 Frequency domain representation of the signal x ( 2π Ft + α) in terms of magnitude and phase versus frequency. Let s see a numerical example. Example. Consider the signal x( = 1 cos(2π t +.15). Clearly it has an amplitude A = 1 (Volts, Amps or whatever physical quantity the signal is associated to), a frequency of F 1 Hz (don t forget the factor 2 as in 2 π ) and phase α =. 15 = radians. This signal can be represented in terms of complex exponentials as j.15 j2π t j.15 j2π t x( = ( 5e ) e + ( 5e ) e which shows the two frequency components at ± 1 Hz each one with magnitude 5 and phase ±. 15 radians. This is shown as a plot of magnitude and phase vs frequency in the figure below. Frequency Domain Representation of the signal x( = 1 cos(2π t +.15) in the example. Notice two facts. First the definition of a negative frequency. When we tal about frequency (say in your radio), you always assume a positive number. Radio station (say) KAZU 9.3 implies a signal broadcast around a carrier with frequency 9.3MHz. It is sort of understood that the frequency is a positive number. The negative frequency ( F = 1. Hz in the example) is a mathematical artifact, since we are expressing sinusoids in terms of complex exponentials. Since each complex

3 j exponential 2 πf t e = cos( 2πF + j sin(2πf t ) has an imaginary part (multiplied by j = 1, imaginary because it does not exist in nature) we need to add its own j complex conjugate 2 πf t e = cos( 2πF j sin(2πf t ) so that we cancel it out. For the same reason, the complex coefficient of the negative exponential 5e j.15 in the example, is the complex conjugate of the coefficient 5e j.15 multiplying the exponential with positive frequency. Another important observation is that there is a one-to-one correspondence between a continuous time sinusoid and its frequency domain representation. Referring to the figure below, given a sinusoid with given Amplitude A, phase α and frequency F, we can represent it (as we have seen ) in the frequency domain. On the other hand, given the frequency representation on the right, showing amplitude phase and frequency, there is only sinusoid in continuous time with these parameters. In other words, there is no ambiguity in the time and frequency domain representations. In Continuous Time there is no ambiguity between Time and Frequency Domain representation of a sinusoid. Since there are no ambiguities, at least theoretically there are no limits in value of amplitude, phase and frequency. In particular this means that the frequency F can assume any value in the whole range from to +. Example. Suppose the magnitude and phase are as shown in the figure below. First, we verify that it is symmetrical (same magnitude and opposite phase for positive and negative frequencies), which is necessary for a real signal. Then we can see that the magnitude is A / 2 = 2, which implies A = 4, the phase is α =. 3 radians and the frequency F = 5Hz. Then the continuous time signal is given by x( = 4cos(1π t +.3), and no other sgnal has the same representation. There is no amguity!

4 Magnitude and Phase for the Example. 3. Frequency Representation of Sinusoids: Discrete Time VIDEO: Frequency Representation of Discrete Time Sinusoids (8:33) In the discrete time domain, we have exactly the same representation in terms of the digital frequency ω = 2πF / FS. Recall that this is expressed in radians (NOT radians per second) and it has no dimensions since it is a relative frequency, relative to the sampling frequency F. S Then a sinusoid x [ n] ω n + α) in discrete time, with amplitude A, phase α and digital frequency ω can be expressed in terms of complex exponentials as A jα jω n A jα jωn x[ n] = e e + e e 2 2 This is the same form as in the continuous time domain. We have magnitude and phase versus frequency ω as shown in the figure below.

5 Frequency Domain representation of the discrete time sinusoid x [ n] ω n + α). In order to illustrate this concept let us see an example. Example. Consider the discrete time sinusoid x[ n] = 8cos(.45π n.35). It has an amplitude of A = 8, phase α =. 35 radians and digital frequency.45π radians. This signal can be expanded in terms of complex exponentials as j.35 j.45π n j.35 j. 45π n x[ n] = ( 4e ) e + ( 4e ) e This shows two frequency components at ω = ±. 45π radians with magnitudes 4 and phase. 35 radians. The frequency domain representation of this signal is shown in the figure below. Frequency Domain Representation of the signal x[ n] = 8cos(.45π n.35) in the example. Again we see that the magnitude and phase of the two components (at ω = ±. 45π radians) are related having the same magnitude and opposite phase.

6 4. Discrete Time Sinusoids and Frequency Domain Ambiguity VIDEO: Frequency Domain Ambiguity in Discrete Time (13:1) In continuous time we have seen that there is a one to one correspondence between a continuous time sinusoid and its frequency domain representation. In other words we can go from the time domain to the frequency domain and viceversa without ambiguity. In discrete time this is not so, in the sense that there exists an infinite number of sinusoids having different digital frequencies but with the same samples x [n]. In order to see this let s start with two discrete time sinusoids x [ n] ω n + α) x n] ω n + ) 1[ 1 α Let the two frequencies ω,ω 1 be related as ω ω 2 1 = + π, with an integer. Then we can write x [ ] as 1 n x 1[ n] ω n + 2π n + α) ωn + α) where the rightmost equality comes from the fact that both, n are integer by assumption, and an integer multiple of 2 π does not affect the angle. It is easy to verify, with this choice of frequencies x 1[ n] = x[ n] for all n. That is to say that they are not distinguishable from each other, even though they have different frequencies. Tae another signal x 2[ n] ω2n α) Let the two frequencies ω,ω 2 be related as ω ω 2 2 = + π, with an integer. Then we can write x [ ] as 2 n x 2[ n] ω n + 2π n α) ωn + α) So we can see that even this signal is not distuinguishable from x [ n ], since x n] = x [ ] for all n. 2[ n From these two examples we can see that, in discrete time, there is a lot of ambiguity in the frequency domain representation, since the frequencies

7 ω = ω + 2π 1 ω2 = 2π ω with any arbitray integer, yield the same signal in the time domain. Let s see this with an example. Example. Consider the discrete time sinusoid x[ n] = 5cos(.1π n +.2) and let s try to find other sinusoids with different frequencies but the same sample values in the time domain. From the expression ω1 = ω + 2π, let (say) = 1 and we obtain ω1 =.1π + 2π = 2. 1π. If we choose = 2 we have the digital frequency ω2 =.1π + 4π = 4. 1π and so on. Therefore the sinusoids x[ n] = 5cos(.1π n +.2) = 5cos(2.1π n +.2) = 5cos(4.1π n +.2) =... and many more are indistinguishable from each other. Similarly, using the expression ω2 = 2π ω, let (say) = 1,2,3,... and we obtain the digital frequencies 1.9π, 3.9π, 5.9π,... and so on, all having the same sample values in the time domain. The figure below, show this ambiguity. For simplicity we show only the magnitude plot, but it is understood that there is a phase plot as well. In discrete time, different frequencies can give the same time domain signal. VIDEO: Aliased Frequencies (9:27)

8 Now we want to try to resolve this ambiguity so there is no confusion when we loo at the frequency domain. In order to do so we mae the following observation. Consider all the digital frequencies in the interval π ω < π Then it is easy to verify (simply try to believe!) that all other frequencies with the same samples (which we call aliases) are such that, for any integer ω + 2π > π ω + 2π > π In other words they are outside the interval π, + π as shown in the figure below. Frequences of the Aliases For a digital frequency in the interval π ω < π all aliases are outside this interval. In fact, notice from the last example, that the digital frequency ω =. 1π radians has all aliases at frequencies ω = 2.1π, 4.1π,...,1.9π,3.9π,... all with values larger than π. So, if we now in advance that the signal has frequency between π and + π there is only one choice, in this case ω =. 1π and none else. This is shown in the figure below. For all sinusoids with digital frequency π ω < π there is a one to one correspondence (ie, no ambiguity, no aliases) between time domain signal and frequency domain representation. In discrete time, there is a one to one correspondence between the frequency interval π ω < π and the time domain signals.

9 As a consequence of this, we loo at the digital frequency spectrum of discrete time signals only within the interval π ω < π radians. Everything else is just an alias and it can be represented by a frequency within the main interval π ω < π. 5. Sampling of Continuous Time Sinusoids VIDEO: Sampled Sinusoids (2:3) In the past section we saw that, in order to have a one to one correspondence between frequency representation and time signal, we need the digital frequency of a sinusoid to be within the interval π ω < π. This has a very significant consequence on the choice of the sampling frequency for a given signal and it leads to the well nown sampling theorem which we are going to explain next. Consider a sinusoid with frequency F Hz, sampled at F S Hz (or samples per second). As shown in the figure below, in order for the the two digital frequencies ± ω = ± F / to be within the required interval π ω < π we need 2π F S F < F S 2 Sampling a Continuous Time Sinusoid. Now we want to see which other frequencies would give aliases, ie the same sampled sinusoids. Rewrite the aliasing conditions in terms F and F S and we obtain the two conditions on the frequencies as F F Fs + 2π + 2π = 2π F F s s

10 2π F F Fs F + 2π = 2π s This shows that a sinusoid with frequency F, after sampling is not distuinguishable from other sinusoids with frequencies F + FS and F S F, with an arbitrary integer. In other words, as shown in the figure below, after sampling all sinusoids with frequencies F + FS, F + 2F, and S F S F, 2F S F, all lead to the same sampled sinusoid with frequency ω = F / F. 2π The Frequency of a Sinuosoid and its Aliases S F s All Sinusoids with Frequencies F, F + FS, F + 2F, S F S F, 2F S F, give all the same sampled signal. Example. Consider a signal with frequency F = 2Hz sampled at F S = 1Hz. Then, after sampling, it would not be distinguishable from its aliases at frequencies F + F = S 12Hz, 22Hz,... and F 8, 12 S F = Hz Hz,... All these sinusoids here, after sampling, map into the same sinusoid with digital frequency ω = 2 / 5 radians. π The importance of this fact is that there is no loss of information in sampling a sinusoid with frequency F < F / 2. In other words, as shown in the figure below, we can S exactly reconstruct it from its samples.

11 Sampling Thoerem for One Sinusoid There is no loss of information in sampling a sinusoid with frequency F < F / 2. S 6. Extension to General Signals: the Sampling Theorem VIDEO: Fourier Series Expansion (2:15) All these considerations can be extended to more general signals. It can be shown that any periodic signal with period T can be expanded as a Fourier Series of the form + j2πft x( = a e = where F = 1/ T is the fundamental frequency, and a are the Fourier Coefficients, in general complex. Example. Tae a continuous time sinusoid x( = 5cos(2π t +.1) with frequency F = 1Hz and period 1/ 1 3 T = F = sec. Then, as seen above, we can expand it as j.1 j2π t j.1 j2π t the sum of two complex exponentials x( = ( 2.5e ) e + ( 2.5e ) e. This is a particular case of a Fourier Series with fundamental frequency F = 1Hz and j.1 j.1 coefficients a 1 = 2. 5e, a 1 = 2. 5e and a = for all 1. Although the treatment of the Fourier Series will be subject of a later module, in this section we just want to emphasize the concepts of frequency spectrum of a signal and

12 the distribution of its power in the frequency domain. This will help understanding how to choose the sampling frequency of a signal so to minimize any loss of information due to the sampling process. In order to do so, we need to understand the relation between the signal x (, assumed periodic, and its Fourier Series coefficients a. In order to do so, first notice a fundamental property of complex expoentials, called orthogonality. This property states that, if we tae two complex esponentials of the form j2πmft e with, m any two integers, then we can write j2πft e and + T / 2 1 j2πf t j2πmft e e dt [ m ] T = d T / 2 where δ [ m ] = 1 if m = and δ [ m ] = if m, and again T = 1/ F. Applying this to the expression of the Fourier Series, we obtain a way of computing the Fourier Series coefficients, as 1 + T / T / 2 j2πf t ( ) = 1 j2 m Ft x( e dt a m e π dt T T m= T / 2 T / 2 The rightmost term is δ [ m ] which is always zero, apart from when = m. Therefore we obtain a = T We can illustrate this with an example. + / 2 1 T T / 2 x( e j2πft dt Periodic Signal for the Example. Example. Consider the periodic signal shown above. It is a square wave, with period 3 3 T = 4 1 sec. Each pulse has a width of 2 1 sec. From the period we determine the fundamental frequency coefficients as F = / T 25Hz and the new compute the Fourier Series 1 =

13 a 3 1 = 1 2e j2π 25t 1 if and, for =, a = 2 = dt 3 1 dt = sin 2 ( π / 2) π. A plot of the Fourier Coefficients (magnitude only) is shown in the figure below. Notice that they decay to zero at the index goes to infinity. Magnitude of Fourier Series Coefficients. An important property called Parseval s Theorem, relates the magnitude of the Fourier Coefficients to the Average Power of a signal, as T / 2 1 T T / 2 x( 2 dt = + = a 2 In other words, the sum of the magnitude square of the Fourier Series Coefficients yields the average Power of the signal. Since all signals in nature have finite power, then + = a 2 and therefore, for all signals lim a =. This means that most of the energy of a signal ± < is within frequency range called the Bandwidth of the signal. Then we can state the sampling theorem as follows. VIDEO: Sampling Theorem (3:39) Sampling Theorem. A signal with bandwidth (ie maximum frequency) B can be sampled at a sampling rate F S > 2B without any loss of information.

14 This is hown in the fiure below. Sampling of a Bandlimited Signal A bandlimited signal with maximum frequency B can be sampled at a rate F S > 2B without loss of information. Let s see a couple of tpical examples. Example. A telephone quality signal has a maximum bandwidth of sampled at a sampling frequency of at least F S = 8Hz. B = 4Hz. It can be Example. The human hearing goes up to a maximum frequency Compact Dis the music is sampled at F S = 44. 1Hz. B = 22Hz. In a

LOPE3202: Communication Systems 10/18/2017 2

LOPE3202: Communication Systems 10/18/2017 2 By Lecturer Ahmed Wael Academic Year 2017-2018 LOPE3202: Communication Systems 10/18/2017 We need tools to build any communication system. Mathematics is our premium tool to do work with signals and systems.

More information

A system that is both linear and time-invariant is called linear time-invariant (LTI).

A system that is both linear and time-invariant is called linear time-invariant (LTI). The Cooper Union Department of Electrical Engineering ECE111 Signal Processing & Systems Analysis Lecture Notes: Time, Frequency & Transform Domains February 28, 2012 Signals & Systems Signals are mapped

More information

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the

ω 0 = 2π/T 0 is called the fundamental angular frequency and ω 2 = 2ω 0 is called the he ime-frequency Concept []. Review of Fourier Series Consider the following set of time functions {3A sin t, A sin t}. We can represent these functions in different ways by plotting the amplitude versus

More information

ENSC327 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 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 information

Lecture 28 Continuous-Time Fourier Transform 2

Lecture 28 Continuous-Time Fourier Transform 2 Lecture 28 Continuous-Time Fourier Transform 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/14 1 Limit of the Fourier Series Rewrite (11.9) and (11.10) as As, the fundamental

More information

Discrete-Time Signals: Time-Domain Representation

Discrete-Time Signals: Time-Domain Representation Discrete-Time Signals: Time-Domain Representation 1 Signals represented as sequences of numbers, called samples Sample value of a typical signal or sequence denoted as x[n] with n being an integer in the

More information

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L

CHAPTER 4 FOURIER SERIES S A B A R I N A I S M A I L CHAPTER 4 FOURIER SERIES 1 S A B A R I N A I S M A I L Outline Introduction of the Fourier series. The properties of the Fourier series. Symmetry consideration Application of the Fourier series to circuit

More information

Lecture 27 Frequency Response 2

Lecture 27 Frequency Response 2 Lecture 27 Frequency Response 2 Fundamentals of Digital Signal Processing Spring, 2012 Wei-Ta Chu 2012/6/12 1 Application of Ideal Filters Suppose we can generate a square wave with a fundamental period

More information

I. Signals & Sinusoids

I. Signals & Sinusoids I. Signals & Sinusoids [p. 3] Signal definition Sinusoidal signal Plotting a sinusoid [p. 12] Signal operations Time shifting Time scaling Time reversal Combining time shifting & scaling [p. 17] Trigonometric

More information

Tutorial Sheet #2 discrete vs. continuous functions, periodicity, sampling

Tutorial 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 information

Discrete-Time Signals: Time-Domain Representation

Discrete-Time Signals: Time-Domain Representation Discrete-Time Signals: Time-Domain Representation 1 Signals represented as sequences of numbers, called samples Sample value of a typical signal or sequence denoted as x[n] with n being an integer in the

More information

The Fourier Transform (and more )

The Fourier Transform (and more ) The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider

More information

Digital Signal Processing

Digital Signal Processing Digital Signal Processing Introduction Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Czech Republic amiri@mail.muni.cz prenosil@fi.muni.cz February

More information

LECTURE 12 Sections Introduction to the Fourier series of periodic signals

LECTURE 12 Sections Introduction to the Fourier series of periodic signals Signals and Systems I Wednesday, February 11, 29 LECURE 12 Sections 3.1-3.3 Introduction to the Fourier series of periodic signals Chapter 3: Fourier Series of periodic signals 3. Introduction 3.1 Historical

More information

Chapter 4 The Fourier Series and Fourier Transform

Chapter 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 information

Transform Representation of Signals

Transform Representation of Signals C H A P T E R 3 Transform Representation of Signals and LTI Systems As you have seen in your prior studies of signals and systems, and as emphasized in the review in Chapter 2, transforms play a central

More information

Lecture 8 ELE 301: Signals and Systems

Lecture 8 ELE 301: Signals and Systems Lecture 8 ELE 30: Signals and Systems Prof. Paul Cuff Princeton University Fall 20-2 Cuff (Lecture 7) ELE 30: Signals and Systems Fall 20-2 / 37 Properties of the Fourier Transform Properties of the Fourier

More information

Sinc Functions. Continuous-Time Rectangular Pulse

Sinc 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 information

EE 224 Signals and Systems I Review 1/10

EE 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 information

VII. Bandwidth Limited Time Series

VII. Bandwidth Limited Time Series VII. Bandwidth Limited Time Series To summarize the discussion up to this point: (1) In the general case of the aperiodic time series, which is infinite in time and frequency, both the time series and

More information

X. Chen More on Sampling

X. 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 information

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4

Continuous Time Signal Analysis: the Fourier Transform. Lathi Chapter 4 Continuous Time Signal Analysis: the Fourier Transform Lathi Chapter 4 Topics Aperiodic signal representation by the Fourier integral (CTFT) Continuous-time Fourier transform Transforms of some useful

More information

Unit 2: Modeling in the Frequency Domain Part 2: The Laplace Transform. The Laplace Transform. The need for Laplace

Unit 2: Modeling in the Frequency Domain Part 2: The Laplace Transform. The Laplace Transform. The need for Laplace Unit : Modeling in the Frequency Domain Part : Engineering 81: Control Systems I Faculty of Engineering & Applied Science Memorial University of Newfoundland January 1, 010 1 Pair Table Unit, Part : Unit,

More information

Music 270a: Complex Exponentials and Spectrum Representation

Music 270a: Complex Exponentials and Spectrum Representation Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential

More information

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes

06EC44-Signals and System Chapter Fourier Representation for four Signal Classes Chapter 5.1 Fourier Representation for four Signal Classes 5.1.1Mathematical Development of Fourier Transform If the period is stretched without limit, the periodic signal no longer remains periodic but

More information

Signals and Systems: Part 2

Signals 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 information

Wave Phenomena Physics 15c

Wave Phenomena Physics 15c Wave Phenomena Physics 5c Lecture Fourier Analysis (H&L Sections 3. 4) (Georgi Chapter ) What We Did Last ime Studied reflection of mechanical waves Similar to reflection of electromagnetic waves Mechanical

More information

Review of Discrete-Time System

Review 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 information

Wave Phenomena Physics 15c. Lecture 10 Fourier Transform

Wave Phenomena Physics 15c. Lecture 10 Fourier Transform Wave Phenomena Physics 15c Lecture 10 Fourier ransform What We Did Last ime Reflection of mechanical waves Similar to reflection of electromagnetic waves Mechanical impedance is defined by For transverse/longitudinal

More information

Functions not limited in time

Functions not limited in time Functions not limited in time We can segment an arbitrary L 2 function into segments of width T. The mth segment is u m (t) = u(t)rect(t/t m). We then have m 0 u(t) =l.i.m. m0 u m (t) m= m 0 This wors

More information

Chapter 4 The Fourier Series and Fourier Transform

Chapter 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 information

Detailed Solutions to Exercises

Detailed Solutions to Exercises Detailed Solutions to Exercises Digital Signal Processing Mikael Swartling Nedelko Grbic rev. 205 Department of Electrical and Information Technology Lund University Detailed solution to problem E3.4 A

More information

DSP-I DSP-I DSP-I DSP-I

DSP-I DSP-I DSP-I DSP-I NOTES FOR 8-79 LECTURES 3 and 4 Introduction to Discrete-Time Fourier Transforms (DTFTs Distributed: September 8, 2005 Notes: This handout contains in brief outline form the lecture notes used for 8-79

More information

The (Fast) Fourier Transform

The (Fast) Fourier Transform The (Fast) Fourier Transform The Fourier transform (FT) is the analog, for non-periodic functions, of the Fourier series for periodic functions can be considered as a Fourier series in the limit that the

More information

EE1 and ISE1 Communications I

EE1 and ISE1 Communications I EE1 and ISE1 Communications I Pier Luigi Dragotti Lecture two Lecture Aims To introduce signals, Classifications of signals, Some particular signals. 1 Signals A signal is a set of information or data.

More information

MITOCW MITRES_6-007S11lec09_300k.mp4

MITOCW MITRES_6-007S11lec09_300k.mp4 MITOCW MITRES_6-007S11lec09_300k.mp4 The following content is provided under a Creative Commons license. Your support will help MIT OpenCourseWare continue to offer high quality educational resources for

More information

The Discrete-Time Fourier

The 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 information

Signals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI

Signals and Systems. Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI Signals and Systems Lecture 11 Wednesday 22 nd November 2017 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Effect on poles and zeros on frequency response

More information

Lectures on Spectra of Discrete-Time Signals

Lectures on Spectra of Discrete-Time Signals Lectures on Spectra of Discrete-Time Signals Principal questions to be addressed: What, in a general sense, is the "spectrum" of a discrete-time signal? How does one assess the spectrum of a discrete-time

More information

Review of Linear Time-Invariant Network Analysis

Review of Linear Time-Invariant Network Analysis D1 APPENDIX D Review of Linear Time-Invariant Network Analysis Consider a network with input x(t) and output y(t) as shown in Figure D-1. If an input x 1 (t) produces an output y 1 (t), and an input x

More information

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University

ENSC327 Communications Systems 2: Fourier Representations. School of Engineering Science Simon Fraser University ENSC37 Communications Systems : Fourier Representations School o Engineering Science Simon Fraser University Outline Chap..5: Signal Classiications Fourier Transorm Dirac Delta Function Unit Impulse Fourier

More information

Lectures on Spectra of Continuous-Time Signals

Lectures on Spectra of Continuous-Time Signals Lectures on Spectra of Continuous-Time Signals Principal questions to be addressed:. What, in a general sense, is the "spectrum" of a signal? 2. Why are we interested in spectra? ("spectra" = plural of

More information

Discrete-Time David Johns and Ken Martin University of Toronto

Discrete-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 information

Solutions to Problems in Chapter 4

Solutions to Problems in Chapter 4 Solutions to Problems in Chapter 4 Problems with Solutions Problem 4. Fourier Series of the Output Voltage of an Ideal Full-Wave Diode Bridge Rectifier he nonlinear circuit in Figure 4. is a full-wave

More information

2 Frequency-Domain Analysis

2 Frequency-Domain Analysis 2 requency-domain Analysis Electrical engineers live in the two worlds, so to speak, of time and frequency. requency-domain analysis is an extremely valuable tool to the communications engineer, more so

More information

Fourier transform. Alejandro Ribeiro. February 1, 2018

Fourier transform. Alejandro Ribeiro. February 1, 2018 Fourier transform Alejandro Ribeiro February 1, 2018 The discrete Fourier transform (DFT) is a computational tool to work with signals that are defined on a discrete time support and contain a finite number

More information

Generalizing the DTFT!

Generalizing the DTFT! The Transform Generaliing the DTFT! The forward DTFT is defined by X e jω ( ) = x n e jωn in which n= Ω is discrete-time radian frequency, a real variable. The quantity e jωn is then a complex sinusoid

More information

ENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING

ENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING c 2008 by Armand M. Maowsi 1 ENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING In these notes we discuss the sampling process and properties of some of its mathematical description. This culminates in

More information

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2)

E2.5 Signals & Linear Systems. Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & 2) E.5 Signals & Linear Systems Tutorial Sheet 1 Introduction to Signals & Systems (Lectures 1 & ) 1. Sketch each of the following continuous-time signals, specify if the signal is periodic/non-periodic,

More information

Down-Sampling (4B) Young Won Lim 10/25/12

Down-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 information

Down-Sampling (4B) Young Won Lim 11/15/12

Down-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 information

Frequency-domain representation of discrete-time signals

Frequency-domain representation of discrete-time signals 4 Frequency-domain representation of discrete-time signals So far we have been looing at signals as a function of time or an index in time. Just lie continuous-time signals, we can view a time signal as

More information

System Identification & Parameter Estimation

System Identification & Parameter Estimation System Identification & Parameter Estimation Wb3: SIPE lecture Correlation functions in time & frequency domain Alfred C. Schouten, Dept. of Biomechanical Engineering (BMechE), Fac. 3mE // Delft University

More information

L6: Short-time Fourier analysis and synthesis

L6: Short-time Fourier analysis and synthesis L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude

More information

Time and Spatial Series and Transforms

Time and Spatial Series and Transforms Time and Spatial Series and Transforms Z- and Fourier transforms Gibbs' phenomenon Transforms and linear algebra Wavelet transforms Reading: Sheriff and Geldart, Chapter 15 Z-Transform Consider a digitized

More information

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

Signals and Systems. Lecture 14 DR TANIA STATHAKI READER (ASSOCIATE PROFESSOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON Signals and Systems Lecture 14 DR TAIA STATHAKI READER (ASSOCIATE PROFESSOR) I SIGAL PROCESSIG IMPERIAL COLLEGE LODO Introduction. Time sampling theorem resume. We wish to perform spectral analysis using

More information

Up-Sampling (5B) Young Won Lim 11/15/12

Up-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 information

Roberto s Notes on Infinite Series Chapter 1: Sequences and series Section 4. Telescoping series. Clear as mud!

Roberto s Notes on Infinite Series Chapter 1: Sequences and series Section 4. Telescoping series. Clear as mud! Roberto s Notes on Infinite Series Chapter : Sequences and series Section Telescoping series What you need to now already: The definition and basic properties of series. How to decompose a rational expression

More information

ELEN 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 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 information

Part: Frequency and Time Domain

Part: Frequency and Time Domain Numerical Methods Fourier Transform Pair Part: Frequency and Time Domain For more details on this topic Go to Clic on eyword Clic on Fourier Transform Pair You are free to Share to copy, distribute, display

More information

Digital Signal Processing

Digital Signal Processing Digital Signal Processing The -Transform and Its Application to the Analysis of LTI Systems Moslem Amiri, Václav Přenosil Embedded Systems Laboratory Faculty of Informatics, Masaryk University Brno, Cech

More information

Fourier Series and Fourier Transforms

Fourier Series and Fourier Transforms Fourier Series and Fourier Transforms EECS2 (6.082), MIT Fall 2006 Lectures 2 and 3 Fourier Series From your differential equations course, 18.03, you know Fourier s expression representing a T -periodic

More information

Grades will be determined by the correctness of your answers (explanations are not required).

Grades 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 information

Chapter 6: The Laplace Transform. Chih-Wei Liu

Chapter 6: The Laplace Transform. Chih-Wei Liu Chapter 6: The Laplace Transform Chih-Wei Liu Outline Introduction The Laplace Transform The Unilateral Laplace Transform Properties of the Unilateral Laplace Transform Inversion of the Unilateral Laplace

More information

Representing a Signal

Representing 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 information

3 What You Should Know About Complex Numbers

3 What You Should Know About Complex Numbers 3 What You Should Know About Complex Numbers Life is complex it has a real part, and an imaginary part Andrew Koenig. Complex numbers are an extension of the more familiar world of real numbers that make

More information

Circuit Analysis Using Fourier and Laplace Transforms

Circuit Analysis Using Fourier and Laplace Transforms EE2015: Electrical Circuits and Networks Nagendra Krishnapura https://wwweeiitmacin/ nagendra/ Department of Electrical Engineering Indian Institute of Technology, Madras Chennai, 600036, India July-November

More information

The Discrete Fourier Transform

The Discrete Fourier Transform The Discrete Fourier Transform / 23 The Fourier Transform Any discrete time series exponentials: can be built up of a sum of complex = X m e i2πmn/, n = 0,, m=0 = [ + + + + ]. X 0 X e i2πn (/) X 2 e i2πn

More information

MEDE2500 Tutorial Nov-7

MEDE2500 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 information

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis

SEISMIC WAVE PROPAGATION. Lecture 2: Fourier Analysis SEISMIC WAVE PROPAGATION Lecture 2: Fourier Analysis Fourier Series & Fourier Transforms Fourier Series Review of trigonometric identities Analysing the square wave Fourier Transform Transforms of some

More information

Course Notes for Signals and Systems. Krishna R Narayanan

Course Notes for Signals and Systems. Krishna R Narayanan Course Notes for Signals and Systems Krishna R Narayanan May 7, 018 Contents 1 Math Review 5 1.1 Trigonometric Identities............................. 5 1. Complex Numbers................................

More information

Last Update: March 1 2, 201 0

Last Update: March 1 2, 201 0 M ath 2 0 1 E S 1 W inter 2 0 1 0 Last Update: March 1 2, 201 0 S eries S olutions of Differential Equations Disclaimer: This lecture note tries to provide an alternative approach to the material in Sections

More information

Modern Digital Communication Techniques Prof. Suvra Sekhar Das G. S. Sanyal School of Telecommunication Indian Institute of Technology, Kharagpur

Modern Digital Communication Techniques Prof. Suvra Sekhar Das G. S. Sanyal School of Telecommunication Indian Institute of Technology, Kharagpur Modern Digital Communication Techniques Prof. Suvra Sekhar Das G. S. Sanyal School of Telecommunication Indian Institute of Technology, Kharagpur Lecture - 15 Analog to Digital Conversion Welcome to the

More information

1 Signals and systems

1 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 information

EE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions

EE 261 The Fourier Transform and its Applications Fall 2006 Midterm Exam Solutions EE 6 The Fourier Transform and its Applications Fall 006 Midterm Exam Solutions There are six questions for a total of 00 points. Please write your answers in the exam booklet provided, and make sure that

More information

Discrete Fourier Transform

Discrete 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 information

16.362: Signals and Systems: 1.0

16.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 information

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation

CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation CMPT 318: Lecture 5 Complex Exponentials, Spectrum Representation Tamara Smyth, tamaras@cs.sfu.ca School of Computing Science, Simon Fraser University January 23, 2006 1 Exponentials The exponential is

More information

2 Fourier Transforms and Sampling

2 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 information

Frequency Response and Continuous-time Fourier Series

Frequency Response and Continuous-time Fourier Series Frequency Response and Continuous-time Fourier Series Recall course objectives Main Course Objective: Fundamentals of systems/signals interaction (we d like to understand how systems transform or affect

More information

EE303: Communication Systems

EE303: Communication Systems EE303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE303: Introductory Concepts

More information

EA2.3 - Electronics 2 1

EA2.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 information

Review of Fourier Transform

Review 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 information

Continuous-time Signals. (AKA analog signals)

Continuous-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 information

LINEAR SYSTEMS. J. Elder PSYC 6256 Principles of Neural Coding

LINEAR 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 information

2. The following diagram illustrates that voltage represents what physical dimension?

2. The following diagram illustrates that voltage represents what physical dimension? BioE 1310 - Exam 1 2/20/2018 Answer Sheet - Correct answer is A for all questions 1. A particular voltage divider with 10 V across it consists of two resistors in series. One resistor is 7 KΩ and the other

More information

Sampling and Discrete Time. Discrete-Time Signal Description. Sinusoids. Sampling and Discrete Time. Sinusoids An Aperiodic Sinusoid.

Sampling and Discrete Time. Discrete-Time Signal Description. Sinusoids. Sampling and Discrete Time. Sinusoids An Aperiodic Sinusoid. Sampling and Discrete Time Discrete-Time Signal Description Sampling is the acquisition of the values of a continuous-time signal at discrete points in time. x t discrete-time signal. ( ) is a continuous-time

More information

Review: Continuous Fourier Transform

Review: 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 information

Fourier Transform for Continuous Functions

Fourier 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 information

2.161 Signal Processing: Continuous and Discrete

2.161 Signal Processing: Continuous and Discrete 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. M MASSACHUSETTS

More information

Basic Procedures for Common Problems

Basic Procedures for Common Problems Basic Procedures for Common Problems ECHE 550, Fall 2002 Steady State Multivariable Modeling and Control 1 Determine what variables are available to manipulate (inputs, u) and what variables are available

More information

Mathematical Review for Signal and Systems

Mathematical Review for Signal and Systems Mathematical Review for Signal and Systems 1 Trigonometric Identities It will be useful to memorize sin θ, cos θ, tan θ values for θ = 0, π/3, π/4, π/ and π ±θ, π θ for the above values of θ. The following

More information

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.

Z-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1. 84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4

More information

UNIVERSITY 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. 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 information

Line Spectra and their Applications

Line Spectra and their Applications In [ ]: cd matlab pwd Line Spectra and their Applications Scope and Background Reading This session concludes our introduction to Fourier Series. Last time (http://nbviewer.jupyter.org/github/cpjobling/eg-47-

More information

UNIVERSITY OF OSLO. Please make sure that your copy of the problem set is complete before you attempt to answer anything.

UNIVERSITY 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 information

Discrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz

Discrete 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

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3

THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3 THE FOURIER TRANSFORM (Fourier series for a function whose period is very, very long) Reading: Main 11.3 Any periodic function f(t) can be written as a Fourier Series a 0 2 + a n cos( nωt) + b n sin n

More information

EE Homework 13 - Solutions

EE 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 information

Figure 3.1 Effect on frequency spectrum of increasing period T 0. Consider the amplitude spectrum of a periodic waveform as shown in Figure 3.2.

Figure 3.1 Effect on frequency spectrum of increasing period T 0. Consider the amplitude spectrum of a periodic waveform as shown in Figure 3.2. 3. Fourier ransorm From Fourier Series to Fourier ransorm [, 2] In communication systems, we oten deal with non-periodic signals. An extension o the time-requency relationship to a non-periodic signal

More information