0% found this document useful (0 votes)
49 views2 pages

Do NOT Bring A Copy To The Exam!: ECE355F Final Examination - Fourier Properties Sheet December 11, 2008

This document provides a summary of key Fourier transform properties for both continuous-time and discrete-time signals. It lists the Fourier transform, inverse Fourier transform, and Fourier transform pairs for common signals. It also summarizes properties such as linearity, time shifting, frequency shifting, conjugation, time reversal, convolution, multiplication, differentiation, integration, and Parseval's theorem for both continuous and discrete time signals.

Uploaded by

Barry Fung
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
49 views2 pages

Do NOT Bring A Copy To The Exam!: ECE355F Final Examination - Fourier Properties Sheet December 11, 2008

This document provides a summary of key Fourier transform properties for both continuous-time and discrete-time signals. It lists the Fourier transform, inverse Fourier transform, and Fourier transform pairs for common signals. It also summarizes properties such as linearity, time shifting, frequency shifting, conjugation, time reversal, convolution, multiplication, differentiation, integration, and Parseval's theorem for both continuous and discrete time signals.

Uploaded by

Barry Fung
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

ECE355F Final Examination Fourier Properties Sheet December 11

th
, 2008
NOTE: The following sheet will be included in your exam booklet.
Do NOT bring a copy to the exam!
Fourier Properties
Property DTFS CTFS DTFT CTFT
Synthesis x[n] = x(t) = x[n] = x(t) =

k=<N>
a
k
e
jk
0
n

k=
a
k
e
jk
0
t 1
2

2
X(e
j
)e
jn
d
1
2

X(j)e
jt
d
Analysis a
k
= a
k
= X(e
j
) = X(j) =
1
N

n=<N>
x[n]e
jk
0
n 1
T

T
x(t)e
jk
0
t
dt

x[n]e
jn

x(t)e
jt
dt
Linearity
x[n] + y[n] x(t) +y(t) x[n] +y[n] x(t) +y(t)
a
k
+b
k
a
k
+ b
k
X(e
j
) + Y (e
j
) X(j) + Y (j)
Time Shifting x[n n
0
] a
k
e
j2n
0
k/N
x(t t
0
) a
k
e
jk
0
t
0
x[n n
0
] e
jn
0
X(e
j
) x(t t
0
) e
jt
0
X(j)
Frequency Shift x[n]e
j2mn/N
a
km
x(t)e
jm
0
t
a
km
x[n]e
j
0
n
X(e
j(
0
)n
) x(t)e
j
0
t
X(j(
0
))
Conjugation x

[n] a

k
x

(t) a

k
x

[n] X

(e
j
) x

(t) X

(j)
Time Reversal x[n] a
k
x(t) a
k
x[n] X(e
j
) x(t) X(j)
Convolution

N1
r=0
x[r]y[n r]

T
x()y(t )d x[n] y[n] X(e
j
)Y (e
j
) x(t) y(t) X(j)Y (j)
Na
k
b
k
Ta
k
b
k
Multiplication
x[n]y[n]

N1
r=0
arb
kr
x(t)y(t) a
k
b
k
x[n]y[n] x(t)y(t)
1
2

2
X(e
j
)Y (e
j()
)d
1
2
X(j) Y (j)
First Dierence/ x[n] x[n 1]
dx(t)
dt
jk
0
a
k
x[n] x[n 1]
dx(t)
dt
jX(j)
Derivative (1 e
j2k/N
)a
k
(1 e
j
)X(e
j
)
Running Sum/

n
k=
x[k]

x()d
a
k
jk
0

n
k=
x[k]
X(e
j
)
1e
j

x()d
X(j)
j
Integration
a
k
1e
j2k/N
+X(e
j0
)() +X(j0)()
Parsevals
1
N

N1
n=0
|x[n]|
2 1
T

T
|x(t)|
2
dt

n=
|x[n]|
2

|x(t)|
2
dt
Relation =

N1
k=0
|a
k
|
2
=

k=
|a
k
|
2
=
1
2

2
|X(e
j
)|
2
d =
1
2

|X(j)|
2
d
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. a
k
and b
k
denote the Fourier coecients 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 < .
ECE355F Final Examination Fourier Properties Sheet December 11
th
, 2008
Fourier Pairs
Fourier Series Coefficients of Periodic Signals

Continuous-Time Discrete-Time

Time Domain x(t) Frequency Domain a


k
Time Domain x[n] Frequency Domain a
k
Ae
j
0
t
a
1
= A Ae
j
0
n
a
1
= A,
a
k
= 0, k = 1 a
k
= 0, k = 1
Acos(
0
t) a
1
= a
1
= A/2 Acos(
0
n) a
1
= a
1
= A/2
a
k
= 0, k = 1 a
k
= 0, k = 1
Asin(
0
t) a
1
= a

1
=
A
2j
Asin(
0
n) a
1
= a

1
=
A
2j
a
k
= 0, k = 1 a
k
= 0, k = 1
x(t) = A a
0
= A, a
k
= 0 otherwise x[n] = A a
0
= A, a
k
= 0 otherwise

n=
(t nT) a
k
=
1
T

k=
[n kN] a
k
=
1
N
Periodic square wave a
0
=
2T
1
T
x(t) =

1 |t| < T
1
0 T
1
< |t|
T
2
a
k
=
sin(k
0
T
1
)
k
, k = 0
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(e
j
)
x(t) =

1, |t| < T
1
0, |t| > T
1
2 sin(T
1
)

x[n] =

1, |n| N
1
0, |n| > N
1
sin((N
1
+ 1/2))
sin(/2)
sinWt
t
X(j) =

1, || < W
0, otherwise
sin Wn
n
X(e
j
) =

1, || W
0, otherwise
(t) 1 [n] 1
1 2() 1 2()
u(t)
1
j
+() u[n]
1
1 e
j
+ ()
e
at
u(t), Re(a) > 0
1
a +j
a
n
u[n], |a| < 1
1
1 ae
j
t
n1
(n 1)!
e
at
u(t), Re(a) > 0
1
(a + j)
n
(n + r 1)!
n!(r 1)!
a
n
u[n], |a| < 1
1
(1 ae
j
)
r

In the Fourier series table,


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

For the DTFS, a


k
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 a
k
= a
k+N
; for the DTFT X(e
j
) is given only for in the range < , and X(e
j
) = X(e
j(+2)
).
Fourier Transform for Periodic Signals:
x(t) =

k=
a
k
e
jk
0
t
X(j) = 2

k=
a
k
( k
0
)
x[n] =

k=<N>
a
k
e
jk
0
n
X(e
j
) = 2

k=
a
k
( k
0
)

You might also like