Sie sind auf Seite 1von 17

Anna University Examination Questions

QUESTION PAPER CODE: 90207


B.E. / B.Tech. DEGREE EXAMINATION, NOV /DEC 2019
Fifth Semester (Regulations 2017)
Electrical and Electronics Engineering
EE8591-DIGITAL SIGNAL PROCESSING-ANSWERS
(Common to: Electronics and Instrumentation Engineering)
PART A – (10 X 2 = 20 marks)
1) Show that  (n)  u(n)  u(n  1) graphicall y.

2) Show that the product of two even signals or of two odd signals is an even signal
while the product of an even signal and an odd signal is an odd signal.
Proof: product of an even signal and an odd signal is an odd signal
Let even signal be g[n] and odd signal be h[n]
Product by f[n]=g[n]*h[n]; Now, f(-n)=g[-n]*h[-n]
g(n) is even g[-n]=g[n]; and as h[n] is odd, h[-n]=-h[n]
Substitute into the above equation, f[-n]=-g[n]*h[n]
But g[n]*h[n] is simply f[n] So, f[-n]=-f[n]
Proof: Product of two even signals or of two odd signals is an even signal
h(-x)=f(-x)*g(-x)=f(x)*g(x)=h(x)
3) State and prove that convolution in the time domain is the same as multiplication
in the z-domain.
If x1 (n) & x2 (n) are two sequences
x1 (n) z
 X1 ( z) & x2 (n) z
 X 2 ( z)
x (n)  x2 (n)   X1 ( z) X 2 ( z)
Then 1 z

Proof:

   n  
Z .T  x1 (n)  x2 (n)      x1 (k ) x2 (n  k ) z   x1 (k )  x2 (n  k ) z n  k
n   k   k  n 

  x (k )z
k 
1
k
X 2 ( z)  X1 ( z) X 2 ( z)

4) Determine the magnitude and phase representation for the following system:
1
y(n)  y(n  1)  x(n)  x(n  1) .
4
Solution:
Y ( z )  0.25z 1Y ( z)  X ( z)  z 1 X ( z)
Y ( z) 1  z 1
H ( z)  
X ( z ) 1  0.25 z 1
1  cos   j sin 
Magnitude response: H (e j ) 
1  0.25 cos   j 0.25 sin 

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.1


Anna University Examination Questions
sin 
Phase response:  H (e j )  tan 1 ( )
1  cos 
5) Draw the basic butterfly structure of radix-4 algorithm in the DIT algorithm.
Ans: Out of Syllabus
6) Compute the x(n) for the following sequence using DIF-FFT algorithm:
{1,1  j 2,1,1  j  j 2}
Ans: Given sequence is typing error.
7) Justify the usage of Hamming or Hanning window for FIR filter design as against
Rectangular window.
For the rectangular window the amplitude of the side lobes is unaffected by the
length of widow. The main lobe width of Hanning window is twice that of the
rectangular window, which results in a doubling of the transition region of the filter.
There is smaller ripples in both passband and stopband of the filter designed using
Hanning window.
8) Differentiate IIR and FIR filters.
FIR IIR
They have perfect linear phase They do not have perfect linear phase
FIR filters can be realized recursively and IIR filters are easily realized recursively
non-recursively
Greater flexibility to control the shape of Less flexibility to control the shape of
magnitude response magnitude response
Errors due to round off noise are less severe The round off noise in IIR filters are
mainly because feedback is not used. more

9) Justify the usage of Branch, Call and Return instruction in Digital Signal
Processor.
Branch,Call and Return instructions are the control Instructions in Digital Signal
Processor.
BACC[D]-Branch to location specified by accumulator
CC[D]-Call conditionally
RET-Return
RC[D]-Return conditionally
10) Name any 4 assembler directives and their usage in any digital signal processor.

Assembler directives Description


.mmregs Permits the memory map registers to be referred
using the names such as AR0,SP etc.
.include”XX” Informs the assembler to insert a list of instructions
in the file XX to be inserted in this place and
assemble it.
.end The end of the assembly language program.
.data Assemble into data memory area

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.2


Anna University Examination Questions

PART – B (5x13=65 marks)


11) (a) i) Check whether the following systems are static, linear, time invariant,
causal or stable. [4]

