CHAPTER 2 Digital Signal Processing

CHAPTER T W O
Discrete-time Signals and system

Ephrem Ch. & Zemenu A.
Nov, 2022
1
JIT DSP
Discrete-Time signals
Discrete-Time System
Analysis of Discrete-Time LTI systems
Implementation of Discrete-Time System
Correlation of Discrete-time signals
Outline
1. Discrete-Time Signals
• Some Elementary Discrete Time Signals
• Classification of Discrete Time Signals
• Simple Manipulation of Discrete Time Signals
2. Discrete Time Systems
• Input-Output Description of Systems
• Block Diagram Rep of DT systems
• Classification of DT Systems
3. Analysis of DT LTI Systems
• Resolution of a DT signal into Impulses
• Response of LTI system to arbitrary inputs: The convolution Sum
• Properties of convolution and the Interconnection of LTI Systems
4. Implementation of Discrete-Time System
5. Correlation of DT signals
2
JIT DSP
Discrete-Time System Discrete-Time signals
Analysis of Discrete-Time LTI systems Classification of Discrete-Time Signals
Implementation of Discrete-Time System Simple Manipulation of Discrete-Time Signals
A discrete-time signal X(n) is a function of an independent

variable that is an integer.
A discrete-time signal is not define at instants betweenTwo
successive samples.
Figure : Graphical representation of a discrete-time signal.

3
JIT DSP
Cont....
Alternatively represented by:
1. Functional Representation such as:

0.9 𝐹𝑜𝑟 𝑛 = −4
−0.8 𝐹𝑜𝑟 𝑛 = −3
0.7 𝐹𝑜𝑟 𝑛 = −4
1.5 𝐹𝑜𝑟 𝑛 = −2
2 𝐹𝑜𝑟 𝑛 = −1
𝑥 𝑛 = 1.7 𝐹𝑜𝑟 𝑛 = 0
1.0 𝐹𝑜𝑟 𝑛 = 1
0.7 𝐹𝑜𝑟 𝑛 = 2
−0.8 𝐹𝑜𝑟 𝑛 = 3
1.2 𝐹𝑜𝑟 𝑛 = 4
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒 4
JIT DSP
Cont....
Alternatively represented by:
2. Tabular representation such as:
3. Sequence representation such as:
5
JIT DSP
Some elementary signal Discrete-Time Signals

1.Unit sample sequence: Graphical representation
1 For n=0
δ (n) =
0 For n /= 0
2. Unit-step signal Graphical representation

1 For n ≥ 0
u(n) =
0 For n < 0
3. The unit ramp signal Graphical representation

n For n ≥ 0
ur (n) =
0 For n < 0
6
JIT DSP
Cont...
4.Exponential Signal:
X(n)=an For all n
0<a<1 a>1
-1<a<0 a<-1
7
JIT DSP
Classification of Discrete-Time Signals
Energy Signals and Power signals
The energy E of a signal X(n) is defined as

∞
E≡ ∑ |X (n)|2
n =−∞
The energy of the a signal can be infinite or finite(0 < E < ∞).
If E is finite, then X(n) is called an energy signal.
8
JIT DSP
Classification of Discrete-Time Signals
Energy Signals and Power signals
▪ Many signals that possess infinity energy have a finite

average power.
▪ The average power P of a signal X(n) is defined as
1
P = lim σ𝑁
𝑛=−𝑁 𝑥(𝑛)
2
𝑁→∞ 2𝑁+1
▪ The energy of the a signal can be infinite or finite(0 < E < ∞). If
E is finite, then X(n) is called an energy signal.
▪ Clearly, if E is finite, P =0. On the other hand if E is infinite, the

average power P may be finite or infinite.
9
JIT DSP
Cont...
Periodic signals and aperiodic signals
A signal X(n) is periodic with period N if and only if
X (n +N) = X (n) for all n
The smallest value of N for which X (n + N) = X (n) holds is

Called the fundamental period.
If there is no value of N that satisfies X (n + N) = X (n), the
signal is called non-periodic or aperiodic.
10
JIT DSP
Cont...
Symmetric (even) and antisymmetric (odd) signals
▪ A real-valued signal X(n) is called symmetry (even) if
X (−n) = X (n)
▪ A signal X(n) is called antisymmetric (odd) if
X (−n) = −X (n), X(0)=0.
▪ Any arbitrary signal can be expressed as a sum of two

