Scribd
Upload
100 views

Digital Signal Processing: Discrete-Time Systems Lecture - 4

The document discusses block diagram representations of discrete-time systems. It defines basic building blocks like adders, constant multipliers, signal multipliers, unit delay elements, and unit advance elements. These blocks can be interconnected in cascades, parallel configurations, or using feedback to represent more complex discrete-time systems. An example block diagram is provided to represent a system with the input-output relation y(n)=y(n-1)+0.5x(n)+0.5x(n-1). Interconnection topologies allow simple systems to be combined to accomplish overall designs.

Uploaded by

Saif Alabdullah
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
100 views

Digital Signal Processing: Discrete-Time Systems Lecture - 4

The document discusses block diagram representations of discrete-time systems. It defines basic building blocks like adders, constant multipliers, signal multipliers, unit delay elements, and unit advance elements. These blocks can be interconnected in cascades, parallel configurations, or using feedback to represent more complex discrete-time systems. An example block diagram is provided to represent a system with the input-output relation y(n)=y(n-1)+0.5x(n)+0.5x(n-1). Interconnection topologies allow simple systems to be combined to accomplish overall designs.

Uploaded by

Saif Alabdullah
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

Digital signal processing

Dr. Saad Muhi Falih


DSP-II p. 1

Chapter 1

Discrete-Time Systems
Lecture - 4

Block Diagram Representation of


Discrete-Time Systems

DSP-II 2p. 2
Block Diagram Representation of Discrete-Time
Systems

• It is useful at this point to introduce a block


diagram representation of discrete time
systems.
• For this purpose we need to define some basic
building blocks that can be interconnected to
form complex systems.

DSP-II 3p. 3

Block Diagram Representation of Discrete-Time


Systems

1) adder: Figure below illustrates a system (adder) that


performs the addition of two signal sequences to form
another (the sum) sequence, which we denote as 𝑦(𝑛).
• Note that it is not necessary to store either one of the
sequences in order to perform the addition. In other words,
the addition operation is memoryless.

x(n)
𝑦(𝑛)=x(n)+r(n)

r(n)

DSP-II 4p. 4
Block Diagram Representation of Discrete-Time
Systems

2) constant multiplier: This operation is depicted by Fig.


below, and simply
• represents applying a scale factor on the input x ( n ) . Note
that this operation is also memoryless.

c
X(n) Y(n)=c.X(n)
• OR

X(n) c Y(n)=c.X(n)

DSP-II 5p. 5

Block Diagram Representation of Discrete-Time


Systems

1) signal multiplier: Figure below illustrates the


multiplication of two signal sequences to form another (the
product) sequence, denoted in the figure as
• y ( n ) . As in the preceding two cases, we can view the
multiplication operation as memoryless.

x1(n) Y(n)=x1(n).x2(n)

x2(n)
DSP-II 6p. 6
Block Diagram Representation of Discrete-Time
Systems
4) unit delay element: The unit delay is a special system
that simply delays
• the signal passing through it by one sample.
• Figure below illustrates such a system.
• If the input signal is x ( n ) , the output is x(n - 1).
• In fact, the sample x(n - 1) is stored in memory at time n -
1 and it is recalled from memory at time n to form
• Thus this basic building block requires memory.
• The use of the symbol ,z-1 to denote the unit of delay will
become apparent when we discuss the Z transform

DSP-II 7p. 7

Block Diagram Representation of Discrete-Time


Systems
5) unit advance element: In contrast to the unit delay, a unit
advance moves the input x( n ) ahead by one sample in time to
yield x(n + 1).
• Figure below illustrates this operation, with the operator Z being
used to denote the unit being used to denote the unit advance.

• We observe that any such advance is physically impossible in real


time, since. In fact, it involves looking into the future of the signal.
• On the other hand. if we store the signal in the memory of the
computer, we can recall any sample at any time. In such a non
real-time application, it is possible to advance the signal x(n) in
time.
DSP-II 8p. 8
Block Diagram Representation of Discrete-Time
Systems
Example: Using basic building blocks introduced above.
sketch the block diagram representation of the discrete-
time system described by the input-output relation.
𝟏 𝟏 𝟏
𝒚 𝒏 = 𝒚 𝒏 − 𝟏 + 𝒙 𝒏 + 𝒙(𝒏 − 𝟏)
𝟒 𝟐 𝟐
where x ( n ) is the input and y ( n ) is the output of the
system.
Solution : the output y ( n ) is obtained by multiplying the
Input x ( n ) by 0.5, multiplying the previous input x( n - 1 )
by 0.5. adding the two products, and then adding the
previous output y(n - 1) multiplied by 1/4.
• Figure a illustrates this block diagram realization of the
system.
• Figure b illustrates another block diagram realization
of the same system.
DSP-II p. 99

