Test Sem 1
Test Sem 1
O
o - �·tu - 2;J c,.)
22. e +A·-€ +z. e 2
,lf
I
-? ........
Example: Digital Oscillator
A discrete system should generate the signal :
y (n) = sin ( 0 n ) x(n) =δ(n) y(n) =h(n)
h(n)
+ causal system, results:
1
H ( z ) = Z h ( n ) = Z e jn0 u ( n ) − Z e − jn0 u ( n )
2j
Z e jn0
u (n) = e jn0 −
z =n
1 − e
1
j0 z −1
n =0
with the convergence condition: z e j0 = 1
Z e − jn0
u (n) = e − jn0 −
z =n 1
1 − e− j0 z −1
z e− j0 = 1
1
n =0
Example: Digital Oscillator
1 1 1 sin 0 z −1
H ( z) =
− =
2 j 1− e 0 z
j −1 1 − e 0 z 1 − 2cos 0 z −1 + z −2
− j −1
Im{z}
– poles: p1,2 = e
j0
p1 = e j0
– zeros: z = 0 0 Re{z}
z = 0 −0
The finite difference equation: p2 = e− j0
M N
y (n) = bk x ( n − k ) − ak y ( n − k ) M
bk z −k
k =0 k =1
B( z )
H (z) = = k =0
b0 = 0, b1 = sin 0 A( z ) N
a0 = 1, a1 = −2cos 0 , a2 = 1
1+ ak z − k
k =1
y (n + 1) = sin ( (n + 1)0 )
4
DIGITAL SIGNAL PROCESSING
Discrete signals and systems
Notice that:
𝑁−1
1 − 𝑎𝑁 (1 − 𝑎)(1 + 𝑎 + 𝑎2 +. . . +𝑎𝑁−1 )
𝑛
∑𝑎 = =
1−𝑎 1−𝑎
𝑛=0
∞
1 − 𝑎∞ 1
∑ 𝑎𝑛 = = 𝑤𝑖𝑡ℎ 𝑡ℎ𝑒 𝑐𝑜𝑛𝑣𝑒𝑟𝑔𝑒𝑛𝑐𝑒 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛 |𝑎| < 1 ⇒ 𝑎∞ → 0
1−𝑎 1−𝑎
𝑛=0
∞ ∞
𝑗𝜔 −𝑗𝑛𝜔
1
𝑋(𝑒 ) = ∑ 𝑢(𝑛) 𝑒 = ∑ 𝑒 −𝑗𝑛𝜔 =
1 − 𝑒 −𝑗𝜔
𝑛=−∞ 𝑛=0
c)
∞
𝑗𝜔
𝑋(𝑒 ) = ∑ 𝛿(𝑛)𝑒 −𝑗𝑛𝜔 = 1
𝑛=−∞
5. Let 𝑥(𝑛) = 𝑠𝑖𝑛(𝜔0 𝑛), where 𝐹0 = 1𝑘𝐻𝑧, 𝐹𝑠 = 3𝑘𝐻𝑧. Compute the DFT of 𝑥(𝑛) in 𝑁 = 12 points
and draw the amplitude spectrum obtained.
𝐹0 2𝜋
𝜔0 = 2𝜋 =
𝐹𝑠 3
The DFT of the input signal 𝑥(𝑛) is given by:
𝑁−1
2𝜋
𝑋(𝑘) = 𝐷𝐹𝑇{𝑥(𝑛)} = ∑ 𝑠𝑖𝑛(𝜔0 𝑛) ∙ 𝑒 −𝑗 𝑁 𝑘𝑛 , 𝑤ℎ𝑒𝑟𝑒 𝑘 = 0,1, . . . , 𝑁 − 1
𝑛=0
Considering that:
𝑒 𝑗𝜔0 𝑛 − 𝑒 −𝑗𝜔0 𝑛
𝑠𝑖𝑛(𝜔0 𝑛) =
2𝑗
the previous relation becomes:
𝑁−1 𝑁−1
2𝜋 2𝜋
1 −𝑗 𝑘𝑛 1 −𝑗 𝑘𝑛
𝑋(𝑘) = ∑ 𝑒 𝑗𝜔0 𝑛 ∙ 𝑒 𝑒 𝑁 − ∑ 𝑒 −𝑗𝜔0 𝑛 ∙ 𝑒 𝑒 𝑁
2𝑗 2𝑗
𝑛=0 𝑛=0
Let’s compute separately, the first sum (in blue color) and the 2nd sum (in red):
DIGITAL SIGNAL PROCESSING
Discrete signals and systems
𝑁−1 𝑁−1 𝑁−1
1 2𝜋
𝑗(𝜔 − 𝑘)𝑛 1 2𝜋 2𝜋
𝑗( − 𝑘)𝑛 1 𝑁−3𝑘
𝑠𝑢𝑚1 = ∑ 𝑒 0 𝑁 = ∑𝑒 3 𝑁 = ∑ 𝑒 2𝜋𝑗 3𝑁 𝑛
2𝑗 2𝑗 2𝑗
𝑛=0 𝑛=0 𝑛=0
𝑁−3𝑘 4−𝑘
It is easier to denote 𝑏 = 3𝑁
and knowing that 𝑁 = 12, we will have 𝑏 = 12
. The first sum is
then:
𝑁−1 4−𝑘
1 2𝜋𝑗𝑏𝑛
1 1 − 𝑒 2𝜋𝑗𝑏𝑁 1 1 − 𝑒 2𝜋𝑗 12 12
𝑠𝑢𝑚1 = ∑ 𝑒 = ∙ = ∙ 4−𝑘
2𝑗 2𝑗 1 − 𝑒 2𝜋𝑗𝑏 2𝑗
𝑛=0 1 − 𝑒 2𝜋𝑗 12
0 , 𝑓𝑜𝑟 𝑘 ≠ 4
={
𝑠𝑜𝑚𝑒𝑡ℎ𝑖𝑛𝑔 ?, 𝑓𝑜𝑟 𝑘 = 4
For the term 𝑒 2𝜋𝑗 (4−𝑘) =? = 1, because (4 − 𝑘) ∈ ℤ and I am actually going along the unity circle
several times, a multiple of 2𝜋.
11
1 12 𝑁
𝑠𝑢𝑚1 |𝑘=4 = ∑ 𝑒 2𝜋𝑗 0 𝑛 = =
2𝑗 2𝑗 2𝑗
𝑘=0
0, for k ≠ 4
So, 𝑠𝑢𝑚1 = { N .
2j
, for k = 4
0, 𝑘≠8
𝑠𝑢𝑚2 = { 𝑁
, 𝑘=8
2𝑗
A situation of un-determination could be generated by 𝑘 = −4, but the values for k are positive: 0,
1, …, N-1. For 𝑘 = 8, we will reach 𝑒 −2𝜋𝑗 = 1.
The DFT is then given by:
0, 𝑓𝑜𝑟 𝑘 ≠ 4, 8
𝑁
, 𝑓𝑜𝑟 𝑘 = 4
𝑋(𝑘) = 𝑠𝑢𝑚1 − 𝑠𝑢𝑚2 = 2𝑗
𝑁
− , 𝑓𝑜𝑟 𝑘 = 8
{ 2𝑗
Obviously 𝑋(𝑘) ∈ ℂ. In order to represent the amplitude spectrum, we will compute the absolute
value:
DIGITAL SIGNAL PROCESSING
Discrete signals and systems
0, 𝑓𝑜𝑟 𝑘 ≠ 4, 8
𝑁
|𝑋(𝑘)| = , 𝑓𝑜𝑟 𝑘 = 4
2
𝑁
{+ 2 , 𝑓𝑜𝑟 𝑘 = 8
What is the frequency value corresponding to a bin of k = 4 or 8 in the previous amplitude spectrum?
2𝜋
𝜔𝑘 = 𝑘
𝑁
2𝜋 2𝜋 𝜔4
𝜔4 = 4= ⇒ 𝐹[𝐻𝑧] = ∙ 𝐹 = 1 𝑘𝐻𝑧
12 3 2𝜋 𝑠
2𝜋 4𝜋
𝜔8 = 8=
12 3
Solution:
and so
1 𝜔 1 1 𝜔0
ℎ𝐿𝑃𝐹 (𝑛) = 2𝜋 ∫−𝜔0 𝑒 𝑗𝑛𝜔 𝑑𝜔 = 2𝜋 𝑗𝑛 (𝑒 𝑗𝑛𝜔0 − 𝑒 −𝑗𝑛𝜔0 ) = 𝑛𝜋 𝑠𝑖𝑛(𝑛𝜔0 ) = 𝜋
𝑠𝑖𝑛𝑐(𝑛𝜔0 ).
0
b) Notice that :
𝐻𝐻𝑃𝐹 (𝑒 𝑗𝜔 ) = 1 − 𝐻𝐿𝑃𝐹 (𝑒 𝑗𝜔 )
𝜔0
ℎ𝐻𝑃𝐹 (𝑛) = 𝛿(𝑛) − ℎ𝐿𝑃𝐹 (𝑛) = 𝛿(𝑛) − 𝑠𝑖𝑛𝑐(𝑛𝜔0 )
𝜋
c) Observe that:
𝐻𝑆𝐵𝐹 (𝑒 𝑗𝜔 ) = 1 − 𝐻𝐵𝑃𝐹 (𝑒 𝑗𝜔 )
And so
𝜔2 − 𝜔1 𝜔2 − 𝜔1 𝜔1 + 𝜔2
ℎ𝑆𝐵𝐹 (𝑛) = 𝛿(𝑛) − ℎ𝐵𝑃𝐹 (𝑛) = 𝛿(𝑛) − 𝑠𝑖𝑛𝑐 (𝑛 ) 𝑐𝑜𝑠 (𝑛 )
2𝜋 2 2
,d,,,,,GUM 1 tJ>vi'j""'c.R , / a-i'\ (. i, =) )z-\ > a.,
�� � �:
rr
z �
J c., k,-2k.�Jmtt -2�
lk1\xC�) 2•-
1
1/ Jk. z -&m f(j-12k)XfiJ.:l,-,7.
,2 -) l k l' J
Qe2: {xr:i)t-•�1.z� � a_
z ;_,;,,, �).
r -> °'--
c"''. r"
Cy6)C �---b)
'vVu� � 4Jicm !
X (l) z l{x(V\) j 2 L
'i>"'
nzo
A
� l>fW C'.<W1 �eh � � �"""""
,-a·'t-_,
�� � }a_.:[' I< i &) l �l >-[�(
(,-o i�·(t-t> i)
,-- r��,)
�H:t) z_ t � . � (i)
�i 1 H Ii) · [,- tt ()
rrw.21.
H(i'): 0- �i�)
fnm �
1 Ak t.� r�
=O (<>) lz -2,-1 => c}�
�
Jw,,Jf�
�(r\ -
�v{ �
� 1 roe lw bl©
--- mdl. I ,u,e
o1t
'F-f1c � � P;�,
""°'� _ f--1'e rt= I
�
(i- Ct �') ( I - c; i 1} z � + ti 2
ri -, ,. 1\(
\\ - c, � ) \ - (c-/) 'i, J + 4 · 22
iE �
1
2 {
1
1--H c) , H \ - ·t) ( 1 + 0, 2 s- . i � )( 1 t 4 - f2 ) ( , - re - ; + /-)
-2D 11 <.?
/.j(e_j ,)/ z - c,,, (=) 1-J (e iVfi,) • 0
1. Design a linear phase BPF using the window method and a rectangular window, having the
following parameters: 1st cut-off frequency 𝐹1 = 3 𝑘𝐻𝑧 , 2nd cut-off frequency 𝐹2 = 6 𝑘𝐻𝑧 and
sampling frequency 𝐹𝑠 = 24 𝑘𝐻𝑧. The filter’s length is 𝑁 = 17 and the impulse response function
is anti-symmetrical. What type of linear-phase FIR filter can be used?
Solution:
BPFs can be implemented in any of the 4 types of linear phase FIR filters. The odd length 𝑁 = 17
is possible in types 1 and 3. An anti-symmetrical impulse response is present for types 3 and 4.
Our BPF is then a type 3 linear phase FIR filter.
𝐻0 (𝜔)
−𝜔2 −𝜔1 𝜔
−𝜋 0 𝜔1 𝜔2 𝜋 2𝜋 3𝜋
The reverse discrete-time Fourier transform will result then in the desired impulse response
function:
DIGITAL SIGNAL PROCESSING
Linear phase FIR filters applications
𝜋
1
ℎ𝑑 (𝑛) = ∫ 𝐻𝑑 (𝑒 𝑗𝜔 ) 𝑒 𝑗𝑛𝜔 𝑑𝜔 =
2𝜋
−𝜋
−𝜔1 𝜔2
1 𝑁−1 1 𝑁−1
= ∫ (−𝑗) 𝑒 −𝑗 2 𝜔 𝑒 𝑗𝑛𝜔 𝑑𝜔 + ∫ 𝑗 𝑒 −𝑗 2 𝜔 𝑒 𝑗𝑛𝜔 𝑑𝜔 =
2𝜋 2𝜋
−𝜔2 𝜔1
−𝜔2 𝜔2
1 𝑗(𝑛−
𝑁−1
)𝜔 𝑗 𝑗(𝑛−
𝑁−1
)𝜔
= ∫ 𝑗𝑒 2 𝑑𝜔 + ∫ 𝑒 2 𝑑𝜔
2𝜋 2𝜋
−𝜔1 𝜔1
𝑁−1
By denoting with 𝑝 = 𝑛 − :
2
1 −𝜔2 𝜔2
ℎ𝑑 (𝑛) = ∙ [𝑒 𝑗𝑝𝜔 |−𝜔 + 𝑒 𝑗𝑝𝜔 |𝜔 ] =
2𝜋𝑝 1 1
1
= ∙ [𝑒 −𝑗𝑝𝜔2 − 𝑒 −𝑗𝑝𝜔1 + 𝑒 𝑗𝑝𝜔2 − 𝑒 𝑗𝑝𝜔1 ] =
2𝜋𝑝
1
= ∙ [cos(𝑝𝜔2 ) − cos(𝑝𝜔1 )]
𝜋𝑝
The general formula for the desired impulse response function in types 3 and 4 is then:
1 𝑁−1 𝑁−1
ℎ𝑑 (𝑛) = ∙ [cos ((𝑛 − ) 𝜔2 ) − cos ((𝑛 − ) 𝜔1 )] , 𝑛 ∈ ℤ
𝑁−1 2 2
𝜋 (𝑛 − 2 )
Our real impulse response function, ℎ(𝑛), is obtained by multiplying ℎ𝑑 (𝑛) with a rectangular window:
ℎ (𝑛), 𝑛 = ̅̅̅̅̅̅̅̅̅̅
0, 𝑁 − 1
ℎ(𝑛) = ℎ𝑑 (𝑛) ∙ 𝑤𝑟 (𝑛) = { 𝑑
0, 𝑟𝑒𝑠𝑡
2. Compute the symmetric impulse response function ℎ(𝑛) of a HPF – FIR filter with a linear phase
characteristic, length 𝑁 = 19, using a rectangular window. The cut-off frequency is 𝐹𝑡 = 8 𝑘𝐻𝑧
and the sampling frequency is 𝐹𝑠 = 24 𝑘𝐻𝑧.
Solution:
The only possible type for a symmetrical ℎ(𝑛) with an odd length is type 1.
The normalized angular frequency corresponding to the cut-off frequency is:
𝐹𝑡 2𝜋
𝜔𝑡 = 2𝜋 =
𝐹𝑠 3
The linear-phase component for a type 1 FIR filter is:
𝑁−1
𝜃(𝜔) = − 𝜔
2
DIGITAL SIGNAL PROCESSING
Linear phase FIR filters applications
𝐻𝑑0 (𝜔)
𝜔
−𝜋 −𝜔𝑡 0 𝜔𝑡 𝜋 2𝜋 − 𝜔𝑡 2𝜋 2𝜋 + 𝜔𝑡 3𝜋
The reverse discrete-time Fourier transform is then used to obtain the desired impulse response function:
𝜋
1
ℎ𝑑 (𝑛) = ∫ 𝐻𝑑 (𝑒 𝑗𝜔 ) 𝑒 𝑗𝑛𝜔 𝑑𝜔 =
2𝜋
−𝜋
−𝜔𝑡 𝜋
1 𝑗(𝑛−
𝑁−1
)𝜔 1 𝑗(𝑛−
𝑁−1
)𝜔
= ∫ 𝑒 2 𝑑𝜔 + ∫ 𝑒 2 𝑑𝜔
2𝜋 2𝜋
−𝜋 𝜔𝑡
𝑁−1
The last formula can be simplified with the following notation 𝑝 = 𝑛 − :
2
1 −𝜔 𝜋
ℎ𝑑 (𝑛) = ∙ [𝑒 𝑗𝑝𝜔 | 𝑡 + 𝑒 𝑗𝑝𝜔 |𝜔 ] =
2𝜋𝑗𝑝 −𝜋 𝑡
1
= ∙ [𝑒 −𝑗𝑝𝜔𝑡 − 𝑒 −𝑗𝑝𝜋 + 𝑒 𝑗𝑝𝜋 − 𝑒 𝑗𝑝𝜔𝑡 ] =
2𝜋𝑗𝑝
1
= ∙ [sin(𝑝𝜋) − sin(𝑝𝜔𝑡 )] =
𝜋𝑝
𝜔𝑡
= 𝑠𝑖𝑛𝑐(𝑝𝜋) − 𝑠𝑖𝑛𝑐(𝑝𝜔𝑡 )
𝜋
𝑁−1 𝜔𝑡 𝑁−1
ℎ𝑑 (𝑛) = 𝑠𝑖𝑛𝑐 ((𝑛 − ) 𝜋) − 𝑠𝑖𝑛𝑐 ((𝑛 − ) 𝜔𝑡 ) , 𝑛∈ℤ
2 𝜋 2
The real impulse response function, ℎ(𝑛), is obtained by multiplying ℎ𝑑 (𝑛) with a rectangular window:
ℎ (𝑛), 𝑛 = ̅̅̅̅̅̅̅̅̅̅
0, 𝑁 − 1
ℎ(𝑛) = ℎ𝑑 (𝑛) ∙ 𝑤𝑟 (𝑛) = { 𝑑
0, 𝑟𝑒𝑠𝑡
DIGITAL SIGNAL PROCESSING
Linear phase FIR filters applications
3. Design a LPF with real coefficients, having a linear phase, and using the frequency characteristic
sampling method. The cutoff frequency is 8 𝑘𝐻𝑧 , sampling rate of 24 𝑘𝐻𝑧 and the length is 16.
What type of linear phase FIR filter can be used?
Solution:
The low-pass filters having an even length (𝑁 = 16) can be implemented only in a type 2
configuration. The general cases of low-pass characteristics can be designed only in types 1 and
2. The types 3 and 4 have a mandatory zero in 𝜔 = 0 , which makes impossible a band pass for
low frequencies (band pass for low frequencies implies an amplitude of at least 1 in the transfer
function, in contradiction with the zero for 𝜔 = 0 that demands a rejection).
The normalized cutoff frequency is:
𝐹𝑐 8 1
𝑓𝑐 = = =
𝐹𝑠 24 3
while the corresponding normalized angular frequency:
2𝜋
𝜔𝑐 = 2𝜋𝑓𝑐 =
3
In a type 2 linear phase FIR filter, the zero-phase function 𝐻0 (𝜔) is an even function with a 𝜋
antisymmetric characteristic:
𝐻𝑑0 (𝜔)
2𝜋−𝜔𝑐 2𝜋+𝜔𝑐 𝜔
−𝜋 −𝜔𝑐 0 𝜔𝑐 𝜋 2𝜋 3𝜋
−1
1 , 𝑘 = ̅̅̅̅
0,5
𝐻0 (𝑘) = { −1 , ̅̅̅̅̅̅̅
𝑘 = 11,15
0 , 𝑟𝑒𝑠𝑡 𝑜𝑓 𝑘 𝑣𝑎𝑙𝑢𝑒𝑠
𝐻0 (𝑘)
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 𝑘
−𝜋 −𝜔𝑐 0 𝜔𝑐 𝜋 2𝜋 3𝜋
−1
The desired characteristic for the set of N equally spaced frequencies becomes:
2𝜋
𝑒 −𝑗7,5∙ 16 ∙𝑘 , 𝑘 = ̅̅̅̅
0,5
𝐻𝑑 (𝑒 𝑗𝜔𝑘 ) = 𝐻0 (𝑘) ∙ 𝑒 𝑗∙𝜃(𝜔) = { −𝑗7,5∙2𝜋∙𝑘
−𝑒 16 , 𝑘 = ̅̅̅̅̅̅̅
11,15
0 , 𝑟𝑒𝑠𝑡
Our designed FIR filter will have the impulse response function computed as a reverse Discrete Fourier
Transform:
𝑁−1
1 2𝜋
ℎ(𝑛) = ∑ 𝐻(𝑘) ∙ 𝑒 𝑗𝑛 𝑁 𝑘
𝑁
𝑘=0
For the last summation term written in blue, a change of variable can simplify that term: instead of k, it
will be used 16 − 𝑘 ( 𝑘 → 𝑁 − 𝑘).
5 5
1 1 2𝜋 2𝜋 1 2𝜋 2𝜋
(16−𝑘)
ℎ(𝑛) = + ∑ 𝑒 −𝑗7,5∙16 ∙𝑘 ∙ 𝑒 𝑗𝑛 16 𝑘 − ∑ 𝑒 −𝑗7,5∙ 16 ∙(16−𝑘) ∙ 𝑒 𝑗𝑛 16 =
16 16 16
𝑘=1 𝑘=1
DIGITAL SIGNAL PROCESSING
Linear phase FIR filters applications
5 5
1 1 2𝜋 2𝜋 1 2𝜋 2𝜋
= + ∑ 𝑒 −𝑗7,5∙ 16 ∙𝑘 ∙ 𝑒 𝑗𝑛 16 𝑘 + ∑ 𝑒 +𝑗7,5∙16 ∙𝑘 ∙ 𝑒 −𝑗𝑛 16 𝑘
16 16 16
𝑘=1 𝑘=1
By conveniently grouping the complex exponentials, the designed filter has the symmetrical
impulse response of a type 2 linear-phase FIR:
5
1 1 2𝜋
ℎ(𝑛) = + ∑ cos ((7,5 − 𝑛)𝑘 )
16 8 16
𝑘=1
4. Design a HPF with real coefficients, having a linear phase, and using the frequency characteristic
sampling method. The cutoff frequency is 8 𝑘𝐻𝑧 , sampling rate of 24 𝑘𝐻𝑧 and the length is 19.
What type of linear phase FIR filter can be used? Represent the designed filter coefficients and
the frequency response.
Solution:
Figure 4. The zero-phase function for the frequency characteristic sampling method
The transfer function, in the Discrete Fourier Transform domain, of the digital filter with linear-phase
characteristic is:
𝑁−1 2𝜋 𝑘 𝑘
𝐻(𝑘) = 𝐻0 (𝑘)𝑒 −𝑗 2 𝑁
𝑘
= 𝐻0 (𝑘)𝑒 −𝑗𝜋𝑘+𝑗𝑁𝜋 = (−1)𝑘 𝐻0 (𝑘) 𝑒 𝑗𝑁𝜋
The impulse response coefficients will be computed with the Inverse Discrete Fourier Transform:
𝑁−1
1 2𝜋
ℎ(𝑛) = 𝐼𝐷𝐹𝑇{𝐻(𝑘)}(𝑛) = ∑ 𝐻(𝑘) ∙ 𝑒 𝑗𝑛 𝑁 𝑘
𝑁
𝑘=0
𝑁−1 𝑁−1
1 𝜋 2𝜋 1 1 2𝜋
𝑗𝑘(𝑛+ )
ℎ(𝑛) = ∑(−1)𝑘 𝐻0 (𝑘) 𝑒 𝑗𝑁𝑘 𝑒 𝑗 𝑁 𝑘𝑛 = ∑ (−1)𝑘 𝐻0 (𝑘) 𝑒 2 𝑁
𝑁 𝑁
𝑘=0 𝑘=0
Let it be denoted 𝑁 = 2𝑝 + 1
𝑝 2𝑝
1 1 2𝜋
𝑗𝑘(𝑛+ )
1 2𝜋
𝑗𝑘(𝑛+ )
ℎ(𝑛) = [𝐻0 (0) + ∑(−1)𝑘 𝐻0 (𝑘)𝑒 2 𝑁 + ∑ (−1)𝑘 𝐻0 (𝑘)𝑒 2 𝑁]
𝑁
𝑘=1 𝑘=𝑝+1
𝑝
1 2𝜋 1
ℎ(𝑛) = [𝐻0 (0) + 2 ∑(−1)𝑘 𝐻0 (𝑘) 𝑐𝑜𝑠 ( (𝑛 + ) 𝑘)]
𝑁 𝑁 2
𝑘=1
0
0 I/
If
<D �
-t
1 .. ?f .t Q) i,,, 1 t � zS,S
211-W,_
\,
Nt--r:- 'Yf
�
t 1i'fb z ;!'.
V
t2 z) {2. < � do,C
1.
-" - -- - - - - --
-T