Given system y(n)  x(n) cos n


Static:
Put n=0; y(0)  x(0) cos 0  x(0) ;
Put n=1; y(1)  x(1) cos 1  x(1) cos ;
For all values of ‘n’ the output depends on present values of input. Hence the system
is static.
Causality
Given system y(n)  x(n) cos n
Put n=0; y(0)  x(0) cos 0  x(0) ;
Put n=1; y(1)  x(1) cos 1  x(1) cos ;
For all values of ‘n’ the output depends on present and past values of input. Hence
The system is causal.
Linearity
The output y(n) for an arbitrary input x1(n) is
y1 (n)  x1 (n) cos n
The output y(n) for an arbitrary input x2(n) is
y 2 (n)  x2 (n) cos n
Thus the sum of the individual response is,
y1 (n)  y 2 (n)  x1 (n) cos n  x2 (n) cos n ----1
Combined Response: When the inputs are applied simultaneously then the response
due to sum of inputs is,
y1 (n)  y 2 (n)  x1 (n) cos n  x2 (n) cos n ----2
Eqn (1)=(2). Therefore given system is linear.

Time invariance property:

The response due to delayed input is, yn, k   x(n  k ) cos n ---- (1)
While the delayed response is, yn  k   x(n  k ) cos (n  k ) ----- (2)
Eqn. (1)  (2); So the system is time variant.

Stability property:
The impulse response is, h(n)   (n) cos n
1 for n  0
where,  (n)  
0 for n  0
Put n=0; h(0)   (0) cos 0  1; put n=1; h(1)   (1) cos 1  0; h(n)   (n) cos n
Hence the system is stable.

11.(a) ii) Check whether the following systems are static, linear, time invariant,
causal or stable. y(n)  x(n)  nx(n  1) [5]

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.3


Anna University Examination Questions

Solution: Given system y(n)  x(n)  nx(n  1)


Dynamic:
Put n=0; y(0)  x(0)  0 * x(1)  x(0) ; Put n=1; y(1)  x(1)  1* x(2)  x(1)  x(2)
For all values of ‘n’ the output depends on present and future values of input. Hence
The system is Dynamic.
Non-Causal:
Put n=0; y(0)  x(0)  0 * x(1)  x(0) ; Put n=1; y(1)  x(1)  1* x(2)  x(1)  x(2)
For all values of ‘n’ the output depends on present and future values of input. Hence
the system is non-causal.
Linearity
The output y(n) for an arbitrary input x1(n) is
y1 (n)  x1 (n)  nx1 (n  1)
The output y(n) for an arbitrary input x2(n) is
y 2 (n)  x2 (n)  nx2 (n  1)
Thus the sum of the individual response is,
y1 (n)  y2 (n)  x1 (n)  x2 (n)  nx1 (n  1)  nx2 (n  1) ----1
Combined Response: When the inputs are applied simultaneously then the response
due to sum of inputs is,
y1 (n)  y2 (n)  x1 (n)  x2 (n)  nx1 (n  1)  nx2 (n  1) ----2
Eqn (1)=(2). Therefore given system is linear.
Time invariance property:
The response due to delayed input is, yn, k   x(n  k )  nx(n  k  1) ---- (1)
While the delayed response is, yn  k   x(n  k )  (n  k ) x(n  k  1 ----- (2)
Eqns. (1)  (2); So the system is time variant.
Stability property:
The impulse response is, h(n)   (n)  n (n  1)
1 for n  0
where,  (n)  
0 for n  0
Put n=0; h(0)   (0)  0 *  (0  1)  1 ;
put n=1; h(1)   (1)  1*  (1  1)  0 ;
Hence the system is stable.
11.(a) iii) y(n)  Truncation[ x(n)] [4]
Solution:
Static, Causal, Linear, Time In-variant, stable.
11. (b) Two discrete time systems T1 and T2 are connected in cascade to form a new
system T. Prove or disprove the following statements:
i) If T1 and T2 are causal, then T is causal. (3)
ii) If T1 and T2 are linear and time invariant, then interchanging the order doesn’t
change the system T. (4)
(iii) If T1 and T2 are stable, then T is stable. (3)
(iv) If T1 and T2 are non-causal, then T is non-causal (3)
Solution:
i. If T1 and T2 are causal, then T is causal.

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.4


