Table 1: PROPERTIES OF THE FOURIER TRANSFORM

Property

Aperiodic signal

Fourier Transform

x(t)

X(j)

y(t)

Y (j)

Time Shifting

x(t t0 )

ejt0 X(j)

Frequency Shifting

ej0 t x(t)

X(j( 0 ))

Conjugation

x (t)

X (j)

Time Reversal

x(t)

X(j)

Time and Frequency Scaling

x(at)

1
X( j
)
|a|
a

Convolution

x(t) y(t)

X(j)Y (j)

Multiplication

x(t)y(t)

Differentiation in Time

d
x(t)
dt
t

Integration

1
X(j)
2

Y (j)

jX(j)
1
X(j)
j

x(t)dt

+ X(0)()

d
j d
X(j)

tx(t)

Differentiation in Frequency

Parsavels Relation for Aperiodic Signals

+

|x(t)|2 dt =

1
2

|X(j)|2 d

Synthesis-Analysis Pair for Continuous-Time Aperiodic Signals( Fourier

Transform)
+

x(t) =

1
2

X(j)ejt d

X(j) =

x(t)ejt dt

Synthesis-Analysis Pair for Continuous-Time Periodic Signals( Fourier

Series)
+

x(t) =

k=

ak =

1
T

R
T

ak ejko t =

x(t)ejko t dt =

ak ejk(2/T )t

k=

1
T

R
T

x(t)ejk(2/T )t dt

Synthesis-Analysis Pair for Discrete-Time Periodic Signals( Fourier

Series)

x[n] =

ak ejko n =

k=<N >

ak =

1
N

ak ejk(2/N )n

k=<N >

x[n]ejko n =

1
N

n=<N >

x[n]ejk(2/N )n

n=<N >

Table 2: BASIC FOURIER TRANSFORM PAIRS

Signal

Fourier Transform

ej0 t

2( 0 )

Fourier Series Coefficients(if periodic)

a1 = 1
ak = 0, otherwise

1,
x(t) =
0,

|t| < T1

2sinT1

|t| > T1

sinW t
t

u(t)
eat u(t), <e{a} > 0

1,
X(j) =
0,
1
j

|| < W
|| > W

+ ()

1
a+j

Table 3: PROPERTIES OF THE DISCRETE-TIME FOURIER TRANSFORM

Property

Aperiodic signal

Fourier Transform

x[n]

X(ej ) periodic with

y[n]

Y (ej ) period 2

Time Shifting

x[n n0 ]

ejn0 X(ej )

Frequency Shifting

ej0 n x[n]

X(ej(0 ) )

Conjugation

x [n]

X (ej )

x[n]

X(ej )

Time Reversal
Time Expansion

Convolution

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

if n = multipleof k

X(ejk )

if n 6= multipleof k
X(ej )Y (ej )

x[n] y[n]

Multiplication

x[n]y[n]

Differencing in Time

x[n] x[n 1]

1
2

R
2

X(ej )Y (ej() )d

(1 ej )X(ej )

Accumulation

x[k]

1
1ej

X(ej )

k=

Differentiation in Frequency

nx[n]

dX(ej )
d

Parsavels Relation for Aperiodic Signals

+

1
2

|x[n]|2 =

n=

|X(ej )|2 d

Synthesis-Analysis Pair for Discrete-Time Fourier Transform

x[n] =

1
2

R
2

X(ej )ejn d

X(ej ) =

x[n]ejn

n=

Table 4: BASIC DISCRETE-TIME FOURIER TRANSFORM PAIRS

Signal

Fourier Transform

Fourier Series Coefficients(if periodic)

ej0 n

( 0 2l)

(a)0 =

2m
N

l=

1,
ak =
0,

k = m, m N, m 2N, ...
otherwise

0
(b)
irrational the signal is aperi2
odic

1,
x[n] =
0,

|n| N1

)]
sin[(N1 + 1
2
)
sin(
2

|n| > N1

1,
W
sinc( Wn ), 0 < W < X() =

0,

0 || W
X() is periodic with period 2 W < ||
+

u[n]

1
1ej

( 2k)

k=

an u[n], |a| < 1

1
1aej

Table 5: PROPERTIES OF THE LAPLACE TRANSFORM

Property

Signal

Laplace Transform ROC

x(t)

X(s)

x1 (t)

X1 (s)

R1

x2 (t)

X2 (s)

R2

Time Shifting

x(t t0 )

est0 X(s)

Shifting in the s-Domain

es0 t x(t)

X(s s0 )

Shifted version of R (i.e s is in the ROC

if s s0 is in R)

Time scaling

x(at)

1
X( as )
|a|

Scaled ROC (i.e, s is in the ROC if s/a

is in R)

Conjugation

x (t)

X (s )

Convolution

x1 (t) x2 (t)

X1 (s)X2 (s)

Differentiation in Time Domain

d
x(t)
dt

sX(s)

At least R

Differentiation in the s-Domain

tx(t)

d
X(s)
ds

Integration in the Time Domain

Rt

1
X(s)
s

x( )d( )

At least R1 R2

At least R {<e{s} > 0}

Defining Equations for Laplace Transform

+

X(s) =

x(t)est dt

+j

x(t) =

1
2j

X(s)est ds

Table 6: LAPLACE TRANSFORMS OF ELEMENTARY FUNCTIONS

Signal

Transform

ROC

u(t)

1
s

<e{s} > 0

u(t)

1
s

<e{s} < 0

et u(t)

1
s+

<e{s} >

et u(t)

1
s+

<e{s} <

Defining Equation of Z-Transform

+

X(z) =

x[n]z n

n=

Table 7: SOME COMMON Z-TRANSFORM PAIRS

Signal

Transform

ROC

u[n]

1
1z 1

|z| > 1

u[n 1]

1
1z 1

|z| < 1

n u[n]

1
1z 1

|z| > ||

n u[n 1]

1
1z 1

|z| < ||

Identities derived from Eulers relation

cos() =

ej +ej
2

sin() =

ej ej
2j

Some Important Trignometric Identities

sin2 () =

1cos(2)
2

cos2 () =

1+cos(2)
2

sin()sin() =

1
[cos(
2

) cos( + )]

cos()cos() =

1
[cos(
2

) + cos( + )]

sin()cos() =

1
[sin(
2

+ ) + sin( )]

cos()sin() =

1
[sin(
2

+ ) sin( )]

Intergration By Parts

udv = uv

vdu

Finite Sum Formula

N 1

n =

n=0

N,
N

1
1

=1
,

6= 1

Infinite Sum Formula

n =

1
1

n=0

where || < 1