ENEE222 Elements of Discrete Signal Analysis Lab 9 1.

Slides:



Advertisements
Similar presentations
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Advertisements

Computer Vision Lecture 7: The Fourier Transform
Time Series II.
Digital Kommunikationselektronik TNE027 Lecture 5 1 Fourier Transforms Discrete Fourier Transform (DFT) Algorithms Fast Fourier Transform (FFT) Algorithms.
LECTURE Copyright  1998, Texas Instruments Incorporated All Rights Reserved Use of Frequency Domain Telecommunication Channel |A| f fcfc Frequency.
Fourier Transform (Chapter 4)
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.
Chapter Four Image Enhancement in the Frequency Domain.
Let’s go back to this problem: We take N samples of a sinusoid (or a complex exponential) and we want to estimate its amplitude and frequency by the FFT.
DREAM PLAN IDEA IMPLEMENTATION Introduction to Image Processing Dr. Kourosh Kiani
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 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.
Time and Frequency Representation
Continuous Time Signals All signals in nature are in continuous time.
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.
CH#3 Fourier Series and Transform
Systems: Definition Filter
Frequency Domain Representation of Sinusoids: Continuous Time Consider a sinusoid in continuous time: Frequency Domain Representation: magnitude phase.
EE513 Audio Signals and Systems Digital Signal Processing (Systems) Kevin D. Donohue Electrical and Computer Engineering University of Kentucky.
Motivation Music as a combination of sounds at different frequencies
The Discrete Fourier Transform. The Fourier Transform “The Fourier transform is a mathematical operation with many applications in physics and engineering.
Fourier series. The frequency domain It is sometimes preferable to work in the frequency domain rather than time –Some mathematical operations are easier.
1 The Fourier Series for Discrete- Time Signals Suppose that we are given a periodic sequence with period N. The Fourier series representation for x[n]
: Chapter 14: The Frequency Domain 1 Montri Karnjanadecha ac.th/~montri Image Processing.
Lecture 12: Introduction to Discrete Fourier Transform Sections 2.2.3, 2.3.
Digital Signal Processing – Chapter 10
Chapter 7: The Fourier Transform 7.1 Introduction
1 © 2010 Cengage Learning Engineering. All Rights Reserved. 1 Introduction to Digital Image Processing with MATLAB ® Asia Edition McAndrew ‧ Wang ‧ Tseng.
EE104: Lecture 5 Outline Review of Last Lecture Introduction to Fourier Transforms Fourier Transform from Fourier Series Fourier Transform Pair and Signal.
Digital Image Processing Chapter 4 Image Enhancement in the Frequency Domain Part I.
October 29, 2013Computer Vision Lecture 13: Fourier Transform II 1 The Fourier Transform In the previous lecture, we discussed the Hough transform. There.
CHEE825 Fall 2005J. McLellan1 Spectral Analysis and Input Signal Design.
Fourier Analysis of Discrete Time Signals
Fourier Series Fourier Transform Discrete Fourier Transform ISAT 300 Instrumentation and Measurement Spring 2000.
7- 1 Chapter 7: Fourier Analysis Fourier analysis = Series + Transform ◎ Fourier Series -- A periodic (T) function f(x) can be written as the sum of sines.
Fourier Transform.
2D Fourier Transform.
Eeng360 1 Chapter 2 Fourier Transform and Spectra Topics:  Fourier transform (FT) of a waveform  Properties of Fourier Transforms  Parseval’s Theorem.
ENEE 322: Continuous-Time Fourier Transform (Chapter 4)
The Frequency Domain Digital Image Processing – Chapter 8.
Fourier transform.
Fourier Transform and Spectra
The Fourier Transform.
CH#3 Fourier Series and Transform 1 st semester King Saud University College of Applied studies and Community Service 1301CT By: Nour Alhariqi.
Fourier Transform (Chapter 4) CS474/674 – Prof. Bebis.
Digital Image Processing Lecture 8: Fourier Transform Prof. Charlene Tsai.
Discrete Fourier Transform (DFT)
CS 591 S1 – Computational Audio
CE Digital Signal Processing Fall Discrete-time Fourier Transform
LECTURE 11: FOURIER TRANSFORM PROPERTIES
Continuous-Time Signal Analysis
EE Audio Signals and Systems
Sinusoids: continuous time
Net 222: Communications and networks fundamentals (Practical Part)
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.
Net 222: Communications and networks fundamentals (Practical Part)
Image Processing, Leture #14
Chapter 8 The Discrete Fourier Transform
Advanced Digital Signal Processing
Lecture 17 DFT: Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform
ENEE222 Elements of Discrete Signal Analysis Lab 3 1.
Digital Image Procesing Unitary Transforms Discrete Fourier Trasform (DFT) in Image Processing DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Lecture 4 Image Enhancement in Frequency Domain
Discrete Fourier Transform
LECTURE 11: FOURIER TRANSFORM PROPERTIES
The Frequency Domain Any wave shape can be approximated by a sum of periodic (such as sine and cosine) functions. a--amplitude of waveform f-- frequency.
Electrical Communications Systems ECE
Presentation transcript:

ENEE222 Elements of Discrete Signal Analysis Lab 9 1

Prepare your working environment Download the script for lab 9 from ELMS or: terpconnect.umd.edu/~rssaketh/ene222/lab Move files to your desktop Double click the MATLAB icon on the desktop In MATLAB, set “Current Folder” to your desktop Double click the file “lab_09_script.zip” inside MATLAB 2

Item 1: The Fourier Matrix The discrete Fourier transform (DFT) and its inverse can be computed using FFT and IFFT An N-by-N Fourier matrix V can be generated using V=fft(eye(N))’ or V=N*ifft(eye(N)) or V=dftmtx(N)' The matrix V consists of N complex sinusoids, each of length N, at frequencies w = 2πk/N, k = 0:N-1. 3

Item 2: DFT of an Audio Signal A WAVE file can be imported into MATLAB with [samples, sampling_rate]=wavread('clip.wav') Suppose the sampling rate is fs = 32kHz the number of samples is N = 160,000 the magnitude spectrum has a sharp cutoff at k = 30,000 What is the actual cutoff frequency in Hz? 4

Item 3: Phase Component While seemingly random, the phase spectrum contains important information and cannot be ignored. Let’s try to reconstruct x using the correct magnitude spectrum and a random phase spectrum. Phase component generation: q = pi*rand(size(x)) q = q - q([1 N:-1:2]) Y = abs(X).*exp(j*q) To obtain reconstructed signal, real(ifft()) should be used instead of merely ifft(). Why? 5

Item 4: Circular Time Reversal Recall (y=) Rx ↔ RX (=Y). In Matlab, Rx can be implemented by y=x([1 N:-1:2]) y undergoes a circular time reversal, and in addition, x is a real signal. So what will the plots of real and imaginary parts of Y look like compared to those of X? (recall the property of circular conjugate symmetry) 6

Item 4: Circular Time Shift (Delay) Recall (y=) PMx ↔ F−MX (=Y). In Matlab, circular shift is implemented by y = circshift(x,M) The DFT in this case is Y = X.*exp(-j*k*2*pi*M/N) Again, the phase component plays an important role and cannot be changed arbitrarily. Basis Vectors 7

Item 5: Amplitude Modulation An AM signal is generated by multiplication of the original signal and a real sinusoid in the time domain, i.e., Xmod[n] = x[n]cos(n) In Matlab, it is implemented by elementwise multiplication x_mod=x.*cos(n*2*pi*K/N) Since the cosine term above is the sum of two Fourier sinusoids, the spectrum of the AM signal is obtained by adding together two circularly shifted versions of the original DFT. 8