Signals and Systems Revision Lecture 2

Slides:



Advertisements
Similar presentations
Ch 3 Analysis and Transmission of Signals
Advertisements

ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Response to a Sinusoidal Input Frequency Analysis of an RC Circuit.
Symmetry and the DTFT If we know a few things about the symmetry properties of the DTFT, it can make life simpler. First, for a real-valued sequence x(n),
ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Fourier Transform – Chapter 13. Fourier Transform – continuous function Apply the Fourier Series to complex- valued functions using Euler’s notation to.
Qassim University College of Engineering Electrical Engineering Department Course: EE301: Signals and Systems Analysis The sampling Process Instructor:
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
University of British Columbia CPSC 414 Computer Graphics © Tamara Munzner 1 Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
EE-2027 SaS, L10: 1/13 Lecture 10: Sampling Discrete-Time Systems 4 Sampling & Discrete-time systems (2 lectures): Sampling theorem, discrete Fourier transform.
Lecture 9: Fourier Transform Properties and Examples
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
First semester King Saud University College of Applied studies and Community Service 1301CT.
The Nyquist–Shannon Sampling Theorem. Impulse Train  Impulse Train (also known as "Dirac comb") is an infinite series of delta functions with a period.
Chapter 4: Sampling of Continuous-Time Signals
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Echivalarea sistemelor analogice cu sisteme digitale Prof.dr.ing. Ioan NAFORNITA.
… Representation of a CT Signal Using Impulse Functions
The sampling of continuous-time signals is an important topic It is required by many important technologies such as: Digital Communication Systems ( Wireless.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
Fourier Analysis of Systems Ch.5 Kamen and Heck. 5.1 Fourier Analysis of Continuous- Time Systems Consider a linear time-invariant continuous-time system.
DTFT And Fourier Transform
1 Chapter 8 The Discrete Fourier Transform 2 Introduction  In Chapters 2 and 3 we discussed the representation of sequences and LTI systems in terms.
Leo Lam © Signals and Systems EE235 Lecture 28.
GG 313 Lecture 26 11/29/05 Sampling Theorem Transfer Functions.
Interpolation and Pulse Shaping
111 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Chapter 5 Frequency Domain Analysis of Systems. Consider the following CT LTI system: absolutely integrable,Assumption: the impulse response h(t) is absolutely.
1 Chapter 5 Ideal Filters, Sampling, and Reconstruction Sections Wed. June 26, 2013.
ECE 4710: Lecture #6 1 Bandlimited Signals  Bandlimited waveforms have non-zero spectral components only within a finite frequency range  Waveform is.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
ECE 4710: Lecture #7 1 Overview  Chapter 3: Baseband Pulse & Digital Signaling  Encode analog waveforms into baseband digital signals »Digital signaling.
Leo Lam © Signals and Systems EE235 Leo Lam.
2D Sampling Goal: Represent a 2D function by a finite set of points.
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
Digital Signal Processing
Sampling of Continuous-Time Signals Quote of the Day Optimist: "The glass is half full." Pessimist: "The glass is half empty." Engineer: "That glass is.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Topics 1 Specific topics to be covered are: Discrete-time signals Z-transforms Sampling and reconstruction Aliasing and anti-aliasing filters Sampled-data.
2D Fourier Transform.
Chapter 2 Ideal Sampling and Nyquist Theorem
Linear systems: University of Illinois at Chicago ECE 427, Dr. D. Erricolo University of Illinois at Chicago ECE 427, Dr. D. Erricolo Consider two complex.
Lecture 1.4. Sampling. Kotelnikov-Nyquist Theorem.
DSP First, 2/e Lecture 16 DTFT Properties. June 2016 © , JH McClellan & RW Schafer 2 License Info for DSPFirst Slides  This work released under.
Prof. Brian L. Evans Dept. of Electrical and Computer Engineering The University of Texas at Austin EE445S Real-Time Digital Signal Processing Lab Spring.
Sampling Week 7, Fri 17 Oct 2003 p1 demos sampling.
Echivalarea sistemelor analogice cu sisteme digitale
SAMPLING & ALIASING.
Sampling and Quantization
Lecture Signals with limited frequency range
(C) 2002 University of Wisconsin, CS 559
EE Audio Signals and Systems
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
لجنة الهندسة الكهربائية
Image Acquisition.
The sampling of continuous-time signals is an important topic
Sampling and the Discrete Fourier Transform
Interpolation and Pulse Shaping
Chapter 2 Ideal Sampling and Nyquist Theorem
Lecture 15 DTFT: Discrete-Time Fourier Transform
Rectangular Sampling.
LECTURE 18: FOURIER ANALYSIS OF CT SYSTEMS
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Lesson Week 8 Fourier Transform of Time Functions (DC Signal, Periodic Signals, and Pulsed Cosine)
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Signals and Systems Lecture 2
Signals and Systems Revision Lecture 1
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Chapter 3 Sampling.
DIGITAL CONTROL SYSTEM WEEK 3 NUMERICAL APPROXIMATION
Presentation transcript:

Signals and Systems Revision Lecture 2 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL PROCESSING IMPERIAL COLLEGE LONDON

Sampling In this revision lecture we will focus on: Sampling. The 𝑧− transform.

Sampling The sampling process converts continuous signals 𝑥(𝑡) into numbers 𝑥[𝑛]. A sample is kept every 𝑇 𝑠 units of time. This process is called uniform sampling and 𝑥 𝑛 =𝑥(𝑛 𝑇 𝑠 ). 𝑥(𝑡) 𝑇 𝑠 =1/ 𝑓 𝑠 𝑥[𝑛]

Sampling theorem Sampling theorem is the bridge between continuous-time and discrete-time signals. It states how often we must sample in order not to loose any information. 𝑥(𝑡) 𝑇 𝑠 =1/ 𝑓 𝑠 𝑥[𝑛] Sampling theorem A continuous-time lowpass signal 𝑥(𝑡) with frequencies no higher than 𝑓 𝑚𝑎𝑥 𝐻𝑧 can be perfectly reconstructed from samples taken every 𝑇 𝑠 units of time, 𝑥 𝑛 =𝑥(𝑛 𝑇 𝑠 ), if the samples are taken at a rate 𝑓 𝑠 =1/ 𝑇 𝑠 that is greater than 2𝑓 𝑚𝑎𝑥 .

Recall: spectrum of sampled signal Consider a signal, bandlimited to 𝐵𝐻𝑧, with Fourier transform 𝑋(𝜔) (depicted real for convenience). The sampled signal has the following spectrum.

Reconstruction of the original signal The gap between two adjacent spectral repetitions is (𝑓 𝑠 −2𝐵)𝐻𝑧. In theory, in order to reconstruct the original signal 𝑥(𝑡), we can use an ideal lowpass filter on the sampled spectrum which has a bandwidth of any value between 𝐵 and ( 𝑓 𝑠 −𝐵𝐻𝑧). Reconstruction process is possible only if the shaded parts do not overlap. This means that 𝑓 𝑠 must be greater that twice 𝐵. We can also visually verify the sampling theorem in the above figure.

Reconstruction generic example Frequency domain The signal 𝑥 𝑛 𝑇 𝑠 =<𝑥 𝑡 ,𝛿(𝑡−𝑛 𝑇 𝑠 )> has a spectrum 𝑋 𝑠 (𝜔) which is multiplied with a rectangular pulse in frequency domain.

Reconstruction generic example cont. Time domain The signal 𝑥 𝑛 𝑇 𝑠 =<𝑥 𝑡 ,𝛿(𝑡−𝑛 𝑇 𝑠 )> is convolved with a sinc function, which is the time domain version of a rectangular pulse in frequency domain centred at the origin. <𝑥 𝑡 ,𝛿(𝑡−𝑛 𝑇 𝑠 )>∗ sinc 𝑎𝑡 = 𝑛 𝑥[𝑛] sinc[𝑎(𝑡−𝑛 𝑇 𝑠 )] [Recall that convolution with a shifted Delta function, shifts the original function at the location of the Delta function].

Recall Nyquist sampling: Just about the correct sampling rate In that case we use the Nyquist sampling rate of 10𝐻𝑧=2𝐵𝐻𝑧. The spectrum 𝑋 𝜔 consists of back-to-back, non-overlapping repetitions of 1 𝑇 𝑠 𝑋 𝜔 repeating every 10𝐻𝑧. In order to recover 𝑋(𝜔) from 𝑋 𝜔 we must use an ideal lowpass filter of bandwidth 5𝐻𝑧. This is shown in the right figure below with the dotted line.

Recall oversampling: What happens if we sample too quickly? Sampling at higher than the Nyquist rate (in this case 20𝐻𝑧) makes reconstruction easier. The spectrum 𝑋 𝜔 consists of non-overlapping repetitions of 1 𝑇 𝑠 𝑋 𝜔 , repeating every 20𝐻𝑧 with empty bands between successive cycles. In order to recover 𝑋(𝜔) from 𝑋 𝜔 we can use a practical lowpass filter and not necessarily an ideal one. This is shown in the right figure below with the dotted line. The filter we use for reconstruction must have gain 𝑇 𝑠 and bandwidth of any value between 𝐵 and ( 𝑓 𝑠 −𝐵)𝐻𝑧.

Recall undersampling: What happens if we sample too slowly? Sampling at lower than the Nyquist rate (in this case 5𝐻𝑧) makes reconstruction impossible. The spectrum 𝑋 𝜔 consists of overlapping repetitions of 1 𝑇 𝑠 𝑋 𝜔 repeating every 5𝐻𝑧. 𝑋(𝜔) is not recoverable from 𝑋 𝜔 . Sampling below the Nyquist rate corrupts the signal. This type of distortion is called aliasing.

Problem: Reconstruction of the continuous time using the sample and hold operation As already mentioned, in order to reconstruct the original signal 𝑥(𝑡) in theory, we can use an ideal lowpass filter on the sampled spectrum. In practice, there are various circuits/devices which facilitate reconstruction of the original signal from its sampled version. Consider a continuous-time, band-limited signal 𝑥 𝑡 , limited to bandwidth 𝜔 ≤2𝜋×𝐵 rad/sec. We sample 𝑥 𝑡 uniformly with sampling frequency 𝑓 𝑠 to obtain the discrete-time signal 𝑥[𝑛]. A possible technique to reconstruct the continuous-time signal from its samples is the so called sample and hold circuit. This is an analogue device which samples the value of a continuously varying analogue signal and outputs the following signal 𝑥 𝐷𝐴 𝑡 . 𝑥 𝐷𝐴 𝑡 = 𝑥[𝑛] 𝑛 𝑓 𝑠 − 𝑇 𝑠 2 <𝑡< 𝑛 𝑓 𝑠 + 𝑇 𝑠 2 𝑥 𝑛 /2 𝑡= 𝑛 𝑓 𝑠 ± 𝑇 𝑠 2 0 otherwise = 𝑥[𝑛] 𝑛 𝑇 𝑠 − 𝑇 𝑠 2 <𝑡<𝑛 𝑇 𝑠 + 𝑇 𝑠 2 𝑥 𝑛 /2 𝑡=𝑛 𝑇 𝑠 ± 𝑇 𝑠 2 0 otherwise

Reconstruction of the continuous time using the sample and hold operation cont. The figure below facilitates the understanding of sample and hold operation. The grey continuous curve depicts the continuous signal 𝑥 𝑡 . The red arrows depict the locations of the discrete (sampled) signal 𝑥 𝑛 . The green continuous curve depicts the signal 𝑥 𝐷𝐴 𝑡 .

Problem: Reconstruction of the continuous time using the sample and hold operation cont. In the sample and hold operation the signal is written as: 𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )Π 𝑡− 𝑛 𝑓 𝑠 𝑇 𝑠 with Π 𝑡 the very well known unit gate or rectangle function: Π 𝑡 =rect 𝑡 = 1 𝑡 <0.5 0.5 𝑡 =0.5 0 otherwise Note that the values at 𝑡=±0.5 do not have any impact in the Fourier Transform of Π 𝑡 and alternative definitions of Π 𝑡 have rect ±0.5 to be 0, 1 or undefined.

𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 ) 𝛿(𝑡−𝑛 𝑇 𝑠 )∗Π 𝑡 𝑇 𝑠 Problem: Reconstruction of the continuous time using the sample and hold operation cont. Taking into consideration that: 𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )Π 𝑡− 𝑛 𝑓 𝑠 𝑇 𝑠 it is straightforward to show that: 𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 ) 𝛿(𝑡−𝑛 𝑇 𝑠 )∗Π 𝑡 𝑇 𝑠 𝑥 𝐷𝐴 𝑡 =( 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )𝛿(𝑡−𝑛 𝑇 𝑠 ) )∗Π 𝑡 𝑇 𝑠

𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )𝛿(𝑡−𝑛 𝑇 𝑠 ) ∗Π 𝑡 𝑇 𝑠 Problem: Reconstruction of the continuous time using the sample and hold operation cont. 𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )𝛿(𝑡−𝑛 𝑇 𝑠 ) ∗Π 𝑡 𝑇 𝑠 The Fourier transform of the function 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )𝛿(𝑡−𝑛 𝑇 𝑠 ) is 1 𝑇 𝑠 𝑘=−∞ ∞ 𝑋(𝜔+𝑘 2𝜋 𝑇 𝑠 ) . The Fourier transform of the function Π 𝑡 𝑇 𝑠 can be easily found using the definition of the Fourier transform. The Fourier transform of 𝑥 𝐷𝐴 𝑡 is the product of the two Fourier transforms described above (remember that convolution in time becomes multiplication in frequency).

𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )𝛿(𝑡−𝑛 𝑇 𝑠 ) ∗Π 𝑡 𝑇 𝑠 Problem: Reconstruction of the continuous time using the sample and hold operation cont. 𝑥 𝐷𝐴 𝑡 = 𝑛=−∞ ∞ 𝑥(𝑛 𝑇 𝑠 )𝛿(𝑡−𝑛 𝑇 𝑠 ) ∗Π 𝑡 𝑇 𝑠 We can show that 𝑋 𝐷𝐴 𝜔 = 1 𝑇 𝑠 𝑘=−∞ ∞ 𝑋(𝜔+𝑘 2𝜋 𝑇 𝑠 ) ∙ 𝑇 𝑠 sinc 𝜔 𝑇 𝑠 2 = 𝑘=−∞ ∞ 𝑋(𝜔+𝑘 2𝜋 𝑇 𝑠 ) ∙ sinc 𝜔 𝑇 𝑠 2 In order to recover the original spectrum 𝑋(𝜔) we can remove the replications 𝑋(𝜔+𝑘 2𝜋 𝑇 𝑠 ) by passing 𝑋 𝐷𝐴 𝜔 through a lowpass filter. Note that the term sinc 𝜔 𝑇 𝑠 2 must be removed from 𝑋 𝐷𝐴 𝜔 .

