Scribd
Upload
14 views45 pages

CH 2 1

Uploaded by

dawitsirak1221
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
14 views45 pages

CH 2 1

Uploaded by

dawitsirak1221
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/ 45

Chapter: Two

Discrete time signals and systems

2.1. Discrete-Time Signals: are signals defined only


for integer time index.
• Discrete time signals are represented as sequences
of numbers, called samples.
• Sample value of a typical signal or sequence
denoted as x[n] with n being an integer in the range
 n

1
Discrete-Time Signals
Representation
• Discrete-time signals can be represented
using:
Sequence of numbers
Graph
Table
Function

2
Cont’d…
• Discrete-time signal can be written as a sequence
of numbers inside braces:

{x[n]}  {,  0.2, 2.2,1.1, 0.2,  3.7, 2.9,}



• In the above, x[1]  0.2, x[0]  2.2, x[1]  1.1,
etc.
• The arrow is placed under the sample at time
index n = 0.

3
Cont’d…
• Graphical representation of a discrete-time
signal with real-valued samples

4
Cont’d…

n -1 0 1
X[n] 1 2 -2

5
Elementary (Common) discrete
time signals

6
Classification of discrete time
signals
• Discrete time signals can be classified as:

Periodic and Aperiodic signals

Energy and power signals

Even and odd signals

7
Periodic and Aperiodic signals

8
Cont’d…

9
Cont’d…

10
Energy and Power signals

11
Cont’d…

12
Cont’d…
Note:
• If energy is finite sequence, average power is zero.
• If energy is infinite sequence, average power may
be either finite or infinite.
Therefore,
• An infinite-energy signal with finite average power
is called a power signal
• A finite-energy signal with zero average power is
called an energy signal
13
Cont’d…

14
Cont’d…

15
Even and Odd signals

16
Cont’d…

17
Cont’d…

18
Basic operations on discrete
time signals
• Addition operation:
x[n]  y[n]
– Adder y [ n ]  x[ n ]  w[ n ]
w[n]

• Multiplication operation
A
– Multiplier x[n] y[n] y [ n ]  A  x[ n ]

19
Cont’d…
• Time-shifting operation: y[n]  x[n  N ]
where N is an integer
• If N > 0, it is delaying operation
– Unit delay y [ n ]  x [ n  1]
x[n] z 1 y[n]

• If N < 0, it is an advance operation


x[n] z y[n] y [ n ]  x [ n  1]
– Unit advance
20
Cont’d…
• Time-reversal (folding) operation:
y [ n ]  x[  n ]

• Branching operation: Used to provide


multiple copies of a sequence
x[n] x[n]

x[n]
21
Cont’d…
• Example - Consider the following two
sequences of length 5 defined for 0  n  4 :
{a[n]}  {3 4 6  9 0}
{b[n]}  {2  1 4 5  3}
• New sequences generated from the above
two sequences by applying the basic
operations are as follows:

22
Cont’d…
{c [ n ]}  {a [ n ]  b [ n ]}  {6  4 24  45 0}
{d [ n ]}  {a [ n ]  b [ n ]}  {5 3 10  4  3}
{e[ n ]}  3 {a[ n ]}  {4 .5 6 9  13.5 0}
2

• Operations on two or more sequences can


be carried out if all sequences involved are
of same length and defined for the same
range of the time index n.

23
Cont’d…
• However if the sequences are not of same
length, in some situations, this problem can
be circumvented by appending zero-valued
samples to the sequence(s) of smaller
lengths to make all sequences have the same
range of the time index.
• Example - Consider the sequence of length
3 defined for 0  n  2: { f [n]}  { 2 1  3}
24
Cont’d…
• We cannot add the length-3 sequence { f [n]}
to the length-5 sequence {a[n]} defined
earlier
• We therefore first append { f [n]} with 2
zero-valued samples resulting in a length-5
sequence { fe [n]}  {2 1 3 0 0}
• Then
{g[n]}  {a[n]}  { fe[n]}  {1 5 3  9 0}
25
Combinations of Basic
Operations
• Example -

y[n]  1x[n]   2 x[n  1]  3 x[n  2]   4 x[n  3]


26
Sampling Rate Alteration

L 1

x[n] L xu [n]
27
Cont’d…

x[n] M y[n]

28
Cont’d…

29
2.2. Discrete-Time Systems
• A discrete-time system processes a given input
sequence x[n] to generates an output sequence y[n]
with more desirable properties
• In most applications, the discrete-time system is a
single-input, single-output system:

x[n]
Discrete time y[n]
System
Input sequence Output sequence

30
Discrete-Time Systems: Examples

31
Cont’d…

32
Cont’d…
• M-point moving-average system -

• Used in smoothing random variations in data

• Its application is in denoising:


• Consider, x[n] = s[n] + d[n],
where s[n] is the signal corrupted by a noise d[n].

33
Cont’d…

34
Cont’d…

35
Classification of Discrete-Time
Systems:
• Memory loss or memory
• Time invariant or time variant
• Linear or non-linear
• Causal or non-causal
• Stable or unstable

36
Memory loss or memory systems

37
Time invariant or time variant
systems

38
Cont’d…

39
Linear or non-linear Discrete-
Time Systems

40
Cont’d…

41
Cont’d…

42
Cont’d…

43
Causal or non-causal system

44
Stable or Unstable systems

45

You might also like