LABORATORY 1 DISCRETE-TIME SIGNALS
|
|
- Barnard Kennedy
- 5 years ago
- Views:
Transcription
1 LABORATORY DISCRETE-TIME SIGNALS.. Introduction A discrete-time signal is represented as a sequence of numbers, called samples. A sample value of a typical discrete-time signal or sequence is denoted as: x[, N n N (.) In MATLAB these sequences can be defined as a row or column vectors, with real or complex elements. A first limitation arises from the fact that these vectors are of finite length while the digital signal processing problems can work with infinite length sequences... Generation of Sequences Two basic discrete-time sequences are the unit impulse sequence and the unit step sequence. The unit impulse sequence, n 0 [ (.) 0, n 0
2 Delayed unit impulse, n n0 [ n n0 ] (.3) 0, n n0 Since MATLAB cannot define sequences of infinite length must be stated range of values for n. To facilitate the definition of sequences of this kind will create a MATLAB function function [y, = impuls(li,ls,k) %IMPULS the unit (Dirac) impulse in discrete time, %defined on a finite temporal support % Output parameters: % y = delta(n-k) (line vector) on the support li:ls % n = temporal support li:ls (line vector) % Input parameters: % li = the inferior limit of the temporal support; % ls = the superior limit of the temporal support; % k = the index from delta(n-k) if (nargin~=3) (nargout>) error(check the input/output arguments!') end if li>=ls error('invalid temporal support!') end if (k<li) (k>ls) error('index outside the temporal support!') end L = ls-li+; y = zeros(,l); y(k-li+) = ; n = li:ls; Observations: The rules for proper function definition and usage are listed here:
3 The function s name should also be the name of the file containing that function. Do NOT use names that are already used for Matlab toolbox functions! The functions will be called from other Matlab scripts saved in the same current directory! A function will NOT be executed as a normal script by pushing the Run button! Examples: Define and plot the following discrete time sequences:. x[ [. x [ n ] 0,5 [ n 3], for 0 n 0. [y, = impuls(-0,0,0) figure, stem(n,y), grid [y, = impuls(-0,0,3); figure, stem(n,0.5*y), grid The unit step sequence, n 0 u [ (.4) 0, n 0 Delayed unit step sequence:, n n0 u [ n n0] (.5) 0, n n0 A MATLAB function can be also created to define the unit step sequences: function [y, = treapta(li,ls,k) %TREAPTA unit step sequence in discrete time, %defined on a finite temporal support % Output parameters: % y = u(n-k) (line vector) for the support li:ls % n = the temporal support li:ls % Input parameters: % li = the inferior limit of the temporal support; % ls = the superior limit of the temporal support; % k = the index from u(n-k) if (nargin~=3) (nargout>) 3
4 error(' Check the input/output arguments!!') end if li>=ls error(' Invalid temporal support! ') end if (k<li) (k>ls) error('index outside the temporal support!') end L=ls-li+; y=zeros(,l); y(k-li+:l)=; n=li:ls; Examples: Define and plot the following discrete time sequences:. x[ u[. x[ 0,7( un [ 3] un [ 3]), for 5 n 0. [y, = treapta(-5,0,0); figure, stem(n,y), grid [y, = treapta(-5,0,-3); [y, = treapta(-5,0,3); y=0.7*(y-y); figure, stem(n,y), grid E. Exercises: Define and plot the following discrete time sequences:. x n δnδn for 0 n 0. x n δn0.5δn 0.3δn δn for 0 n 0 3. x n un0.5un 4 0.5un 4 for 0 n 0 4. x n δn un 5 δn δn 9, for 0 n 0 5. x n for 0n0 6. x n lncos sin for 0 n 0 7. x n cos for 0n0 4
5 A discrete-time signal results from the sampling of a continuous signal using a sampling period of time denoted T. The samples stored in the vector that represents the discrete signal are the amplitude values of the continuous signal taken at multiples of the sampling period n T, n N A x () a t sn s nt t T s T s nt s -A A -A x( n) n For example, for a sinusoidal signal of frequency F the sampled signal is: s t A sinπ F t sn A sinπ F n T A sin π F F n By denoting the normalized frequency f, respectively the normalized angular frequency ω πf π results in: sn A sinπ f n A sinω n 5
6 Example:. Represent graphically using stem function a discrete signal obtained by sampling a sine wave of 300 Hz, total duration 0 ms and amplitude. The sampling frequency is Fs = 4kHz. How many samples does the resulting discrete signal has? F0 = 300; Fs = 4000; Tmax = 0^(-); % signal duration is 0 ms N = Tmax*Fs; % number of samples N=0ms*4kHz w0 = *pi*f0/fs; % normalized angular frequency n = 0:N-; x = *sin(w0*n); figure(), stem(n,x), grid. Represent graphically, using the plot function, the continuous signal obtained from the previous discrete one, through digital to analogue conversion (Fs = 4kHz). The representation will be done in absolute time (ms). Determine the period and non-normalized frequency of the analogue signal. F0 = 300; Fs = 4000; Tmax = 0^(-); % signal duration is 0 ms Ts = /Fs; t = 0:Ts:Tmax-Ts; xa = *sin(*pi*f0*t); figure(), plot(t,xa,'-o'), xlabel('t[ms]'), grid.3. Linear convolution of discrete-time signals Linear convolution of two discrete-time sequences x[ and x[ (assumed as infinite length sequences) is defined as: [ x [ x[ x[ k] x k x [ n k] (.6) In MATLAB, the sequences are arrays of finite length N starting at index. Therefore the above formula is changed to: N k0 x [ n ] x [ k ] x[ n k] (.7) 6
7 MATLAB function to implement convolution is: y=conv(x,x) returns in the vector y the result of linear convolution of the vectors x and x. The resulting vector length is equal to length of vector x plus length of vector x minus. Example: Compute and plot the linear convolution of the sequences x [ u[ u[ n 5] ( 0 n 0 ) and n [ (0,9 ( 0 0 x ) n ). x=treapta(0,0,0)-treapta(0,0,5); n=0:0; x=0.9.^n; x=conv(x,x); subplot(,,),stem(0:0,x),title( x ),grid subplot(,,),stem(n,x),title( x ),grid subplot(,,),stem(0:length(x)-,x),title( x ),grid x x x E. Exercises: Compute and plot the linear convolution of the following sequences:. x [ u[ n 5] u[ n 5] x [ 0 n for 0 n 0. x [ n ] sin0. n x [ [ n 5] for 0 n 0 3. x [ cos(0,5 n) n x [ ( ) for 0 n 0 7
8 .4. Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) of a sequence x [ is defined by: X j jn ( e ) x[ e (.8) n F where is the normalized angular frequency:. FS F is the un-normalized frequency (measured in Hz) and FS is the sampling frequency. F Also, the normalized frequency is: f. FS j The function X ( e ) is periodical of period, so it is sufficient to know the behavior in the interval [, ) (base interval). Because this function is defined over a continuous variable which can take an infinite number of values, it is not possible implementation on a computing machine. In order to achieve, however, a frequency analysis, it is used the Discrete Fourier Transform (DFT), computed by replacing over interval [ 0, ) into N uniformly distributed points: k k, with k 0,,, N. N Therefore, the Discrete Fourier Transform of a sequence x [ is defined by relation: j kn N Xk [ ] xne [ ] with k 0,,, N (.9) n The figure below shows the spectrum of a discrete-time signal representation based on the normalized angular frequency or normalized frequency and the correspondence with analog frequency. We also notice the correspondence between the DFT spectral components of index k and the spectrum represented in normalized angular frequency. 8
9 X a j S S S max Ω[rad/s] -Ωmax 0 Ωmax -Fmax 0 Fmax FS/ FS F[Hz] j X e -π -ωmax 0 ωmax π π fmax 0 fmax 0.5 F S F f F S f X k k 0,..., N k k N k 0 3 N/ N- In MATLAB the function used to compute the discrete Fourier transform is FFT function (Fast Fourier Transform) and it uses for DFT calculating a fast algorithm. Syntax: y = fft(x) for a vector x the result is the discrete Fourier transform (DFT) of vector x returned in a vector y having the same length to x. for a matrix x the result is a matrix y of the same size to x, the fft operation is applied to each column of matrix x. 9
10 y = fft(x,n) is the N-point fft, padded with zeros if x has less than N points and truncated if it has more. Examples: Compute the discrete Fourier transform of the following sequence: x [ u[ u[ n 0], for 0 n 0 Plot the magnitude, phase, real and imaginary parts for the computed Fourier transform. x=treapta(0,0,0)-treapta(0,0,0); X=fft(x); figure(),plot(x) // results a wrong graphical representation since X has complex values // the magnitude of Fourier transform can be represented using absolute value figure(),plot(abs(x)) // the length of computed Fourier transform is the same to length of vector x // for a better representation we will compute the Fourier transform in a large number of points (N = 5): X=fft(x,5); figure(3),plot(abs(x)),grid This representation corresponds to the frequency interval [ 0, ). Usually we want a symmetrical representation of the spectrum in the interval [, ). Since the discrete Fourier transform is periodical of period then the representation in interval [,0) corresponds to representation in interval [, ). It must therefore be done a reversal of the two halves of the vector X. This is done using the MATLAB function fftshift which swaps the left and right halves of vector X. This is useful for visualizing the Fourier transform with the zero-frequency component in the middle of the spectrum. 0
11 In addition, to have representation over the abscissa within [, ) interval, a linear step vector must be generated having a total number of elements equal to the length of the represented spectrum vector: w=-pi:*pi/5:pi-*pi/5; figure(4),plot(w,fftshift(abs(x))),grid // Figure 4 plots the amplitude characteristics and figure 5 plots the phase characteristics using the function angle(). figure(5),plot(w,fftshift(angle(x))),grid // Finally we represent real and imaginary parts of DFT figure(6) subplot(,,),plot(w,fftshift(real(x))),grid subplot(,,),plot(w,fftshift(imag(x))),grid
12 Comments: The representation of spectrums was performed according to the normalized angular frequency [, ). The values computed by X=fft(x,5) represent the spectrum k computed in k, with k 0,,, N. The number of points N to N calculate the FFT determines the spectral resolution. As N is bigger the j spectrum approximation of X ( e ) is better. If the x [ sequence length is less than N, the sequence is filled with zeros, the calculated spectrum representing the convolution between the spectrum of infinite length sequence function and the spectrum of the square gate sequence. The spectrum computed by fft can be represented also depending of: o DFT index: k 0,,, N. F o Normalized frequency: f, f [ 0.5,0.5). FS f = -0.5:/N:0.5-/N; o Un-normalized frequency F f F [Hz]. F[ F /, F /). S Es Es E3. Example:. a) Generate the discrete sequence s[ obtained by sampling with the sampling frequency FS 8kHz of the signal s() t sinπft 0 with frequency F0 500Hz and duration tmax 40ms. How many samples does the discrete sequence have? Fs = 8000; F0 = 500; t_max = 0.04; t = 0:/Fs:t_max-/Fs; s = sin(*pi*f0*t); No_samples = length(s); % or: No_samples = t_max*fs // we got the sequence sn by stepping with a stride T F for as long as t seconds. b) Compute the DFT of the sequence in N=56 points using fft and plot the amplitude spectrum (modulus of the DFT) as a function of k=0:n-.
13 N_fft = 56; S = fft(s,n_fft); k = 0:N_fft-; figure(),plot(k,abs(s)) k k // in figure() there are clearly visible Dirac impulses, witch corresponds theoretically to the Fourier transform of a sine wave: Fsinω tω i δω ω δω ω The values of normalized angular frequency for the Dirac impulses will be determined, knowing the representation corresponds to a period of 0, π. Subsequently, the indexes k and k for the DFT samples are: ω π k N ω πf π F F k N F F ω π k πω N π f π F F F k N F F 40 F 6 c) Plot the amplitude spectrum as function of the normalized angular frequency [, ). w = -pi: *pi/n_fft :pi-*pi/n_fft; figure(),plot(w,fftshift(abs(s))),grid // figure() represents the amplitude spectrum for the base period π, π. It can be verified (using Zoom in) that the normalized angular frequency ω πf /F 0.39 has the same value in the spectrum. 3
14 d) Plot the amplitude spectrum as function of the normalized frequency [ 0.5,0.5) f. f = -0.5: /N_fft :0.5-/N_fft; % or: f = w/(*pi) figure(3),plot(f,fftshift(abs(s))),grid // in figure(3), the amplitude spectrum is represented as a function of the normalized frequency f, and so the Dirac pulses correspond to the value f e) Plot the amplitude spectrum as function of the un-normalized frequency [Hz]. 4
15 F = -Fs/: Fs/N_fft :Fs/-Fs/N_fft; %sau:f=w/(*pi)*fs figure(4),plot(f,fftshift(abs(s))),grid // in figure(4), the amplitude spectrum of the sine wave is represented directly as a function of un-normalized frequency and so, the unit impulses stand straight on the value F, the sinusoidal signal frequency. f) Plot the amplitude and the phase spectrum as function of the normalized frequency on the same figure, using subplot. figure(5),subplot(),plot(f,fftshift(abs(s))),grid subplot(),plot(f,fftshift(angle(s))),grid 5
16 g) Plot the real and the imaginary part of the DFT as function of the normalized frequency on the same figure, using subplot. figure(6),subplot(),plot(f,fftshift(real(s))),grid subplot(),plot(f,fftshift(imag(s))),grid Each spectrum will be represented on a separate figure (use the figure() function). The plot will contain the functions: grid, title and xlabel.. For the program from the previous exercise, modify the following parameters and explain the changes that occur in the spectrum representation. a) The signal s frequency F0 00Hz. b) The number of points of the DFT N=04 (for the initial signal with F0 500Hz ). 6
LAB 2: DTFT, DFT, and DFT Spectral Analysis Summer 2011
University of Illinois at Urbana-Champaign Department of Electrical and Computer Engineering ECE 311: Digital Signal Processing Lab Chandra Radhakrishnan Peter Kairouz LAB 2: DTFT, DFT, and DFT Spectral
More informationDigital Signal Processing: Signal Transforms
Digital Signal Processing: Signal Transforms Aishy Amer, Mohammed Ghazal January 19, 1 Instructions: 1. This tutorial introduces frequency analysis in Matlab using the Fourier and z transforms.. More Matlab
More informationCE 513: STATISTICAL METHODS
28-8-217/CE 68 CE 513: STATISTICAL METHODS IN CIVIL ENGINEERING Lecture: Introduction to Fourier transforms Dr. Budhaditya Hazra Room: N-37 Department of Civil Engineering 1 Fourier Analysis Fourier Series
More informationDSP Laboratory (EELE 4110) Lab#5 DTFS & DTFT
Islamic University of Gaza Faculty of Engineering Electrical Engineering Department EG.MOHAMMED ELASMER Spring-22 DSP Laboratory (EELE 4) Lab#5 DTFS & DTFT Discrete-Time Fourier Series (DTFS) The discrete-time
More informationDigital Signal Processing Lab 3: Discrete Fourier Transform
Digital Signal Processing Lab 3: Discrete Fourier Transform Discrete Time Fourier Transform (DTFT) The discrete-time Fourier transform (DTFT) of a sequence x[n] is given by (3.1) which is a continuous
More informationLecture 10. Digital Signal Processing. Chapter 7. Discrete Fourier transform DFT. Mikael Swartling Nedelko Grbic Bengt Mandersson. rev.
Lecture 10 Digital Signal Processing Chapter 7 Discrete Fourier transform DFT Mikael Swartling Nedelko Grbic Bengt Mandersson rev. 016 Department of Electrical and Information Technology Lund University
More informationDefinition. A signal is a sequence of numbers. sequence is also referred to as being in l 1 (Z), or just in l 1. A sequence {x(n)} satisfying
Signals and Systems. Definition. A signal is a sequence of numbers {x(n)} n Z satisfying n Z x(n)
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 4 Digital Signal Processing Pro. Mark Fowler ote Set # Using the DFT or Spectral Analysis o Signals Reading Assignment: Sect. 7.4 o Proakis & Manolakis Ch. 6 o Porat s Book /9 Goal o Practical Spectral
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:30-15:45 CBC C222 Lecture 02 DSP Fundamentals 14/01/21 http://www.ee.unlv.edu/~b1morris/ee482/
More informationSummary of lecture 1. E x = E x =T. X T (e i!t ) which motivates us to define the energy spectrum Φ xx (!) = jx (i!)j 2 Z 1 Z =T. 2 d!
Summary of lecture I Continuous time: FS X FS [n] for periodic signals, FT X (i!) for non-periodic signals. II Discrete time: DTFT X T (e i!t ) III Poisson s summation formula: describes the relationship
More informationHW13 Solutions. Pr (a) The DTFT of c[n] is. C(e jω ) = 0.5 m e jωm e jω + 1
HW3 Solutions Pr..8 (a) The DTFT of c[n] is C(e jω ) = = =.5 n e jωn + n=.5e jω + n= m=.5 n e jωn.5 m e jωm.5e jω +.5e jω.75 =.5 cos(ω) }{{}.5e jω /(.5e jω ) C(e jω ) is the power spectral density. (b)
More informationOverview of Discrete-Time Fourier Transform Topics Handy Equations Handy Limits Orthogonality Defined orthogonal
Overview of Discrete-Time Fourier Transform Topics Handy equations and its Definition Low- and high- discrete-time frequencies Convergence issues DTFT of complex and real sinusoids Relationship to LTI
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding Fourier Series & Transform Summary x[n] = X[k] = 1 N k= n= X[k]e jkω
More informationFast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding
Fast Fourier Transform Discrete-time windowing Discrete Fourier Transform Relationship to DTFT Relationship to DTFS Zero padding J. McNames Portland State University ECE 223 FFT Ver. 1.03 1 Fourier Series
More informationDigital Signal Processing Chapter 10. Fourier Analysis of Discrete- Time Signals and Systems CHI. CES Engineering. Prof. Yasser Mostafa Kadah
Digital Signal Processing Chapter 10 Fourier Analysis of Discrete- Time Signals and Systems Prof. Yasser Mostafa Kadah CHI CES Engineering Discrete-Time Fourier Transform Sampled time domain signal has
More informationIn this Lecture. Frequency domain analysis
In this Lecture Frequency domain analysis Introduction In most cases we want to know the frequency content of our signal Why? Most popular analysis in frequency domain is based on work of Joseph Fourier
More informationIntroduction to DSP Time Domain Representation of Signals and Systems
Introduction to DSP Time Domain Representation of Signals and Systems Dr. Waleed Al-Hanafy waleed alhanafy@yahoo.com Faculty of Electronic Engineering, Menoufia Univ., Egypt Digital Signal Processing (ECE407)
More informationDiscrete Time Signals and Systems Time-frequency Analysis. Gloria Menegaz
Discrete Time Signals and Systems Time-frequency Analysis Gloria Menegaz Time-frequency Analysis Fourier transform (1D and 2D) Reference textbook: Discrete time signal processing, A.W. Oppenheim and R.W.
More informationChapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum
Chapter 4 Discrete Fourier Transform (DFT) And Signal Spectrum CEN352, DR. Nassim Ammour, King Saud University 1 Fourier Transform History Born 21 March 1768 ( Auxerre ). Died 16 May 1830 ( Paris ) French
More informationDiscrete Fourier transform (DFT)
Discrete Fourier transform (DFT) Signal Processing 2008/9 LEA Instituto Superior Técnico Signal Processing LEA (IST) Discrete Fourier transform 1 / 34 Periodic signals Consider a periodic signal x[n] with
More informationFFT Octave Codes (1B) Young Won Lim 7/6/17
FFT Octave Codes (1B) Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More informationAssignment 2. Signal Processing and Speech Communication Lab. Graz University of Technology
Signal Processing and Speech Communication Lab. Graz University of Technology Assignment 2 This homework has to be submitted via e-mail to the address hw1.spsc@tugraz.at not later than 25.5.2016. Let the
More informationDFT Octave Codes (0B) Young Won Lim 4/15/17
Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationDiscrete Fourier Transform
Discrete Fourier Transform Valentina Hubeika, Jan Černocký DCGM FIT BUT Brno, {ihubeika,cernocky}@fit.vutbr.cz Diskrete Fourier transform (DFT) We have just one problem with DFS that needs to be solved.
More informationLab 4: Introduction to Signal Processing: Fourier Transform
Lab 4: Introduction to Signal Processing: Fourier Transform This laboratory requires the following equipment: Matlab The laboratory duration is approximately 3 hours. Although this laboratory is not graded,
More information6.003: Signal Processing
6.003: Signal Processing Discrete Fourier Transform Discrete Fourier Transform (DFT) Relations to Discrete-Time Fourier Transform (DTFT) Relations to Discrete-Time Fourier Series (DTFS) October 16, 2018
More informationMultimedia Signals and Systems - Audio and Video. Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2
Multimedia Signals and Systems - Audio and Video Signal, Image, Video Processing Review-Introduction, MP3 and MPEG2 Kunio Takaya Electrical and Computer Engineering University of Saskatchewan December
More informationINFE 5201 SIGNALS AND SYSTEMS
INFE 50 SIGNALS AND SYSTEMS Assignment : Introduction to MATLAB Name, Class&Student ID Aim. To give student an introduction to basic MATLAB concepts. You are required to produce basic program, learn basic
More informationDiscrete Time Fourier Transform (DTFT)
Discrete Time Fourier Transform (DTFT) 1 Discrete Time Fourier Transform (DTFT) The DTFT is the Fourier transform of choice for analyzing infinite-length signals and systems Useful for conceptual, pencil-and-paper
More informationDOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS
DOING PHYSICS WITH MATLAB FOURIER ANALYSIS FOURIER TRANSFORMS Ian Cooper School of Physics, University of Sydney ian.cooper@sydney.edu.au DOWNLOAD DIRECTORY FOR MATLAB SCRIPTS maths_ft_01.m mscript used
More informationBME 50500: Image and Signal Processing in Biomedicine. Lecture 2: Discrete Fourier Transform CCNY
1 Lucas Parra, CCNY BME 50500: Image and Signal Processing in Biomedicine Lecture 2: Discrete Fourier Transform Lucas C. Parra Biomedical Engineering Department CCNY http://bme.ccny.cuny.edu/faculty/parra/teaching/signal-and-image/
More information7.16 Discrete Fourier Transform
38 Signals, Systems, Transforms and Digital Signal Processing with MATLAB i.e. F ( e jω) = F [f[n]] is periodic with period 2π and its base period is given by Example 7.17 Let x[n] = 1. We have Π B (Ω)
More informationExercises in Digital Signal Processing
Exercises in Digital Signal Processing Ivan W. Selesnick September, 5 Contents The Discrete Fourier Transform The Fast Fourier Transform 8 3 Filters and Review 4 Linear-Phase FIR Digital Filters 5 5 Windows
More informationEngineering Geodesy I. Exercise 3: Monitoring of a Bridge Determination of the Eigenfrequencies
Engineering Geodesy I Exercise 3: Monitoring of a Bridge Determination of the Eigenfrequencies Prof. Dr. H. Ingensand Geodetic Metrology and Engineering Geodesy 29.11.2010 Model Analyses of the Bridge
More informationFundamentals of the DFT (fft) Algorithms
Fundamentals of the DFT (fft) Algorithms D. Sundararajan November 6, 9 Contents 1 The PM DIF DFT Algorithm 1.1 Half-wave symmetry of periodic waveforms.............. 1. The DFT definition and the half-wave
More information8/19/16. Fourier Analysis. Fourier analysis: the dial tone phone. Fourier analysis: the dial tone phone
Patrice Koehl Department of Biological Sciences National University of Singapore http://www.cs.ucdavis.edu/~koehl/teaching/bl5229 koehl@cs.ucdavis.edu Fourier analysis: the dial tone phone We use Fourier
More informationSolutions - Homework # 3
ECE-34: Signals and Systems Summer 23 PROBLEM One period of the DTFS coefficients is given by: X[] = (/3) 2, 8. Solutions - Homewor # 3 a) What is the fundamental period 'N' of the time-domain signal x[n]?
More informationsinc function T=1 sec T=2 sec angle(f(w)) angle(f(w))
T=1 sec sinc function 3 angle(f(w)) T=2 sec angle(f(w)) 1 A quick script to plot mag & phase in MATLAB w=0:0.2:50; Real exponential func b=5; Fourier transform (filter) F=1.0./(b+j*w); subplot(211), plot(w,
More informationENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM. Dr. Lim Chee Chin
ENT 315 Medical Signal Processing CHAPTER 2 DISCRETE FOURIER TRANSFORM Dr. Lim Chee Chin Outline Introduction Discrete Fourier Series Properties of Discrete Fourier Series Time domain aliasing due to frequency
More information!Sketch f(t) over one period. Show that the Fourier Series for f(t) is as given below. What is θ 1?
Second Year Engineering Mathematics Laboratory Michaelmas Term 998 -M L G Oldfield 30 September, 999 Exercise : Fourier Series & Transforms Revision 4 Answer all parts of Section A and B which are marked
More informationNov EXAM INFO DB Victor Phillip Dahdaleh Building (DB) - TEL building
ESSE 4020 / ESS 5020 Time Series and Spectral Analysis Nov 21 2016 EXAM INFO Sun, 11 Dec 2016 19:00-22:00 DB 0014 - Victor Phillip Dahdaleh Building (DB) - TEL building Fourier series and Spectral Analysis,
More informationDepartment of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions
Problem 1 Department of Electrical and Computer Engineering Digital Speech Processing Homework No. 6 Solutions The complex cepstrum, ˆx[n], of a sequence x[n] is the inverse Fourier transform of the complex
More informationDigital Signal Processing, Lecture 2 Frequency description continued, DFT
Outline cture 2 2 Digital Signal Processing, cture 2 Frequency description continued, DFT Thomas Schön Division of Automatic Control Department of Electrical Engineering Linköping i University it E-mail:
More informationDiscrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section The (DT) Fourier transform (or spectrum) of x[n] is
Discrete-time Fourier transform (DTFT) representation of DT aperiodic signals Section 5. 3 The (DT) Fourier transform (or spectrum) of x[n] is X ( e jω) = n= x[n]e jωn x[n] can be reconstructed from its
More informationEE482: Digital Signal Processing Applications
Professor Brendan Morris, SEB 3216, brendan.morris@unlv.edu EE482: Digital Signal Processing Applications Spring 2014 TTh 14:305:45 CBC C222 Lecture 8 Frequency Analysis 14/02/18 http://www.ee.unlv.edu/~b1morris/ee482/
More informationDiscrete-Time Fourier Transform
Discrete-Time Fourier Transform Chapter Intended Learning Outcomes: (i) (ii) (iii) Represent discrete-time signals using discrete-time Fourier transform Understand the properties of discrete-time Fourier
More informationFourier analysis of discrete-time signals. (Lathi Chapt. 10 and these slides)
Fourier analysis of discrete-time signals (Lathi Chapt. 10 and these slides) Towards the discrete-time Fourier transform How we will get there? Periodic discrete-time signal representation by Discrete-time
More informationThe Discrete Fourier Transform
In [ ]: cd matlab pwd The Discrete Fourier Transform Scope and Background Reading This session introduces the z-transform which is used in the analysis of discrete time systems. As for the Fourier and
More informationDiscrete Time Fourier Transform (DTFT) Digital Signal Processing, 2011 Robi Polikar, Rowan University
Discrete Time Fourier Transform (DTFT) Digital Signal Processing, 2 Robi Polikar, Rowan University Sinusoids & Exponentials Signals Phasors Frequency Impulse, step, rectangular Characterization Power /
More informationGeorge Mason University ECE 201: Introduction to Signal Analysis Spring 2017
Assigned: March 20, 2017 Due Date: Week of April 03, 2017 George Mason University ECE 201: Introduction to Signal Analysis Spring 2017 Laboratory Project #6 Due Date Your lab report must be submitted on
More informationEE-210. Signals and Systems Homework 7 Solutions
EE-20. Signals and Systems Homework 7 Solutions Spring 200 Exercise Due Date th May. Problems Q Let H be the causal system described by the difference equation w[n] = 7 w[n ] 2 2 w[n 2] + x[n ] x[n 2]
More informationCh.11 The Discrete-Time Fourier Transform (DTFT)
EE2S11 Signals and Systems, part 2 Ch.11 The Discrete-Time Fourier Transform (DTFT Contents definition of the DTFT relation to the -transform, region of convergence, stability frequency plots convolution
More informationEEO 401 Digital Signal Processing Prof. Mark Fowler
EEO 401 Digital Signal Processing Prof. Mark Fowler Note Set #21 Using the DFT to Implement FIR Filters Reading Assignment: Sect. 7.3 of Proakis & Manolakis Motivation: DTFT View of Filtering There are
More informationVII. Discrete Fourier Transform (DFT) Chapter-8. A. Modulo Arithmetic. (n) N is n modulo N, n is an integer variable.
1 VII. Discrete Fourier Transform (DFT) Chapter-8 A. Modulo Arithmetic (n) N is n modulo N, n is an integer variable. (n) N = n m N 0 n m N N-1, pick m Ex. (k) 4 W N = e -j2π/n 2 Note that W N k = 0 but
More informationFOURIER TRANSFORM AND
Version: 11 THE DISCRETE TEX d: Oct. 23, 2013 FOURIER TRANSFORM AND THE FFT PREVIEW Classical numerical analysis techniques depend largely on polynomial approximation of functions for differentiation,
More informationDiscrete Fourier Transform
Discrete Fourier Transform Virtually all practical signals have finite length (e.g., sensor data, audio records, digital images, stock values, etc). Rather than considering such signals to be zero-padded
More informationAspects of Continuous- and Discrete-Time Signals and Systems
Aspects of Continuous- and Discrete-Time Signals and Systems C.S. Ramalingam Department of Electrical Engineering IIT Madras C.S. Ramalingam (EE Dept., IIT Madras) Networks and Systems 1 / 45 Scaling the
More informationDFT-Based FIR Filtering. See Porat s Book: 4.7, 5.6
DFT-Based FIR Filtering See Porat s Book: 4.7, 5.6 1 Motivation: DTFT View of Filtering There are two views of filtering: * Time Domain * Frequency Domain x[ X f ( θ ) h[ H f ( θ ) Y y[ = h[ * x[ f ( θ
More information! Circular Convolution. " Linear convolution with circular convolution. ! Discrete Fourier Transform. " Linear convolution through circular
Previously ESE 531: Digital Signal Processing Lec 22: April 18, 2017 Fast Fourier Transform (con t)! Circular Convolution " Linear convolution with circular convolution! Discrete Fourier Transform " Linear
More informationLecture 19: Discrete Fourier Series
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept. of Electrical Engineering Lecture 19: Discrete Fourier Series Dec 5, 2001 Prof: J. Bilmes TA: Mingzhou
More informationChap 2. Discrete-Time Signals and Systems
Digital Signal Processing Chap 2. Discrete-Time Signals and Systems Chang-Su Kim Discrete-Time Signals CT Signal DT Signal Representation 0 4 1 1 1 2 3 Functional representation 1, n 1,3 x[ n] 4, n 2 0,
More informationReview of Discrete-Time System
Review of Discrete-Time System Electrical & Computer Engineering University of Maryland, College Park Acknowledgment: ENEE630 slides were based on class notes developed by Profs. K.J. Ray Liu and Min Wu.
More informationUniversiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN
Universiti Malaysia Perlis EKT430: DIGITAL SIGNAL PROCESSING LAB ASSIGNMENT 3: DISCRETE TIME SYSTEM IN TIME DOMAIN Pusat Pengajian Kejuruteraan Komputer Dan Perhubungan Universiti Malaysia Perlis Discrete-Time
More informationMATLAB and Mathematical Introduction Will be discussed in class on 1/24/11
MATLAB and Mathematical Introduction Will be discussed in class on 1/24/11 GEOP 523; Theoretical Seismology January 17, 2011 Much of our work in this class will be done using MATLAB. The goal of this exercise
More informationDigital Filters Ying Sun
Digital Filters Ying Sun Digital filters Finite impulse response (FIR filter: h[n] has a finite numbers of terms. Infinite impulse response (IIR filter: h[n] has infinite numbers of terms. Causal filter:
More informationE2.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 informationEEL3135: 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 informationLABORATORY 3 FINITE IMPULSE RESPONSE FILTERS
LABORATORY 3 FINITE IMPULSE RESPONSE FILTERS 3.. Introduction A digital filter is a discrete system, used with the purpose of changing the amplitude and/or phase spectrum of a signal. The systems (filters)
More informationLaboratory handout 5 Mode shapes and resonance
laboratory handouts, me 34 82 Laboratory handout 5 Mode shapes and resonance In this handout, material and assignments marked as optional can be skipped when preparing for the lab, but may provide a useful
More informationDiscrete-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 informationThe Z-Transform. For a phasor: X(k) = e jωk. We have previously derived: Y = H(z)X
The Z-Transform For a phasor: X(k) = e jωk We have previously derived: Y = H(z)X That is, the output of the filter (Y(k)) is derived by multiplying the input signal (X(k)) by the transfer function (H(z)).
More informationLab 4: Quantization, Oversampling, and Noise Shaping
Lab 4: Quantization, Oversampling, and Noise Shaping Due Friday 04/21/17 Overview: This assignment should be completed with your assigned lab partner(s). Each group must turn in a report composed using
More information! Introduction. ! Discrete Time Signals & Systems. ! Z-Transform. ! Inverse Z-Transform. ! Sampling of Continuous Time Signals
ESE 531: Digital Signal Processing Lec 25: April 24, 2018 Review Course Content! Introduction! Discrete Time Signals & Systems! Discrete Time Fourier Transform! Z-Transform! Inverse Z-Transform! Sampling
More informationLecture 5. The Digital Fourier Transform. (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith)
Lecture 5 The Digital Fourier Transform (Based, in part, on The Scientist and Engineer's Guide to Digital Signal Processing by Steven Smith) 1 -. 8 -. 6 -. 4 -. 2-1 -. 8 -. 6 -. 4 -. 2 -. 2. 4. 6. 8 1
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More information6.003 Signal Processing
6.003 Signal Processing Week 6, Lecture A: The Discrete Fourier Transform (DFT) Adam Hartz hz@mit.edu What is 6.003? What is a signal? Abstractly, a signal is a function that conveys information Signal
More informationECE-314 Fall 2012 Review Questions for Midterm Examination II
ECE-314 Fall 2012 Review Questions for Midterm Examination II First, make sure you study all the problems and their solutions from homework sets 4-7. Then work on the following additional problems. Problem
More informationEvaluating Fourier Transforms with MATLAB
ECE 460 Introduction to Communication Systems MATLAB Tutorial #2 Evaluating Fourier Transforms with MATLAB In class we study the analytic approach for determining the Fourier transform of a continuous
More informationThe Discrete-Time Fourier
Chapter 3 The Discrete-Time Fourier Transform 清大電機系林嘉文 cwlin@ee.nthu.edu.tw 03-5731152 Original PowerPoint slides prepared by S. K. Mitra 3-1-1 Continuous-Time Fourier Transform Definition The CTFT of
More informationFinal Exam January 31, Solutions
Final Exam January 31, 014 Signals & Systems (151-0575-01) Prof. R. D Andrea & P. Reist Solutions Exam Duration: Number of Problems: Total Points: Permitted aids: Important: 150 minutes 7 problems 50 points
More informationThe Fourier Transform (and more )
The Fourier Transform (and more ) imrod Peleg ov. 5 Outline Introduce Fourier series and transforms Introduce Discrete Time Fourier Transforms, (DTFT) Introduce Discrete Fourier Transforms (DFT) Consider
More informationFall 2011, EE123 Digital Signal Processing
Lecture 6 Miki Lustig, UCB September 11, 2012 Miki Lustig, UCB DFT and Sampling the DTFT X (e jω ) = e j4ω sin2 (5ω/2) sin 2 (ω/2) 5 x[n] 25 X(e jω ) 4 20 3 15 2 1 0 10 5 1 0 5 10 15 n 0 0 2 4 6 ω 5 reconstructed
More informationGRAPHIC WEEK 7 DR. USMAN ULLAH SHEIKH DR. MUSA MOHD MOKJI DR. MICHAEL TAN LOONG PENG DR. AMIRJAN NAWABJAN DR. MOHD ADIB SARIJARI
GRAPHIC SKEE1022 SCIENTIFIC PROGRAMMING WEEK 7 DR. USMAN ULLAH SHEIKH DR. MUSA MOHD MOKJI DR. MICHAEL TAN LOONG PENG DR. AMIRJAN NAWABJAN DR. MOHD ADIB SARIJARI 1 OBJECTIVE 2-dimensional line plot function
More informationSignals and Systems. Problem Set: The z-transform and DT Fourier Transform
Signals and Systems Problem Set: The z-transform and DT Fourier Transform Updated: October 9, 7 Problem Set Problem - Transfer functions in MATLAB A discrete-time, causal LTI system is described by the
More informationInformation and Communications Security: Encryption and Information Hiding
Short Course on Information and Communications Security: Encryption and Information Hiding Tuesday, 10 March Friday, 13 March, 2015 Lecture 5: Signal Analysis Contents The complex exponential The complex
More informationCHAPTER 7. The Discrete Fourier Transform 436
CHAPTER 7. The Discrete Fourier Transform 36 hfa figconfg( P7a, long ); subplot() stem(k,abs(ck), filled );hold on stem(k,abs(ck_approx), filled, color, red ); xlabel( k, fontsize,lfs) title( Magnitude
More informationE : Lecture 1 Introduction
E85.2607: Lecture 1 Introduction 1 Administrivia 2 DSP review 3 Fun with Matlab E85.2607: Lecture 1 Introduction 2010-01-21 1 / 24 Course overview Advanced Digital Signal Theory Design, analysis, and implementation
More information(i) Represent continuous-time periodic signals using Fourier series
Fourier Series Chapter Intended Learning Outcomes: (i) Represent continuous-time periodic signals using Fourier series (ii) (iii) Understand the properties of Fourier series Understand the relationship
More informationLinear Convolution Using FFT
Linear Convolution Using FFT Another useful property is that we can perform circular convolution and see how many points remain the same as those of linear convolution. When P < L and an L-point circular
More informationLAB # 5 HANDOUT. »»» The N-point DFT is converted into two DFTs each of N/2 points. N = -W N Then, the following formulas must be used. = k=0,...
EEE4 Lab Handout. FAST FOURIER TRANSFORM LAB # 5 HANDOUT Data Sequence A = x, x, x, x3, x4, x5, x6, x7»»» The N-point DFT is converted into two DFTs each of N/ points. x, x, x4, x6 x, x3, x5, x7»»» N =e
More informationCorrelation, discrete Fourier transforms and the power spectral density
Correlation, discrete Fourier transforms and the power spectral density visuals to accompany lectures, notes and m-files by Tak Igusa tigusa@jhu.edu Department of Civil Engineering Johns Hopkins University
More informationECSE 512 Digital Signal Processing I Fall 2010 FINAL EXAMINATION
FINAL EXAMINATION 9:00 am 12:00 pm, December 20, 2010 Duration: 180 minutes Examiner: Prof. M. Vu Assoc. Examiner: Prof. B. Champagne There are 6 questions for a total of 120 points. This is a closed book
More informationEE538 Final Exam Fall :20 pm -5:20 pm PHYS 223 Dec. 17, Cover Sheet
EE538 Final Exam Fall 005 3:0 pm -5:0 pm PHYS 3 Dec. 17, 005 Cover Sheet Test Duration: 10 minutes. Open Book but Closed Notes. Calculators ARE allowed!! This test contains five problems. Each of the five
More informationDFT and Matlab with some examples.
DFT and Matlab with some examples 1 www.icrf.nl Fourier transform Fourier transform is defined as: X + jωt = x( t e dt ( ω ) ) with ω= 2 π f Rad/s And x(t) a signal in the time domain. www.icrf.nl 2 Fourier
More informationDigital Signal Processing I Final Exam Fall 2008 ECE Dec Cover Sheet
Digital Signal Processing I Final Exam Fall 8 ECE538 7 Dec.. 8 Cover Sheet Test Duration: minutes. Open Book but Closed Notes. Calculators NOT allowed. This test contains FIVE problems. All work should
More informationFFT, total energy, and energy spectral density computations in MATLAB Aaron Scher
FFT, total energy, and energy spectral density computations in MATLAB Aaron Scher Everything presented here is specifically focused on non-periodic signals with finite energy (also called energy signals
More informationRandom signals II. ÚPGM FIT VUT Brno,
Random signals II. Jan Černocký ÚPGM FIT VUT Brno, cernocky@fit.vutbr.cz 1 Temporal estimate of autocorrelation coefficients for ergodic discrete-time random process. ˆR[k] = 1 N N 1 n=0 x[n]x[n + k],
More informationIntroduction to DFT. Deployment of Telecommunication Infrastructures. Azadeh Faridi DTIC UPF, Spring 2009
Introduction to DFT Deployment of Telecommunication Infrastructures Azadeh Faridi DTIC UPF, Spring 2009 1 Review of Fourier Transform Many signals can be represented by a fourier integral of the following
More informationDiscrete-Time Signals and Systems. The z-transform and Its Application. The Direct z-transform. Region of Convergence. Reference: Sections
Discrete-Time Signals and Systems The z-transform and Its Application Dr. Deepa Kundur University of Toronto Reference: Sections 3. - 3.4 of John G. Proakis and Dimitris G. Manolakis, Digital Signal Processing:
More informationZ-TRANSFORMS. Solution: Using the definition (5.1.2), we find: for case (b). y(n)= h(n) x(n) Y(z)= H(z)X(z) (convolution) (5.1.
84 5. Z-TRANSFORMS 5 z-transforms Solution: Using the definition (5..2), we find: for case (a), and H(z) h 0 + h z + h 2 z 2 + h 3 z 3 2 + 3z + 5z 2 + 2z 3 H(z) h 0 + h z + h 2 z 2 + h 3 z 3 + h 4 z 4
More information