Anna University Examination Questions

True.
T1 is causal i.e., v(n) depends only on x(k) for k  n .
T2 is causal i.e., y(n) depends only on v(k) for k  n . Therefore, y(n) depends only on
v(k) for k  n . Hence T is causal.
ii) If T1 and T2 are linear and time invariant, then interchanging the order doesn’t
change the system T.
True
The output of the second system is,
y(n)  T2 v(n)  T2 T1  x(n)   T2T1  x(n)   Tc  x(n) 
However, if T1 and T2 are linear and time invariant, then Tc is time invariant and
T2T1  TT
1 2 i.e., the order in which system process the signal is not important.

1 2 yield identical output sequences.


T2T1 & TT
Suppose T1 and T2 are time invariant, then
x(n  k ) T1 v( n  k )
v(n  k ) T2 y( n  k )
Thus, x(n  k ) Tc  TT
1 2 y( n  k )

Therefore Tc is time invariant


(iii) If T1 and T2 are stable, then T is stable.
True.
T1 is stable i.e., v(n) is bounded if x(n) is bounded.
T2 stable i.e., y(n) is bounded if v(n) is bounded.
Hence y(n) is bounded if x(n) is bounded. Therefore Tc is stable.
iv) If T1 and T2 are non-causal, then T is non-causal
True.
T1 is non causal i.e., v(n) does not depends only on x(k) for k  n .
T2 is non causal i.e., y(n) does not depends only on v(k) for k  n . Therefore, y(n)
does not depends only on v(k) for k  n . Hence T is non causal.

12.a) i) Determine the Z-transform and compute the Region of


convergence: x(n)  e 3n u(n  1) (7)

  
e3 z 1 e3
X ( z)  
n 
x(n) z  n   e3n z  n = (e 3 z 1 )n 
n 1 n 1
=
1  e3 z 1 Z  e3
1 1
ROC: e3 z 1  1  3 1  z 
ez e3

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.5


Anna University Examination Questions
12.a(ii) Use convolution to find x(n), if X(z), is given by (6)
1
X ( z) 
1 1
(1  z 1 )(1  z 1 )
2 4
Solution:
Z2
X (Z ) 
 Z  0.5 Z  0.25
Z
X1 (Z )   x1 (n)   0.5 u (n)
n

Z  0.5
 0.5n
 n0
x1 (n)  

0 n<0
 0.5
 n-k  0  k  n
n-k

x1 (n  k )  

0 k>n
Z
X 2 (Z )   x2 (n)   0.25 u (n)
n

Z  0.25
 0.25
 k0
k

x2 (k )  

0 k<0

x(n)  x1 (n)* x2 (n)   x (n  k ) x (k )
k 
1 2

n n n
x(n)    0.5  0.25   2k  0.25   0.5    0.5
nk k k n k

k 0 k 0 k 0

n  0.5    0.5 
 0
 n 1

x(n)   0.5  
 1  0.5 
2
x(n)   0.5 1  0.5  0.5   u(n)
n n

3  

12. b) Compute and sketch the convolution and correlation of the two signals
x(n)={1,2,3,4} and h(n)={1,2,3,4) (7+6)

Convolution:
X  z   1  2z 1  3z 2  4z 3
H  z   z 3  2z 2  3z  4
Y  z   X  z  H  z   1  2z 1  3z 2  4z 3  z 3  2z 2  3z  4 
 z 3  4z 2  10z  20  25z 1  24z 2  16z 3
y n   1,4,10,20,25,24,16

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.6


Anna University Examination Questions

Correlation: Out of Syllabus

13.a)Compute the FFT using DIT algorithm for the following sequence: (7)
X(n)={1.-1,-1,-1,1,1,1,-1}

13.(b)(i) Compute the circular convolution of the following sequences: (7)


x1 (n)  { (n)   (n  1)   (n  2)   (n  3)}
x2 (n)  { (n)   (n  1)   (n  4)}
Solution:

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.7


Anna University Examination Questions

13. b) ii) Establish the relationship between Fourier transform and Z-transform. (6)

Z transform evaluated on a unit circle(r=1) is DTFT.



X (e j )   x ( n)e
n 
 j n

