Discrete Time Signal

Time-Domain Representation
Discrete Time Signal: Time-Domain
Representation
• Signals 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
• x[n] defined only for integer values of n
and undefined for non-integer values of n
• Discrete-time signal represented by {x[n]}
Discrete Time Signal: Time-Domain
Representation
• Discrete-time signal may also be written
as
 
x[n]  ...,0.2, 2.2,1.1,0.2,3.7,2.9,...
a sequence of numbers inside braces:
• 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
Discrete Time Signal: Time-Domain
Representation
• Some alternative representation of
discrete time signal
– Graphical representation
– Functional representation
– Tabular representation
– Sequence representation
 Graphical representation
• Graphical representation of a discrete-time
signal with real-valued samples:
Functional representation

1,.........n  1,3

x[n]   4,..........n  2
 0,..elsewhere

 Tabular representation

n … -2 -1 0 1 2 3 4 5 …
x(n) … 0 0 0 1 4 1 0 0 …
 Sequence representation

 
x(n)  ...,0,0, 0,1,4,1,0,... (Infinite form)
  

 
x(n)  0,1,4,1,0 (Finite form)
 
 Elementary Discrete-Time
Signals
• These elementary signals are also called
standard signals.
• The standard discrete-time signals are as
follows:
1. Unit step sequence
2. Unit ramp sequence
3. Unit parabolic sequence
4. Unit impulse sequence
 Elementary Discrete-Time
Signals
• The standard discrete-time signals are as
follows: (cont’n)
5. Sinusoidal sequence
6. Real exponential sequence
7. Complex exponential sequence
 Elementary Discrete-Time Signals
• Unit Step Signal is denoted as u(n) and is
defined as 1, n  0
u ( n)  
0, n  0
 Elementary Discrete-Time Signals
• Unit Ramp Signal is denoted as ur(n) and
is defined as n, n  0
u r ( n)  
0, n  0
Elementary Discrete-Time Signals
• Unit Parabolic Signal is denoted as up(n)
and is defined as n 2 2 , n  0
u p ( n)  
 0, n0
 Elementary Discrete-Time Signals
• Unit sample sequence (Unit Impulse) is
denoted as δ(n) and is defined as

1, n  0
 ( n)  
0, n  0

• It is a signal that is zero everywhere,

except at n = 0 where its value is unity
Elementary Discrete-Time Signals
• Unit sample sequence
 Elementary Discrete-Time Signals
• Properties of discrete-time unit sample
sequence
 Elementary Discrete-Time Signals
• Relation between the unit sample
sequence and the unit step sequence
• The unit sample sequence and the unit
step sequence u(n) are related as:
 Elementary Discrete-Time Signals
• Sinusoidal Sequence
• The discrete-time sinusoidal sequence is
given by
x(n) = Asin(ωn + ϕ)
• where A is the amplitude, ω is angular
frequency, ϕ is phase angle in radians and
n is an integer.
 Elementary Discrete-Time Signals
• Sinusoidal Sequence
• The period of the discrete-time sinusoidal
sequence is

where N and m are integers.

• All continous-time sinusoidal signals are
periodic, but discrete-time sinusoidal
sequences may or may not be periodic
depending on the value of ω.
 Elementary Discrete-Time Signals
• Sinusoidal Sequence
• For a discrete-time signal to be periodic,
the angular frequency w must be a rational
multiple of 2π.
 Elementary Discrete-Time Signals
• Exponential Signal is a sequence of the
form x(n) = an for all n
• If the parameter a is real, then x(n) is a
real signal.
• If the parameter a is complex valued, it
can be expressed as a = rej, where r and
 are now the parameters. Hence, x(n),
can be express as x(n) = rnejn = rn(cosn
+ jsinn)
Elementary Discrete-Time Signals
• Exponential Signal
Elementary Discrete-Time Signals
• Exponential Signal
 Elementary Discrete-Time Signals
Example:
Find the following summations:
 Elementary Discrete-Time Signals
Solution:
 Basic Operation on Sequences
• The basic operations on sequences are as
follows:
1. Time shifting
2. Time reversal
3. Time scaling
4. Amplitude scaling
5. Signal addition
6. Signal multiplication
Basic Operation on Sequences
• Time Shifting
• The time shifting of a signal may result in
time delay or time advance.
• The time shifting operation of a discrete-
time signal x(n) can be represented by
y(n) = x(n – k)
• This shows that the signal y(n) can be
obtained by time shifting the signal x(n) by
k units.
 Basic Operation on Sequences