Block Diagram Representation of Discrete-Time


Systems
0.5
x(n) y(n)

0.5
0.25
a

0.5
x(n) y(n)

0.25
b
10

DSP-II p. 10
Interconnection of Discrete-Time Systems

• Simple systems can be connected together


one system's output becomes another's input
to accomplish some overall design.
• Interconnection topologies can be quite
complicated, but usually consist of weaves of
three basic interconnection forms.
1. Cascade (series)
2. Parallel
3. Feedback

DSP-II p. 11
11

Interconnection of Discrete-Time Systems


1. Cascade (series)
• The simplest form is when one system's output is
connected only to another's input.
• Mathematically,
𝒚𝟏 (𝒏) = 𝑻𝟏 (𝑥 (𝒏)), and 𝑦 𝒏 = 𝒚𝟐 (𝒏) = 𝑻𝟐 (𝒚𝟏 (𝒏)), with the
information contained in x (t) processed by the first, then
the second system.
• In some cases, the ordering of the systems matter, in
others it does not.
• For example, in the fundamental model of
communication (Figure) the ordering most certainly
matters.
DSP-II p. 12
12
Cascade (series)

𝒙𝟏 (𝒏) 𝒚𝟏 (𝒏)𝒙𝟐 (𝒏) 𝒚𝟐 (𝒏)


x(n) 𝑻𝟏 𝑻𝟐 y(n)

y(𝒏) = T[x(𝒏)] = 𝑻𝟐 𝑻𝟏 𝒙(𝒏)

DSP-II p. 13
13

Interconnection of Discrete-Time Systems


2. Parallel
• A signal x (t) is routed to two (or more) systems, with
this signal appearing as the input to all systems
simultaneously and with equal strength.
• Block diagrams have the convention that signals going
to more than one system are not split into pieces along
the way.
• Two or more systems operate on x(t) and their outputs
are added together to create the output y (t).
• Thus,
𝑦(𝑡) = 𝑻𝟏 (𝑥(𝑡)) + 𝑻𝟐 (𝑥(𝑡)),
and the information in x(t) is processed separately by
both systems.
DSP-II p. 14
14
Parallel

𝒙𝟏 (𝒏)=𝒙(𝒏) 𝒚𝟏 (𝒏)
𝑻𝟏

x(n) y(n)

𝑻𝟐
𝒙𝟐 (𝒏)= 𝒙(𝒏) 𝒚𝟐 (𝒏)
𝑻

y(𝒏) = T[x(𝒏)] = 𝑻𝟏 𝒙(𝒏) +𝑻𝟐 𝒙(𝒏)

DSP-II p. 15
15

Interconnection of Discrete-Time Systems


3. Feedback
• The subtlest interconnection configuration has a
system's output also contributing to its input.
• Engineers would say the output is "fed back" to the
input through system 2, hence the terminology.
• The mathematical statement of the feedback
interconnection (Figure 2.12) is that the feed-forward
system produces the output: 𝑦 (𝒏) = 𝑻𝟏 (𝑒(𝒏)) .
The input e(t) equals the input signal minus the output
of some other system's output to y(t):
𝑒(𝒏) = 𝑥 (𝒏) − 𝑻𝟐 (𝑦(𝒏)).
• Feedback systems are omnipresent in control
problems, with the error signal used to adjust the
output to achieve some condition defined by the input
(controlling) signal.
DSP-II p. 16
16
Feedback

𝒆𝟏 (𝒏)
x(n) 𝑻𝟏 y(n)
-

𝑻𝟐 𝒚(𝒏)
𝑻𝟐

y(𝒏) = T[x(𝒏)] = 𝑻𝟏 𝒙 𝒏 − 𝑻𝟐 𝒚(𝒏)

DSP-II p. 17
17

END

DSP-II p. 18
18

You might also like