PHASOR ESTIMATION TECHNIQUES - I

Dr Premalata Jena
ELECTRICAL ENGINEERING DEPARTMENT

1
Discrete Fourier Transform

Phasor : A phasor can be defined as a complex number which can represent any
sinusoidal Signal.
•The magnitude of the complex number provides the rms value of the signal.
•Angle of the phasor provides the instantaneous position of the signal on wt axis

2
Discrete Fourier Transform
Phasor Estimation: It Involves in estimating the instantaneous angle and
the rms value of the signal.
The discrete voltage and current signals are fed to the phasor estimation
algorithm to estimate the phasor parameters

3
Discrete Fourier Transform
If V(n) is a periodic signal having N samples per cycle
DFT for the corresponding signal can be written as

N 1 j 2 kn

 V ( n) * e
2
Vk  N , 0  n  N  1,
N n 0
N 1
  n 

2
Vreal   v ( n)  cos  2    
N n 0   N 

N 1
  n 
 v(n)  sin  2    N  
2
Vimg 
N n 0

4
Discrete Fourier Transform
Magnitude and phase of the phasor can be calculated as

Vmag  Vreal 2  Vimg 2

 Vimg 
V phase  arctan  
 Vreal 

5
X(i) Cos(2*pi*i/N) Sin(2*pi*i/N) X(i)*Cos(2*pi*i/N) X(i)*Sin(2*pi*i/N)

-0.2095 0.9511c 0.3088s 0.0735 0.2441

-0.154 0.8092 0.5875 0.1453 0.2094
-0.0841 0.5881 0.8087 0.2029 0.1542
-0.0056 0.3096 0.9508 0.2407 0.0839
0.0734 0.0007 0.9999 0.2548 0.0053
0.1453 -0.3081 0.9513 0.2440 -0.0736
0.2029 -0.5868 0.8096 0.2093 -0.1454
0.2407 -0.8082 0.5888 0.1541 -0.2030
0.2549 -0.9506 0.3103 0.0838 -0.2407
0.2441 -0.9999 0.0015 0.0053 -0.2548
0.2094 -0.9515 -0.3073 -0.0736 -0.2439
0.1541 -0.8101 -0.5862 -0.1454 -0.2092
0.0838 -0.5894 -0.8077 -0.2030 -0.1540
0.0053 -0.3111 -0.9503 -0.2406 -0.0837
-0.0736 -0.0023 -0.9999 -0.2547 -0.0052
-0.1454 0.3065 -0.9518 -0.2439 0.0736
-0.2030 0.5855 -0.8106 -0.2092 0.1454
-0.2407 0.8073 -0.5901 -0.1540 0.2029
-0.2548 0.9501 -0.3118 -0.0837 0.2405
-0.2439 0.9999 -0.0031 -0.0053 0.2546

6
Discrete Fourier Transform
Half Cycle DFT
•In case of half cycle DFT , phasor is calculated using half of the data points.
N / 2 1
  n 

4
Vreal   v (n)  cos  2    
N n 0   N  
N / 2 1
  n 

4
Vimg   v ( n )  sin  2    
N n 0   N 
Vmag  Vreal 2  Vimg 2
 Vimg 
V phase  arctan  
 Vreal 
7
Discrete Fourier Transform
Cosine transform:
N / 2 1
  n 

2
Vcn   v ( n )  cos  2    
N n 0   N 
The phasor can be obtained as
Vn  Vcn  jVc n  ( N / 4)
The sine term can be obtained from past calculation. N/4 refers to 90
degrees

8
Discrete Fourier Transform
Recursive DFT:

9
Discrete Fourier Transform
0.5

magnitude
0

-0.5
0 5 10 15 20 25 30 35 40
samples
0.4
magnitude
0.2

0
0 5 10 15 20 25 30 35 40
samples
5
angle(rad)

-5
0 5 10 15 20 25 30 35 40
samples

10
Recursive Discrete Fourier Transform
Recursive DFT:
Recursive DFT reduces the number of mathematical operations. It requires
previous phasor information.

11
Frequency Error Analysis in DFT
x (t )  X cos( wt   )
x ( k )  X cos( kwTs   )
let
x  Xe j
 e j ( wt  )  e j ( wt  )  xe jwt  x *e  jwt
x(t )  X   
 2 2
 
let
w  2 ( f 0  f )
N 1  2 k 

 x(k
2 
Xr   r )e  N  where, N  no of samples per cycle
N k 0

12
Frequency Error Analysis in DFT
N 1 2 k
j

2 T F
Xr  x(k  r )e N where, N   s  no of samples per cycle
N k 0
Ts f0
N 1 2 k 2 2
j
 x ( k  r )e
2 j 2 j
X r 1  N  Xre N   x(r  N )  x(r ) e N
N k 1
N
2
j
let w  e N

xe jwt  x *e  jwt
x(t ) 
2
2 ( f 0 f ) 2 ( f 0 f )
j k j k
xe f0 N
 x*e f0 N
x(k ) 
2
13
Frequency Error Analysis in DFT
i 1

x(r  k  N )  x(r  k ) w
2 ik
X r i  Xrw  i
N k 0

 j 2 ( f0 f ) ( r  k  N ) j
2 ( f 0 f )
(r  k  N ) 
i 1  
 xe
f0 N
x e* f0 N
 ik

2
 Xrw 
i
 w
N k 0  2 

 

 j 2 ( f0 f ) ( r  k ) j
2 ( f 0 f )
(r k ) 
i 1  
 xe
f0 N
x e * f0 N
 ik

2
  w
N k 0  2 

 


14
Thank You

15