DEPARTMENT OF ELECTRONICS AND

TELECOMMUNICATIONS
ENGINEERING, A.B.U. ZARIA

Digital Signal Processing

Lecture 1

https://cmend.abu.edu.ng We make knowledge work

 Introduction

• What is a Signal?
• What is a Digital Signal?
• What is Signal Processing?
• What is Digital Signal Processing?
• Why do we process signal?

https://cmend.abu.edu.ng We make knowledge work

 Why do we process signal?
 Signals are corrupted by interference  Signals are distorted due to the
due to noise transmission medium

https://cmend.abu.edu.ng We make knowledge work

 Signal Processing

https://cmend.abu.edu.ng We make knowledge work

 Advantages & Disadvantages of DSP

Advantages:
• Programmability
• Stability
• Repeatability
• Easier implementation of adaptive algorithms

Disadvantage:
• Bandwidth limitation related to the processor cycle and algorithm complexity

https://cmend.abu.edu.ng We make knowledge work

 Discrete-Time (DT)
Signals

https://cmend.abu.edu.ng We make knowledge work

 Continuous-time (CT) signal
(an overview)
 A signal is known as a CT signal if the independent variable which is "𝑡" (time) is continuous
in nature.

 That is 𝑡 𝜖 ℝ (real numbers) – any number you could think of that is not complex

 The mathematical notation of a CT signal is " 𝑥 𝑡 "

 𝑥 𝑡 = 𝑠𝑖𝑛 2𝜋𝑓𝑐 𝑡
 𝑥 𝑡 = 𝑒 𝑗𝑤𝑡
 Some graphical examples of CT signal:

https://cmend.abu.edu.ng We make knowledge work

 Discrete time (DT) signal
 If the independent variable is discrete in nature that is integers (𝜖 ℤ), then the signal is
known as a DT signal.

 The mathematical notation of a DT signal is "𝑥(𝑛)" where “n” is the discrete time or
sample
 𝑥 𝑛 = 𝑠𝑖𝑛 2𝜋𝑓𝑐 𝑛𝑇𝑠
 𝑥 𝑛 = 𝑒 𝑗𝑤𝑛𝑇𝑠

 Some graphical examples of DT signal:

https://cmend.abu.edu.ng We make knowledge work

 Side by Side Graphical Comparison of some
DT Signals and their CT signal equivalent

https://cmend.abu.edu.ng We make knowledge work

 Convert CT Signal to DT signal
 To convert a CT signal to a DT signal, a process called sampling is used.

 It Involves measuring the value of CT signal at integer value of time.

t  [1, , 1.1, 1.2, , 2.0, 2.1, , 60]
n  [1, 2, 3, 4, 5, , 58, 59, 60]

Sampler

x(t) 𝒕 = 𝒏𝑻𝒔 x(n) T𝑠 = sampling time

https://cmend.abu.edu.ng We make knowledge work

 Convert CT Signal to DT signal……cont
Given a CT signal as:

𝑥 𝑡 = 𝑐𝑜𝑠(2𝜋𝑓𝑡)

What is the DT equivalent?

To get the DT equivalent of the CT signal, just replace "𝒕“ with "𝒏𝑻𝒔 “ as follows:

𝑥 𝑛 = 𝑐𝑜𝑠(2𝜋𝑓𝒏𝑻𝒔 )

https://cmend.abu.edu.ng We make knowledge work

 More examples

𝑥 𝑡 = 𝑒 𝑗2𝜋𝑓𝑐 𝑡

To find the DT equivalent, all we have to do is substitute “t” with

“𝒏𝑻𝒔 ” as follows:

𝑥 𝑛 = 𝑒 𝑗2𝜋𝑓𝑐 𝒏𝑻𝒔

https://cmend.abu.edu.ng We make knowledge work

 In-Class Exercise
1. Generate the DT equivalent of the following CT signals.

𝑥 𝑡 = 𝐴𝑐𝑜𝑠(2𝜋𝑓𝑐 𝑡 + 𝜑)

𝑥 𝑡 = 𝑒 𝑗𝜔𝑡 + 𝑒 𝑗𝜔𝑡+𝜑

2. Given the graphical representation of the signal, for each indicate whether it is a CT or a DT signal

