ENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING

Size: px
Start display at page:

Download "ENEE 420 FALL 2007 COMMUNICATIONS SYSTEMS SAMPLING"

Transcription

1 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 the celebrated Shannon-Nyquist Sampling Theorem. ectangular pulses With > 0, the rectangular pulse p : is defined by 1 if 0 t p (t) 0 otherwise. Fourier analysis of rectangular pulses (1) For each f 0 in, straightforward calculations show P (f) p (t)e j2πft dt 0 e j2πft dt e j2πf 1 j2πf sin(πf) e jπf πf while Therefore, (2) P (f), f 0. sin(πf) e jπf if f 0 πf P (f) if f 0.

2 c 2008 by Armand M. Maowsi 2 From now on, the parameters and T s are selected so that 0 < < T s, and we write f s 1 T s. Throughout, we use the notation to denote the summation 0,±1,... over all integers. Train of rectangular pulses The train of pulses associated with p is the signal c : given by c (t) : p (t T s ), t. The signal c being periodic with period T s, it admits a Fourier series representation, namely c (t) α ()e j2πfst, t with Fourier coefficients given by α () By virtue of (2) we find (3) (4) α () It is now plain that Natural sampling c (t) 1 Ts p (t)e j2πfst dt T s 0 1 T s P (f s ), 0, ±1, ±2,... 1 sin(πf s) T s πf s e jπfs if ±1, ±2,... T s if 0. α () e j2πfst, t. Let g : denote an information-bearing signal. Natural sampling gives rise to the signal g Nat, : defined by g Nat, (t) c (t)g(t) p (t T s ) g(t), t.