• Time Shifting
• If k is positive, it is delay and the shift is to
the right, and if k is negative, it is advance
and the shift is to the left.
Basic Operation on Sequences
Basic Operation on Sequences
• Time Reversal
• The time reversal also called time folding
of a discrete-time signal x(n) can be
obtained by folding the sequence about n
= 0.
• The time reversed signal is the reflection
of the original signal.
• It is obtained by replacing the independent
variable n by –n.
Basic Operation on Sequences
• Time Reversal
• Time reverse (flip)
Basic Operation on Sequences
• Time Reversal
• Time reversed and advanced signal x(-
n+3)
Basic Operation on Sequences
• Time Reversal
• Time reversed and delayed signal x(-n-3)
Basic Operation on Sequences
• Amplitude Scaling
• The amplitude scaling of a discrete-time
signal can be represented by
y(n) = ax(n)
where a is a constant.
 Basic Operation on Sequences
• Amplitude Scaling
• The amplitude of y(n) at any instant is
equal to a times the amplitude of x(n) at
that instant.
• If a > 1, it is amplification and if a < 1, it is
attenuation. Hence the amplitude is
rescaled. Hence the name amplitude
scaling.
Basic Operation on Sequences
• Amplitude Scaling
Basic Operation on Sequences
• Time Scaling
• Time scaling may be time expansion or
time compression.
• The time scaling of a discrete time signal
x(n) can be accomplished by replacing n
by an in it.
Basic Operation on Sequences
• Time Scaling
• Mathematically, it can be expressed as:
y(n) = x(an)
• When a > 1, it is time compression and
when a < 1, it is time expansion.
Basic Operation on Sequences
• Time Scaling
Basic Operation on Sequences
• Time Scaling
Basic Operation on Sequences
• Signal Addition
• In discrete-time domain, the sum of two
signals x1(n) and x2(n) can be obtained by
adding the corresponding sample values
and the subtraction of x2(n) from x1(n) can
be obtained by subtracting each sample of
x2(n) from the corresponding sample of
x1(n) as illustrated below.
 Basic Operation on Sequences
• Signal Addition
• If x1(n) = {1, 2, 3, 1, 5} and x2(n) = {2, 3, 4,
1, –2}
• Then x1(n) + x2(n) = {1 + 2, 2 + 3, 3 + 4, 1
+ 1, 5 – 2} = {3, 5, 7, 2, 3}
• and x1(n) – x2(n) = {1 – 2, 2 – 3, 3 – 4, 1 –
1, 5 + 2} = {–1, –1, –1, 0, 7}
 Basic Operation on Sequences
• Signal Multiplication
• The multiplication of two discrete-time
sequences can be performed by
multiplying their values at the sampling
instants as shown below.
• If x1(n) = {1, –3, 2, 4, 1.5} and x2(n) = {2, –
1, 3, 1.5, 2}
• Then x1(n)x2(n) = {1x2,-3x-1, 2x3, 4x1.5,
1.5x2} = {2, 3, 6, 6, 3}
 Classification of Discrete Time
Signals
• Deterministic and Random Signals
• Periodic and Non-periodic(Aperiodic)
Signals
• Energy and Power Signals
• Causal and Non-casual Signals
• Symmetric (even) and Antisymmetric (odd)
Signals
Deterministic and Random Signals
• A signal exhibiting no uncertainty of its
magnitude and phase at any given instant
of time is called deterministic signal. A
deterministic signal can be completely
represented by mathematical equation at
any time and its nature and amplitude at
any time can be predicted.
Deterministic and Random Signals
• A signal characterized by uncertainty
about its occurrence is called a non-
deterministic or random signal. A random
signal cannot be represented by any
mathematical equation. The behaviour of
such a signal is probabilistic in nature and
can be analyzed only stochastically.
Deterministic and Random Signals
• The pattern of such a signal is quite
irregular. Its amplitude and phase at any
time instant cannot be predicted in
advance. A typical example of a non-
deterministic signal is thermal noise.
 Periodic and Aperiodic Signals