(a) (b) (c) (d)

https://cmend.abu.edu.ng We make knowledge work
 Discrete-time Signal Classification

• Finite and Infinite Signals

• Causal and Noncausal Signals
• Periodic and Aperiodic Signals
• Energy and Power Signals

https://cmend.abu.edu.ng We make knowledge work

 Discrete-time Signal Classification
(Finite and Infinite Signals)

• One of the most fundamental ways to characterize a discrete-time signal is to count

the number of samples.

• A signal x(n) is a finite duration signal, or a finite signal , if and only

𝑥 𝑛 ≠ 0 for 𝑁1 ≤ n ≤ 𝑁2 where 𝑁2 ≥ 𝑁1 .

• Otherwise, the signal is called infinite signal.

https://cmend.abu.edu.ng We make knowledge work

 Discrete-time Signal Classification
(Causal, Anti-Causal and Non-causal Signals)
• Causal signals are signals that are zero for all negative time.

𝑥 𝑛 = 0 𝑓𝑜𝑟 𝑛 < 0

• Anti-causal are signals that are zero for all positive time.

𝑥 𝑛 = 0 𝑓𝑜𝑟 𝑛 > 0

• Noncausal signals are signals that have nonzero values in both positive and
negative time.

𝑥 𝑛 ≠ 0 𝑓𝑜𝑟 − ∞ ≤ 𝑛 < ∞

https://cmend.abu.edu.ng We make knowledge work

 Graphical illustration

(a) Causal Signal

(c) Non-Causal Signal

(b) Anti-Causal Signal

https://cmend.abu.edu.ng We make knowledge work

 Discrete-time Signal Classification
(Periodic and Aperiodic Signals)
• A periodic signal is one that repeats the sequence of values exactly after a fixed
length of time, known as the period.

• Mathematically:

𝑥 𝑛 =𝑥 𝑛+𝑁 𝑓𝑜𝑟 − ∞ ≤ 𝑛 ≤ ∞ and 𝑁 > 0

• Some examples of periodic signals are Sine and Cosine

• A signal that does not repeats its pattern over a period is called aperiodic signal or
non periodic.

• An examples of aperiodic signal is sound signal from radio.

https://cmend.abu.edu.ng We make knowledge work
 Discrete-time Signal Classification
(Energy and Power Signals)…….cont
• A signal is called an energy signal if:

0 < 𝐸𝑥 < ∞ (finite energy value) and 𝑃𝑥 = 0

• A signal is called power signal if:

0 < 𝑃𝑥 < ∞ (finite power value) and 𝐸𝑥 = ∞

• Signals for which both power and energy tends to infinite in neither energy nor power
signal i.e.

𝐸𝑥 = ∞ and 𝑃𝑥 = ∞

• For some signals, energy is finite and some power is finite. No signal has both finite
energy and power.
https://cmend.abu.edu.ng We make knowledge work
 Discrete-time Signal Classification
(Energy and Power Signals)
• The energy of a discrete time signal is obtained as:
∞
2
𝐸𝑥 = ෍ 𝑥 𝑛
𝑛=−∞

• The power of a discrete time signal is obtained as:

𝑁 𝑁−1
1 2
1 2
𝑃𝑥 = lim ෍ 𝑥 𝑛 = lim ෍ 𝑥 𝑛
𝑁→∞ 2𝑁 + 1 𝑁→∞ 𝑁
𝑛=−𝑁 𝑛=0

https://cmend.abu.edu.ng We make knowledge work

 Examples

𝑬𝒙 = ∞ and 𝑷𝒙 = ∞ 𝑬𝒙 = ∞ and 𝑷𝒙 < ∞ 𝑬𝒙 = ∞ and 𝑷𝒙 < ∞

𝑬𝒙 = ∞ and 𝑷𝒙 < ∞
𝑬𝒙 = ∞ and 𝑷𝒙 = ∞ 𝑬𝒙 < ∞ and 𝑷𝒙 = 0
https://cmend.abu.edu.ng We make knowledge work
 Some fundamental Discrete time signals
• Most information-bearing signals of practical interest are complicated functions of time.

• There are three simple, yet important, discrete-time signals that are frequently used in the
representation and description of more complicated signals.

• They are the unit sample, the unit step, and the exponential.

