Electrical Communications Systems ECE

Slides:



Advertisements
Similar presentations
DCSP-12 Jianfeng Feng
Advertisements

DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
DCSP-11 Jianfeng Feng
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),
LECTURE Copyright  1998, Texas Instruments Incorporated All Rights Reserved Use of Frequency Domain Telecommunication Channel |A| f fcfc Frequency.
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
S. Mandayam/ DIP/ECE Dept./Rowan University Digital Image Processing / Fall 2003 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2010 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2008 Shreekanth Mandayam ECE Department Rowan University.
Sampling, Reconstruction, and Elementary Digital Filters R.C. Maher ECEN4002/5002 DSP Laboratory Spring 2002.
S. Mandayam/ DIP/ECE Dept./Rowan University Digital Image Processing ECE /ECE Fall 2009 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2008 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2009 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2009 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2010 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ DIP/ECE Dept./Rowan University Digital Image Processing ECE /ECE Fall 2007 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2011 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2009 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communication Systems ECE Spring 2008 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems Spring 2005 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2008 Shreekanth Mandayam ECE Department Rowan University.
S. Mandayam/ ECOMMS/ECE Dept./Rowan University Electrical Communications Systems ECE Spring 2007 Shreekanth Mandayam ECE Department Rowan University.
Discrete Time Periodic Signals A discrete time signal x[n] is periodic with period N if and only if for all n. Definition: Meaning: a periodic signal keeps.
Systems: Definition Filter
Discrete-Time and System (A Review)
DTFT And Fourier Transform
Discrete Fourier Transform Prof. Siripong Potisuk.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Real time DSP Professors: Eng. Julian S. Bruno Eng. Jerónimo F. Atencio Sr. Lucio Martinez Garbino.
Digital Signal Processing Chapter 3 Discrete transforms.
Fourier Analysis of Discrete Time Signals
Fast Fourier Transforms. 2 Discrete Fourier Transform The DFT pair was given as Baseline for computational complexity: –Each DFT coefficient requires.
Eeng360 1 Chapter 2 Fourier Transform and Spectra Topics:  Fourier transform (FT) of a waveform  Properties of Fourier Transforms  Parseval’s Theorem.
Learning from the Past, Looking to the Future James R. (Jim) Beaty, PhD - NASA Langley Research Center Vehicle Analysis Branch, Systems Analysis & Concepts.
Eeng Chapter 2 Discrete Fourier Transform (DFT) Topics:  Discrete Fourier Transform. Using the DFT to Compute the Continuous Fourier Transform.
Fourier Transform and Spectra
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
EE422G Signals and Systems Laboratory Fourier Series and the DFT Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Chapter 4 Discrete-Time Signals and transform
Digital Image Processing / Fall 2001
Section II Digital Signal Processing ES & BM.
DIGITAL SIGNAL PROCESSING ELECTRONICS
Spectral Analysis Spectral analysis is concerned with the determination of the energy or power spectrum of a continuous-time signal It is assumed that.
EE Audio Signals and Systems
Fast Fourier Transforms Dr. Vinu Thomas
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
Chapter 8 The Discrete Fourier Transform
Lecture 18 DFS: Discrete Fourier Series, and Windowing
Chapter 2 Ideal Sampling and Nyquist Theorem
Lecture 17 DFT: Discrete Fourier Transform
LECTURE 18: FAST FOURIER TRANSFORM
Chapter 2 Discrete Fourier Transform (DFT)
Rectangular Sampling.
Fourier Transform and Spectra
Chapter 8 The Discrete Fourier Transform
Today's lecture System Implementation Discrete Time signals generation
Lec.6:Discrete Fourier Transform and Signal Spectrum
Electrical Communications Systems ECE Spring 2019
Electrical Communication Systems ECE Spring 2019
LECTURE 18: FAST FOURIER TRANSFORM
Fourier Transforms of Discrete Signals By Dr. Varsha Shah
Electrical Communications Systems ECE
Electrical Communications Systems ECE
Electrical Communications Systems ECE
Electrical Communications Systems ECE
Presentation transcript:

Electrical Communications Systems ECE.09.433 Signals and Spectra II Dr. Shreek Mandayam Electrical & Computer Engineering Rowan University

Plan CFT’s (spectra) of common waveforms Discrete Fourier Transform Impulse Sinusoid Rectangular Pulse Discrete Fourier Transform How to get the frequency axis in the DFT

ECOMMS: Topics

Continuous Fourier Transform Continuous Fourier Transform (CFT) Frequency, [Hz] Amplitude Spectrum Phase Inverse Fourier Transform (IFT) See p. 46 Dirichlet Conditions

CFT’s of Common Waveforms Impulse (Dirac Delta) Sinusoid Rectangular Pulse Matlab Demo: recpulse.m

CFT for Periodic Signals Recall: FS: Periodic Signals CFT: Aperiodic Signals We want to get the CFT for a periodic signal What is ?

Discrete Fourier Transform (DFT) Equal time intervals Discrete Domains Discrete Time: k = 0, 1, 2, 3, …………, N-1 Discrete Frequency: n = 0, 1, 2, 3, …………, N-1 Discrete Fourier Transform Inverse DFT Equal frequency intervals n = 0, 1, 2,….., N-1 k = 0, 1, 2,….., N-1

Importance of the DFT Allows time domain / spectral domain transformations using discrete arithmetic operations Computational Complexity Raw DFT: N2 complex operations (= 2N2 real operations) Fast Fourier Transform (FFT): N log2 N real operations Fast Fourier Transform (FFT) Cooley and Tukey (1965), ‘Butterfly Algorithm”, exploits the periodicity and symmetry of e-j2pkn/N VLSI implementations: FFT chips Modern DSP

How to get the frequency axis in the DFT The DFT operation just converts one set of number, x[k] into another set of numbers X[n] - there is no explicit definition of time or frequency How can we relate the DFT to the CFT and obtain spectral amplitudes for discrete frequencies? (N-point FFT) Need to know fs n=0 1 2 3 4 n=N f=0 f = fs

All those signals………. Amplitude w(t) time Time Amplitude Signal 111 continuous continuous continuous-time analog signal discrete discrete discrete-time digital signal Cn 111 110 101 100 011 010 001 000 sampling Amplitude time discrete continuous discrete-time analog signal w(nTs) Ts sampling discrete continuous discrete-time sequence w[n] n=0 1 2 3 4 5 indexing

…..and all those transforms Sample in time, period = Ts Continuous-time analog signal w(t) Discrete-time analog sequence w [n] C D Continuous-variable Discrete-variable Laplace Transform W(s) Continuous Fourier Transform W(f) z-Transform W(z) Discrete-Time Fourier Transform W(W) Discrete Fourier Transform W(k) z = ejW s = jw w=2pf =2pf W = w Ts, scale amplitude by 1/Ts Sample in frequency, W = 2pn/N, N = Length of sequence

Summary