Scribd
Upload
5 views25 pages

Lec 2 DSP

Uploaded by

am978623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views25 pages

Lec 2 DSP

Uploaded by

am978623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

Digital signal processing

Lec.2
Dr. Abdallah gad
Communication & electronics
October high institute for engineering & technology
➢Elements of discrete-time systems
➢ Network Analysis

Lecture outline ➢Signal Flow-Graph Analysis


➢Node elimination method
➢Unit DeLay y(nT) = x(nT-T)

➢Adder 𝑦(𝑛𝑇) = ෌𝐾
𝑖=1 𝑥𝑖 (𝑛𝑇)

Elements of discrete-time systems

➢Multiplier 𝑦(𝑛𝑇) = ෌𝐾
𝑖=1 𝑥𝑖 (𝑛𝑇)
➢ The analysis of a discrete-time network, which is the process of
deriving the difference equation characterizing the network

ℰ 𝑟 𝑥 𝑛𝑇 = 𝑥 𝑛𝑇 + 𝑟𝑇

the shift operator ℰ 𝑟

Network Analysis The shift operator is one of the basic operators of numerical analysis
which will advance or delay a signal depending on whether r is positive
or negative. Its main properties are as follows:
1. Since

ℰ 𝑟 [𝑎1 𝑥1 (𝑛𝑇) + 𝑎2 𝑥2 (𝑛𝑇)] = 𝑎1 𝑥1 (𝑛𝑇 + 𝑟𝑇) + 𝑎2 𝑥2 (𝑛𝑇 + 𝑟𝑇)


= 𝑎1 ℰ 𝑟 𝑥1 (𝑛𝑇) + 𝑎2 ℰ 𝑟 𝑥2 (𝑛𝑇)
2. Since
ℰ 𝑟 ℰ 𝑝 𝑥(𝑛𝑇) = ℰ 𝑟 𝑥(𝑛𝑇 + 𝑝𝑇) = 𝑥(𝑛𝑇 + 𝑟𝑇 + 𝑝𝑇)
= ℰ 𝑟+𝑝 𝑥(𝑛𝑇)
the shift operator obeys the usual law of exponents.
3.
𝜀 −𝑟 𝜀 𝑟 = 𝜀 𝑟 𝜀 −𝑟 = 1

4. A linear combination of powers of 𝜀 𝑟 defines a meaningful


operator, e.g., if

Network Analysis 𝑓(ℰ) = 1 + 𝑎1 ℰ + 𝑎2 ℰ 2

𝑓(ℰ)𝑥(𝑛𝑇) = (1 + 𝑎1 ℰ + 𝑎2 ℰ 2 )𝑥(𝑛𝑇)
= 𝑥(𝑛𝑇) + 𝑎1 𝑥(𝑛𝑇 + 𝑇) + 𝑎2 𝑥(𝑛𝑇 + 2𝑇)
Given that
𝑀 𝑁

𝑦(𝑛𝑇) = ( ෍ 𝑎𝑖 ℰ −𝑖 )𝑥(𝑛𝑇) − (෍ 𝑏𝑖 ℰ −𝑖 )𝑦(𝑛𝑇)


𝑖=−𝐾 𝑖=1
Find the operator ℛ

𝑦(𝑛𝑇) = ℛ𝑥(𝑛𝑇)

Network Analysis
𝑀
෌𝑖=−𝐾 𝑎𝑖 ℰ −𝑖
ℛ=( 𝑁 )
1+ ෌𝑖=1 𝑏𝑖 ℰ −𝑖

INPUT SYSTEM OUTPUT


(a) Analyze the network of Fig. A. (b) Repeat
part (a) for the network of
Fig. (B).

Sol:
(a) Analyze the network of Fig. A. (b) Repeat
part (a) for the network of
Fig. (B).
Sol:
(a) Analyze the network of Fig. A. (b) Repeat
part (a) for the network of
Fig. (B).
➢ Each adder by a node with one outgoing branch and
as many incoming branches as there are inputs to the
adder
➢ Each distribution node by a distribution node
Signal Flow-Graph Analysis ➢ Each multiplier by a directed branch with
transmittance equal to the constant of the multiplier
➢ Each direct transmission path by a directed branch
with transmittance equal to unity
➢ Each unit delay by a directed branch with
transmittance equal to the shift operator ℰ −1 .
Signal
Flow-
Graph
➢ In the node elimination method, the given signal flow graph is
reduced down to a single branch between the input and output nodes
through a sequence of node eliminations and simplifications, and the
transmittance of the last remaining branch is the operator
of the network.
NODE ELIMINATION METHOD ➢ Node elimination can be accomplished by applying a small set of
rules, as follows:
➢ Rule 1: K branches in series with transmittances T1, T2, . . . , TK can
be replaced by a single branch with transmittance T1T2 . . . TK , as
shown in Fig. 4.a.
➢ Rule 2: K branches in parallel with transmittances T1, T2, . . . ,
TK can be replaced by a single branch with transmittance T1 +
T2 + · · · + TK , as illustrated in Fig. 4.b.

NODE ELIMINATION METHOD


Rule 3: A node with N incoming branches with transmittances TI
1, TI 2, . . . , TI N and M outgoing branches with transmittances
TO1, TO2, . . . , TO M can be replaced by N × M branches with
transmittances TI 1TO1, TI 1TO2, . . . , TI N TO M as illustrated in
Fig. 4.c.

NODE ELIMINATION METHOD


Rule 4a: K self-loops at a given node with transmittances T1, T2, .
. . , TK can be replaced by a single self-loop with transmittance T1
+ T2 + · · · + TK , as illustrated in Fig. 4.d.

NODE ELIMINATION METHOD


➢ Rule 4b: A self-loop at a given node with transmittance TSL can be
eliminated by dividing the transmittance of each and every incoming
branch by 1 - TSL as shown in Fig. 4.e.

NODE ELIMINATION METHOD


➢ the equations of the bottom flow
graph in Fig. 4.e are given by

𝑇𝑙1 𝑇𝑙2
𝑀= 𝐼 + 𝐼
1 − 𝑇𝑆𝐿 1 1 − 𝑇𝑆𝐿 2
𝑂 = 𝑇𝑀𝑂 𝑀

and can be obtained from the


equations of the top flow graph in
Fig. 4.e, that is,
NODE ELIMINATION METHOD

𝑀 = 𝑇𝐼1 𝐼1 + 𝑇𝐼2 𝐼2 + 𝑇𝑆𝐿 𝑀


𝑂 = 𝑇𝑀𝑂 𝑀
Example Find the difference equation of the discrete-time network shown in Fig by using the node elimination
method.
Sol:

By using rule3

By using rule2
Sol:

By using rule3

By using rule2
Sol:

By using rule3

By using rule 4b

By using rule1
Sol:
(a) Find the impulse response of the system in Fig. . The system is initially relaxed, that is, y(nT ) = 0 for n < 0, and p
is a real constant. (b) Find the unit-step response of the system.

(a) the system is characterized by the difference equation

𝑦 𝑛𝑇 = 𝑥 𝑛𝑇 + 𝑝𝑦 𝑛𝑇 − 𝑇
Any questions?

You might also like