DTFT Theorems and Properties

Property Time Domain Frequency Domain

Notation: x(n) X()
x1 (n) X1 ()
x2 (n) X1 ()
Linearity: a1 x1 (n) + a2 x2 (n) a1 X1 () + a2 X2 ()
Time shifting: x(n k) ejk X()
Time reversal x(n) X()
Convolution: x1 (n) x2 (n) X1R()X2 ()
1
Multiplication: x1 (n)x2 (n) 2 2 X1 ()X2 ( )d
Correlation: rx1 x2 (l) = x1 (l) x2 (l) Sx1 x2 () = X1 ()X2 ()
= X1 ()X2 () [if x2 (n) real]
Frequency Differentiation: nx(n) j dX()
d
Wiener-Khintchine: rxx (l) = x(l) x(l) Sxx () = |X()|2

DTFT Symmetry Properties

Time Sequence DTFT
x(n) X()
x (n) X ()
x (n) X ()
x(n) X()
xR (n) Xe () = 21 [X() + X ()]
jxI (n) Xo () = 21 [X() X ()]
X() = X ()
XR () = XR ()
x(n) real XI () = XI ()
|X()| = |X()|
X() = X()
x0e (n) = 12 [x(n) + x (n)] XR ()
x0o (n) = 21 [x(n) x (n)] jXI ()

DFT Properties
Property Time Domain Frequency Domain
Notation: x(n) X(k)
Periodicity: x(n) = x(n + N ) X(k) = X(k + N )
Linearity: a1 x1 (n) + a2 x2 (n) a1 X1 (k) + a2 X2 (k)
Time reversal x(N n) X(N k)
Circular time shift: x((n l))N X(k)ej2kl/N
Circular frequency shift: x(n)ej2ln/N X((k l))N
Complex conjugate: x (n) X (N k)
Circular convolution: x1 (n) x2 (n) X1 (k)X2 (k)
1
Multiplication: x (n)x (n) NX 1 (k) X2 (k)
P1 N 1 2 1 PN 1
Parsevals theorem: n=0 x(n)y (n) N k=0 X(k)Y (k)

1
 Note: The following tables are courtesy of Professors Ashish Khisti and Ravi Adve and were
developed originally for ECE355. Please note that the notation used is different from that in
ECE455.

Fourier Properties

Property DTFS CTFS DTFT CTFT

Synthesis x[n] = x(t) = x[n] = R x(t) = jt
P
ak ejk0 n ak ejk0 t 1
X(ej )ejn d 1
P R
k=<N > k= 2 2 2
X(j)e d
Analysis ak = ak = X(ej ) = R X(j)jt
=
jk0 n P
1 1
x(t)ejk0 t dt jn
P R
N n=<N > x[n]e T T x[n]e
x(t)e dt
x[n] + y[n] x(t) + y(t) x[n] + y[n] x(t) + y(t)
Linearity
j j
ak + bk ak + bk X(e ) + Y (e ) X(j) + Y (j)
j2n0 k/N jk0 t0 jn0
Time Shifting x[n n0 ] ak e x(t t0 ) ak e x[n n0 ] e X(e j
) x(t t0 ) ejt0 X(j)
Frequency Shift x[n]ej2mn/N akm x(t)ejm0 t akm x[n]ej0 n X(ej(0 )n ) x(t)ej0 t X(j( 0 ))
Conjugation x [n] ak x (t) ak x [n] X (ej ) x (t) X (j)
Time Reversal x[n] ak x(t) ak x[n] X(ej ) x(t) X(j)
PN 1
x[n] y[n] X(ej )Y (ej )
R
x[r]y[n r]
r=0 T
x( )y(t )d x(t) y(t) X(j)Y (j)
Convolution
N a k bk T ak bk
P 1
x[n]y[n] N r=0 ar bkr x(t)y(t) ak bk x[n]y[n] x(t)y(t)
Multiplication
1
X(ej )Y (ej() )d 1
R
2 2 2
X(j) Y (j)
dx(t) dx(t)
First Difference/ x[n] x[n 1] dt
jk0 ak x[n] x[n 1] dt
jX(j)
Derivative (1 ej2k/N )ak (1 ej )X(ej )
Rt j Rt
X(e )
x( )d X(j)
Pn ak Pn
Running Sum/ k= x[k]
x( )d jk0 k= x[k] 1e j j
ak j0
Integration 1ej2k/N
+X(e )() +X(j0)()
PN 1 P R
1
|x[n]|2 1
|x(t)|2 dt |x[n]|2 |x(t)|2 dt
R
Parsevals N Pn=0
N 1
TPT
Rn= j 2
R
Relation = k=0 |ak |2 = k= |ak |2 1
= 2 2 |X(e )| d = 2 |X(j)|2 d
1

Real and even Real and even

signals in frequency domain
Real and odd Purely imaginary and odd
signals in frequency domain