signal component, one of which is eve and the other is
odd.
1
𝑥𝑒 𝑛 = 𝑥 𝑛 + 𝑥 −𝑛
2
1
𝑥𝑜 𝑛 = (𝑥 𝑛 − 𝑥(−𝑛))
2 11
JIT DSP
Cont....
Example
Decompose the Following function into an evenand an odd
competent
x(n) = { 2, 3, 4, 5, 6}
↑
x(n) = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9}
↑
x(n) = e0.1n [U(n + 5) − U(n − 10)]
12
JIT DSP
Simple Manipulation of Discrete-Time Signals
1 Transformation of the independent Variable(time)

A signal X(n) may be shifted in time by replacing the
independent variable n by n-k.
If k is a positive integer, the time shift results in a delay of the
signal by k units of time.
If K is a negative integer, the time shift results in an advance
of the signal by |k| units in time.
2 Folding or reflection of signal
replacing the independent variable n by -n about the time
origin n=0.
3 Time scaling or Down-Sampling
Replacing n by µn. Where µ is an integer.
13
JIT DSP
Cont...
4 Scaling of a signal
Amplitude scaling of a signal by a constant A is accomplished
by multiplying the value of every signal sample by A.
Y (n) = AX (n) −∞ < n < ∞
5 Addition of Signal
y(n) = X1 (n) + X2 (n) −∞ < n < ∞

6 Multiplication of signal
y(n) = X1 (n)X2 (n) −∞ < n < ∞
14
JIT DSP
Cont...
1 Find X(n-3) and X(n+2)

2 Find X(-n)
3 Scale X(n) by 5
4 Add X(n) with X(n)
5 multiply X(n) by X(n)
6 Find X(2n)
7 Find X(-2n-3)
15
JIT DSP
Discrete-Time System Discrete-Time System
Classification of Discrete-Time System
Discrete-time system is a device or algorithm that operates on
a discrete-time signal called the input or excitation, according
to somewell-defined rule, to produce an other discrete-time
signal called the output or response of the system.
Y (n) ≡ T [X (n)]
where the symbol T denotes the transformation or processing
performed by the system on x(n) to produce Y(n).
Input-Output Description of System
16
JIT DSP
Cont ..…
Alternatively T
X (n) → Y (n)
Y(n) is the response of the system T to the excitation X(n).
Example
Determine the response of the F.F systems to the input signal
|n| −3 ≤ n ≤ 3
X (n) =
0 Otherwise
(A) Y(n)=X(n)
(B) Y(n)=X(n-1)
(C) Y(n)=X(n+1)
(D) Y(n)=1/3[X(n+1)+X(n)+X(n-1)]
(E) Y(n)=max[X(n + 1),X (n),X (n − 1)]
(F) Y(n)= ∑ nk=-∞ X (k) = X (n) + X (n − 1) + X (n − 2)+,…. 17
JIT DSP
Block Diagram Representation of Discrete-Time System

Basic blocks to realize complex system
Adder Graphical representation

Adder is asystem that
performs the addition of two
signal sequence. Which is
denoted by Y(n).
It is not necessaryto store
either one of the sequence in
order to perform the
addition.
So the addition operation is
memoryless. 18
JIT DSP
Analysis of Discrete-Time LTI systems Classification of Discrete-Time System
Cont...
Constant multiplier
Constant multiplier is Graphical representation

applying a scale factor on
the input x(n).
This operation is also
memoryless.
Unit delay element
Z −1 denote unit delay.
The unit delay is a special
system that simply delays Graphical representation
the signal passing through it
by one sample.
This operation needs
memory. 19
JIT DSP
Cont...
Signal Multiplier Graphical representation
Multiplication of two signal

sequences to form another
sequence
Also Multiplication operation
does not need memory.
20
JIT DSP
Cont...
Unit advance element If the signal is stored in the

memory of the computer, it
Unit advance moves the
is possible to recall any
input X(n) ahead by one
sample at any time.
sample in time to yield
X(n+1). It is possible to advance the
signal X(n) in time.
The operation Z being used
to denote the unit advance. Graphical representation
Unit advance is physically
impossible in real time. since
in fact it involves looking
into the future of the signal.
21
JIT DSP
Con...
Example
Sketch the block diagram representation of the discrete-time

system described by the input-output relation.
1 y(n) = 14 y(n − 1 ) + 12 x(n) + 12 x(n− 1)
2 Y [n] = α 1 X [n]+ α 2 X [n − 1]+ α 3 X [n − 2]+ α 4 X [n − 3]
3 Y [n] = b0X [n]+ b1X [n − 1]+ b2X [n − 2]+ a1Y [n − 1]+ a2Y [n − 2]
22
JIT DSP