14. a) Determine H(z) for a Butterworth filter satisfying the following constraints
using impulse invariant transformation and T=1 sec. (13)
Pass band edge magnitude= 0.5

Pass band frequency=
2
Stop band magnitude=0.2
3
Stop band frequency=
4
Solution:
1
 0.5 =0.707; A1  0.707 and 1  0.5
1  2

1
 0.2 ; A2  0.2 and 2  0.75
1  2
The pre warped frequencies are,

 
 p   1   0.5 rad / sec
T 

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.8


Anna University Examination Questions
 
S   1   0.75 rad / sec ;
T 
s
where , k  =1.5;  =1;  =4.898
p

Determination of order:

 1/ A2 2  1  
 log  
1/ A12  1  
 1

N1  0.5  
  3.92 [OR]
N  log  / log  =3.92
 log   S
  
    k

  P 
Choose N=4
Determination of cutoff frequency:
P
C  1
 0.5  1.57 rad / sec
1/ A  1
1
2 2N

The transfer function of the fourth order normalized LPF is,


1
H a (S ) 
S 2
 0.765S  1 S 2  1.848S  1

S S
Applying LP to LP transformation i.e., S  
C 1.57

1.57 
4

H a (S ) 
S 2
 1.2S  1 S 2  2.9S  1

Applying partial fraction expansion,

1.57 
4
AS  B CS  D
  2
S 2
 1.2S  1 S  2.9S  1
2
 S  1.2S  1  S  2.9S  1
2

Solving for constants, A=-1.456, B=-1.75, C=1.456, D=4.23

1.456S  1.75 1.456S  4.23


H a (S )  
 S 2  1.2S  1  S 2  2.9S  1
The roots of the denominator are, S1,2  0.6  j1.45 & S1,2  1.45  j 0.6

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.9


Anna University Examination Questions
  S  1.45 
1.45 
 
  S  1.45   0.6   S  1.45   0.6  
2 2 2 2

H a ( S )  1.456  
  S  0.6  
0.6 
  S  0.6 2  1.452   S  0.6 2  1.452  
 
      

  S  1.45 
1.45 0.6 
 
  S  1.45   0.6  0.6  S  1.45   0.6  
2 2 2 2

H a ( S )  1.456  
  S  0.6  
0.6 1.45 
  S  0.6 2  1.452  1.45  S  0.6 2  1.452  
 
      

b e aT SinbTZ 1
WKT, IIT
 S  a  2  b 2  1  2e aT CosbTZ 1  e2 aT Z 2
 

 S  a  IIT 1  e aT CosbTZ 1
 S  a  2  b 2  1  2e aT CosbTZ 1  e2 aT Z 2
 

1.45 e0.6  Sin1.45  Z 1 0.54Z 1


IIT 
 S  0.6 2  1.452  1  2e0.6Cos 1.45 Z 1  e20.6 Z 2 1  0.13Z 1  0.3Z 2
 
0.6 e1.45  Sin0.6  Z 1 0.13Z 1
IIT 
 S  1.45 2  0.62  1  2e1.45 Cos0.6Z 1  e21.45 Z 2 1  0.39Z 1  0.055Z 2
 

 S  1.45 IIT
1  e1.45  Cos0.6  Z 1

1  0.2Z 1
 S  1.452  0.62  1  2e1.45  Cos0.6  Z 1  e21.45 Z 2 1  0.4Z 1  0.055Z 2
 

 S  0.6  IIT
1  e 0.6  Cos1.45 Z 1

1  0.066Z 1
 S  0.6 2  1.452  1  2e 0.6  Cos1.45 Z 1  e20.6 Z 2 1  0.13Z 1  0.3Z 2
 

 1  0.2Z 1 0.13Z 1 
  2.42 2 
1  0.4Z  0.055Z
1 2
1  0.4Z  0.055Z 
1
H ( Z )  1.456  1 
 1  0.066Z 0.54Z 1 
 0.41
 1  0.13Z 1  0.3Z 2
 1  0.13Z 1  0.3Z 2  

 1.456  0.184Z 1 1.456  0.232Z 1 


H (Z )   1 2
 
1  0.4Z  0.055Z 1  0.13Z 1  0.3Z 2 

14. b) The desired frequency response of a Low pass filter is (13)