unit sample unit step the exponential

https://cmend.abu.edu.ng We make knowledge work

 Graphical Representation of fundamental
Discrete time signals

https://cmend.abu.edu.ng We make knowledge work

A signal is defined as
1
x(t )  cos(2 1000t )  sin( 2 2000t ) 0  t  T , T  10m sec
4
=0 elsewhere
Sampling frequency is 16000 Hz, T=10 msec, N=T/Ts=160 samples. Calculate the
discrete-time signal x(n).

To obtained the discrete-time signal, substitute t=nTs

1
x(n)  cos(2 1000 nTs )  sin( 2 2000 nTs )
4
1
 cos(2 1000n /16000)  sin(2 2000n /16000)
4
1
 cos( n / 8)  sin( n / 4)
4
https://cmend.abu.edu.ng We make knowledge work
 Discrete-Time
System

https://cmend.abu.edu.ng We make knowledge work

 Discrete Time System
• A system is characterized by: Input output
• Input System
• Output
• rules of operation (mathematical model of the system)

• A discrete-time system has as its input a discrete-time sequence or signal 𝑥(𝑛) and
also discrete time sequence or signal 𝑦(𝑛) as its output.

• Discrete-time systems can be categorized in a number of useful ways such as:

• Linear and Nonlinear Systems
• Time-invariant and Time-varying Systems
• Causal and Noncausal Systems
• Stable and Unstable Systems

https://cmend.abu.edu.ng We make knowledge work

 Linear and Nonlinear Systems
• Let 𝑇 . be the internal operations of a discrete time system as shown below.

𝑥(𝑛) 𝑻. 𝑦 𝑛 =𝑇 𝑥 𝑛

• A discrete time system is said to be LINEAR if it obeys the principle of superposition.

• What this means is let:

𝑥 𝑛 = 𝑎𝑥1 𝑛 + 𝑏𝑥2 𝑛

𝑦 𝑛 = 𝑇 𝑎𝑥1 𝑛 + 𝑏𝑥2 𝑛 = 𝑇 𝑎𝑥1 𝑛 + 𝑇 𝑏𝑥2 𝑛

• Almost all of the discrete-time systems we consider will be linear.

https://cmend.abu.edu.ng We make knowledge work
 Time-invariant and Time-varying Systems
• A system is time invariant if delaying the input signal 𝑥(𝑛) by “k” samples
produces the same output y(𝑛) but delayed by “k” samples.

𝑥(𝑛) 𝑻. 𝑦 𝑛 =𝑇 𝑥 𝑛

𝑥(𝑛 − 𝑘) 𝑻. 𝑦 𝑛−𝑘 =𝑇 𝑥 𝑛−𝑘

• For this course, we will always assume that the discrete time system is linear, shift
invariant.

https://cmend.abu.edu.ng We make knowledge work

 Causal and Noncausal Systems
• A system is called causal if its output y(𝑛) at an arbitrary time 𝑛 = 𝑛𝑜 , depends on
only the input x(𝑛) for 𝑛 ≤ 𝑛𝑜 .

• That is, the output of a causal system at the present time depends on only the
present and/or past values of the input.

• Thus, in a causal system, it is not possible to obtain an output before an input is

applied to the system.

• A LTI system will be causal if and only if ℎ(𝑛) is equal to zero for 𝑛 < 0.

≠0 𝑛≥0
ℎ 𝑛 ቐ
=0 𝑛<0
https://cmend.abu.edu.ng We make knowledge work
 Stable and Unstable Systems
• In many applications, it is important for a system to have a output response, 𝑦(𝑛), that is
bounded in amplitude whenever the input is bounded.

• system with this property is said to be stable in the bounded input-bounded output (BIBO)
sense.

• A system is said to be stable in the BIBO sense if, for any input that is bounded, 𝑥 𝑛 ≤𝐴<
∞, the output will be bounded,

𝑦 𝑛 ≤𝐵<∞

• For a linear shift-invariant system, stability is guaranteed if the unit sample response is
absolutely summable:
∞

෍ ℎ(𝑛) < ∞
𝑛=−∞
https://cmend.abu.edu.ng We make knowledge work
 End

https://cmend.abu.edu.ng We make knowledge work