Computation of Phasor from Discrete Fourier Transform

Computation of Phasor from Discrete

Fourier Transform
S. A. Soman
Department of Electrical Engineering,
IIT Bombay

Computation of Phasor from Discrete Fourier Transform

Outline

DFT of a Sinusoid

Phase Computation using DFT

Full Cycle Recursive DFT

Half Cycle Recursive Form for Phase Estimation

Half Cycle Recursive DFT

Computation of Phasor from Discrete Fourier Transform

DFT of a Sinusoid

DFT of a Sinusoid
Consider a sinusoidal input signal of frequency 0 , given by

x(t) = 2X cos (0 t + )
(1)

This signal is conveniently represented by a phasor X

= Xej = X (cos + j sin )
X

(2)

Assume that x(t) is sampled N times per cycle such that

T0 = Nts .



2
k +
(3)
xk = 2X cos
N

Computation of Phasor from Discrete Fourier Transform

DFT of a Sinusoid

The Discrete Fourier Transform of xk contains the

fundamental frequency component given by
X1 =

N1
2
2 X
xk ej N k = Xc jXs
N

(4)

k =0

Where,


N1
2
2 X
xk cos
k
Xc =
N
N

(5)



N1
2 X
2
xk sin
k
N
N

(6)

k =0

Xs =

k =0

Computation of Phasor from Discrete Fourier Transform

DFT of a Sinusoid

Substituting xk from (3) in (5) and (6) it can be shown that

for a sinusoidal input signal given by (1)

Xs = 2X sin
(7)
Xc = 2X cos
From equation (2), (4) and (7) it follows that
= 1 X1 = 1 (Xc + jXs )
X
2
2

(8)

When the input signal contains other frequency

components as well, the phasor calculated by equation (8)
is a filtered fundamental frequency phasor.

Computation of Phasor from Discrete Fourier Transform

Phase Computation using DFT

Phase Computation using DFT

Let Xcw and Xsw indicate Xc and Xs component of DFT for
w th window.
Window number is the sample number of the first sample
in the active window.
Xcw =

N1
2 X
2
k
xk +w cos
N
N
k =0


2X cos

2
w +
N

Similarly,
Xsw

N1
2 X
2
=
k
xk +w sin
N
N
k =0




2
= 2X sin
w +
N

Computation of Phasor from Discrete Fourier Transform

Phase Computation using DFT

DFT estimated at w th window for (m = 1) is given by







2
2
w
w
w
X1 = Xc jXs = 2X cos
w + + j sin
w +
N
N
Phasor estimate for w th window is given by
w
w = 1 (X w + jX w ) = Xej ej 2
N
X
c
s
2
2

The phasor estimate rotates at a speed of ej N per window

which can be directly derived from DFT phase shifting
property.

Computation of Phasor from Discrete Fourier Transform

Phase Computation using DFT

In the computation of phasor, we would not like this phasor

rotation to occur due to DFT phase shifting.
This can be avoided by
w
w = Xej ej 2
N
X

w
w ej 2
N
= Xej
X

N1
2
2 X
xk +w ej N k
N

!
ej

2
w
N

= Xej

k =0

2
N

w+N1
X
k =w

xk ej

2
k
N

= Xej

Computation of Phasor from Discrete Fourier Transform

Full Cycle Recursive DFT

Full Cycle Recursive DFT

From equation (5) and (6),with elimination of phasor
rotation we have
Xcw

N+w1
X

2
=
N

Xsw =
The computation for
following figure.

2k
N

xk sin

2k
N

k =w

2
N

Xcw

xk cos

N+w1
X
k =w

can be visualized from the

Computation of Phasor from Discrete Fourier Transform

Full Cycle Recursive DFT

Figure: Mechanism of Recursive DFT

Computation of Phasor from Discrete Fourier Transform

Full Cycle Recursive DFT

It is now obvious, that

Xcw+1 = Xcw + (xw+N xw ) cos

2
w
N


(9)

Similarly
Xsw+1

Xsw


+ (xw+N xw ) sin

2
w
N


(10)

It reduces computation from 2N multiply add operation in

normal DFT to 4 additions and 2 multiplications per update.

Computation of Phasor from Discrete Fourier Transform

Full Cycle Recursive DFT

Question
If we follow the convention that latest sample number
corresponds to window number then show that in recursive full
cycle fourier algorithm update equations are given by


2
w+1
w
Xc
= Xc + (xw xwN ) cos
w
N


2
w+1
w
Xs
= Xs + (xw xwN ) sin
w
N

Computation of Phasor from Discrete Fourier Transform

Half Cycle Recursive Form for Phase Estimation

Half Cycle Recursive Form for Phase Estimation

Half cycle form of DFT phasor estimation is given by
Xcw

2
=
N

Xsw =
Question
By substituting xk =

2X cos

(12). Show that

Xcw =

2
N

2X cos

N+w1
X
k =w
N+w1
X
k =w


N

k
N

(11)

k
N

(12)

xk cos

xk sin


k + validate eq (11) and

Xsw = 2X sin

(13)

Computation of Phasor from Discrete Fourier Transform

Half Cycle Recursive DFT

Half Cycle Recursive DFT

Recursive form of half cycle DFT can be derived in an
analogous manner to full cycle DFT.
Recursive update forms for fundamental phasor
computation


 
(N + w) xw cos
w
Xcw+1 = Xcw + xw+N cos
N
N
 
= Xcw (xw+N + xw ) cos
w
N

 
(N + w) xw sin
w
Xsw+1 = Xcw + xw+N sin
N
N
 
= Xsw (xw+N + xw ) sin
w
N

Computation of Phasor from Discrete Fourier Transform

Half Cycle Recursive DFT

Question
If we follow the convention that latest sample number
corresponds to window number then show that in recursive half
cycle fourier algorithm update equations are given by
 
w
Xcw+1 = Xcw + (xw xwN ) cos
 N 
Xsw+1 = Xsw + (xw + xwN ) sin
w
N

Computation of Phasor from Discrete Fourier Transform

Half Cycle Recursive DFT

Discussion

Can we implement Recursive form on a DSP or a

microprocessor?

Computation of Phasor from Discrete Fourier Transform

Half Cycle Recursive DFT

Thank You