3 3
H d (ei )  e  j 3 for  
4 4
3
0 for |  | 
4

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.10


Anna University Examination Questions
Determine H d (e jw ) for a rectangular window of width 7.
Solution:
3 3
4 4
1 1
 e  e
 j 3
hd (n)  e jn d  j ( n 3)
d
2 3 2 3
4 4
3
Sin(n  3)
hd (n)  4 for n  3
(n  3)
1  3 3 
hd (3)    0.75
2  4 4 
The filter coefficients are symmetrical about n=3.
3
Sin(4  3)
hd (2)  hd (4)  4  0.225
(4  3)
3
Sin(5  3)
hd (1)  hd (5)  4  0.16
(5  3)
3
Sin(6  3)
hd (0)  hd (6)  4  0.075
(6  3)
hd n   0.075, 0.16,0.225,0.75,0.225, 0.16,0.075

N 1 / 2
The frequency response is given by, H (e j )   a(n) cos n
n 1

H (e j )  0.75  0.45 cos   0.32 cos 2  0.15 cos 3


a(0)=h(N-1/2)=h((7-1)/2=h(3)=0.75;
a(n)=2h((N-1)/2-n)
a(1)=2h(3-1)=2*h(2)=2*0.225=0.45;
a(2)=2h(3-2)=2*h(1)=2*(-0.16)= -0.32;
a(3)=2h(3-3)=2h(0)=2*0.075=0.15
The frequency response is given by
H (e j )  0.75  0.45 cos   0.32 cos 2  0.15 cos 3
15. a) Discuss the architecture of any one commercial DSP and explain with
necessarydiagram. (13)
Architecture of TMS 320C50 processor:
The 'C5x devices offer these advantages:
Enhanced TMS320 architectural design for increased performance and
versatility
Modular architectural design for fast development of spin-off devices

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.11


Anna University Examination Questions
Advanced integrated-circuit processing technology for increased
performance
Upward-compatible source code
Enhanced TMS320 instruction set for faster algorithms and for
optimized high-level language operation.New static-design techniques
for minimizing power consumption and maximizing radiation
tolerance.

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.12


Anna University Examination Questions

15.b) Discuss in brief the addressing formats and functional modes of any one
commercial DSP.(13)

Data addressing modes provide various ways to access operands to execute


instructions and place results in the memory or the registers. The 54XX devices offer
seven basic addressing modes.

1. Immediate addressing.
2. Direct addressing.
3. Indirect addressing.
4. Memory mapped addressing
5. Circular addressing.
6. Register addressing
1. Immediate addressing:

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.13


Anna University Examination Questions
The instruction contains the specific value of the operand. The operand can be short
(3,5,8 or 9 bit in length) or long (16 bits in length). The instruction syntax for short
operands occupies one memory location,
Example: ADD # 49H,A;
LD #20, DP.
RPT #0FFFFh.
2.Direct Addressing:
Base address + 7 bits of value contained in instruction = 16 bit address. A page of 128
locations can be accessed without change in DP or SP.Compiler mode bit (CPL) in
ST1
register is used.
If CPL =0 selects DP
CPL = 1 selects SP,
It should be remembered that when SP is used instead of DP, the effective address is
computed by adding the 7-bit offset to SP.
3. Indirect Addressing:
• Data space is accessed by address present in an auxiliary register.
• 54xx have 8, 16 bit auxiliary register (AR0 – AR 7). Two auxiliary register
arithmetic units (ARAU0 & ARAU1)
• Used to access memory location in fixed step size. AR0 register is used for
indexed and bit reverse addressing modes.
• For single – operand addressing
MOD type of indirect addressing
ARF AR used for addressing
• ARP depends on (CMPT) bit in ST1
CMPT = 0, Standard mode, ARP set to zero
CMPT = 1, Compatibility mode, Particularly AR selected by ARP
4. Memory-Mapped Register Addressing:

• Used to modify the memory-mapped registers without affecting the current data
page
pointer (DP) or stack-pointer (SP)
– Overhead for writing to a register is minimal
– Works for direct and indirect addressing
– Scratch –pad RAM located on data PAGE0 can be modified
5. Circular Buffer Addressing:

• Used for FFT algorithms. Special circular Buffer registers are used,
(ie).CBSR1- Circular Buffer Start Register1
CBER1- Circular Buffer End Register1
CBSR2- Circular Buffer Start Register2
CBER2- Circular Buffer End Register2
6. Register Addressing:
Accumulator content is used as address to transfer data between Program and Data
memory.Ex: READA *AR2

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.14


Anna University Examination Questions
PART-C (1X15=15Marks)
16. a) i)Determine the response of the system defined by the equation
5 1
y(n)  y(n  1)  y(n  2)  x(n)
6 6
1
To the input signal x(n)   (n)   (n  1) assuming zero initial conditions.
3
(10)
Solution:
5 1
y(n)  y(n  1)  y(n  2)  x(n)
6 6
5 1 1
y(n)  y(n  1)  y(n  2)   (n)   (n  1)
6 6 3
Taking Z transform on both sides
 5 1  1
y ( Z ) 1  Z 1  Z 2   1  Z 1
 6 6  3
 5 1  1 
y ( Z )  Z 2  Z    1  Z 1  Z 2
 6 6  3 
 5 1  1
y(Z )  Z 2  Z    z  z  
 6 6  3
 1
 z 
Y  z  3

z  2 5 1
Z  Z  
 6 6
 1
z 
 3

A

B
 2 5 1  (Z  0.5) ( Z  0.33)
Z  Z  
 6 6
Z  0.33  A(Z  0.33)  B(Z  0.5)
Solving, A=5 and B = - 4
5Z 4Z
Y (Z )  
(Z  0.5) ( Z  0.33)
 y(n)= 5(0.5)n  4(0.33)n  u(n)

16.a.ii) Justify and explain the necessity for quantization and the Nyquist criterions
influence on the quantization function. (5)
Digital Signal Processing system:
Sampling: This is the conversion of continuous time signal into a discrete time signal
obtained by taking samples of the continuous time signal at discrete time instants.

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.15


Anna University Examination Questions

Quantization is the process of conversion of discrete time continuous valued signal


into a discrete time discrete valued signal. The difference between actual output
and quantized output is called quantization error. As the number of bits in the digital
word is finite, A/D conversion results in a finite resolution. The digital output can
assume only a finite number of levels, and therefore an analog number must be either
rounded off or truncated to the nearest digital level. So the error that exists due to the
quantization process is called quantization error.
Let xq(n) denote the sequence of quantized samples at the output of
the quantizer. Hence xq(n) = Q[x(n)]. Then the quantization error is a
sequence eq(n) defined as the difference between the quantized value and
the actual sample value.

Thus eq(n) = xq(n)-x(n). Quantization is done two ways.

 Truncation (excess digits are discarded)


 Rounding (rounded off to next integer level)

(OR)
16. b) Obtain the parallel and cascade realization of the following filter structure
using Transpose form II. (7+8)

H (Z ) 
 3  5Z 
1
 0.6  3Z 1 
1  5Z 1  2Z 2  1  Z 1 
Solution:
Cascade form:

H (Z ) 
 3  5Z 1   0.6  3Z 1 
1  5Z 1  2Z 2  1  Z 1 
Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.16
Anna University Examination Questions

Parallel form:

H (Z ) 
 3  5Z 1   0.6  3Z 1 
1  5Z 1  2Z 2  1  Z 1 
Z 1.8Z 2  12Z  15  Z 1.8Z 2  12Z  15 
H (Z )  
Z 2
 5Z  2   Z  1  Z  4.56  Z  0.44  Z  1
H (Z )

1.8Z 2  12 Z  15 
Z  Z  4.56  Z  0.44  Z  1
Applying PFE to
1.8Z 2
 12 Z  15 
 Z  4.56  Z  0.44  Z  1
1.8Z 2
 12Z  15  A
 
B

C
 Z  4.56  Z  0.44  Z  1  Z  4.56   Z  0.44   Z  1
Solving for constants, A= 7.26 B=8.94 & C= -14.4
7.26Z 8.94Z 14.4Z 7.26 8.94 14.4
H (Z )      
 Z  4.56  Z  0.44   Z  1 1  4.56Z  1  0.44Z  1  Z 1 
1 1

Prepared by Prof.S.Nagammai, HOD/EIE, KLNCE A.17

Das könnte Ihnen auch gefallen