Example Consider a LTI system with input 𝑥[𝑛] and output 𝑦[𝑛] related with the difference equation: 𝑦 𝑛−2 − 5 2 𝑦 𝑛−1 +𝑦 𝑛 =𝑥[𝑛] Determine the impulse response and its 𝑧−transform in the following three cases: The system is causal. The system is stable. The system is neither stable nor causal.

Recall: Find the 𝒛−transform of 𝒙 𝒏 =𝜸 𝒏 𝒖[𝒏] Find the 𝑧−transform of the causal signal 𝛾 𝑛 𝑢[𝑛], where 𝛾 is a constant. By definition: 𝑋[𝑧]= 𝑛=−∞ ∞ 𝛾 𝑛 𝑢 𝑛 𝑧 −𝑛 = 𝑛=0 ∞ 𝛾 𝑛 𝑧 −𝑛 = 𝑛=0 ∞ 𝛾 𝑧 𝑛 =1+ 𝛾 𝑧 + 𝛾 𝑧 2 + 𝛾 𝑧 3 +… We apply the geometric progression formula: 1+𝑥+ 𝑥 2 + 𝑥 3 +…= 1 1−𝑥 , 𝑥 <1 Therefore, 𝑋[𝑧]= 1 1− 𝛾 𝑧 , 𝛾 𝑧 <1 = 𝑧 𝑧−𝛾 , 𝑧 > 𝛾 We notice that the 𝑧−transform exists for certain values of 𝑧. These values form the so called Region-Of-Convergence (ROC) of the transform.

Recall: Find the 𝒛−transform of 𝒙 𝒏 =−𝜸 𝒏 𝒖[−𝒏−𝟏] Find the 𝑧−transform of the anticausal signal − 𝛾 𝑛 𝑢[−𝑛−1], where 𝛾 is a constant. By definition: 𝑋[𝑧]= 𝑛=−∞ ∞ − 𝛾 𝑛 𝑢 −𝑛−1 𝑧 −𝑛 = 𝑛=−∞ −1 − 𝛾 𝑛 𝑧 −𝑛 =− 𝑛=1 ∞ 𝛾 −𝑛 𝑧 𝑛 =− 𝑛=1 ∞ 𝑧 𝛾 𝑛 =− 𝑧 𝛾 𝑛=0 ∞ 𝑧 𝛾 𝑛 =− 𝑧 𝛾 1+ 𝑧 𝛾 + 𝑧 𝛾 2 + 𝑧 𝛾 3 +… Therefore, 𝑋[𝑧]=− 𝑧 𝛾 1 1− 𝑧 𝛾 , 𝑧 𝛾 <1 = 𝑧 𝑧−𝛾 , 𝑧 < 𝛾 We notice that the 𝑧−transform exists for certain values of 𝑧, which consist the complement of the ROC of the function 𝛾 𝑛 𝑢[𝑛] with respect to the 𝑧−plane.

Example cont. Consider a LTI system with input 𝑥[𝑛] and output 𝑦[𝑛] related with the difference equation: 𝑦 𝑛−2 − 5 2 𝑦 𝑛−1 +𝑦 𝑛 =𝑥[𝑛] By taking the 𝑧−transform in both sides of the above equation, we obtain: 𝑧 −2 − 5 2 𝑧 −1 +1 𝑌 𝑧 =𝑋 𝑧 ⇒ 𝑌(𝑧) 𝑋(𝑧) = 1 𝑧 −2 − 5 2 𝑧 −1 +1 = 1 ( 𝑧 −1 −2)( 𝑧 −1 − 1 2 ) = 2 3 ( 𝑧 −1 −2) − 2 3 ( 𝑧 −1 − 1 2 )

Example cont. The impulse response that corresponds to the term 2 3 ( 𝑧 −1 −2) =(− 1 3 ) 𝑧 𝑧− 1 2 can be: ℎ 1 𝑛 = − 1 3 1 2 𝑛 𝑢 𝑛 or ℎ 2 𝑛 = 1 3 1 2 𝑛 𝑢 −𝑛−1 The impulse response that corresponds to the term − 2 3 ( 𝑧 −1 − 1 2 ) = 4 3 𝑧 𝑧−2 can be: ℎ 3 𝑛 = 4 3 2 𝑛 𝑢 𝑛 or ℎ 4 𝑛 = (− 4 3 ) 2 𝑛 𝑢 −𝑛−1

Example cont. In order for the system to be stable: ℎ 𝑛 = − 1 3 1 2 𝑛 𝑢 𝑛 − 4 3 2 𝑛 𝑢 −𝑛−1 In order for the system to be causal: ℎ 𝑛 = − 1 3 1 2 𝑛 𝑢 𝑛 + 4 3 2 𝑛 𝑢 𝑛 In order for the system to be neither stable nor causal the remaining two combinations should be considered.