3 c 2008 by Armand M. Maowsi 3 Its Fourier transform is given by G Nat, (f) g Nat, (t)e j2πft dt c (t)g(t)e j2πft dt ) ( α ()e j2πfst g(t)e j2πft dt α () g(t)e j2πfst e j2πft dt α () g(t)e j2π(f fs)t dt (5) α ()G(f f s ), f. As a result, we also find G Nat, (f) g Nat, (t) e j2πft dt α () (6) G(f f s ), f. Ideal pulses It may seem natural to model an instantaneous (or ideal) pulse (at time t 0) as a mapping (or function) p : such that 0 if t 0 p(t) 1 if t 0. Unfortunately, such a definition is not a useful one due to the following fact: From the point of view of Fourier analysis, the function p is indistinguishable from the identically zero function. Instead, we model an ideal pulse by a Dirac function δ :. We draw attention to the fact that although we present the pulse δ as if it were a function, this is far from being the case! The terminology is an accepted one and we shall use it throughout.

4 c 2008 by Armand M. Maowsi 4 Formally, we can compute the Fourier transform of the Dirac function as (7) δ(t)e j2πft dt 1, f. Train of ideal pulses In analogy with the notion of train of natural pulses, we can associate with ideal pulses the corresponding notion of pulse train. We define such a train of ideal pulses as the mapping c δ : given by c δ (t) δ(t T s), t. Again caution is in order: While the train c δ of ideal pulses may have been presented as if it were a mapping, this is not so due to the (unresolved) conceptional difficulties mentionned earlier. Yet, despite the fact that such a train of ideal pulses has only been vaguely defined (if at all), this notion does serve a useful purpose, albeit a formal one, as will become apparent below. Again proceeding formally, we compute the Fourier transform of c δ as C δ (f) c δ (t)e j2πft dt ( ) δ(t T s) e j2πft dt δ(t T s )e j2πft dt (8) e j2πfts, f. Ideal sampling Let g : denote an information-bearing signal. Ideal sampling produces the signal g Ideal : given by g Ideal (t) c δ (t)g(t) δ(t T s)g(t) (9) g(t s)δ(t T s ), t.

5 c 2008 by Armand M. Maowsi 5 (10) Its Fourier transform is therefore given by G Ideal (f) g Ideal (t)e j2πft dt g(t s) δ(t T s )e j2πft dt g(t s)e j2πfts f. This expression turns out to be not too useful for our purposes, a state of affairs which prompts us to see a different approach for evaluating the Fourier transform G Ideal. Although the expressions to be given are formal expressions for the Fourier transform of an object which has not been fully defined, they will turn out to be useful for understanding the properties of the sampling process. From natural to ideal pulses For each > 0, the normalized rectangular pulse p : is defined by p (t) : p 1 if 0 t (t) 0 otherwise. Its Fourier transform is simply given by sin(πf) P (f) : P e (f) jπf if f 0 πf 1 if f 0. The convergence P P (f) (f) 0 0 1, f and the expression (7) for the Fourier transform of a Dirac function together suggest that the ideal pulse δ can be thought of as the it of the normalized pulse p as goes to zero. Conversely, the normalized pulse p with small can be interpreted as a good approximation for the ideal pulse δ. We symbolically summarize such a convergence as (11) p δ. 0

6 c 2008 by Armand M. Maowsi 6 We mae no attempt at giving a precise meaning to the convergence (11). In fact, a precise definition is certainly fraught with difficulties, some of which are already apparent from the pointwise convergence 0 if t 0 p 0 (t) if t 0. esolving these difficulties is beyond the scope of these notes. From natural to ideal sampling Let go to zero: Since it is plain that sin(πf s ) 0 πf s 1, 0 P α () (f s ) 1, 0, ±1, ±2, Therefore, formally we conclude that c (t) 0 0 α () ( ) α () 0 e j2πfst e j2πfst (12) 1 T s ej2πfst. (13) On the other hand, formally wielding (11) we find c (t) 0 0 p (t T s) 0 p (t T s ) δ(t T s) c δ (t), t.

7 c 2008 by Armand M. Maowsi 7 Combining we conclude that δ(t T s) 1 e j2πfst, t. T s This (formal) relation often appears in the literature, and is nown as Poisson s summation formula. From train of natural pulses to train of ideal pulses (14) Next, we see that In short, (15) G Nat, (f) G Ideal (f) 0 0 α () ( 0 α () G(f f s ) ) G(f f s ), f. G Ideal (f) 1 T s G(f f s), f. ecovering g from g Nat, Assume the signal g : to be band-ited with cut-off frequency W, i.e., (16) G(f) 0, f > W. The frequency f Nyq 2W plays a particular role and is nown as the Nyquist rate for g. Under the condition (16) the translates G(f f s ) and G(f lf s ) do not overlap if l whenever the condition (17) 2W < f s holds. More precisely, under (16) and (17), the translates G(f f s ) and G(f lf s ) with l cannot be simultaneously non-zero. As a result, in the expression for the Fourier transform of g Nat,, namely G Nat, (f) α () G(f f s ), f,

8 c 2008 by Armand M. Maowsi 8 at most one of the terms G(f f s ), 0, ±1, ±2,..., is ever non-zero for a given frequency f under the condition (17). With this in mind, consider a lowpass filter H with cutoff frequency W h, i.e., H(f) 0, f > W h. If we select W h so that (18) then W < W h < f s W, (19) H(f) G Nat, (f) α () H(f)G(f f s ) α (0)H(f)G(f), f since for all ±1,..., we have H(f)G(f f s ) 0, f. In particular, if we tae the lowpass filter H to be 1 if f W h H(f) 0 otherwise, then we obtain H(f) G Nat, (f) T s G(f), f. Thus, the lowpass information-bearing signal m : can be recovered fully from g Nat, by linear processing. The Shannon-Nyquist Sampling Theorem We now show that not only can g also be recovered from g Ideal, but that this signal can be reconstructed from the samples {g(t s ), 0, ±1,...}. Here as well we assume the signal g : to be band-ited with cut-off frequency W. Moreover, the condition (17) is enforced. From (15) we readily conclude that G Ideal (f) 1 G(f), f W T s so that G(f) T s G Ideal (f), f W

9 c 2008 by Armand M. Maowsi 9 eporting this fact into (10) we conclude that G(f) T s g(t s)e j2πfts, f W Since the signal g is band-ited with cut-off frequency W, this last relation already shows that the samples should be sufficient to reconstruct the original signal g! By Fourier inversion, we get g(t) G(f)e j2πft dt (20) W W W W G(f)e j2πft dt T s g(t s) T s (T s g(t s)e j2πfts ) e j2πft dt W W e j2πf(t Ts) dt g(t s) ej2π(t Ts)W e j2π(t Ts)W j2π(t T s ) so that g(t) T s g(t s) sin (2π(t T s)w) (21), t. π(t T s ) This expression is sometimes written in terms of the Nyquist rate for the signal g, namely g(t) T s g(t s) sin (π(t T s)f Nyq ) π(t T s ) (22) T s f Nyq g(t s) sinc ((t T s )f Nyq ), t where we have defined sin (πt) sinc(t), t. πt With f s f Nyq, we get T s f Nyq 1 and the last relation becomes g(t) g(t s) sinc ((t T s )f Nyq ) (23) g(t s) sinc (f Nyq t ), t.

1 Understanding Sampling

1 Understanding Sampling 1 Understanding Sampling Summary. In Part I, we consider the analysis of discrete-time signals. In Chapter 1, we consider how discretizing a signal affects the signal s Fourier transform. We derive the

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

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

IB Paper 6: Signal and Data Analysis

IB Paper 6: Signal and Data Analysis IB Paper 6: Signal and Data Analysis Handout 5: Sampling Theory S Godsill Signal Processing and Communications Group, Engineering Department, Cambridge, UK Lent 2015 1 / 85 Sampling and Aliasing All of

More information

Lecture 6 January 21, 2016

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

A3. Frequency Representation of Continuous Time and Discrete Time Signals

A3. Frequency Representation of Continuous Time and Discrete Time Signals 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

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

Chap 4. Sampling of Continuous-Time Signals

Chap 4. Sampling of Continuous-Time Signals Digital Signal Processing Chap 4. Sampling of Continuous-Time Signals Chang-Su Kim Digital Processing of Continuous-Time Signals Digital processing of a CT signal involves three basic steps 1. Conversion

More information

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt

Homework 4. May An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Homework 4 May 2017 1. An LTI system has an input, x(t) and output y(t) related through the equation y(t) = t e (t t ) x(t 2)dt Determine the impulse response of the system. Rewriting as y(t) = t e (t

More information

EE401: Advanced Communication Theory

EE401: Advanced Communication Theory EE401: Advanced Communication Theory Professor A. Manikas Chair of Communications and Array Processing Imperial College London Introductory Concepts Prof. A. Manikas (Imperial College) EE.401: Introductory

More information

II - Baseband pulse transmission

II - Baseband pulse transmission II - Baseband pulse transmission 1 Introduction We discuss how to transmit digital data symbols, which have to be converted into material form before they are sent or stored. In the sequel, we associate

More information

Chapter 5 Frequency Domain Analysis of Systems

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

ESS Dirac Comb and Flavors of Fourier Transforms

ESS Dirac Comb and Flavors of Fourier Transforms 6. Dirac Comb and Flavors of Fourier ransforms Consider a periodic function that comprises pulses of amplitude A and duration τ spaced a time apart. We can define it over one period as y(t) = A, τ / 2

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

Summary of Fourier Transform Properties

Summary of Fourier Transform Properties Summary of Fourier ransform Properties Frank R. Kschischang he Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of oronto January 7, 207 Definition and Some echnicalities

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

Chapter 5 Frequency Domain Analysis of Systems

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

ECE 301: Signals and Systems Homework Assignment #7

ECE 301: Signals and Systems Homework Assignment #7 ECE 301: Signals and Systems Homework Assignment #7 Due on December 11, 2015 Professor: Aly El Gamal TA: Xianglun Mao 1 Aly El Gamal ECE 301: Signals and Systems Homework Assignment #7 Problem 1 Note:

More information

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

Lecture 7 ELE 301: Signals and Systems

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

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year

Fourier transform. Stefano Ferrari. Università degli Studi di Milano Methods for Image Processing. academic year Fourier transform Stefano Ferrari Università degli Studi di Milano stefano.ferrari@unimi.it Methods for Image Processing academic year 27 28 Function transforms Sometimes, operating on a class of functions

More information

EE5713 : Advanced Digital Communications

EE5713 : Advanced Digital Communications EE5713 : Advanced Digital Communications Week 12, 13: Inter Symbol Interference (ISI) Nyquist Criteria for ISI Pulse Shaping and Raised-Cosine Filter Eye Pattern Equalization (On Board) 20-May-15 Muhammad

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

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

Experimental Fourier Transforms

Experimental Fourier Transforms Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be

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

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals

Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Module 3 : Sampling and Reconstruction Lecture 22 : Sampling and Reconstruction of Band-Limited Signals Objectives Scope of this lecture: If a Continuous Time (C.T.) signal is to be uniquely represented

More information

FROM ANALOGUE TO DIGITAL

FROM ANALOGUE TO DIGITAL SIGNALS AND SYSTEMS: PAPER 3C1 HANDOUT 7. Dr David Corrigan 1. Electronic and Electrical Engineering Dept. corrigad@tcd.ie www.mee.tcd.ie/ corrigad FROM ANALOGUE TO DIGITAL To digitize signals it is necessary

More information

1.1 SPECIAL FUNCTIONS USED IN SIGNAL PROCESSING. δ(t) = for t = 0, = 0 for t 0. δ(t)dt = 1. (1.1)

1.1 SPECIAL FUNCTIONS USED IN SIGNAL PROCESSING. δ(t) = for t = 0, = 0 for t 0. δ(t)dt = 1. (1.1) SIGNAL THEORY AND ANALYSIS A signal, in general, refers to an electrical waveform whose amplitude varies with time. Signals can be fully described in either the time or frequency domain. This chapter discusses

More 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

The Hilbert Transform

The Hilbert Transform The Hilbert Transform Frank R. Kschischang The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto October 22, 2006; updated March 0, 205 Definition The Hilbert

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

2.1 Basic Concepts Basic operations on signals Classication of signals

2.1 Basic Concepts Basic operations on signals Classication of signals Haberle³me Sistemlerine Giri³ (ELE 361) 9 Eylül 2017 TOBB Ekonomi ve Teknoloji Üniversitesi, Güz 2017-18 Dr. A. Melda Yüksel Turgut & Tolga Girici Lecture Notes Chapter 2 Signals and Linear Systems 2.1

More information

Representation of Signals and Systems. Lecturer: David Shiung

Representation of Signals and Systems. Lecturer: David Shiung Representation of Signals and Systems Lecturer: David Shiung 1 Abstract (1/2) Fourier analysis Properties of the Fourier transform Dirac delta function Fourier transform of periodic signals Fourier-transform

More information

Continuous-Time Fourier Transform

Continuous-Time Fourier Transform Signals and Systems Continuous-Time Fourier Transform Chang-Su Kim continuous time discrete time periodic (series) CTFS DTFS aperiodic (transform) CTFT DTFT Lowpass Filtering Blurring or Smoothing Original

More information

12.1 Fourier Transform of Discretely Sampled Data

12.1 Fourier Transform of Discretely Sampled Data 494 Chapter 12. Fast Fourier Transform now is: The PSD-per-unit-time converges to finite values at all frequencies except those where h(t) has a discrete sine-wave (or cosine-wave) component of finite

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

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

Sistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September

Sistemas de Aquisição de Dados. Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September Sistemas de Aquisição de Dados Mestrado Integrado em Eng. Física Tecnológica 2016/17 Aula 3, 3rd September The Data Converter Interface Analog Media and Transducers Signal Conditioning Signal Conditioning

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

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

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis

OSE801 Engineering System Identification. Lecture 05: Fourier Analysis OSE81 Engineering System Identification Lecture 5: Fourier Analysis What we will study in this lecture: A short introduction of Fourier analysis Sampling the data Applications Example 1 Fourier Analysis

More information

Sensors. Chapter Signal Conditioning

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

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet

EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, Cover Sheet EE301 Signals and Systems In-Class Exam Exam 3 Thursday, Apr. 19, 2012 Cover Sheet Test Duration: 75 minutes. Coverage: Chaps. 5,7 Open Book but Closed Notes. One 8.5 in. x 11 in. crib sheet Calculators

More information

Chapter 6: The Laplace Transform 6.3 Step Functions and

Chapter 6: The Laplace Transform 6.3 Step Functions and Chapter 6: The Laplace Transform 6.3 Step Functions and Dirac δ 2 April 2018 Step Function Definition: Suppose c is a fixed real number. The unit step function u c is defined as follows: u c (t) = { 0

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

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS

NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS page 1 of 5 (+ appendix) NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY DEPARTMENT OF ELECTRONICS AND TELECOMMUNICATIONS Contact during examination: Name: Magne H. Johnsen Tel.: 73 59 26 78/930 25 534

More information

Introduction to Fourier Transforms. Lecture 7 ELE 301: Signals and Systems. Fourier Series. Rect Example

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

Fourier Transform Chapter 10 Sampling and Series

Fourier Transform Chapter 10 Sampling and Series Fourier Transform Chapter 0 Sampling and Series Sampling Theorem Sampling Theorem states that, under a certain condition, it is in fact possible to recover with full accuracy the values intervening between

More information

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5

Signal and systems. Linear Systems. Luigi Palopoli. Signal and systems p. 1/5 Signal and systems p. 1/5 Signal and systems Linear Systems Luigi Palopoli palopoli@dit.unitn.it Wrap-Up Signal and systems p. 2/5 Signal and systems p. 3/5 Fourier Series We have see that is a signal

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

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7 ECS 332: Principles of Communications 2012/1 HW 4 Due: Sep 7 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which part will

More information

Line Codes and Pulse Shaping Review. Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI

Line Codes and Pulse Shaping Review. Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI Line Codes and Pulse Shaping Review Line codes Pulse width and polarity Power spectral density Intersymbol interference (ISI) Pulse shaping to reduce ISI Embracing ISI Line Code Examples (review) on-off

More information

4 The Continuous Time Fourier Transform

4 The Continuous Time Fourier Transform 96 4 The Continuous Time ourier Transform ourier (or frequency domain) analysis turns out to be a tool of even greater usefulness Extension of ourier series representation to aperiodic signals oundation

More information

This examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

This examination consists of 10 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS THE UNIVERSITY OF BRITISH COLUMBIA Department of Electrical and Computer Engineering EECE 564 Detection and Estimation of Signals in Noise Final Examination 08 December 2009 This examination consists of

More information

Communication Theory II

Communication Theory II Communication Theory II Lecture 4: Review on Fourier analysis and probabilty theory Ahmed Elnakib, PhD Assistant Professor, Mansoura University, Egypt Febraury 19 th, 2015 1 Course Website o http://lms.mans.edu.eg/eng/

More information

Discrete-time Signals and Systems in

Discrete-time Signals and Systems in Discrete-time Signals and Systems in the Frequency Domain Chapter 3, Sections 3.1-39 3.9 Chapter 4, Sections 4.8-4.9 Dr. Iyad Jafar Outline Introduction The Continuous-Time FourierTransform (CTFT) The

More information

An Introduction to Discrete-Time Signal Processing

An Introduction to Discrete-Time Signal Processing An Introduction to Discrete-Time Signal Processing John A. Gubner 5 4 3 2 1 0 0.5 0.3 0.1 0.1 0.3 0.5 i Contents 1 From Continuous Time to Discrete Time and Back 1 1.1 Does Sampling Always Lose Information?

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

Interchange of Filtering and Downsampling/Upsampling

Interchange of Filtering and Downsampling/Upsampling Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform

More information

EE 16B Final, December 13, Name: SID #:

EE 16B Final, December 13, Name: SID #: EE 16B Final, December 13, 2016 Name: SID #: Important Instructions: Show your work. An answer without explanation is not acceptable and does not guarantee any credit. Only the front pages will be scanned

More information

Each of these functions represents a signal in terms of its spectral components in the frequency domain.

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

EE4061 Communication Systems

EE4061 Communication Systems EE4061 Communication Systems Week 11 Intersymbol Interference Nyquist Pulse Shaping 0 c 2015, Georgia Institute of Technology (lect10 1) Intersymbol Interference (ISI) Tx filter channel Rx filter a δ(t-nt)

More information

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52

ECEN 420 LINEAR CONTROL SYSTEMS. Lecture 2 Laplace Transform I 1/52 1/52 ECEN 420 LINEAR CONTROL SYSTEMS Lecture 2 Laplace Transform I Linear Time Invariant Systems A general LTI system may be described by the linear constant coefficient differential equation: a n d n

More information

Laplace Transforms Chapter 3

Laplace Transforms Chapter 3 Laplace Transforms Important analytical method for solving linear ordinary differential equations. - Application to nonlinear ODEs? Must linearize first. Laplace transforms play a key role in important

More information

Digital Communications

Digital Communications Digital Communications Chapter 9 Digital Communications Through Band-Limited Channels Po-Ning Chen, Professor Institute of Communications Engineering National Chiao-Tung University, Taiwan Digital Communications:

More information

Example: Bipolar NRZ (non-return-to-zero) signaling

Example: Bipolar NRZ (non-return-to-zero) signaling Baseand Data Transmission Data are sent without using a carrier signal Example: Bipolar NRZ (non-return-to-zero signaling is represented y is represented y T A -A T : it duration is represented y BT. Passand

More information

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011

A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 A523 Signal Modeling, Statistical Inference and Data Mining in Astrophysics Spring 2011 Lecture 6 PDFs for Lecture 1-5 are on the web page Problem set 2 is on the web page Article on web page A Guided

More information

Digital Baseband Systems. Reference: Digital Communications John G. Proakis

Digital Baseband Systems. Reference: Digital Communications John G. Proakis Digital Baseband Systems Reference: Digital Communications John G. Proais Baseband Pulse Transmission Baseband digital signals - signals whose spectrum extend down to or near zero frequency. Model of the

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

Sampling. Alejandro Ribeiro. February 8, 2018

Sampling. Alejandro Ribeiro. February 8, 2018 Sampling Alejandro Ribeiro February 8, 2018 Signals exist in continuous time but it is not unusual for us to process them in discrete time. When we work in discrete time we say that we are doing discrete

More information

An Introduction to Discrete-Time Signal Processing

An Introduction to Discrete-Time Signal Processing An Introduction to Discrete-Time Signal Processing John A. Gubner 5 4 3 2 0 0.5 0.3 0. 0. 0.3 0.5 Contents From Continuous Time to Discrete Time and Back. Does Sampling Always Lose Information?.2 Review

More information

FINAL EXAM: 3:30-5:30pm

FINAL EXAM: 3:30-5:30pm ECE 30: Probabilistic Methods in Electrical and Computer Engineering Spring 016 Instructor: Prof. A. R. Reibman FINAL EXAM: 3:30-5:30pm Spring 016, MWF 1:30-1:0pm (May 6, 016) This is a closed book exam.

More information

EEL3135: Homework #3 Solutions

EEL3135: Homework #3 Solutions EEL335: Homework #3 Solutions Problem : (a) Compute the CTFT for the following signal: xt () cos( πt) cos( 3t) + cos( 4πt). First, we use the trigonometric identity (easy to show by using the inverse Euler

More information

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114.

ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114. ECE 301 Division 1 Final Exam Solutions, 12/12/2011, 3:20-5:20pm in PHYS 114. The exam for both sections of ECE 301 is conducted in the same room, but the problems are completely different. Your ID will

More 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

Question Paper Code : AEC11T02

Question Paper Code : AEC11T02 Hall Ticket No Question Paper Code : AEC11T02 VARDHAMAN COLLEGE OF ENGINEERING (AUTONOMOUS) Affiliated to JNTUH, Hyderabad Four Year B. Tech III Semester Tutorial Question Bank 2013-14 (Regulations: VCE-R11)

More information

Fourier Analysis for Engineers

Fourier Analysis for Engineers Fourier Analysis for Engineers M. Behrens January 12, 22 1 Motivation: Finite dimensional vector spaces The periodic theory of Fourier analysis may be likened to the decomposition of an ordinary vector

More information

Bridge between continuous time and discrete time signals

Bridge between continuous time and discrete time signals 6 Sampling Bridge between continuous time and discrete time signals Sampling theorem complete representation of a continuous time signal by its samples Samplingandreconstruction implementcontinuous timesystems

More information

Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko

Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, Prof. Young-Chai Ko Fourier Series and Transform KEEE343 Communication Theory Lecture #7, March 24, 20 Prof. Young-Chai Ko koyc@korea.ac.kr Summary Fourier transform Properties Fourier transform of special function Fourier

More information

Fourier Analysis and Sampling

Fourier Analysis and Sampling Chapter Fourier Analysis and Sampling Fourier analysis refers to a collection of tools that can be applied to express a function in terms of complex sinusoids, called basis elements, of different frequencies.

More information

Homework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2)

Homework 7 Solution EE235, Spring Find the Fourier transform of the following signals using tables: te t u(t) h(t) = sin(2πt)e t u(t) (2) Homework 7 Solution EE35, Spring. Find the Fourier transform of the following signals using tables: (a) te t u(t) h(t) H(jω) te t u(t) ( + jω) (b) sin(πt)e t u(t) h(t) sin(πt)e t u(t) () h(t) ( ejπt e

More information

Fourier series: Additional notes

Fourier series: Additional notes Fourier series: Additional notes Linking Fourier series representations for signals Rectangular waveform Require FS expansion of signal y(t) below: 1 y(t) 1 4 4 8 12 t (seconds) Period T = 8, so ω = 2π/T

More information

Frequency Domain Representations of Sampled and Wrapped Signals

Frequency Domain Representations of Sampled and Wrapped Signals Frequency Domain Representations of Sampled and Wrapped Signals Peter Kabal Department of Electrical & Computer Engineering McGill University Montreal, Canada v1.5 March 2011 c 2011 Peter Kabal 2011/03/11

More information

Chapter 2: The Fourier Transform

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

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

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam.

ECE 350 Signals and Systems Spring 2011 Final Exam - Solutions. Three 8 ½ x 11 sheets of notes, and a calculator are allowed during the exam. ECE 35 Spring - Final Exam 9 May ECE 35 Signals and Systems Spring Final Exam - Solutions Three 8 ½ x sheets of notes, and a calculator are allowed during the exam Write all answers neatly and show your

More information

8 The Discrete Fourier Transform (DFT)

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

Chapter 6: Applications of Fourier Representation Houshou Chen

Chapter 6: Applications of Fourier Representation Houshou Chen Chapter 6: Applications of Fourier Representation Houshou Chen Dept. of Electrical Engineering, National Chung Hsing University E-mail: houshou@ee.nchu.edu.tw H.S. Chen Chapter6: Applications of Fourier

More information

L29: Fourier analysis

L29: Fourier analysis L29: Fourier analysis Introduction The discrete Fourier Transform (DFT) The DFT matrix The Fast Fourier Transform (FFT) The Short-time Fourier Transform (STFT) Fourier Descriptors CSCE 666 Pattern Analysis

More information

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME

Fourier Methods in Digital Signal Processing Final Exam ME 579, Spring 2015 NAME Fourier Methods in Digital Signal Processing Final Exam ME 579, Instructions for this CLOSED BOOK EXAM 2 hours long. Monday, May 8th, 8-10am in ME1051 Answer FIVE Questions, at LEAST ONE from each section.

More information

Digital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10

Digital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10 Digital Band-pass Modulation PROF. MICHAEL TSAI 211/11/1 Band-pass Signal Representation a t g t General form: 2πf c t + φ t g t = a t cos 2πf c t + φ t Envelope Phase Envelope is always non-negative,

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

Carrier frequency estimation. ELEC-E5410 Signal processing for communications

Carrier frequency estimation. ELEC-E5410 Signal processing for communications Carrier frequency estimation ELEC-E54 Signal processing for communications Contents. Basic system assumptions. Data-aided DA: Maximum-lielihood ML estimation of carrier frequency 3. Data-aided: Practical

More information

Timbral, Scale, Pitch modifications

Timbral, Scale, Pitch modifications Introduction Timbral, Scale, Pitch modifications M2 Mathématiques / Vision / Apprentissage Audio signal analysis, indexing and transformation Page 1 / 40 Page 2 / 40 Modification of playback speed Modifications

More information

The Poisson summation formula, the sampling theorem, and Dirac combs

The Poisson summation formula, the sampling theorem, and Dirac combs The Poisson summation ormula, the sampling theorem, and Dirac combs Jordan Bell jordanbell@gmailcom Department o Mathematics, University o Toronto April 3, 24 Poisson summation ormula et S be the set o

More information

CH.4 Continuous-Time Fourier Series

CH.4 Continuous-Time Fourier Series CH.4 Continuous-Time Fourier Series First step to Fourier analysis. My mathematical model is killing me! The difference between mathematicians and engineers is mathematicians develop mathematical tools

More information

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi

Correlator I. Basics. Chapter Introduction. 8.2 Digitization Sampling. D. Anish Roshi Chapter 8 Correlator I. Basics D. Anish Roshi 8.1 Introduction A radio interferometer measures the mutual coherence function of the electric field due to a given source brightness distribution in the sky.

More information

Summary: ISI. No ISI condition in time. II Nyquist theorem. Ideal low pass filter. Raised cosine filters. TX filters

Summary: ISI. No ISI condition in time. II Nyquist theorem. Ideal low pass filter. Raised cosine filters. TX filters UORIAL ON DIGIAL MODULAIONS Part 7: Intersymbol interference [last modified: 200--23] Roberto Garello, Politecnico di orino Free download at: www.tlc.polito.it/garello (personal use only) Part 7: Intersymbol

More information