Scribd
Upload
67 views1 page

ECE232 DTFT Properties

This document summarizes key properties of the discrete time Fourier transform. It shows how time and frequency domain representations of signals are related under various operations, such as time shifting, modulation, convolution, multiplication, and time reversal. The properties include that the Fourier transform of a time-shifted signal results in a phase shift in the frequency domain, and that convolution in the time domain corresponds to simple multiplication in the frequency domain. It also presents Parseval's theorem relating the energy of a signal in the time and frequency domains.

Uploaded by

isteg
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
67 views1 page

ECE232 DTFT Properties

This document summarizes key properties of the discrete time Fourier transform. It shows how time and frequency domain representations of signals are related under various operations, such as time shifting, modulation, convolution, multiplication, and time reversal. The properties include that the Fourier transform of a time-shifted signal results in a phase shift in the frequency domain, and that convolution in the time domain corresponds to simple multiplication in the frequency domain. It also presents Parseval's theorem relating the energy of a signal in the time and frequency domains.

Uploaded by

isteg
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

PROPERTIES OF THE DISCRETE TIME FOURIER TRANSFORM

Property x n  “Time Domain” X () “Frequency Domain”

Linearity ax1  n  bx 2  n aX 1 ()  bX 2 ()

Time Scaling  x n / k  , if n is a multiple of k X ( k)


x( k )  n   
 0, , if n is not a multiple of k
Time Shifting x n  n0  X (  ) e  j  n0
1 X () cos n 0
 x n  n0   x n  n0  
2
Frequency x  n  e j 0 n X (   0 )
Shifting
Modulation x n  cos  0 n 1
 X (    0 )  X (   0 ) 
2
x n  sin  0 n 1
 X (   0 )  X (    0 ) 
2j
Convolution 
X 1 (  )  X 2 ( )
x1  n  * x 2  n   x k  x n  k
in t-domain k  
1 2

Multiplication x1  n  x 2  n 1

2 X

1 (u ) X 2 (  u ) du

Conjugation x *  n X * (  )
Differentiation n  x n  d
j X ()
in  -domain d
Summation n
X ( ) 

 x m 
m  
1  e  j
 X ( 0 ) 
k  
 (  2k )

Time Reversal x  n  X (  )

Parseval’s  
 x n 1
2
E 
 X ()
2
Theorem E d
n   2 

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy