Sunteți pe pagina 1din 11

Discrete-Time Signals and Systems

Quote of the Day


Mathematics is the tool specially suited for
dealing with abstract concepts of any kind and
there is no limit to its power in this field.
Paul Dirac
Content and Figures are from Discrete-Time Signal Processing, 2e by Oppenheim, Shafer, and Buck, 1999-2000 Prentice Hall Inc.

Discrete-Time Signals: Sequences


Discrete-time signals are represented by sequence of numbers
The nth number in the sequence is represented with x[n]

Often times sequences are obtained by sampling of


continuous-time signals
In this case x[n] is value of the analog signal at xc(nT)
Where T is the sampling period
10
0
-10
0
10

t (ms)

20

40

60

80

100

10

20

30

40

50 n (samples)

0
-10
0

Copyright (C

351M Digital Signal Processing

Basic Sequences and Operations


Delaying (Shifting) a sequence

y[n] x[n no ]
Unit sample (impulse) sequence

0 n0
[n]
1 n0

1.5
1
0.5
0
-10

10

-5

10

-5

10

1.5

Unit step sequence

0 n0
u[n]
1 n0

1
0.5
0
-10

Exponential sequences

x[n] An

Copyright (C

-5

1
0.5
0
-10

351M Digital Signal Processing

Sinusoidal Sequences
Important class of sequences

xn cos on
An exponential sequence with complex e

jo

and A A e j

xn An A e j e jon A e j on
n

xn A cos on j A sin on
n

x[n] is a sum of weighted sinusoids


Different from continuous-time, discrete-time sinusoids
Have ambiguity of 2k in frequency

cos o 2k n cos on

Are not necessary periodic with 2/o


2k
cos on cos on oN only if N
is an integer
o

Copyright (C

351M Digital Signal Processing

Demo

Rotating Phasors Demo

Copyright (C

351M Digital Signal Processing

Discrete-Time Systems
Discrete-Time Sequence is a mathematical operation that
maps a given input sequence x[n] into an output sequence
y[n]

y[n] T{x[n]}

x[n]

T{.}

y[n]

Example Discrete-Time Systems


Moving (Running) Average

y[n] x[n] x[n 1] x[n 2] x[n 3]


Maximum

y[n] max x[n], x[n 1], x[n 2]


Ideal Delay System

y[n] x[n no ]

Copyright (C

351M Digital Signal Processing

Memoryless System
Memoryless System
A system is memoryless if the output y[n] at every value of n
depends only on the input x[n] at the same value of n

Example Memoryless Systems


Square

y[n] x[n]
Sign

y[n] sign x[n]

Counter Example
Ideal Delay System

y[n] x[n no ]

Copyright (C

351M Digital Signal Processing

Linear Systems
Linear System: A system is linear if and only if

T{x1[n] x2[n]} T x1[n] T x2[n] (additivity)


and
Tax[n] aT x[n] (scaling)
Examples
Ideal Delay System

y[n] x[n no ]

T{x1[n] x2[n]}
T{x2[n]} T x1[n]
Tax[n]
aT x[n]

Copyright (C

x1[n no ] x2[n no ]
x1[n no ] x2[n no ]

ax1[n no ]

ax1[n no ]

351M Digital Signal Processing

Time-Invariant Systems
Time-Invariant (shift-invariant) Systems
A time shift at the input causes corresponding time-shift at output

y[n] T{x[n]} y[n no ] T x[n no ]


Example
Square

y[n] x[n]

Delay the input the output is

Delay the output gives

y1 n x[n no ]

yn - no x[n no ]

Counter Example
Compressor System

y[n] x[Mn]

Copyright (C

Delay the input the output is


Delay the output gives

y1 n x[Mn no ]

yn - no xMn no

351M Digital Signal Processing

Causal System
Causality
A system is causal its output is a function of only the current and
previous samples

Examples
Backward Difference

y[n] x[n] x[n 1]


Counter Example
Forward Difference

y[n] x[n 1] x[n]

Copyright (C

351M Digital Signal Processing

10

Stable System
Stability (in the sense of bounded-input bounded-output
BIBO)
A system is stable if and only if every bounded input produces a
bounded output

x[n] Bx y[n] By

Example

y[n] x[n]

Square

if input is bounded by x[n] B x


output is bounded by y[n] B2x

Counter Example
Log

y[n] log10 x[n]

even if input is bounded by x[n] Bx

output not bounded for xn 0 y0 log10 xn

Copyright (C

351M Digital Signal Processing

11

S-ar putea să vă placă și