It is desirable to classify the systems according to the general
properties that they satisfy.
Because analyzing and designing DT system depend
heavily on the general characteristics of the system that
are being considered.
Static versus Dynamic Systems
Static Systems(Memoryless): The O/p at any instant n depends at
most on the input sample at the same time, But not
on past or future samples of the input.
Dynamic(to have Memory): The O/P of a system at time n is
completely determined by the input samples in the
interval from n-N to n the system is said to have
memory of duration N. 23
JIT DSP
Cont...
Example
Y (n) = aX(n)
Y (n) = nX (n) + bX 3 (n)
Y (n) = X (n) + 3X (n − 1)
n
Y (n) = ∑ X (n −k)
K =0
∞
Y (n) = ∑ X (n − K )
k=0
24
JIT DSP
Time-invariant versus Time-variant systems

Time-invariant System (Shift-invariant): A system for which a
time shift or delay of the input sequence causes a
corresponding shift in the output sequence.
If the system is time invariant and Y1(n) is the system output
due to the input X1(n), then the shifted system input
X1 (n − n0 ) will produce a shifted system output Y1 (n − n0 ) by
the same amount of time n0.
25
JIT DSP
Cont...
Example
Y(n)=X(n)-X(n-1)
Y(n)=nX(n)
Y(n)=X(-n)
Y(n)=X(n)cosw0 n
Y(n)=2X(n-5)
Y(n)=-2X(3n)
Y(n)=4X(n2)
26
JIT DSP
Cont...
Linear versus non-linear system

Linear System: A linear system is one that satisfies the
Superposition principle.
Figure : Digital linear system.
27
JIT DSP
Cont...
Example
Determine if the systemsdescribed by the following input-output
equations are linear or non-linear.
(a) Y(n)=nX(n)
(b) Y(n)=X(n2)
(c) Y(n)=X 2 (n)
(d) Y(n)=AX(n)+B
(e) Y(n)=eX (n)
28
JIT DSP
Cont...
Causal versus non-causal Systems

A causal system is the one in which the output Y(n) at time n
depends only on the current input X(n) at time n, and its past
input sample values such as X(n-1), X(n-2),...
Otherwise, if a system output depends on future input values
such as X(n+1), X(n+2),... the system is noncausal.
The noncausal system cannot be realized in real time.
29
JIT DSP
Cont...
Example
Determine if the systemsdescribed by the following input-output
equations are causal or non-causal.
(a) Y(n)=X(n)-X(n-1)
(b) Y(n)= ∑nk=−∞ X (k)
(c) Y(n)=ax(n)
(d) Y(n)=X(n)+3X(n+4)
(e) Y(n)=X(n 2)
(f) Y(n)=X(2n)
(g) Y(n)=X(-n)
30
JIT DSP
Stable versus unstable System

A system is said to be bounded input-bounded output (BIBO)
stable if and only if every bounded input produces abounded
output.
Let Mx and My are a finite numbers such that
|X (n)| ≤ Mx < ∞ |Y (n)| ≤ My < ∞
for all n (BIBO), then the systems is called stable system.