Additional Property: A real-valued time-domain signal x(t) or x[n] will have a conjugate-symmetric Fourier
representation.
Notes:
1. For the CTFS, the signal x(t) has a period of T , fundamental frequency 0 = 2/T ; for the DTFS, the signal
x[n] has a period of N , fundamental frequency 0 = 2/N . ak and bk denote the Fourier coefficients of x(t)
(or x[n]) and y(t) (or y[n]) respectively.
2. Periodic convolutions can be evaluated by summing or integrating over any single period, not just those
indicated above.
3. The Running Sum formula for the DTFT above is valid for in the range < .

2
 Fourier Pairs
Fourier Series Coefficients of Periodic Signals
Continuous-Time Discrete-Time
Time Domain x(t) Frequency Domain ak Time Domain x[n] Frequency Domain ak

Aej0 t a1 = A Aej0 n a1 = A,
ak = 0, k 6= 1 ak = 0, k 6= 1
A cos(0 t) a1 = a1 = A/2 A cos(0 n) a1 = a1 = A/2
ak = 0, k 6= 1 ak = 0, k 6= 1
A sin(0 t) a1 = a1 = 2jA
A sin(0 n) a1 = a1 = 2jA

ak = 0, k 6= 1 ak = 0, k 6= 1
x(t) = A a0 = A, ak = 0 otherwise x[n] = A a0 = A, ak = 0 otherwise
P 1
P 1
n= (t nT ) ak = T k= [n kN ] ak = N
2T1
Periodic square wave a0 =
 T
1 |t| < T1 sin(k0 T1 )
x(t) = ak = , k 6= 0
0 T1 < |t| T2 k
and x(t) = x(t + T )

Fourier Transform Pairs

Continuous-Time Discrete-Time
Time Domain x(t) Frequency Domain X(j) Time Domain x[n] Frequency Domain X(ej )
 
1, |t| < T1 2 sin(T1 ) 1, |n| N1 sin((N1 + 1/2))
x(t) = x[n] =
0, |t| > T1  0, |n| > N1 sin(/2)

sin W t 1, || < W sin W n j 1, || W
X(j) = X(e ) =
t 0, otherwise n 0, otherwise
(t) 1 [n] 1
1 2() 1 2()
1 1
u(t) + () u[n] + ()
j 1 ej
1 1
eat u(t), Re(a) > 0 an u[n], |a| < 1
a + j 1 aej
tn1 at 1 (n + r 1)! n 1
e u(t), Re(a) > 0 a u[n], |a| < 1
(n 1)! (a + j)n n!(r 1)! (1 aej )r

In the Fourier series table, 0 = 2

T
and 0 = 2N
, where T and N are the periods of x(t) and x[n] respectively.

For the DTFS, ak is given only for k in the range N/2 + 1 k N/2 for even N , (N 1)/2 k (N 1)/2 for
odd N , and ak = ak+N ; for the DTFT X(ej ) is given only for in the range < , and X(ej ) = X(ej(+2) ).

Fourier Transform for Periodic Signals:

X
X
x(t) = ak ejk0 t X(j) = 2 ak ( k0 )
k= k=

X
X
x[n] = ak ejk0 n X(ej ) = 2 ak ( k0 )
k=<N > k=

3
 Common z-Transform Pairs
Signal, x(n) z-Transform, X(z) ROC
1 (n) 1 All z
1
2 u(n) 1z 1
|z| > 1
3 an u(n) 1
1az 1
|z| > |a|
az 1
4 nan u(n) (1az 1 )2
|z| > |a|
5 an u(n 1) 1
1az 1
|z| < |a|
az 1
6 nan u(n 1) (1az 1 )2
|z| < |a|
1z 1 cos 0
7 cos(0 n)u(n) 12z 1 cos 0 +z 2
|z| > 1
z 1 sin 0
8 sin(0 n)u(n) 12z 1 cos 0 +z 2
|z| > 1
n 1az 1 cos 0
9 a cos(0 n)u(n) 12az 1 cos 0 +a2 z 2
|z| > |a|
1az 1 sin 0
10 an sin(0 n)u(n) 12az 1 cos 0 +a2 z 2
|z| > |a|

z-Transform Properties
Property Time Domain z-Domain ROC
Notation: x(n) X(z) ROC: r2 < |z| < r1
x1 (n) X1 (z) ROC1
x2 (n) X2 (z) ROC2
Linearity: a1 x1 (n) + a2 x2 (n) a1 X1 (z) + a2 X2 (z) At least ROC1 ROC2
Time shifting: x(n k) z k X(z) At least ROC, except
z = 0 (if k > 0)
and z = (if k < 0)
z-Scaling: an x(n) X(a1 z) |a|r2 < |z| < |a|r1
Time reversal x(n) X(z 1 ) 1
r1
< |z| < r12
Conjugation: x (n) X (z ) ROC
z-Differentiation: n x(n) z dX(z)
dz
r2 < |z| < r1
Convolution: x1 (n) x2 (n) X1 (z)X2 (z) At least ROC1 ROC2