Scribd
Upload
7 views23 pages

DSP - Lec 2

The document covers basic operations on digital signals, including amplitude modifications, time shifting, time reversal, and time scaling. It also discusses discrete time systems, classifying them as static vs dynamic, linear vs nonlinear, time-invariant vs time-variant, causal vs noncausal, stable vs unstable, and invertible systems. Each classification is explained with definitions and examples to illustrate the concepts.

Uploaded by

chase.willson.incall
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
7 views23 pages

DSP - Lec 2

The document covers basic operations on digital signals, including amplitude modifications, time shifting, time reversal, and time scaling. It also discusses discrete time systems, classifying them as static vs dynamic, linear vs nonlinear, time-invariant vs time-variant, causal vs noncausal, stable vs unstable, and invertible systems. Each classification is explained with definitions and examples to illustrate the concepts.

Uploaded by

chase.willson.incall
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/ 23

Digital signal Lecture (2)

processing Dr. Christina Gamal


Basic operations on Signals
Operations performed on dependent variables:
 Amplitude modifications
 scaling: let x(n) denote a discrete time signal. The signal y(n)
resulting from amplitude scaling applied to x(n) is defined by:
y(n) = A x(n)
where A is scale factor
 Addition: The sum of two signals x1(n) and x2(n) is a signal y(n),
whose value at any instant is equal to the sum of the values of
these two signals at that instant y(n) = x1(n) + x2(n)
 Multiplication: The product of two signals is similarly defined on
a sample-to-sample basis as y(n) = x1(n) x2(n)
Basic operations on Signals
Operations performed on independent variables:
Sequences are often manipulated by modifying the index n as
follows
y(n) = x(f(n))
where f (n) is some function of n.
 Time shifting: This is the transformation defined by f (n) = n - no.
If y(n) = x(n - no), x(n) is shifted to the right by no samples if no is
positive (this is referred to as a delay), and it is shifted to the left
by no samples if no is negative (referred to as an advance).
 Time reversal: This transformation is given by f (n) = - n and
simply involves "flipping" the signal x(n) with respect to the index
n.
Basic operations on Signals
Operations performed on independent variables:

Time scaling: This transformation is defined by f (n) =


Mn or f (n) = n/ N where M and N are positive integers.
In the case of f (n) = Mn, the sequence x(Mn) is
formed by taking every Mth sample of x(n) (this
operation is known as down-sampling). With f (n) =
n/N (this operation is known as up-sampling).
 Examples of shifting, reversing, and time scaling a signal
 Shifting, reversal, and time-scaling operations are order-dependent.
Signal Decomposition
 The unit sample may be used to decompose an arbitrary signal x(n)
into a sum of weighted and shifted unit samples as follows:

 This decomposition may be written concisely as

 where each term in the sum, x(k)δ(n - k), is a signal that has an
amplitude of x(k) at time n = k and a value of zero for all other
values of n. This decomposition is the discrete version of the shifting
property for continuous-time signals and is used in the derivation of
the convolution sum.
Discrete time systems
 A Discrete time systems is a mathematical operator or mapping that
transforms one discrete time signal (the input x(n)) into another discrete time
signal (the output y(n)) by means of a fixed set of rules or operations.
 The relationship between x(n) and y(n) is expressed as:

y(n) = T[x(n)]
 The notation T [ . ] is used to represent a general system, in which an input signal
x(n) is transformed into an output signal y(n) through the transformation T [ . ]
Classification of Discrete time systems
Static versus dynamic systems.
 A discrete-time system is called static or memoryless if its output at any instant n depends at most on the input
sample at the same time, but not on past or future samples of the input.
 The system is said to be dynamic or to have memory. If the output of a system at time n is completely
determined by the input samples in the interval from n ± N to n (N > 0), the system is said to have memory of
duration N.
 If N = 0, the system is static. If o < N < ∞, the system is said to have finite memory, whereas if N = ∞, the
system is said to have infinite memory.
 The systems described by the following input-output equations are both static or memory less.

 The systems described by the following input-output relations are dynamic systems or systems with memory.

Dynamic have finite memory

Dynamic have infinite memory


Classification of Discrete time systems
Linear versus nonlinear systems
 A linear system is one that satisfies the superposition principle.
Simply stated, the principle of superposition requires that 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.

Definition. A system is linear if and only if


Classification of Discrete time systems
Linear versus nonlinear systems
Example
 Determine if the system described by the following input-output
equations are linear or nonlinear.
y(n) = n x(n)
Example
 Determine if the system described by the following input-output
equations are linear or nonlinear.
y(n) = x2(n)
Classification of Discrete time systems
Time-invariant versus time-variant systems.

 A system is called time-invariant if its input-output characteristics do not


change with time.
Definition. A system is time invariant or shift invariant if and only if
Classification of Discrete time systems
Time-invariant versus time-variant systems.

 In general, we can write the output of the shifted input as


Example
 Determine if the system shown is time invariant or time variant.
y(n) = x(n) – x(n-1)
Example
 Determine if the system shown is time invariant or time variant.
y(n) = nx(n)
Example
 Determine if the system shown is time invariant or time variant.
y(n) = x(-n)
Classification of Discrete time systems
Causal versus noncausal systems
 Causal System: if the output of the system at any time n [i.e., y(n)]
depends only on present and past inputs [i.e., x(n), x(n -1), x(n - 2), ...
], but does not depend on future inputs [i.e., x(n + 1), x(n + 2), ... ].
In mathematical terms, the output of a causal system satisfies an equation
of the form
y(n) = F[x(n), x(n - 1), x(n - 2), ... ]
where F[·] is some arbitrary function.
 Noncausal System: is a system has an output that depends not only on
present and past inputs but also on future inputs.
Example
Classification of Discrete time systems
Stable versus unstable systems

 A system is said to be bounded input-bounded output (BIBO) stable if


and only if every bounded input produces a bounded output.
 The condition that the input sequence x(n) and the output sequence
y(n) are bounded is translated mathematically to mean that there exist
some finite numbers, say Mx and My, such that

 If, for some bounded input sequence x(n), the output is unbounded
(infinite), the system is classified as unstable.
Classification of Discrete time systems

Invertible systems
 A system is said to be invertible if the input to the system may
be uniquely determined from the output. In order for a system
to be invertible, it is necessary for distinct inputs to produce
distinct outputs. In other words, given any two inputs x 1(n)
and x2(n) with x1(n) ≠ x2(n), it must be true that y1(n) ≠ y2(n).
Example

 The system defined by


y(n) = x(n)g(n)

is invertible if and only if g(n) ≠ 0 for all n. In particular,


given y(n) with g(n) nonzero for all n, x(n) may be
recovered from y(n) as follows:

𝒚 𝒏
x(n) =
𝒈(𝒏)

You might also like