Scribd
Upload
26 views19 pages

DiscreteTime Rep

Uploaded by

Jenny Lyn Masgong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
26 views19 pages

DiscreteTime Rep

Uploaded by

Jenny Lyn Masgong
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 19

Discrete Time Signals and Systems

By:
Dr. A. ZIDOURI
Discrete Time Signals and Systems

Classification of Sequences
 One classification is in terms of the number of
samples defining the sequence.
 Another classification is with respect to the
symmetry exhibited by the samples with respect to
the time index n = 0
 It can also be classified in terms of its other
properties such as periodicity, summability, energy,
and power.
Discrete Time Signals and Systems
Classification Based on Length
 The discrete-time signal may be a finite-
length or an infinite-length sequence.
1. Finite-Length Sequence
 A finite-length (also called finite-
duration or finite-extent) sequence is
defined only for a finite time interval:
Discrete Time Signals and Systems

Finite Length Sequence


 N1<n<N2
where ∞< N1 and N2 < ∞with N1<N2 The
length or duration N of the above finite-
length sequence is
 N = N2 - N1 +1
Note that a finite-length sequence can be treated
as an infinite-length sequence by adding
zero-valued samples for the undefined
samples. This is called appending or padding
with zeros.
•
Discrete Time Signals and Systems
 2. Right-Sided, Left-Sided and Two-Sided
Sequences
 There are three types of infinite-length

sequences. A right-sided sequence x[n] has zero-


valued samples for n < N1, i.e.
x[n] = 0 for n < N1
where N1 is a finite integer that can be positive
or negative. If N1 ≥, a right-sided sequence is
usually called a causal sequence.
Discrete Time Signals and Systems

 Likewise, a left-sided sequence x[n] has


zero-valued samples for n > N2, i.e. x[n] = 0
for n > N2 where N2 is a finite integer that
can be positive or negative. If N2 ≤, a left-
sided sequence is usually called an anti-
causal sequence.
 A general two-sided sequence is defined for

all values of n in the range -∞≤n≤∞


Discrete Time Signals and Systems

Classification Based on Periodicity


 1. Periodic and Aperiodic Sequences
 A sequence x[n] satisfying
x[n] = x[n + kN] for all n
is called a periodic sequence with a period N where N
is a positive integer and k is any integer.
 A sequence is called an aperiodic sequence if it is not
periodic.
 The fundamental period Nf of a periodic signal is the
smallest value of N for which the periodic condition is
satisfied.
Discrete Time Signals and Systems

Other Types of Classification


1. Bounded Sequence
A sequence x[n] is said to be bounded if
each of its samples is of magnitude
less than or equal to a finite positive
number H, i.e. |x[n]|≤H∞
Discrete Time Signals and Systems

Other Types of Classification

1. Absolutly Summable Sequence


A sequence x[n] is said to be absolutely
summable if

 x[n]  
n  
Discrete Time Signals and Systems

2. Square Summable Sequence


A sequence x[n] is said to be square
summable if

 x[n]
2

n  
Discrete Time Signals and Systems

3. Finite and Infinite Energy


Sequences
 The energy of a sequence x[n] is
defined by

 x[n]
2
E
n  

.A square-summable sequence has finite energy


Discrete Time Signals and Systems

Sequence Operations
 Signal addition: This is a sample-by-
sample addition given by

{x1[n]} + {x2[n]} = {x1[n]+ x2[n]}


Discrete Time Signals and Systems

Sequence Operations
 Signal multiplication: This is a sample-
by-sample multiplication given by

{x1[n]} . {x2[n]} = {x1[n] . x2[n]}


Discrete Time Signals and Systems

Sequence Operations
 Signal scaling: In this operation, each
sample is multiplied by a scalar A.

A{x[n]} = {Ax[n]}
Discrete Time Signals and Systems

Sequence Operations
 Signal shifting: In this operation, each
sample of {x[n]} is shifted by an
amount k to obtain a shifted sequence
{y[n]}.
{y[n]} = {x[n - k]}
Discrete Time Signals and Systems
Schematic representations of some of the above
operations are shown in the following:
Discrete Time Signals and Systems
Schematic representations of some of the above
operations are shown in the following:
Example
Answer

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy