MAHALAKSHMI ENGINEERING COLLEGE-TRICHY
|
|
- Austin Reynolds
- 5 years ago
- Views:
Transcription
1 DIGITAL SIGNAL PROCESSING DEPT./SEM.: ECE&EEE /V DISCRETE FOURIER TRANFORM AND FFT PART-A 1. Define DFT of a discrete time sequence? AUC MAY 06 The DFT is used to convert a finite discrete time sequence x(n) to an N-point frequency domain sequence denoted by X(k),. The N-point DFT of a finite duration sequence x (n) of length L, where L N is defined as N-1 X(K) = x(n)e ^(-j2 nk/n) ; for k = 0,1,2,.,(N - 1) N=0 2. Define IDFT? AUC APR 05 The IDFT is used to convert the N-point frequency domain sequence X(k) to an N-point time domain sequence. The IDFT of the sequence X(k) of length N is defined as N-1 X(n) = x(k)e ^(-j2 nk/n) ; for n = 0,1,2,.,(N - 1) N=0 3. What is the relation between DTFT and DFT? AUC NOV 11 Let x(n) be a discrete time sequence. Now DTFT {x(n)} = X( ) or FT{x(n)} X( ) and DFT {x(n)} X(k). The X( ) is a periodic continuous function of and X(k) is an N- point periodic sequence. The N-point sequence X(k) is actually N samples of X( ) which can be obtained by sampling one period of X( ) at N equal intervals. 4. What is the drawback in Fourier Transform and how it is overcome? AUC NOV 12 The drawback in Fourier transform is that it is a continuous function of and so it cannot be processed by digital system. This drawback is overcome by using Discrete Fourier Transform. The DFT converts the continuous function of.
2 5. Give any two applications of DFT (or Mention the importance of DFT) AUC NOV The DFT is used for spectral analysis of signals using a digital computer. 2. The DFT is used to perform filtering operations on signals using digital computer. 6. when an N-Point periodic sequence is said to be even or odd sequence? AUCMAY 11 An N-Point periodic sequence is called even if it satisfies the condition x(n-n) = x(n); for0 n (N-1) An N-Point periodic sequence is called odd if it satisfies the condition x(n-n) = - x(n); for0 n (N-1) 7. List any four properties of DFT. AUC NOV 09 Let DFT {x(n)} =X(k),DFT{x 1 (n)} = X 1 (k)and DFT{x 2 (k)} = X 2 (k) i. Periodicity: X(K+N) = X(K); for all k ii Linearity : DFT { a 1 x 1 (n)+a 2 x 2 (n)} = a 1 x 1 (k)+a 2 x 2 (k), where a 1 & a 2 are constant iii DFT of time reversed sequence : DFT {x(n-n)} = X (N-k) iv Circular convolution : DFT {x 1 (n) * X 2 (n) = X 1 (k)x 2 (k) 8. Why linear convolution is important in DSP? AUC NOV 05 The response or output of LTI discrete time system for any input x(n) is given by linear convolution of the input x(n) and the impulse response h(n) of the system. (This means that if the impulse response of a system is known, then the response of the system for any input can be determined by convolution operation). 9. Write the properties of linear convolution? AUC APR 07, 08 The linear convolution satisfies the following properties. I. Commutative property : x(n)*h(n) = h(n)*x(n) II. Associative property : [x(n)*h 1 (n)]* h 2 (n) = x(n)*[h 1 (n)*h 2 (n)] III. Distributive property : [x(n)*[h 1 (n)]+h 2 (n) ]= x(n)*h 1 (n)+x(n)*h 2 (n)
3 10. List the differences between linear convolution and circular convolution? AUC NOV 09 Linear convolution 1. The length of the input sequence can be different. 2. Zero padding is not required Circular convolution 1. The length of the input sequence should be same. 2. If the length of the input sequence are different, then zero padding is required. 3. The input sequences need not be period. 4. The output sequence is nonperiodic. 5. The length of output sequence will be greater than the length of input sequences. 3. Atleast one of the input sequence should be periodic or should be periodically extended. 4.The output sequence is periodic. The periodicity is same a that of input sequence. 5. The length of the input and output sequences are same. 11. What is radix-2 FFT? AUC MAY 05 The radix 2 FFT is an efficient algorithm for computing N point DFT of an N-point sequence. In radix 2 FFT the N-point sequence is decimated into 2-point sequences and the 2-point DFT for each decimated sequence is computed. From the results of 2-point DFTs, the 4-point DFTs are computed. From the results of 4-point DFTs, the 8-point DFTs are computed and so on until we get N-point DFT. 12. How many multiplications and additions are involved in radix-2 FFT? AUC NOV 06 For performing radix 2 FFT, the value of N should be such that, N = 2 m. The total number of complex additions are Nlog 2 N and the total number of complex multiplications are (N/2) log 2 N. 13. What is DIT radix 2 FFT? AUC APR 08 The DIT (Decimation In Time) radix-2 FFT is an efficient algorithm for computing DFT. In DIT radix-2 FFT, the time domain N-point sequence is decimated into 2-point sequences.
4 The result of 2-point DFTs are used to compute 4-point DFTs. Two numbers of 2-point DFTs are combined to get a 4-point DFT. The results of 4-point DFTs are used to compute 8 point DFTs. Two numbers of 4-point DFTs are combined to get an 8-point DFT. This process is continued until we get N-point DFT. PART-B 1.Explain the properties of DFT. AUC NOV 06, Periodicity 2. Linearity 3. Symmetry property. 4. Circular convolution of two sequences. 5. Time reversal of sequences. 6. Circular time shift of a sequence. 7. Circular frequency shift of a sequence. 8. Circular correlation of two sequences. 9. Multiplication of two sequences. 10. Parsevals theorem 1. Periodicity: X(n+N)=X(n) X(K+N)=X(K) 2. Linearity: Dft ax 1(n)+ bx 2 (n) N point ax 1(n)+ bx 2 (n) 3. Symmetry property: x(n) Dft N point X(k) x * (n) DFT X(N-K) N-point
5 4. Circular convolution of two sequences. x 1 (n) x 2 (n) X 1 (K). X 2 (K) 5. Time reversal of a sequence: Dft x(n) Npoint DFT x(-n) N= x(n-n) X(-K) N = X(N-K) N-point X(k) 6. Circular time shift of a sequence: x(n) Dft Npoint X(k) x(n-m) Dft Npoint -j2 π mk / N X(k) e 7. Circular frequency shift of a sequence: Dft x(n) Npoint X(k) j2 π mn / N x(n) e X(k-m) Dft Npoint N
6 8. Circular correlation of two sequences. N-1 x 1 (n) x 1 * (n-m) X 1 (k) X 2 * (k) n=0 9. Multiplication of two sequences. x 1 (n) x 2 (n) DFT 1/N [X 1 (k). X 2 * (k)] 10. Parsevals theorem N-1 N-1 x 1 (n) 2 1/N X(k) 2 n=0 n=0 2.Derive and draw the FFT algorithm radix 2 DIT algorithm. AUC MAY 07, 09 Decimation in time algorithm In this case, let us assume that x(n) represents a sequence of N values, where, N is an integer power of 2, that is N=2 L. The given sequence is decimated (broken) in to two n/2 point sequences consisting of the even numbered values of x(n) and the odd numbered values of x(n). The N- point DFT sequence x(n) is given by, N-1 nk X(K) = x(n) W N 0 k N-1 n=0 breaking x(n) in to its even and odd numbered values, we obtain,
7 X(K) = x(n) W N nk + x(n) WN nk n=0 n=0 n=even n=odd sub n=2r for n even and n=2r+1 for n is odd, we have, X(K) = 2rk x(2r) W N + (2r+1)k x(2r+1) WN r=0 r=0 X(K) = x(2r) W N 2rk + x(2r+1) WN (2rk) W N K r=0 r=0 X(K) = rk x(2r) W N/2 + rk x(2r+1) WN/2 K WN r=0 r=0 X(K)=G(K) + W N K H(K) where K=0,1,2,3,4 Where G(K) and H(K) are the N/2 points DFTS of the even and odd numbered sequence respectively. Here each of the sum is computed for 0 k
8 For the direct computation of an N- point dft, G(K) and H(K) as a combination of two n/2 points DFT rk G(K) = x(2r) W N/2 r=0 sub r = 2l for n even and r = 2l+1 for n is odd, we have, N/4-1 N/4-1 G(K) = 2lk x(2l) W N/2 + (2l+1)k x(2l+1) WN/2 l=0 l=0 N/4-1 N/4-1 G(K) = x(2l) W N/4 lk + x(2l+1) WN/4 lk WN/2 K l=0 l=0 G(K)=G 1 (K)+ W N/2 K G 2 (K)
9 Similarly; H(K) = rk x(2r+1) W N/2 r=0 sub r = 2l for n even and r = 2l+1 for n is odd, we have, N/4-1 H(K) = x(4l+1) W N/2 2lk N/4-1 + x(2(2l+1)+1) WN/2 (2l+1)k l=0 l=0 N/4-1 N/4-1 G(K) = x(4l+1) W N/4 lk + x(4l+3) WN/4 lk WN/2 K l=0 l=0 H(K)=H 1 (K)+ W N/2 K H 2 (K) A+BW N 1 A-BW N 1
10 1 3. Derive and draw the FFT algorithm radix 2 DIF algorithm. AUC NOV 07, 08 Decimation in frequency algorithm (DIF-FFT): In the DIT-FFT algorithm, the time domain sequence x(n) is divided in to smaller subsequence.in this algorithm,the frequency samples X(K) are divided in to smaller and smaller subsequences. W.K.T N-1 nk X(K) = x(n) W N 0 k N-1 n=0 X(K) = nk x(n) W N + nk x(n) WN n=0 n=0
11 sub n=n+n/2 X(K) = nk x(n) W N + n+n/2)k x(n+n/2) WN n=0 n=0 X(K) = x(n) W N nk + x(n+n/2) WN NK/2 WN Kn here, n=0 n=0 W N NK/2 =(-1) k X(K) = x(n) W N nk + x(n+n/2) (-1) k W N Kn equ I n=0 n=0 in the above equation Put k=2r, when k is even X(2r) = x(n) W N 2r n + x(n+n/2) (-1) 2r W N 2r n n=0 n=0 X(2r) = n=0 [ x(n) + x(n+n/2) ] W N 2r n X(2r) = [ x(n) +x(n+n/2) ] W N/2 r n n=0 put k=2r +1, when k is odd,
12 (2r+1) n X(2r+1) = x(n) W N + x(n+n/2) (-1) (2r+1) W N (2r+1) n n=0 n=0 X(2r+1) = [ x(n) - x(n+n/2) ] W N (2r+1) n n=0 X(2r+1) = [ x(n) - x(n+n/2) ] W N/2 r n n=0 WN n r n X(2r) = g(n) W N/2 n=0 X(2r+1) = h(n) W N/2 r n n=0 WN n g(n) = [ x(n) - x(n+n/2) ] h(n) =[ x(n) + x(n+n/2) ]
13 A+B (A-B)W N 0
14 4.find the DFT of a sequence X(N)={1,2,3,4,4,3,2,1} by using DIT- FFT algorithm. Solution: W 8 0 =1 W 8 1 =1/ 2 - j 1/ 2 W 8 2 = -j W 8 3 = - 1/ 2 - j 1/ 2
15 5.find the DFT of a sequence X(N)={1,2,3,4,4,3,2,1} by using DIF- FFT algorithm. AUC MAY 08, 06 Solution: W 8 0 =1 W 8 1 =1/ 2 - j 1/ 2 W 8 2 = -j W 8 3 = - 1/ 2 - j 1/ 2
16 6. Discuss about linear filtering in FFT? AUC NOV 06,MAY 09 Linear filtering by fft : Overlap save method: For the input sequence x(n) which has a long duration, performing convolution in practical is not possible. therefore, the entire sequence is divided in to blocks. each blocks are separately and finally the result are combined. The o/p response obtained by this method will be same as that of linear convolution. two methods are used in filtering, they are overlap- save and add method. Overlap save method: Let the length of the input sequence is L S length of the impulse response is M. now the sequence is divided in to blocks of sign N=L-M-1 Each block will have last (M-1) data points of previous block followed by new data points. For the first of data the first (M-1) points are set to zero. X 1 (n)= 0,0, x(0),x(n) x(l-1)
17 (M-1) zero X 2 (N)= X(L-M+1).x(L-1), x(l).x(2l-1) (m-1) data points from x(n) L new data point NOW the impulse response of FIR filter is increased by length appending (L-1) zeroes and N-point circular convolution of x 1 (n) and h(n) are computed. Y 1 (n)=x 1 (n) O h(n) Discard the first M-1 points of the filtered sections x 1 (n) O h(n) Overlap add method: Let the length of the sequence is L s length of the impulse response is M. now the sequence is divided in to blocks of data single having length L and (M-1) zeros are appending to it to make the data single of N=L+M-1 Thus the data blocks are represented as X 1 (n)= x(0),x(1) x(l-1) 0,0, (M-1) zero appended X 2 (n)= X(L),X(L+1).x(2L-1), 0,0,0,. Now L-1 zeros are added to the impulse response (h(n)) N-point circular convolution is performed. since each data block is terminated with (M-1) zeros, last (M-1) point from each output block must be overlapped and added to the first (L-1) points of the succeeding block. Hence this method is called overlap add method. Let the o/p blocks are of the form, Y 1 (n)= { y 1 (0),y 1 (1),..y 1 (L-1), y 1 (1) y 1 (L-1)} Y 2 (n)= { y 2 (0),y 2 (1),..y 2 (L-1), y 2 (1) y 2 (L-1)}
18 Y 3 (n)= { y 3 (0),y 3 (1),..y 3 (L-1), y 3 (1) y 3 (L-1)} The output sequence is y(n)={ y 1 (0), y 1 (1),. y 1 (L-1),y 1 (L)+ y 2 (0),. Y 1 (N-1)+ y 2 (M-1),y 2 (M). y 2 (L)+ y 3 (0), y 2 (L+1)+ y 3 (1),.. y 3 (N-1)} 7. Calculate the IDFT of the sequence X(K)={4,0,0,0}. AUC NOV 05 SOLUTION: X(K) X(K)={4,0,0,0} x(0) x(1) 1 -j -1 j 0 = 1/N x(2) x(3) 1 j -1 -j 0 4 = 1/
19 1 = X(n)=( 1,1,1,1) 8. Calculate the DFT of the sequence x(n)={1,2,3,4}. AUC MAY 08 X(0) X(1) 1 -j -1 j 2 = X(2) X(3) 1 j -1 -j = 1-2j-3+4j j-3-4j
20 10 = -2+2j j
! 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 informationVU Signal and Image Processing. Torsten Möller + Hrvoje Bogunović + Raphael Sahann
052600 VU Signal and Image Processing Torsten Möller + Hrvoje Bogunović + Raphael Sahann torsten.moeller@univie.ac.at hrvoje.bogunovic@meduniwien.ac.at raphael.sahann@univie.ac.at vda.cs.univie.ac.at/teaching/sip/17s/
More informationDigital Signal Processing. Midterm 2 Solutions
EE 123 University of California, Berkeley Anant Sahai arch 15, 2007 Digital Signal Processing Instructions idterm 2 Solutions Total time allowed for the exam is 80 minutes Please write your name and SID
More informationModule 3. Convolution. Aim
Module Convolution Digital Signal Processing. Slide 4. Aim How to perform convolution in real-time systems efficiently? Is convolution in time domain equivalent to multiplication of the transformed sequence?
More informationDHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A
DHANALAKSHMI COLLEGE OF ENGINEERING DEPARTMENT OF ELECTRICAL AND ELECTRONICS ENGINEERING EC2314- DIGITAL SIGNAL PROCESSING UNIT I INTRODUCTION PART A Classification of systems : Continuous and Discrete
More informationThe Fourier transform allows an arbitrary function to be represented in terms of simple sinusoids. The Fourier transform (FT) of a function f(t) is
1 Introduction Here is something I wrote many years ago while working on the design of anemometers for measuring shear stresses. Part of this work required modelling and compensating for the transfer function
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 informationDISCRETE FOURIER TRANSFORM
DISCRETE FOURIER TRANSFORM 1. Introduction The sampled discrete-time fourier transform (DTFT) of a finite length, discrete-time signal is known as the discrete Fourier transform (DFT). The DFT contains
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 informationChapter 8 The Discrete Fourier Transform
Chapter 8 The Discrete Fourier Transform Introduction Representation of periodic sequences: the discrete Fourier series Properties of the DFS The Fourier transform of periodic signals Sampling the Fourier
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 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 informationDIGITAL SIGNAL PROCESSING
IT 1252 DIGITAL SIGNAL PROCESSING 1. Define Discrete time signal. A discrete time signal x (n) is a function of an independent variable that is an integer.a discrete time signal is not defined at instant
More informationIT DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A
DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING IT6502 - DIGITAL SIGNAL PROCESSING (2013 regulation) UNIT-1 SIGNALS AND SYSTEMS PART-A 1. What is a continuous and discrete time signal? Continuous
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 informationDEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT 1
This PDF is Created by Simpo PDF Creator unregistered version - http://wwwsimpopdfcom Study hard, for the well is deep, and our brains are shallow DEPARTMENT OF EI DIGITAL SIGNAL PROCESSING ASSIGNMENT
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 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 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 informationLecture 20: Discrete Fourier Transform and FFT
EE518 Digital Signal Processing University of Washington Autumn 2001 Dept of Electrical Engineering Lecture 20: Discrete Fourier Transform and FFT Dec 10, 2001 Prof: J Bilmes TA:
More informationR13 SET - 1
R13 SET - 1 III B. Tech II Semester Regular Examinations, April - 2016 DIGITAL SIGNAL PROCESSING (Electronics and Communication Engineering) Time: 3 hours Maximum Marks: 70 Note: 1. Question Paper consists
More informationELEG 305: Digital Signal Processing
ELEG 305: Digital Signal Processing Lecture 18: Applications of FFT Algorithms & Linear Filtering DFT Computation; Implementation of Discrete Time Systems Kenneth E. Barner Department of Electrical and
More informationDSP Algorithm Original PowerPoint slides prepared by S. K. Mitra
Chapter 11 DSP Algorithm Implementations 清大電機系林嘉文 cwlin@ee.nthu.edu.tw Original PowerPoint slides prepared by S. K. Mitra 03-5731152 11-1 Matrix Representation of Digital Consider Filter Structures This
More informationEE123 Digital Signal Processing
Announcements EE Digital Signal Processing otes posted HW due Friday SDR give away Today! Read Ch 9 $$$ give me your names Lecture based on slides by JM Kahn M Lustig, EECS UC Berkeley M Lustig, EECS UC
More information/ (2π) X(e jω ) dω. 4. An 8 point sequence is given by x(n) = {2,2,2,2,1,1,1,1}. Compute 8 point DFT of x(n) by
Code No: RR320402 Set No. 1 III B.Tech II Semester Regular Examinations, Apr/May 2006 DIGITAL SIGNAL PROCESSING ( Common to Electronics & Communication Engineering, Electronics & Instrumentation Engineering,
More informationDigital Signal Processing
DIGITAL SIGNAL PROCESSING SUBJECT CODE : NO. OF LECTURE HRS/WEEK : 04 TOTAL NO. OF LECTURE HRS. : 52 IA MARKS : 25 EXAM HOURS : 03 EXAMMARKS : 100 UNIT - 1 DISCRETE FOURIER TRANSFORMS (DFT): FREQUENCY
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 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 informationSIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE)
SIDDHARTH GROUP OF INSTITUTIONS:: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : Digital Signal Processing(16EC422) Year & Sem: III-B.Tech & II-Sem Course
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 informationESE 531: Digital Signal Processing
ESE 531: Digital Signal Processing Lec 22: April 10, 2018 Adaptive Filters Penn ESE 531 Spring 2018 Khanna Lecture Outline! Circular convolution as linear convolution with aliasing! Adaptive Filters Penn
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 informationDigital Signal Processing Lecture 4
Remote Sensing Laboratory Dept. of Information Engineering and Computer Science University of Trento Via Sommarive, 14, I-38123 Povo, Trento, Italy Digital Signal Processing Lecture 4 Begüm Demir E-mail:
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 informationFrequency-domain representation of discrete-time signals
4 Frequency-domain representation of discrete-time signals So far we have been looing at signals as a function of time or an index in time. Just lie continuous-time signals, we can view a time signal as
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 informationQuestion Bank. UNIT 1 Part-A
FATIMA MICHAEL COLLEGE OF ENGINEERING & TECHNOLOGY Senkottai Village, Madurai Sivagangai Main Road, Madurai -625 020 An ISO 9001:2008 Certified Institution Question Bank DEPARTMENT OF ELECTRONICS AND COMMUNICATION
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 informationHST.582J / 6.555J / J Biomedical Signal and Image Processing Spring 2007
MIT OpenCourseare http://ocw.mit.edu HST.58J / 6.555J / 16.56J Biomedical Signal and Image Processing Spring 7 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms.
More information! Review: Discrete Fourier Transform (DFT) ! DFT Properties. " Duality. " Circular Shift. ! Circular Convolution. ! Fast Convolution Methods
Toda ESE 531: Digital Signal Processing! Review: Discrete Fourier Transform (DFT)! DFT Properties Lec 20: April 11, 2017 Discrete Fourier Transform, Pt 2 " Dualit " Circular Shift! Circular Convolution!
More informationEE123 Digital Signal Processing
EE123 Digital Signal Processing Lecture 5 based on slides by J.M. Kahn Info Last time Finished DTFT Ch. 2 z-transforms Ch. 3 Today: DFT Ch. 8 Reminders: HW Due tonight The effects of sampling What is going
More informationDiscrete-Time Signals and Systems
ECE 46 Lec Viewgraph of 35 Discrete-Time Signals and Systems Sequences: x { x[ n] }, < n
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 informationInterchange of Filtering and Downsampling/Upsampling
Interchange of Filtering and Downsampling/Upsampling Downsampling and upsampling are linear systems, but not LTI systems. They cannot be implemented by difference equations, and so we cannot apply z-transform
More information1. Calculation of the DFT
ELE E4810: Digital Signal Processing Topic 10: The Fast Fourier Transform 1. Calculation of the DFT. The Fast Fourier Transform algorithm 3. Short-Time Fourier Transform 1 1. Calculation of the DFT! Filter
More informationDiscrete-time Fourier Series (DTFS)
Discrete-time Fourier Series (DTFS) Arun K. Tangirala (IIT Madras) Applied Time-Series Analysis 59 Opening remarks The Fourier series representation for discrete-time signals has some similarities with
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 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 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 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 informationDIGITAL SIGNAL PROCESSING UNIT I
DIGITAL SIGNAL PROCESSING UNIT I CONTENTS 1.1 Introduction 1.2 Introduction about signals 1.3 Signals Processing 1.4 Classification of signals 1.5 Operations performed on signals 1.6 Properties of signals
More informationTransforms and Orthogonal Bases
Orthogonal Bases Transforms and Orthogonal Bases We now turn back to linear algebra to understand transforms, which map signals between different domains Recall that signals can be interpreted as vectors
More informationDigital Signal Processing. Lecture Notes and Exam Questions DRAFT
Digital Signal Processing Lecture Notes and Exam Questions Convolution Sum January 31, 2006 Convolution Sum of Two Finite Sequences Consider convolution of h(n) and g(n) (M>N); y(n) = h(n), n =0... M 1
More informationRoll No. :... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/ DIGITAL SIGNAL PROCESSING. Time Allotted : 3 Hours Full Marks : 70
Name : Roll No. :.... Invigilator s Signature :.. CS/B.Tech (EE-N)/SEM-6/EC-611/2011 2011 DIGITAL SIGNAL PROCESSING Time Allotted : 3 Hours Full Marks : 70 The figures in the margin indicate full marks.
More informationINTRODUCTION TO THE DFS AND THE DFT
ITRODUCTIO TO THE DFS AD THE DFT otes: This brief handout contains in very brief outline form the lecture notes used for a video lecture in a previous year introducing the DFS and the DFT. This material
More informationHow to manipulate Frequencies in Discrete-time Domain? Two Main Approaches
How to manipulate Frequencies in Discrete-time Domain? Two Main Approaches Difference Equations (an LTI system) x[n]: input, y[n]: output That is, building a system that maes use of the current and previous
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 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 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 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 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 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 informationECE 308 Discrete-Time Signals and Systems
ECE 38-6 ECE 38 Discrete-Time Signals and Systems Z. Aliyazicioglu Electrical and Computer Engineering Department Cal Poly Pomona ECE 38-6 1 Intoduction Two basic methods for analyzing the response of
More informationVALLIAMMAI ENGINEERING COLLEGE. SRM Nagar, Kattankulathur DEPARTMENT OF INFORMATION TECHNOLOGY. Academic Year
VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur- 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY Academic Year 2016-2017 QUESTION BANK-ODD SEMESTER NAME OF THE SUBJECT SUBJECT CODE SEMESTER YEAR
More informationQUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE)
QUESTION BANK SIGNALS AND SYSTEMS (4 th SEM ECE) 1. For the signal shown in Fig. 1, find x(2t + 3). i. Fig. 1 2. What is the classification of the systems? 3. What are the Dirichlet s conditions of Fourier
More informationDiscrete-time signals and systems
Discrete-time signals and systems 1 DISCRETE-TIME DYNAMICAL SYSTEMS x(t) G y(t) Linear system: Output y(n) is a linear function of the inputs sequence: y(n) = k= h(k)x(n k) h(k): impulse response of the
More informationEDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT. March 11, 2015
EDISP (NWL2) (English) Digital Signal Processing Transform, FT, DFT March 11, 2015 Transform concept We want to analyze the signal represent it as built of some building blocks (well known signals), possibly
More informationIntroduction to Digital Signal Processing
Introduction to Digital Signal Processing 1.1 What is DSP? DSP is a technique of performing the mathematical operations on the signals in digital domain. As real time signals are analog in nature we need
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 informationFlash File. Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties. Objectives: Scope of this Lecture:
Module 3 : Sampling and Reconstruction Lecture 28 : Discrete time Fourier transform and its Properties Objectives: Scope of this Lecture: In the previous lecture we defined digital signal processing and
More informationUniversity Question Paper Solution
Unit 1: Introduction University Question Paper Solution 1. Determine whether the following systems are: i) Memoryless, ii) Stable iii) Causal iv) Linear and v) Time-invariant. i) y(n)= nx(n) ii) y(t)=
More informationVel Tech High Tech Dr.Ranagarajan Dr.Sakunthala Engineering College Department of ECE
Subject Code: EC6502 Course Code:C302 Course Name: PRINCIPLES OF DIGITAL SIGNAL PROCESSING L-3 : T-1 : P-0 : Credits 4 COURSE OBJECTIVES: 1. To learn discrete Fourier transform and its properties 2. To
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 informationEE123 Digital Signal Processing. M. Lustig, EECS UC Berkeley
EE123 Digital Signal Processing Today Last time: DTFT - Ch 2 Today: Continue DTFT Z-Transform Ch. 3 Properties of the DTFT cont. Time-Freq Shifting/modulation: M. Lustig, EE123 UCB M. Lustig, EE123 UCB
More informationINSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad
INSTITUTE OF AERONAUTICAL ENGINEERING Dundigal, Hyderabad - 500 043 Title Code Regulation ELECTRONICS AND COMMUNICATION ENGINEERING TUTORIAL QUESTION BANK DIGITAL SIGNAL PROCESSING A60421 R13 Structure
More informationUNIT 1. SIGNALS AND SYSTEM
Page no: 1 UNIT 1. SIGNALS AND SYSTEM INTRODUCTION A SIGNAL is defined as any physical quantity that changes with time, distance, speed, position, pressure, temperature or some other quantity. A SIGNAL
More informationN-Point. DFTs of Two Length-N Real Sequences
Coputation of the DFT of In ost practical applications, sequences of interest are real In such cases, the syetry properties of the DFT given in Table 5. can be exploited to ake the DFT coputations ore
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 informationEEL3135: Homework #4
EEL335: Homework #4 Problem : For each of the systems below, determine whether or not the system is () linear, () time-invariant, and (3) causal: (a) (b) (c) xn [ ] cos( 04πn) (d) xn [ ] xn [ ] xn [ 5]
More informationDiscrete-Time Systems
FIR Filters With this chapter we turn to systems as opposed to signals. The systems discussed in this chapter are finite impulse response (FIR) digital filters. The term digital filter arises because these
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 informationLTI H. the system H when xn [ ] is the input.
REVIEW OF 1D LTI SYSTEMS LTI xn [ ] y[ n] H Operator notation: y[ n] = H{ x[ n] } In English, this is read: yn [ ] is the output of the system H when xn [ ] is the input. 2 THE MOST IMPORTANT PROPERTIES
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 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 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 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 informationAdvanced Digital Signal Processing -Introduction
Advanced Digital Signal Processing -Introduction LECTURE-2 1 AP9211- ADVANCED DIGITAL SIGNAL PROCESSING UNIT I DISCRETE RANDOM SIGNAL PROCESSING Discrete Random Processes- Ensemble Averages, Stationary
More informationProperties of LTI Systems
Properties of LTI Systems Properties of Continuous Time LTI Systems Systems with or without memory: A system is memory less if its output at any time depends only on the value of the input at that same
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 information1 1.27z z 2. 1 z H 2
E481 Digital Signal Processing Exam Date: Thursday -1-1 16:15 18:45 Final Exam - Solutions Dan Ellis 1. (a) In this direct-form II second-order-section filter, the first stage has
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 informationVoiced Speech. Unvoiced Speech
Digital Speech Processing Lecture 2 Homomorphic Speech Processing General Discrete-Time Model of Speech Production p [ n] = p[ n] h [ n] Voiced Speech L h [ n] = A g[ n] v[ n] r[ n] V V V p [ n ] = u [
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 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 informationChapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter
Chapter 5. Fourier Analysis for Discrete-Time Signals and Systems Chapter Objec@ves 1. Learn techniques for represen3ng discrete-)me periodic signals using orthogonal sets of periodic basis func3ons. 2.
More informationDigital Signal Processing. Midterm 1 Solution
EE 123 University of California, Berkeley Anant Sahai February 15, 27 Digital Signal Processing Instructions Midterm 1 Solution Total time allowed for the exam is 8 minutes Some useful formulas: Discrete
More informationLet H(z) = P(z)/Q(z) be the system function of a rational form. Let us represent both P(z) and Q(z) as polynomials of z (not z -1 )
Review: Poles and Zeros of Fractional Form Let H() = P()/Q() be the system function of a rational form. Let us represent both P() and Q() as polynomials of (not - ) Then Poles: the roots of Q()=0 Zeros:
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 informationResponses of Digital Filters Chapter Intended Learning Outcomes:
Responses of Digital Filters Chapter Intended Learning Outcomes: (i) Understanding the relationships between impulse response, frequency response, difference equation and transfer function in characterizing
More informationA NOVEL APPROACH FOR HIGH SPEED CONVOLUTION OF FINITE AND INFINITE LENGTH SEQUENCES USING VEDIC MATHEMATICS
A NOVEL APPROACH FOR HIGH SPEED CONVOLUTION OF FINITE AND INFINITE LENGTH SEQUENCES USING VEDIC MATHEMATICS M. Bharathi 1, D. Leela Rani 2 1 Assistant Professor, 2 Associate Professor, Department of ECE,
More information