Otherwise the system is unstable.
Unstable system usually exhibit erratic and extreme behavior
and cause overflow in any practical implementation.
Example: Y (n) = Y 2 (n − 1) +X (n), Let x(n) = C𝛿(𝑛),
where C is any constant number. And assume y(-1)=0.
The system is BIBO Unstable
JIT DSP
Analysis of Discrete-Time LTI systems Analysis of Discrete-Time LTI systems
Resolution of a Discrete-Time signal into Impulses (Impulse

Response
The elementary signals are selected so that the response of the

system to each signal component is easily determined.
Then by using linearity property, the response of the system to
the elementary signals are added to obtain the total response
of the system to the given input signal.
A linear time-invariant system can be completely described by
its unit-impulse response, which is defined asthe system
response due to the impulse input δ (n).
Multiply two sequences X(n) and δ (n − k). since δ (n − k) is
zero everywhere except at n=k.
32
JIT DSP
Cont...
So the result of multiplication is another sequence that is zero

everywhere except at n=k.
that means
X (n)δ (n − k) = X (k)δ (n − k)
Repeat the multiplication of X(n) with δ (n − m) , where m is
another delay (m ≠ k), the result will be a sequencethat is
zero everywhere except at n=m, where its value is X(m).
That means
X (n)δ (n − m) = X (m)δ (n − m)
33
JIT DSP
Cont...
Consequently, if werepeat this multiplication over all possible
delay −∞ < k < ∞ and sum all the product sequacity the result
will be a sequence equal to the sequence X(n)
∞
X (n) = ∑ X (k)δ (n − k)
k=−∞
Example
Resolve the sequencex(n) into asum of weighted impulse

sequences.
x(n) = { 2, 4, 0, 3}
↑
34
JIT DSP
Responseof LTI system to arbitrary inputs: The convolution

Sum
The response Y(n) of the LTI system as a function of the
input signal X(n) and the unit sample (impulse) response h(n)
is called a Convolution Sum, and given as:
∞ ∞
Y (n) = ∑ X (k)h(n − k) = ∑ X (n −k)h(k)
k=−∞ k=−∞
The convolution between X(k) and h(k) involves the following

four steps.
1 Folding: Fold h(k) about k=0 to obtain h(-k).
2 Shifting: shift h(-k) by n to the right (left) if n is positive
(negative) to obtain h(n-k).
3 Multiplication: Multiply X(k) by h(n-k) to obtain the product
sequence X(k)h(n-k).
35
JIT DSP
Cont...
Summation: Sum all the value of the product sequence.
Example
Determine the convolution of y(n) = x(n) ∗h(n)
h(n) = { 1, 2, 1, -1}
↑
x(n) = { 1, 2, 3, 1}
↑
x(n) = { 3, 11, 7, 0, -1, 4 2}
↑
h(n) = { 2, 3, 0, -5, 2, 1}
↑
36
JIT DSP
Properties of convolution and the Interconnection of LTI

Systems
1 Commutative Law
X (n) ∗h(n) = h(n) ∗X (n)
2 Associative Law
[X (n) ∗h1 (n)] ∗h2 (n) = X (n) ∗[h1 (n) ∗h2 (n)]
3 Distributive Law
X (n) ∗[h1(n) + h2(n)] = X (n) ∗h1(n) + X (n) ∗h2(n)
37
JIT DSP
Analysis of Discrete-Time LTI systems Implementation of Discrete-Time System

consider the First-order system
Y (n) = −a1Y (n − 1) + b0X (n) + b1X (n − 1) (1)
From Z transform property
Y (n) ←→ Y (z)
Y (n − k) ←→ z−k Y (z)
Find the the Z-transform of equation 1
Y (Z ) = −a1 Z −1 Y (Z ) + b0 X (Z ) + b1 Z −1 X (Z )
Y (Z )[1+ a1 Z −1 ] = X (Z )[b0 + b1 Z −1 ]
The transfer function(Y (Z )/X (Z ) is given by
Y (Z ) b0 +b1Z −1
X (Z ) 1+ a1 Z −1
38
JIT DSP
Cont...
Direct form I structure

Uses separate delay (memory) for both the input and output
signal samples.
Let assume
V (Z ) = X (Z )[b0 +b1Z −1] that means V (n) = b0X (n)+b 1 X (n −1)
V (Z )
Y (Z ) = That meansY (n) = −a1 Y (n − 1) + V (n)
1+ a1 Z −1
39
JIT DSP
Cont...
Direct form I structure
40
JIT DSP
Cont...
Direct form II structure

The transfer function(Y (Z )/X (Z ) is given by
b0 +b1Z −1
Y (Z ) = X (Z )
1+ a1 Z −1
Let assume
X (Z )
w(Z ) = that means w(n) = −a1 w(n − 1) + X (n)
1+ a1 Z −1
Y (Z ) = [b0 +b1Z −1]w (Z ) that means Y (n) = b0w(n)+b1w (n−1)
41
JIT DSP
Cont...
Direct form II structure
42
JIT DSP
Cont...
For General LTI system by DF I Graphical representation
N M
Y (n) = − ∑ ak Y (n−k) + ∑ bk X (n−k)
k=1 k=0
M
V (n) = ∑ bk X (n − k) and
k=0
N
Y (n) = − ∑ ak Y (n −k)
k=1
This Structure requires M+N delays and
N+M+1 multiplications.
43
JIT DSP
Cont...
Graphical representation
For General LTI system by DF II
n
w(n) = − ∑ ak w(n − k) + X (n) and
k=1
M
Y (n) = − ∑ bk w(n − k)
k=0
This Structure requires Max(M,N)
delays and N+M+1 multiplications.
44
JIT DSP
Cont...
Example
Realize the following equation by Direct I and Direct II with number
of delay and multiplication required to implement.
Y (n) = b0X (n) + b1X (n − 1) + b2X (n − 2) + b3X (n − 3) + b4X (n − 4)
+ b5X (n − 5) − a1Y (n − 1) − a2Y (n − 2) − a3Y (n − 3) −a4Y (n − 4)
45
JIT DSP
Analysis of Discrete-Time LTI systems Correlation of Discrete-time signals

The correlation between two signals is to measure the degree
to which the two signals are similar and thus to extract some
information that depends to a large extent on the application
such asradar, sonar, digital communications, and other areasin
science and engineering.
Suppose we two signal sequence X(n) and Y(n) that we wish
to compare.
For example in radar application X(n) can be represent the
sampled version of the transmitted signal.
Y(n) represent the sampled version of the received signal.
If a target is present in the spacebeing searched by the radar
the received signal Y(n) consists of adelayed version of the
transmitted signal, reflected from the target and corrupted by
additive noise. 46
JIT DSP
Cont...
Y (n) = α X (n − D) + w(n)
Where α is some attenuation factor

D is the delay
w(n) the additive noise.
47
JIT DSP
Cont...
If there is no target in the space searched by the radar, the

received signal Y(n) consists of noise alone.
In practice, the signal X(n-D) is heavily corrupted by the
additive noise.
BY a visual inspection of Y(n) does not reveal the presence or
absence of the desired signal reflected from the target.
Correlation provides us with a means for extracting this
important information from y(n).
48
JIT DSP
Cont...
Having X(n) which is transmited signal and Y(n) the recieved
signal, the problem in radar detection is to compare Y(n) and
X(n) to determine if a target is present.
After that determine the time delay D and compute the
distance to the target.
The crosscorrelation of X(n)and Y(n) is a sequence rXY (l ) is
given.
∞
rXY (l ) = ∑ X (n)Y (n − l )
n=−∞
Equivalentlly
∞
rXY (l ) = ∑ X (n +l )Y (n)
n=−∞
49
JIT DSP
50
JIT DSP 50

CHAPTER 2 Digital Signal Processing

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CHAPTER 2 Digital Signal Processing

Uploaded by

Copyright:

Available Formats

CHAPTER T W O

Discrete-time Signals and system

A discrete-time signal X(n) is a function of an independent

Figure : Graphical representation of a discrete-time signal.

Alternatively represented by:

1. Functional Representation such as:

Alternatively represented by:

2. Tabular representation such as:

3. Sequence representation such as:

Some elementary signal Discrete-Time Signals

2. Unit-step signal Graphical representation

3. The unit ramp signal Graphical representation

Classification of Discrete-Time Signals

Energy Signals and Power signals

The energy E of a signal X(n) is defined as

Classification of Discrete-Time Signals

Energy Signals and Power signals

▪ Many signals that possess infinity energy have a finite

▪ Clearly, if E is finite, P =0. On the other hand if E is infinite, the

Periodic signals and aperiodic signals

A signal X(n) is periodic with period N if and only if

X (n +N) = X (n) for all n

The smallest value of N for which X (n + N) = X (n) holds is

X (−n) = −X (n), X(0)=0.

▪ Any arbitrary signal can be expressed as a sum of two

x(n) = e0.1n [U(n + 5) − U(n − 10)]

Simple Manipulation of Discrete-Time Signals

1 Transformation of the independent Variable(time)

Y (n) = AX (n) −∞ < n < ∞

y(n) = X1 (n) + X2 (n) −∞ < n < ∞

y(n) = X1 (n)X2 (n) −∞ < n < ∞

1 Find X(n-3) and X(n+2)

Input-Output Description of System

Block Diagram Representation of Discrete-Time System

Adder Graphical representation

Constant multiplier is Graphical representation

Signal Multiplier Graphical representation

Multiplication of two signal

Unit advance element If the signal is stored in the

Sketch the block diagram representation of the discrete-time

Classification of Discrete-Time System

Time-invariant versus Time-variant systems

Linear versus non-linear system

Figure : Digital linear system.

Causal versus non-causal Systems

Stable versus unstable System

|X (n)| ≤ Mx < ∞ |Y (n)| ≤ My < ∞

for all n (BIBO), then the systems is called stable system.

Resolution of a Discrete-Time signal into Impulses (Impulse

The elementary signals are selected so that the response of the

So the result of multiplication is another sequence that is zero

Resolve the sequencex(n) into asum of weighted impulse

Responseof LTI system to arbitrary inputs: The convolution

The convolution between X(k) and h(k) involves the following

Determine the convolution of y(n) = x(n) ∗h(n)

Properties of convolution and the Interconnection of LTI

X (n) ∗h(n) = h(n) ∗X (n)

X (n) ∗[h1(n) + h2(n)] = X (n) ∗h1(n) + X (n) ∗h2(n)

Implementation of Discrete-Time System

Direct form I structure

V (Z ) = X (Z )[b0 +b1Z −1] that means V (n) = b0X (n)+b 1 X (n −1)

Direct form I structure

Direct form II structure

Y (Z ) = [b0 +b1Z −1]w (Z ) that means Y (n) = b0w(n)+b1w (n−1)