• A signal is periodic with period N(N>0), if and
only if x(n + N) = x(n) for all n
• The smallest value of N for which x(n+N) holds
is called the (fundamental) period. If there is no
value of N that satisfies x(n+N), the signal is
called nonperiodic or aperiodic.
• Energy of periodic signals is infinite but it might
be finite over a period. On the other hand, the
average power at the periodic signal is finite and
is equal to the Pave over a single period. Hence,
periodic signals are power signals.
 Energy and Power Signals

E   x(n)
2
• Energy is defined as ,if E


is finite, i.e., o < E < ∞ , then x(n) is called

Energy Signal. However, many signals
that have an infinite energy, have a finite
average power. Average power is defined
as N
1
Pave  lim 
2
x ( n)
N  2N  1 N
 Energy and Power Signals
• If the signal energy of x(n) is define over
the interval (-N, N) as
N
E N   x ( n)
2

N
• then E  lim E N , (subscript N to E
N 
emphasize that EN is the energy of the
signal x(n)) 1
• and therefore, Pave  lim EN
N  2N  1
 Energy and Power Signals
• Note: if E is finite, then Pave = 0 and on
the other hand, if E is infinite, the average
power P may be either finite or infinite. If P
is finite ( and nonzero), the signal is called
a power signal.
 Energy and Power Signals
Example: Consider the following finite
discrete signals

Find which of the following are energy

signals, power signals, neither energy or
power signals.
 Energy and Power Signals
Solution:
 Energy and Power Signals
Solution:
 Energy and Power Signals
Solution:
 Energy and Power Signals
Solution:
 Energy and Power Signals
Solution:
 Energy and Power Signals
Solution:
Causal and Non-casual Signals
• Causal Signals
• A discrete-time signal x(n) is said to be
causal if x(n) = 0 for n < 0, otherwise the
signal is non-causal.
• A causal signal does not exist for negative
time and an anti-causal signal does not
exist for positive time.
• u(n) is a causal signal.
Causal and Non-casual Signals
• Non - Casual Signals
• A discrete-time signal x(n) is said to be
anti-causal if x(n) = 0 for n > 0.
• A signal which exists in positive as well as
negative time is called a non-casual
signal.
• u(– n) an anti-causal signal, whereas x(n)
= 1 for – 2≤n≤3 is a non-causal signal.
Causal and Non-casual Signals
Example: Find which of the following signals
are causal or non-causal.
(a) x(n) = u(n + 4) - u(n - 2)
(b) x(n) = (1/4)n u(n+2) – (1/2)n u(n – 4)
(c) x(n) = u(-n)
Causal and Non-casual Signals
Solution:
(a) x(n) = u(n + 4) - u(n - 2)
The given signal exists from n = – 4 to n = 1.
Since x(n) ≠ 0 for n < 0, it is non-causal.
(b) x(n) = (1/4)n u(n+2) – (1/2)n u(n – 4)
The given signal exists for n < 0 also. So it is
non-causal.
Causal and Non-casual Signals
Solution:
(c) x(n) = u(-n)
The given signal exists only for n < 0. So it is
anti-causal. It can be called non-causal also.
 Symmetric (even) and
Antisymmetric (odd) Signals
• A real-valued signal x(n) is called
symmetric (even) if
x(n) = x(− n)
 Symmetric (even) and
Antisymmetric (odd) Signals
• On the other hand, a signal x(n) is called
antisymmetric (odd) if
x(n) = −x(− n)
 Symmetric (even) and
Antisymmetric (odd) Signals
• Any signal can be written as:
x(n) = xe(n)+ xo(n)

 x e ( n) 
1
x(n)  x(n)
Where  2
 x o ( n) 
1
x(n)  x(n)
 2
 Symmetric (even) and
Antisymmetric (odd) Signals
Find the even and odd components of the
given signal.
 Symmetric (even) and
Antisymmetric (odd) Signals
Solution:
 System

• It is defined as an entity that acts on an

input signal and transforms it into an
output signal.
• It may also be defined as a set of
elements or functional blocks which are
connected together and produces an
output in response to an input signal.
 System

• The response or output of the system

depends on the transfer function of the
system.
• It is a cause and effect relation between
two or more signals.
 Classification of System
1. A continuous-time system is one which
transforms continuous-time input signals into
continuous-time output signals.
2. A discrete-time system is one which
transforms discrete-time input signals into
discrete-time output signals. A discrete-time
system is represented by a block diagram as
shown
 Classification of System
