Está en la página 1de 5

FOURIER TRANSFORM PROPERTIES

Property

Signal

Fourier Transform

x(t)

X(f )

y(t)

Y (f )

Linearity

ax(t) + by(t)

aX(f ) + bY (f )

Time shifting

x(t t0 )

X(f )ej2f t0

Frequency shifting

ej2f0 t x(t)

X(f f0 )

Conjugate

x (t)

X (f )

Reflection

x(t)

X(f )

Time scaling

x(t)

f
1
X( )
||

Convolution

x(t) y(t)

X(f )Y (f )

Multiplication

x(t)y(t)

X(f ) Y (f )

Differenciation in time domain

d
x(t)
dt

j2f X(f )

x(t)dt

Integration in time domain

tx(t)

Diferenciation in frequency domain

1
1
X(f ) + X(0)(f )
j2f
2
j d
X(f )
2 df

X(f ) = X (f )

<e{X(f )} = <e{X(f )}

=m{X(f )} = =m{X(f )}

|X(f )| = |X(f )|

X(f ) = X(f )

Conjugate symmetry

x(t) is real

Real signals

x(t) real and even

X(f ) even and odd

x(t) real and odd

X(f ) odd and imaginary

xe (t) = Ev{x(t)} [x(t) real]


xo (t) = Od{x(t)} [x(t) real]

<e{X(f )}
j=m{X(f )}

Odd and even decomposition

Parseval theorem
Z +
|x(t)|2 dt =
|X(f )|2 df

FOURIER-TRANSFORM PAIRS
Time Function
+
P
ak ejk2f0 t

Fourier Transform

P
ak (f kf0 )

k=

(f f0 )
1
2 [(f

f0 ) + (f + f0 )]

a1 = a1 = 21
ak = 0 other value

sin(2f0 t)

1
2j [(f

f0 ) (f + f0 )]

1
a1 = a1 = 2j
ak = 0 other value

+
X

a0 = 1, ak = 0, k 6= 0
for T > 0

(f )

(
1, |t| < T1
x(t) =
0, T1 < |t|
y x(t) = x(t + T )

T
2

(t nT )

n=

rect

a1 = 1
ak = 0 other value

cos(2f0 t)

t
2T1

ak

k=

ej2f0 t

Fourier Series

+
X
sin(2f0 T1 k)
(f kf0 )
k

k=

+
k
1 X
(f )
T
T
k=


=

|t| < T1
|t| > T1

1,
0,

sinc(2W t)

sin(2f T1 )
2T1 sinc(2T1 f ) =
f


1
f
rect
2W
2W

2f0 T1
k2f0 T1
sin(k2f0 T1 )
sinc(
)=

ak =

1
T

(t)

u(t)

1
1
+ (f )
j2f
2

(t t0 )

ej2f t0

eat u(t),

<e{a} > 0

1
a + j2f

teat u(t),

<e{a} > 0

1
(a + j2f )2

1
(a + 2f )n

2a
a2 + (2f )2

tn1 at
e u(t),
(n 1)!
ea|t| ,

<e{a} > 0

a>0
2

et

ef

sgn(t)

1
jf

1
t

jsgn(f )

s.png

También podría gustarte