111 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.

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.
Lecture 7: Basis Functions & Fourier Series
ECE 4371, Fall, 2014 Introduction to Telecommunication Engineering/Telecommunication Laboratory Zhu Han Department of Electrical and Computer Engineering.
Cellular Communications
ELEC 303 – Random Signals Lecture 20 – Random processes
Sep 16, 2005CS477: Analog and Digital Communications1 LTI Systems, Probability Analog and Digital Communications Autumn
Advanced Computer Graphics (Spring 2006) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
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
Advanced Computer Graphics (Spring 2005) COMS 4162, Lecture 3: Sampling and Reconstruction Ravi Ramamoorthi
Continuous-Time Fourier Methods
Lecture 16 Random Signals and Noise (III) Fall 2008 NCTU EE Tzu-Hsien Sang.
Analogue and digital techniques in closed loop regulation applications Digital systems Sampling of analogue signals Sample-and-hold Parseval’s theorem.
Leo Lam © Signals and Systems EE235. Transformers Leo Lam ©
First semester King Saud University College of Applied studies and Community Service 1301CT.
ELEC 303 – Random Signals Lecture 21 – Random processes
Advanced Computer Graphics CSE 190 [Spring 2015], Lecture 3 Ravi Ramamoorthi
… 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.
DSP for Dummies aka How to turn this (actual raw sonar trace) Into this.. (filtered sonar data)
Discrete-Time and System (A Review)
EE421, Fall 1998 Michigan Technological University Timothy J. Schulz 08-Sept, 98EE421, Lecture 11 Digital Signal Processing (DSP) Systems l Digital processing.
ELEC ENG 4035 Communications IV1 School of Electrical & Electronic Engineering 1 Section 2: Frequency Domain Analysis Contents 2.1 Fourier Series 2.2 Fourier.
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.
1 Let g(t) be periodic; period = T o. Fundamental frequency = f o = 1/ T o Hz or  o = 2  / T o rad/sec. Harmonics =n f o, n =2,3 4,... Trigonometric.
Fourier Series Summary (From Salivahanan et al, 2002)
CISE315 SaS, L171/16 Lecture 8: Basis Functions & Fourier Series 3. Basis functions: Concept of basis function. Fourier series representation of time functions.
Lecture 2 Signals and Systems (I)
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.
1 Fourier Representations of Signals & Linear Time-Invariant Systems Chapter 3.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Notice  HW problems for Z-transform at available on the course website  due this Friday (9/26/2014) 
Course Outline (Tentative) Fundamental Concepts of Signals and Systems Signals Systems Linear Time-Invariant (LTI) Systems Convolution integral and sum.
Chapter 2 Signals and Spectra (All sections, except Section 8, are covered.)
EE354 : Communications System I
Fundamentals of Digital Signal Processing. Fourier Transform of continuous time signals with t in sec and F in Hz (1/sec). Examples:
Leo Lam © Signals and Systems EE235 Leo Lam.
Fourier Analysis of Signals and Systems
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Causality Linearity Time Invariance Temporal Models Response to Periodic.
EEE 503 Digital Signal Processing Lecture #2 : EEE 503 Digital Signal Processing Lecture #2 : Discrete-Time Signals & Systems Dr. Panuthat Boonpramuk Department.
Leo Lam © Signals and Systems EE235. Leo Lam © Fourier Transform Q: What did the Fourier transform of the arbitrary signal say to.
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.
Chapter 2. Fourier Representation of Signals and Systems
11 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Prof. Nizamettin AYDIN Advanced Digital Signal Processing 1.
Lecture 3: The Sampling Process and Aliasing 1. Introduction A digital or sampled-data control system operates on discrete- time rather than continuous-time.
Eeng360 1 Chapter 2 Linear Systems Topics:  Review of Linear Systems Linear Time-Invariant Systems Impulse Response Transfer Functions Distortionless.
Chapter 2. Signals and Linear Systems
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
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.
Lecture 7: Basis Functions & Fourier Series
Advanced Computer Graphics
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
UNIT-III Signal Transmission through Linear Systems
Chapter 4 Dynamical Behavior of Processes Homework 6 Construct an s-Function model of the interacting tank-in-series system and compare its simulation.
Computational Data Analysis
Advanced Digital Signal Processing
Chapter 2 Ideal Sampling and Nyquist Theorem
6. Time and Frequency Characterization of Signals and Systems
Signals and Systems Revision Lecture 2
Chapter 3 Sampling.
Digital Signal Processing
Presentation transcript:

111 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang

2 Outlines Signal Models & Classifications Signal Space & Orthogonal Basis Fourier Series &Transform Power Spectral Density & Correlation Signals & Linear Systems Sampling Theory DFT & FFT 2

More on LTI Systems A system is BIBO if output is bounded, given any bounded input. A system is causal if: current output does not depend on future input; or current input does not contribute to the output in the past. 3

Paley-Wiener Condition: Remarks: (1) |H(f)| cannot grow too fast. (2) |H(f)| cannot be exactly zero over a finite band of frequency. 2 nd ver.: 4

Eigenfunctions of LTI Systems Another way of taking complicated things part. Instead of trying to find a set of orthogonal basis functions, let’s look for signals that will not be changed “fundamentally” when passing them through an LTI system. Why? Consider the key words: analysis/synthesis. Note: Eigen-analysis is not necessarily consistent with orthogonal basis analysis. 5

If, where  is a constant, then  is the eigenvalue for the eigenfunction g(t). Let 6

7 (Cross)correlation functions related by LTI systems: Note: In proving them, we use: Filters!!!

8 Since almost any input x(t) can be represented by a linear combination of orthogonal sinusoidal basis functions, we only need to input to the system to characterize the system’s properties, and the eigenvalue carries all the system information responding to. (Frequency response!!!) In communications, signal distortion is of primary concern in high-quality transmission of data. Hence, the transmission channel is the key investigation target.

9 Three major types of distortion caused by a transmission channel: 1. Amplitude distortion: linear system but the amplitude response is not constant. 2. Phase (delay) distortion: linear system but the phase shift is not a linear function of frequency. (Q: What good is linear phase?) 3. Nonlinear distortion: nonlinear system

10 Example: Group Delay

11

12 Example: Ideal general filters

13 Realizable filters approximating ideal filters

14 The Uncertainty Principle It can be argued that a narrow time signal has a wide (frequency) bandwidth, and vice versa:

15 Sampling Theory You’ve probably heard of “signal processing.” But how to process a signal? For instance, the rectifier – max{x(t), 0}. But, how to do Fourier transform of an arbitrary signal x(t)? Computers seem a good idea. But computers can only work on numbers. We need to “transform” the signal first into numbers. Q: Tell discrete signals from digital signals.

16 Ideal sampling signal: impulse train (an analog signal), T: the sampling period Analog (continuous-time) signal: Sampled (continuous-time) signal: Hopefully the math becomes easier in ideal case. The concept actually is harder.

17 Aliasing: If The replicas of X(f) overlap in frequency domain. That is, the higher frequency components of overlap with the lower frequency components of X(f-f s ).

18 –Nyquist Sampling Theorem: Let x(t) be a bandlimited signal with X(f) = 0 for. (i.e., no components at frequencies greater than W.) Then x(t) is uniquely determined by its samples if.

19 In other words, oversampling preserves all the information that x(t) contains. It is possible to reconstruct x(t) purely by its samples. Ideal reconstruction filter (interpretation in frequency domain: In time domain:

20 Two types of reconstruction errors

21 DFT & FFT You can view DFT as a totally new definition for a totally different set of signals. Or you can try to connect it to the Fourier Transform.

22

Fast Fourier Transform (FFT) is not a new transform, it is simply a fast way to compute DFT. So, don’t use FFT to denote the object that you want to compute; only use it to denote the tool that you use to compute it. (Gauss knew the method already!) Application example: Fast convolution via FFT: 23