Windowing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples
|
|
- Sybil Tate
- 6 years ago
- Views:
Transcription
1 ing Overview Relevance Main lobe/side lobe tradeoff Popular windows Examples ing In practice, we cannot observe a signal x(n) for n = to n = Thus we must truncate, or window, the signal: x(n) w(n) ing a DT signal has a similar effect to windowing a CT signal In the frequency domain Pure tones (sinusoids) change from impulses to the DTFT of the window function The spectrum is blurred These are both undesirable effects It is crucial that you understand them Misunderstanding them will lead to wrong conclusions about spectral content J. McNames Portland State University ECE 38/638 ing Ver.. J. McNames Portland State University ECE 38/638 ing Ver.. DFT Interpretation: ing If x(n) is infinite duration and w(n) is a finite duration window, say { n<n w(n) = otherwise Then the product x(n)w(n) is a discrete-time product and we know x(n)w(n) FT X(e ju )W (e j(ω u) )du π π In words, the sampled signal s spectrum is equal to the convolution of the signal s spectrum X(e jω ) and the window s spectrum W (e jω ) This will be very important when we discuss spectral estimation Example : ing Consider a pure sinusoidal tone x(n) =cos(ω o n). Find the Fourier transform of x(n) w(n) where w(n) is a rectangular window. Plot the true transform and estimated transform for ω o =.3π radian per sample and N = 6,, and. e jω on π l= δ(ω ω o πl) w(n) sin(ωn/)) sin(ω/) e jω(n )/ J. McNames Portland State University ECE 38/638 ing Ver.. 3 J. McNames Portland State University ECE 38/638 ing Ver.. 4
2 x(n) w(n) Example : N =6 ed Cosine N= Time (n) x(n) w(n) Example : N = ed Cosine N= Time (n) J. McNames Portland State University ECE 38/638 ing Ver.. J. McNames Portland State University ECE 38/638 ing Ver.. 6 x(n) w(n) Example : N = ed Cosine N= Time (n) x(n) w(n) Example : N = ed Cosine N= Time (n) J. McNames Portland State University ECE 38/638 ing Ver.. 7 J. McNames Portland State University ECE 38/638 ing Ver.. 8
3 Example : MATLAB Code N = [6 ]; n = -:(max(n)+); nz = ^; % Number of zeros for padding k = (:nz/+); % Frequency indices w = *pi*(k-)/nz; % Frequencies (rads/sample) w = [-fliplr(w) w(:end)]; % Include negative frequencies wo =.3*pi; % Frequency of the sinusoid for cnt = :length(n), wn = (n>= & n<n(cnt)); x = cos(wo*n).*wn; X = fft(x,nz); Rx = abs(x(k)).^; Rx = [fliplr(rx) Rx(:end)]; % Include negative frequencies figure; subplot(3,,); h = stem(n,x, filled ); set(h(), MarkerFaceColor, b ); set(h(), MarkerSize,); xlim([min(n) max(n)]); ylim([-..]); xlabel( Time (n) ); ylabel( x(n) w(n) ); title(sprintf( ed Cosine N=%d,N(cnt))); Example : MATLAB Code Continued subplot(3,,); h = plot(w,rx, r, LineWidth,.6); ylim([ max(rx)*.]); hold on; h = plot(wo*[ -; -],[ ; ]*max(rx), g ); hold off; xlabel( ); ylabel( X(e^{j\omega}) * W(e^{j\omega}) ); subplot(3,,3); h = semilogy(w,rx, r, LineWidth,.6); ylim(max(rx)*[..]); hold on; h = plot(wo*[ -; -],[..; ]*max(rx), g ); hold off; xlabel( ); ylabel( X(e^{j\omega}) * W(e^{j\omega}) ); J. McNames Portland State University ECE 38/638 ing Ver.. 9 J. McNames Portland State University ECE 38/638 ing Ver.. ing π x(n)w(n) FT X(e ju )W (e j(ω u) )du π π ing in the time domain is equivalent to convolution in the frequency domain Would like window to be as close as a Dirac impulse as possible Length of window is constrained to N samples Key tradeoff: main lobe width an amplitude of side lobes Both can cause bias in the frequency domain There are many windows to chose from Rectangular window has smallest main lobe, but largest side lobes Two types of windows Fixed: defined only by the duration of the window, N Parametric: have parameters that control the tradeoff between main lobe width and side lobe amplitude Example : Fixed s Plot various fixed windows and their Fourier transform. Center the windows so that they have even symmetry and length N =samples. J. McNames Portland State University ECE 38/638 ing Ver.. J. McNames Portland State University ECE 38/638 ing Ver..
4 Example : Rectangular Rectangular Length:. 3 3 Example : Triangular Triangular Length: J. McNames Portland State University ECE 38/638 ing Ver.. 3 J. McNames Portland State University ECE 38/638 ing Ver.. 4 Example : Hamming Hamming Length: 3 3 Example : Hanning Hanning Length: J. McNames Portland State University ECE 38/638 ing Ver.. J. McNames Portland State University ECE 38/638 ing Ver.. 6
5 Example : Blackman Example : Blackman-Harris Blackman Length: BlackmanHarris Length: J. McNames Portland State University ECE 38/638 ing Ver.. 7 J. McNames Portland State University ECE 38/638 ing Ver.. 8 N = ; M = 48; n = -(N-)/:(N-)/; for c = :6, switch c, case, wn = rectwin(n); stw = Rectangular ; case, wn = triang(n); stw = Triangular ; case 3, wn = hamming(n); stw = Hamming ; case 4, wn = hanning(n); stw = Hanning ; case, wn = blackman(n); stw = Blackman ; case 6, wn = blackmanharris(n); stw = BlackmanHarris ; Example : MATLAB Code wn = wn*sqrt(n/sum(wn.^)); w = (:M-) *pi/(m/); W = exp(j*w*(n-)/).*fft(wn,m); W = real(w); id = [M/+:M :M/]; W = W(id); w = -(M-3)/:(M+)/; w = w*pi/(m/); Example : MATLAB Code J. McNames Portland State University ECE 38/638 ing Ver.. 9 J. McNames Portland State University ECE 38/638 ing Ver..
6 Example : MATLAB Code Continued figure; subplot(3,,); h = stem(n,wn); set(h(), MarkerFaceColor, b ); set(h(), MarkerSize,4); ylabel( ); title(sprintf( %s Length %d,stw,n)); xlim([-ceil(n/) ceil(n/)]); subplot(3,,); h = plot(w,w, r ); set(h, LineWidth,.); ylabel( W(e^{j \omega}) ); ylim([min(w) max(w)]); subplot(3,,3); h = semilogy(w,abs(w), r ); set(h, LineWidth,.); ylabel( W(e^{j \omega}) ); xlabel( \omega (rad/sec) ); ylim(n*[. ]); H(e jω ) Example : All No. Points: Rectangular Triangular Hamming Hanning Blackman Blackman Harris Frequency (normalized) J. McNames Portland State University ECE 38/638 ing Ver.. J. McNames Portland State University ECE 38/638 ing Ver.. Example : All Example : MATLAB Code H(e jω ) 4 No. Points: Rectangular Triangular Hamming Hanning Blackman Blackman Harris [hrc,w] = freqz(ones(n,)/n,,^); [htr,w] = freqz(triang(n)/sum(triang(n)),,^); [hhm,w] = freqz(hamming(n)/sum(hamming(n)),,^); [hhn,w] = freqz(hanning(n)/sum(hanning(n)),,^); [hbm,w] = freqz(blackman(n)/sum(blackman(n)),,^); [hbh,w] = freqz(blackmanharris(n)/sum(blackmanharris(n)),,^); f = w/(*pi); h = semilogy(f,abs(hrc),f,abs(htr),f,abs(hhm),f,abs(hhn),f,abs(hbm),f,abs(hbh)); set(h, LineWidth,.); ylim([e-6 ]); xlabel( Frequency (normalized) ); ylabel( H(e^{j\omega}) ); title(sprintf( No. Points:%d,wl)); legend( Rectangular, Triangular, Hamming, Hanning, Blackman, Blackman Harris ); Frequency (normalized) J. McNames Portland State University ECE 38/638 ing Ver.. 3 J. McNames Portland State University ECE 38/638 ing Ver.. 4
7 Example 3: Parametric s There are several parametric windows Many of which are included in MATLAB s signal processing toolbox ( help window) Popular choices include Kaiser: one parameter that controls tradeoff, sidelobes taper Dolph-Chebyshev Tukey (cosine-tapered) Gaussian Example 4: Parametric s Plot three parametric windows and their Fourier transform. Center the windows so that they have even symmetry and length N = samples. Pick a wide, uniform range of values for the parameter for each window. J. McNames Portland State University ECE 38/638 ing Ver.. J. McNames Portland State University ECE 38/638 ing Ver.. 6 Example 4: Kaiser Example 4: Tukey Kaiser Length:. 7. Tukey Length: J. McNames Portland State University ECE 38/638 ing Ver.. 7 J. McNames Portland State University ECE 38/638 ing Ver.. 8
8 Example 4: Dolph-Chebyshev Chebyshev Length: Example 4: Gaussian Gaussian Length: J. McNames Portland State University ECE 38/638 ing Ver.. 9 J. McNames Portland State University ECE 38/638 ing Ver.. 3 Example 4: MATLAB Code N = ; M = ^; np = ; WA = zeros(m,np); wa = zeros(n,np); n = -(N-)/:(N-)/; for c = :4, switch c, case, pr = linspace(,,np); stw = Kaiser ; case, pr = linspace(,,np); stw = Tukey ; case 3, pr = linspace(4,,np); stw = Chebyshev ; case 4, pr = linspace(,,np); stw = Gaussian ; Example 4: MATLAB Code Continued for c=:length(pr), switch c, case, wn = kaiser(n,pr(c)); case, wn = tukeywin(n,pr(c)); case 3, wn = chebwin(n,pr(c)); case 4, wn = gausswin(n,pr(c)); wn = wn*sqrt(n/sum(wn.^)); w = (:M-) *pi/(m/); W = exp(j*w*(n-)/).*fft(wn,m); W = real(w); id = [M/+:M :M/]; W = W(id); w = -(M-3)/:(M+)/; w = w*pi/(m/); wa(:,c) = wn; WA(:,c) = W; J. McNames Portland State University ECE 38/638 ing Ver.. 3 J. McNames Portland State University ECE 38/638 ing Ver.. 3
9 Example 4: MATLAB Code Continued figure; subplot(3,,); h = plot(n,wa); set(h, Marker,. ); set(h, MarkerSize,6); set(h, LineWidth,.8); ylabel( ); title(sprintf( %s Length:%d,stW,N)); xlim((n-)/*[- ]); ylim([.*max(wn)]); legend(numstr(pr )) subplot(3,,); h = plot(w,wa); set(h, LineWidth,.); ylabel( W(e^{j \omega}) ); ymn = min(min(wa)); ymx = max(max(wa)); yrg = ymx-ymn; ylim([ymn-.*yrg ymx+.*yrg]); AxisLines; Example 4: MATLAB Code Continued subplot(3,,3); h = semilogy(w,abs(wa)); set(h, LineWidth,.); ylabel( W(e^{j \omega}) ); xlabel( \omega (rad/sec) ); ymn = min(min(wa)); ymx = max(max(wa)); yrg = ymx-ymn; ylim([e-6.*ymx]); J. McNames Portland State University ECE 38/638 ing Ver.. 33 J. McNames Portland State University ECE 38/638 ing Ver.. 34 Parametric s Kaiser Tapered side lobes No intuition for parameter Tukey Tapered side lobes Parameter controls rate of taper Dolph-Chebyshev Flat side lobes (no taper) Parameter controls degree of taper (db) Gaussian Tapered side lobes Parameter controls width of main lobe Summary Choice of the window controls the tradeoff between resolution and sidelobe leakage Rectangular window has maximum resolution and sidelobe leakage Some windows have parameters that permit you to control the tradeoff between resolution and leakage Both cause the spectral estimate to be biased Best window depends on actual spectrum, usually the user picks Ultimately, the window shape is much less important than the duration of the window All windows converge to an impulse train in the limit as N There is a much larger gain in accuracy by increasing N than in picking the best window shape J. McNames Portland State University ECE 38/638 ing Ver.. 3 J. McNames Portland State University ECE 38/638 ing Ver.. 36
Fast 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 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 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 informationSpectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates
Spectrograms Overview Introduction and motivation Windowed estimates as filter banks Uncertainty principle Examples Other estimates J. McNames Portland State University ECE 3 Spectrograms Ver. 1.1 1 Introduction
More informationOverview of Sampling Topics
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationCore Concepts Review. Orthogonality of Complex Sinusoids Consider two (possibly non-harmonic) complex sinusoids
Overview of Continuous-Time Fourier Transform Topics Definition Compare & contrast with Laplace transform Conditions for existence Relationship to LTI systems Examples Ideal lowpass filters Relationship
More informationJ. McNames Portland State University ECE 223 Sampling Ver
Overview of Sampling Topics (Shannon) sampling theorem Impulse-train sampling Interpolation (continuous-time signal reconstruction) Aliasing Relationship of CTFT to DTFT DT processing of CT signals DT
More informationJ. McNames Portland State University ECE 223 DT Fourier Series Ver
Overview of DT Fourier Series Topics Orthogonality of DT exponential harmonics DT Fourier Series as a Design Task Picking the frequencies Picking the range Finding the coefficients Example J. McNames Portland
More informationIntroduction. Spectral Estimation Overview Periodogram Bias, variance, and distribution Blackman-Tukey Method Welch-Bartlett Method Others
Spectral Estimation Overview Periodogram Bias, variance, and distribution Blackman-Tukey Method Welch-Bartlett Method Others Introduction R x (e jω ) r x (l)e jωl l= Most stationary random processes have
More information! Spectral Analysis with DFT. ! Windowing. ! Effect of zero-padding. ! Time-dependent Fourier transform. " Aka short-time Fourier transform
Lecture Outline ESE 531: Digital Signal Processing Spectral Analysis with DFT Windowing Lec 24: April 18, 2019 Spectral Analysis Effect of zero-padding Time-dependent Fourier transform " Aka short-time
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 informationFourier Analysis of Signals Using the DFT
Fourier Analysis of Signals Using the DFT ECE 535 Lecture April 29, 23 Overview: Motivation Many applications require analyzing the frequency content of signals Speech processing study resonances of vocal
More informationLAB 6: FIR Filter Design 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 6: FIR Filter Design Summer 011
More informationBasic Design Approaches
(Classic) IIR filter design: Basic Design Approaches. Convert the digital filter specifications into an analog prototype lowpass filter specifications. Determine the analog lowpass filter transfer function
More informationDefinition of Discrete-Time Fourier Transform (DTFT)
Definition of Discrete-Time ourier Transform (DTT) {x[n]} = X(e jω ) + n= {X(e jω )} = x[n] x[n]e jωn Why use the above awkward notation for the transform? X(e jω )e jωn dω Answer: It is consistent with
More informationAssignment 4 Solutions Continuous-Time Fourier Transform
Assignment 4 Solutions Continuous-Time Fourier Transform ECE 3 Signals and Systems II Version 1.01 Spring 006 1. Properties of complex numbers. Let c 1 α 1 + jβ 1 and c α + jβ be two complex numbers. a.
More informationChirp Transform for FFT
Chirp Transform for FFT Since the FFT is an implementation of the DFT, it provides a frequency resolution of 2π/N, where N is the length of the input sequence. If this resolution is not sufficient in a
More informationLecture 14: Windowing
Lecture 14: Windowing ECE 401: Signal and Image Analysis University of Illinois 3/29/2017 1 DTFT Review 2 Windowing 3 Practical Windows Outline 1 DTFT Review 2 Windowing 3 Practical Windows DTFT Review
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 information(Refer Slide Time: 01:28 03:51 min)
Digital Signal Processing Prof. S. C. Dutta Roy Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture 40 FIR Design by Windowing This is the 40 th lecture and our topic for
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 information-Digital Signal Processing- FIR Filter Design. Lecture May-16
-Digital Signal Processing- FIR Filter Design Lecture-17 24-May-16 FIR Filter Design! FIR filters can also be designed from a frequency response specification.! The equivalent sampled impulse response
More informationPractical Spectral Estimation
Digital Signal Processing/F.G. Meyer Lecture 4 Copyright 2015 François G. Meyer. All Rights Reserved. Practical Spectral Estimation 1 Introduction The goal of spectral estimation is to estimate how the
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 informationContents. Digital Signal Processing, Part II: Power Spectrum Estimation
Contents Digital Signal Processing, Part II: Power Spectrum Estimation 5. Application of the FFT for 7. Parametric Spectrum Est. Filtering and Spectrum Estimation 7.1 ARMA-Models 5.1 Fast Convolution 7.2
More informationLAB 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 informationEDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT. October 19, 2016
EDISP (NWL3) (English) Digital Signal Processing DFT Windowing, FFT October 19, 2016 DFT resolution 1 N-point DFT frequency sampled at θ k = 2πk N, so the resolution is f s/n If we want more, we use N
More informationChange in Notation. e (i) (n) Note that this is inconsistent with the notation used earlier, c k+1x(n k) e (i) (n) x(n i) ˆx(n i) M
Overview of Linear Prediction Terms and definitions Nonstationary case Stationary case Forward linear prediction Backward linear prediction Stationary processes Exchange matrices Examples Properties Introduction
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 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 informationL6: Short-time Fourier analysis and synthesis
L6: Short-time Fourier analysis and synthesis Overview Analysis: Fourier-transform view Analysis: filtering view Synthesis: filter bank summation (FBS) method Synthesis: overlap-add (OLA) method STFT magnitude
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 informationProblem Set 9 Solutions
Problem Set 9 Solutions EE23: Digital Signal Processing. From Figure below, we see that the DTFT of the windowed sequence approaches the actual DTFT as the window size increases. Gibb s phenomenon is absent
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 informationReview of Fundamentals of Digital Signal Processing
Solution Manual for Theory and Applications of Digital Speech Processing by Lawrence Rabiner and Ronald Schafer Click here to Purchase full Solution Manual at http://solutionmanuals.info Link download
More informationSolutions for examination in TSRT78 Digital Signal Processing,
Solutions for examination in TSRT78 Digital Signal Processing, 2014-04-14 1. s(t) is generated by s(t) = 1 w(t), 1 + 0.3q 1 Var(w(t)) = σ 2 w = 2. It is measured as y(t) = s(t) + n(t) where n(t) is white
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 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 informationLABORATORY 1 DISCRETE-TIME SIGNALS
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:
More informationII. Nonparametric Spectrum Estimation for Stationary Random Signals - Non-parametric Methods -
II. onparametric Spectrum Estimation for Stationary Random Signals - on-parametric Methods - - [p. 3] Periodogram - [p. 12] Periodogram properties - [p. 23] Modified periodogram - [p. 25] Bartlett s method
More informationUNIT - 7: FIR Filter Design
UNIT - 7: FIR Filter Design Dr. Manjunatha. P manjup.jnnce@gmail.com Professor Dept. of ECE J.N.N. College of Engineering, Shimoga October 5, 06 Unit 7 Syllabus Introduction FIR Filter Design:[,, 3, 4]
More informationProbability Space. J. McNames Portland State University ECE 538/638 Stochastic Signals Ver
Stochastic Signals Overview Definitions Second order statistics Stationarity and ergodicity Random signal variability Power spectral density Linear systems with stationary inputs Random signal memory Correlation
More informationDigital Signal Processing Lecture 9 - Design of Digital Filters - FIR
Digital Signal Processing - Design of Digital Filters - FIR Electrical Engineering and Computer Science University of Tennessee, Knoxville November 3, 2015 Overview 1 2 3 4 Roadmap Introduction Discrete-time
More informationDigital Signal Processing Lecture 10 - Discrete Fourier Transform
Digital Signal Processing - Discrete Fourier Transform Electrical Engineering and Computer Science University of Tennessee, Knoxville November 12, 2015 Overview 1 2 3 4 Review - 1 Introduction Discrete-time
More informationAssignment 2 Solutions Fourier Series
Assignment 2 Solutions Fourier Series ECE 223 Signals and Systems II Version.2 Spring 26. DT Fourier Series. Consider the following discrete-time periodic signal n = +7l n =+7l x[n] = n =+7l Otherwise
More informationChapter 2: The Fourier Transform
EEE, EEE Part A : Digital Signal Processing Chapter Chapter : he Fourier ransform he Fourier ransform. Introduction he sampled Fourier transform of a periodic, discrete-time signal is nown as the discrete
More informationOverview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros)
Overview of Bode Plots Transfer function review Piece-wise linear approximations First-order terms Second-order terms (complex poles & zeros) J. McNames Portland State University ECE 222 Bode Plots Ver.
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 informationSignals and Systems Spring 2004 Lecture #9
Signals and Systems Spring 2004 Lecture #9 (3/4/04). The convolution Property of the CTFT 2. Frequency Response and LTI Systems Revisited 3. Multiplication Property and Parseval s Relation 4. The DT Fourier
More informationExperimental Fourier Transforms
Chapter 5 Experimental Fourier Transforms 5.1 Sampling and Aliasing Given x(t), we observe only sampled data x s (t) = x(t)s(t; T s ) (Fig. 5.1), where s is called sampling or comb function and can be
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 information2.161 Signal Processing: Continuous and Discrete Fall 2008
IT OpenCourseWare http://ocw.mit.edu 2.161 Signal Processing: Continuous and Discrete all 2008 or information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. assachusetts
More informationReview of Fundamentals of Digital Signal Processing
Chapter 2 Review of Fundamentals of Digital Signal Processing 2.1 (a) This system is not linear (the constant term makes it non linear) but is shift-invariant (b) This system is linear but not shift-invariant
More informationSignal Processing Signal and System Classifications. Chapter 13
Chapter 3 Signal Processing 3.. Signal and System Classifications In general, electrical signals can represent either current or voltage, and may be classified into two main categories: energy signals
More informationAnalog vs. discrete signals
Analog vs. discrete signals Continuous-time signals are also known as analog signals because their amplitude is analogous (i.e., proportional) to the physical quantity they represent. Discrete-time signals
More informationFilter Design Problem
Filter Design Problem Design of frequency-selective filters usually starts with a specification of their frequency response function. Practical filters have passband and stopband ripples, while exhibiting
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 informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science : Discrete-Time Signal Processing
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.34: Discrete-Time Signal Processing OpenCourseWare 006 ecture 8 Periodogram Reading: Sections 0.6 and 0.7
More informationProblem Value
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation
More informationSignal Processing. Lecture 10: FIR Filter Design. Ahmet Taha Koru, Ph. D. Yildiz Technical University Fall
Signal Processing Lecture 10: FIR Filter Design Ahmet Taha Koru, Ph. D. Yildiz Technical University 2017-2018 Fall ATK (YTU) Signal Processing 2017-2018 Fall 1 / 47 Introduction Introduction ATK (YTU)
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 informationX. Chen More on Sampling
X. Chen More on Sampling 9 More on Sampling 9.1 Notations denotes the sampling time in second. Ω s = 2π/ and Ω s /2 are, respectively, the sampling frequency and Nyquist frequency in rad/sec. Ω and ω denote,
More informationUNIVERSITY OF OSLO. Faculty of mathematics and natural sciences. Forslag til fasit, versjon-01: Problem 1 Signals and systems.
UNIVERSITY OF OSLO Faculty of mathematics and natural sciences Examination in INF3470/4470 Digital signal processing Day of examination: December 1th, 016 Examination hours: 14:30 18.30 This problem set
More informationLecture 17: variance in a band = log(s xx (f)) df (2) If we want to plot something that is more directly representative of variance, we can try this:
UCSD SIOC 221A: (Gille) 1 Lecture 17: Recap We ve now spent some time looking closely at coherence and how to assign uncertainties to coherence. Can we think about coherence in a different way? There are
More informationSection Kamen and Heck And Harman. Fourier Transform
s Section 3.4-3.7 Kamen and Heck And Harman 1 3.4 Definition (Equation 3.30) Exists if integral converges (Equation 3.31) Example 3.7 Constant Signal Does not have a Fourier transform in the ordinary sense.
More informationContinuous Fourier transform of a Gaussian Function
Continuous Fourier transform of a Gaussian Function Gaussian function: e t2 /(2σ 2 ) The CFT of a Gaussian function is also a Gaussian function (i.e., time domain is Gaussian, then the frequency domain
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 informationComplex symmetry Signals and Systems Fall 2015
18-90 Signals and Systems Fall 015 Complex symmetry 1. Complex symmetry This section deals with the complex symmetry property. As an example I will use the DTFT for a aperiodic discrete-time signal. The
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 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 informationNonparametric and Parametric Defined This text distinguishes between systems and the sequences (processes) that result when a WN input is applied
Linear Signal Models Overview Introduction Linear nonparametric vs. parametric models Equivalent representations Spectral flatness measure PZ vs. ARMA models Wold decomposition Introduction Many researchers
More informationProblem Value
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL of ELECTRICAL & COMPUTER ENGINEERING FINAL EXAM DATE: 30-Apr-04 COURSE: ECE-2025 NAME: GT #: LAST, FIRST Recitation Section: Circle the date & time when your Recitation
More informationDesign Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation
CENTER FOR COMPUTER RESEARCH IN MUSIC AND ACOUSTICS DEPARTMENT OF MUSIC, STANFORD UNIVERSITY REPORT NO. STAN-M-4 Design Criteria for the Quadratically Interpolated FFT Method (I): Bias due to Interpolation
More informationFilter Analysis and Design
Filter Analysis and Design Butterworth Filters Butterworth filters have a transfer function whose squared magnitude has the form H a ( jω ) 2 = 1 ( ) 2n. 1+ ω / ω c * M. J. Roberts - All Rights Reserved
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 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 informationDCSP-2: Fourier Transform
DCSP-2: Fourier Transform Jianfeng Feng Department of Computer Science Warwick Univ., UK Jianfeng.feng@warwick.ac.uk http://www.dcs.warwick.ac.uk/~feng/dcsp.html Data transmission Channel characteristics,
More informationFilter structures ELEC-E5410
Filter structures ELEC-E5410 Contents FIR filter basics Ideal impulse responses Polyphase decomposition Fractional delay by polyphase structure Nyquist filters Half-band filters Gibbs phenomenon Discrete-time
More informationSNR Calculation and Spectral Estimation [S&T Appendix A]
SR Calculation and Spectral Estimation [S&T Appendix A] or, How not to make a mess of an FFT Make sure the input is located in an FFT bin 1 Window the data! A Hann window works well. Compute the FFT 3
More informationOLA and FBS Duality Review
MUS421/EE367B Lecture 10A Review of OverLap-Add (OLA) and Filter-Bank Summation (FBS) Interpretations of Short-Time Fourier Analysis, Modification, and Resynthesis Julius O. Smith III (jos@ccrma.stanford.edu)
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 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 informationLaboratory Project 2: Spectral Analysis and Optimal Filtering
Laboratory Project 2: Spectral Analysis and Optimal Filtering Random signals analysis (MVE136) Mats Viberg and Lennart Svensson Department of Signals and Systems Chalmers University of Technology 412 96
More informationVer Chap Lecture 15- ECE 240a. Q-Switching. Mode Locking. ECE 240a Lasers - Fall 2017 Lecture Q-Switch Discussion
ing Ver Chap. 9.3 Lasers - Fall 2017 Lecture 15 1 ing ing (Cavity Dumping) 1 Turn-off cavity - prevent lasing 2 Pump lots of energy into upper state - use pulsed pump 3 Turn cavity back on - all the energy
More informationTerminology Suppose we have N observations {x(n)} N 1. Estimators as Random Variables. {x(n)} N 1
Estimation Theory Overview Properties Bias, Variance, and Mean Square Error Cramér-Rao lower bound Maximum likelihood Consistency Confidence intervals Properties of the mean estimator Properties of the
More informationLecture 3 - Design of Digital Filters
Lecture 3 - Design of Digital Filters 3.1 Simple filters In the previous lecture we considered the polynomial fit as a case example of designing a smoothing filter. The approximation to an ideal LPF can
More informationSolutions. Chapter 5. Problem 5.1. Solution. Consider the driven, two-well Duffing s oscillator. which can be written in state variable form as
Chapter 5 Solutions Problem 5.1 Consider the driven, two-well Duffing s oscillator which can be written in state variable form as ẍ + ɛγẋ x + x 3 = ɛf cos(ωt) ẋ = v v = x x 3 + ɛ( γv + F cos(ωt)). In the
More informationReview of spectral analysis methods applied to sea level anomaly signals
Review of spectral analysis methods applied to sea level anomaly signals C. Mailhes 1, D. Bonacci 1, O. Besson 1, A. Guillot 2, S. Le Gac 2, N. Steunou 2, C. Cheymol 2, N. Picot 2 1. Telecommunications
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 informationDigital Signal Processing Lecture 3 - Discrete-Time Systems
Digital Signal Processing - Discrete-Time Systems Electrical Engineering and Computer Science University of Tennessee, Knoxville August 25, 2015 Overview 1 2 3 4 5 6 7 8 Introduction Three components of
More informationA New Twist to Fourier Transforms
Hamish D. Meikle A New Twist to Fourier Transforms WILEY VCH WILEY-VCH Verlag GmbH &, Co. KGaA Table ofcontents 1 The Fourier Transform and the Helix 1 1.1 Fourier Transform Conventions 1 1.1.1 Fourier
More informationTTT4120 Digital Signal Processing Suggested Solutions for Problem Set 2
Norwegian University of Science and Technology Department of Electronics and Telecommunications TTT42 Digital Signal Processing Suggested Solutions for Problem Set 2 Problem (a) The spectrum X(ω) can be
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 informationDFT & Fast Fourier Transform PART-A. 7. Calculate the number of multiplications needed in the calculation of DFT and FFT with 64 point sequence.
SHRI ANGALAMMAN COLLEGE OF ENGINEERING & TECHNOLOGY (An ISO 9001:2008 Certified Institution) SIRUGANOOR,TRICHY-621105. DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING UNIT I DFT & Fast Fourier
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 informationMusic 270a: Complex Exponentials and Spectrum Representation
Music 270a: Complex Exponentials and Spectrum Representation Tamara Smyth, trsmyth@ucsd.edu Department of Music, University of California, San Diego (UCSD) October 24, 2016 1 Exponentials The exponential
More information3.2 Complex Sinusoids and Frequency Response of LTI Systems
3. Introduction. A signal can be represented as a weighted superposition of complex sinusoids. x(t) or x[n]. LTI system: LTI System Output = A weighted superposition of the system response to each complex
More information8 The Discrete Fourier Transform (DFT)
8 The Discrete Fourier Transform (DFT) ² Discrete-Time Fourier Transform and Z-transform are de ned over in niteduration sequence. Both transforms are functions of continuous variables (ω and z). For nite-duration
More informationReview: Continuous Fourier Transform
Review: Continuous Fourier Transform Review: convolution x t h t = x τ h(t τ)dτ Convolution in time domain Derivation Convolution Property Interchange the order of integrals Let Convolution Property By
More informationELEG 305: Digital Signal Processing
ELEG 5: Digital Signal Processing Lecture 6: The Fast Fourier Transform; Radix Decimatation in Time Kenneth E. Barner Department of Electrical and Computer Engineering University of Delaware Fall 8 K.
More information