2. A discrete-time system (cont’n)
An arrow entering the box is the input signal
(also called excitation, source or driving
function) and an arrow leaving the box is an
output signal (also called response).
Generally, the input is denoted by x(n) and
the output is denoted by y(n).
For example microprocessors,
semiconductor memories, shift registers,
etc. are discrete time systems.
 Block Diagram Representation of
Discrete-Time Systems
• An Adder – performs the addition
operation (memoryless) of two signal
sequences to form another (the sum)
sequence, which denoted as y(n).
 Block Diagram Representation of
Discrete-Time Systems
• Constant multiplier – applying a scale
factor on the input x(n), this operation is
memoryless.
 Block Diagram Representation of
Discrete-Time Systems
• Signal multiplier – multiplication of two
signal sequences to form another (the
product) sequence, denoted as y(n). This
operation is memoryless.
 Block Diagram Representation of
Discrete-Time Systems
• Unit delay element – is a special system
that simply delays the signal passing
through it by one sample.
 Block Diagram Representation of
Discrete-Time Systems
• Unit advance element – is a special
system that simply moves the input signal
passing through it ahead by one sample.
 Classification of Discrete-Time
Systems
• Static versus Dynamic Systems
• Time invariant versus Time-variant
Systems
• Linear versus Nonlinear Systems
• Causal versus Anticausal Systems
• Stable versus Unstable Systems
• Invertible and non-invertible systems
• FIR and IIR systems
Static versus Dynamic Systems
• Static Systems ≡ memory less ≡ the
output doesn’t depend on past or future
values of the input.
• Dynamic Systems ≡ memory ≡ having
either infinite or finite memory.
Example:
y(n)  x(n  2) y(n)  x (n)
2

y(n)  x(n  2)  x(n)

Static versus Dynamic Systems
y(n)  x(n  2)
The output depends on the future value of input.
Therefore, the system is dynamic

y(n)  x (n)
2

The output depends on the present value of input

alone. Therefore, the system is static
y(n)  x(n  2)  x(n)
The system is described by a difference equation.
Therefore, the system is dynamic
 Causal versus Anticausal
Systems
• Causal - if the output at any time depends only
on present and past values of the inputs and not
on future values of the input.
• Anti-Causal - if the output at any time depends
only on future values of the input and not on the
present and past values of the inputs.
 Causal versus Anticausal
Systems
• Causal
• Example: y(n)  nx(n)
y(n)  x(n  2)  x(n  1)  x(n)

• Anti-causal
• Example: y (n)  x(n)  x(2n)
y(n)  x (n)  2 x(n  2)
2
Linear versus Nonlinear System
• Linear system – is one that satisfies the
superposition principle (additive and
homogenous).
• Nonlinear system – does not satisfy the
superposition principle.
• Superposition Principle – The response of the
system to a weighted sum of signals be equal to
the corresponding weighted sum of the
responses (outputs) of the system to each of the
individual input signals.
Linear versus Nonlinear System
• A relaxed  system is linear if and only if
[a1x1(n) + a2x2(n)] = a1[x1(n)] + a2[x2(n)]
• For any arbitrary input sequences x1(n)
and x2(n), and any arbitrary constants a1
and a2
Example:
y(n) = nx(n) y(n) = x2(n)
Linear versus Nonlinear System
• y(n) = nx(n)
Let
y1(n) = nx1(n)
y2(n) = nx2(n)
y3(n) = nx3(n) and y3(n) = y1(n) + y2(n) also
x3(n) = x1(n) + x2(n)
therefore, y3(n) = nx3(n)
y1(n) + y2(n) = n[x1(n) + x2(n)]
nx1(n) + nx2(n) = nx1(n) + nx2(n)
Linear versus Nonlinear System
y(n) = x2(n)
Let
y1(n) = x21(n)
y2(n) = x22(n)
y3(n) = x23(n) and y3(n) = y1(n) + y2(n) also
x3(n) = x1(n) + x2(n)
therefore, y3(n) = x23(n)
y1(n) + y2(n) = [x1(n) + x2(n)]2
x21(n) + x22(n) ≠ x21(n) + 2x1(n)x2(n) + x22(n)
Time invariant versus Time-variant
Systems
• Time-invariant – its input-output
characteristics do not change with time.
• Time-variant – its input-output
characteristics change with respect to
time.
• A relaxed system  is time-invariant if
x(n)→ y(n)
x(n − k )→y(n − k )
Example:
y(n)  x(n)  x(n  1) y(n)  nx(n)
 Time invariant versus Time-
