CHAPTER 1
INTRODUCTION TO DISCRETE-TIME
SIGNAL & SYSTEM
• INTRODUCTION - CHARACTERISTIC
•TRANSFORMATION – SHIFTING, SCALING & REVERSAL
• DISCRETE –TIME SYSTEM & ITS PROPERTIES
• CONVOLUTION SUM
• LTI SYSTEM AND ITS PROPERTIES
INTRODUCTION
The common scenario in today’s electronic system is to do most
of the processing of a signal using a computer.
A computer can’t directly process a C-T signal but instead needs
a stream of numbers… which is a D-T signal.
INTRODUCTION
Discrete-time signals are functions of a discrete variable; that is, they
are defined only for integer values of the independent variable (time
steps).
Speed CT signal processing is its higher speed than DT
DT systems are not as fast as their counterparts in the CT domain due
to limits on the sampling rate of the A/D converter and the clock rate
of the processor used to implement the DT systems.
Disadvantage CT Signal Processing:
limited performance range
tend to vary with changes in the operating conditions and with age.
more sensitive to noise and interference
Characteristic/ Advantage DT Signal
improved flexibility, self-calibration, and data-logging.
more flexible and can be reprogrammed such that the same
hardware can be used in a variety of different applications.
less sensitive to noise and interference
the data available from the DT systems can be stored in a
digital server so that the performance of the system can be
monitored over a long period of time.
DT SIGNAL TRANSFORMATION
Time scaling : y[n]= x[n] where - integer
For > 1: x[n] is undefined for fractional values of n.
In this case, called decimation or down-sampling, we not
only get a time compression of the signal, but the signal can
also lose part of its information that is, some of its values may
disappear in the resulting signal y[n].
DT SIGNAL TRANSFORMATION
Time Reversal : A time reversal is achieved by multiplying
the time variable by –1.
Time Shifting: y[n]=x[n+N].
For N positive, the signal is advanced by N time steps
For N negative, the signal is delayed by N time steps.
ELEMENTARY DT SIGNAL
DT periodic signal >1 (grows exponentially)
0< >1 < -1
ELEMENTARY DT SIGNAL
Odd DT signal Unit impulse/ Dirac delta function
Unit step function
SYSTEM MODELS AND BASIC PROPERTIES
Input-Output System Models
System Block Diagrams
BASIC SYSTEM PROPERTIES
All of the following system properties apply equally to CT and DT
systems.
Linearity : A system S is linear if it has the additivity property and the
homogeneity property.
Example: y[n] = 2x[n] + 3 – non-linear (prove!)
Time Invariance: A system S is time-invariant if its response to a time-shifted
input signal x[n – N] is equal to its original response y[n] to x[n], but also time
shifted by N: y[n – N]. That is, if for y[n] := Sx[n], y1[n] := Sx[n – N], the
equality y1[n] = y[n – N] holds for any integer N, then the system is time-
invariant.
Example : y[n]= nx[n] is not time-invariant (it is time-varying)
Time Invertible: DT system is invertible if the input signal x[n] can be
uniquely determined from the output y[n] produced in response to x[n].
Example: y[n] = 1/3x[n] + 5 x[t] = 1/3[y[t]-5] – unique (invertible)
y[n] = x[n]2 x[n] = sqrt(y[n]) – not unique (2 possible answer) –not
invertible
BASIC SYSTEM PROPERTIES
Memoryless : A system is memoryless if its output y at n
depends only on the input at that same time.
Example: y[n]= x[n]2 (memoryless)
y[n]=x[n+1]+x[n]+x[n-1] (memory)
Causality : A system is causal if its output at n depends only
on past or current values of the input.
Example: causal:
non-causal :
Bounded-Input Bounded-Output Stability: A system
S is bounded-input bounded-output (BIBO) stable if for any
bounded input x, the corresponding output y is also
bounded.
EXAMPLE
Determine whether the following systems are: (1) memoryless,
(2) time-invariant, (3) linear, (4) causal, or (5) BIBO stable. Justify
your answers.
y[n]= x[1- n]
Solution:
1. Memoryless? No. For example, the output, y[n] depends on a
future value of the input.
2. Time-invariant? No
3. Linear? Yes (prove!)
4. Causal? No. Output, y[n] depends on a future value of the input.
y[0] = x[1]
5. Stable? Yes
DT LTI SYSTEM (LTID) : CONVOLUTION SUM
Given the LTI system and an input signal x[n], the
convolution sum will allow us to compute the corresponding
output signal y[n] of the system.
y[n] x[n] h[n] x[ ]h[n ]
Convolution Integral
Convolution Sum
Example: Convolution Sum
Example2
Compute and plot y[n] for the input signal and impulse
response of an LTI system below.
Answer: y[0] = 3, y[1] = 5
PROPERTIES OF CONVOLUTION SUM
Commutative property: x1[n] ∗ x2[n] = x2[n] ∗ x1[n]
Distributive property:
x1[n] ∗ {x2[n] + x3[n]} = x1[n] ∗ x2[n] + x1[n] ∗ x3[n].
Associative property:
x1[n] ∗ {x2[n] ∗ x3[n]} = {x1[n] ∗ x2[n]} ∗ x3[n].
Shift property If x1[n] ∗ x2[n] = g[n], then
x1[n − n1] ∗ x2[n − n2] = g[n − n1 − n2]
Convolution with impulse function
x1[n] ∗ δ[n − n0] = x1[n − n0].
Convolution with unit step function
PROPERTIES OF DT LTI SYSTEM (LTID)
Refer to properties of impulse response, h[n]
Memoryless: LTID system is memoryless if and only if
h[n] = 0 for n ≠ 0.
Causal: An LTID system will be causal if and only if its
impulse response h[n] = 0 for n < 0.
BIBO Stable: A DT system is BIBO stable if an arbitrary
bounded input sequence always produces a bounded output
sequence.