variant Systems
y(n)  x(n)  x(n  1)
y (n, k ) x ( n ) x ( n  k )  x(n  k )  x(n  k  1)
y (n  k ) n  n  k  x(n  k )  x(n  k  1)
 y (n, k )  y (n  k ) ; Time Invariant
 Time invariant versus Time-
variant Systems
y(n)  nx(n)
y (n, k ) x ( n ) x ( n  k )  nx(n  k )
y (n  k ) n  n  k  (n  k ) x(n  k )
 y (n, k )  y (n  k ) ; Time variant
 Stable versus Unstable Systems
• A system is Stable if any bounded input
produces bounded output (BIBO).
Otherwise, it is unstable.

Example:
Check the stability of the system defined
1 1
a. y(n)  x(n)  x(n  1)  x(n  2)
2 4
b. h(n)  2 u(n)
n
 Stable versus Unstable
Systems
1 1
a. y(n)  x(n)  x(n  1)  x(n  2)
2 4
 Stable versus Unstable
Systems
b. h(n)  2n u(n)
 Stable versus Unstable
Systems
• The conditions for a BIBO stable system
are given as follows:
1. If the system transfer function is a rational
function, the degree of the numerator should
not be larger than the degree of the
denominator.
2. The poles of the system must lie inside
the unit circle in the z-plane.
 Stable versus Unstable
Systems
• The conditions for a BIBO stable system
are given as follows:
3. If a pole lies on the unit circle it must be a
single order pole, i.e. no repeated pole lies
on the unit circle.
 Impulse and Step Responses
• The response of a discrete-time system to
a unit sample sequence {δ[n]} is called the
unit sample response or simply, the
impulse response, and is denoted by
{h[n]}
• The response of a discrete-time system to
a unit step sequence {μ[n]} is called the
unit step response or simply, the step
response, and is denoted by {s[n]}
 Impulse Response
• Example - The impulse response of the
system
y[n] =α1x[n]+α2x[n −1]+α3x[n − 2]+α4x[n − 3]
is obtained by setting x[n] = δ[n] resulting in
h[n] =α1δ[n]+α2δ[n −1]+α3δ[n − 2]+α4δ[n − 3]
The impulse response is thus a finite-length
sequence of length 4 given by
{ h[n]} = {α1, α2, α3, α4}
 Invertible versus Non-invertible
Systems
• A system is known as invertible only if an
inverse system exists which when
cascaded with the original system
produces an output equal to the input of
the first system.
• A system which does not satisfy this
criterion is called a non-invertible system.
Invertible versus Non-invertible
Systems
 FIR and IIR Systems
• Linear time-invariant discrete-time
systems can be classified according to the
type of impulse response.
• If the impulse response sequence is of
finite duration, the system is called a finite
impulse response (FIR) system.
• If the impulse response sequence is of
infinite duration, the system is called an
infinite impulse response (IIR) system.
• An example of FIR system is described by
 FIR and IIR Systems
• An example of FIR system is described by

• An example of IIR system is described by

 Representation of an Arbitrary
Sequence
• Any arbitrary sequence x(n) can be
represented in terms of delayed and
weighted impulse sequence δ(n). Consider
a finite 5 sample sequence shown below
and multiply each sample in a unit
impulse.
 Representation of an Arbitrary
Sequence
• The sample x(0) can be obtained by
multiplying x(0), the magnitude with unit
impulse δ(n) as shown below
 Representation of an Arbitrary
Sequence
• Similarly the sample x(–1) can be obtained
by multiplying x(–1), the magnitude with
δ(n+1) which is one sample advanced unit
impulse as shown below and similar with
the other sample i.e.
 Representation of an Arbitrary
Sequence
• In this case,
 Representation of an Arbitrary
Sequence
• In general, sequence x(n) can be written in
infinite form

• where δ(n – k) is unity for n = k and zero

for all other terms.
 Representation of an Arbitrary
Sequence
Example: Represent the sequence

as sum of shifted unit impluses.

 Representation of an Arbitrary
Sequence
Solution: