Itroduction To Discrete Time Signals

Digital Signal Processing
B. Discrete time signals

Athanassios C. Iossifides
October 2012

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 2

.1 Representation of discrete time signals
.2 Fundamental discrete time signals
.3 Transformations on the independent variable
.4 Transformations on the dependent variable
.5 Signal classification
.6 Signal analysis and synthesis with impulses
.7 Signal correlation
.8 Examples

. Discrete time signals

.1 Representation of discrete
time signals
Discrete time signals are functions (sequences) defined only for
integer values of the independent variable.
Functional representation

1, 1
5, 2
( )
2, 3
0,
n
n
x n
n
otherwise
=
=

=

Matrix representation

Representation as a sequence

( ) {...,0,0,1,5,2,0,0,...} x n
|
=
n -1 0 1 2 3 4 5
x(n) 0 0 1 5 2 0

.2 Fundamental discrete time
signals
Impulse (delta) or unit sample sequence

Unit step sequence

Unit ramp sequence

1, 0
( )
0, 0
n
n
n
=
=

=
1, 0
( )
0, 0
n
u n
n
>

<

, 0
( )
0, 0
n n
r n
n
>
=

<

Exponential signals
a real number

( )
n
x n a =

0 1 a < <

1 a >
Exponential signals
a real number

( )
n
x n a =

1 0 a < <

1 a <
Exponential signal
a complex number

( )
( )
(cos sin )
( ) ( )
n
j
n jn
n
R I
x n a
a re
x n r e
r n j n
x n jx n
=
=
= =
= +
= +
Real part
Imaginary part
Exponential signal
a complex number

( )
( )
( ) ( )
( )
( )
n
j
n jn
n
x n a
a re
x n r e
x n n
x n r
n n
=
=
= =
= Z
=
Z =
Magnitude
Angle

.3 Transformations on the
independent variable
Shift

( ) ( ) x n x n =
( ) ( ) x n x n =
0
0
0
0
n delay
n precedence
>
<
( ) x n
( 3) x n
( 2) x n +
0
n n n
Folding (reflection)

n n
( ) x n
( ) x n
Down sampling

The resulting sequence corresponds to the one that we would have if the
sampling frequency was M times smaller.
n Mn
( ) x n
( ) x n
(2 ) x n

.4 Transformations on the
dependent variable (signal
operations)
.4 Signal operations
Addition, multiplication and scaling
Addition
Multiplication
Scaling

1 2
( ) ( ) ( ), y n x n x n n = + < <
1 2
( ) ( ) ( ), y n x n x n n = < <
2
( ) ( ), y n cx n n = < <
1 2
( ) ( ) ( ) y n x n x n =
1 2
( ) ( ) ( ) y n x n x n = +

Energy signals and power signals

Signal energy

Mean signal power

When the energy of a signal is finite (0 < < ), then the signal is called
energy signal.
When the mean power of a signal is finite (0 < P < ), then the signal is called
power signal.
A signal may be either
a power signal
or an energy signal
or none of the two.

2
( )
n
E x n
=
=

2
1 1
lim ( ) lim
2 1 2 1
N
N
N N
n N
P x n E
N N
=
= =
+ +

Periodic signals
A signal is periodic with fundamental period ( > 0) if and only if

Let x
1
(n) x
2
(n) discrete time signals of period
1
and
2
respectively.
The signals

are periodic with period
where gcd(N
1
,N
2
) is the greatest common divisor of
1
and
2
.
Periodic signals are power signals (when they dont have infinite values in the duration
of one period). The mean power of a periodic signal can be calculated by

( ) ( ), x n N x n n + =
1 2
( ) ( ) ( ) x n x n x n = +
1 2
( ) ( ) ( ) x n x n x n =
1 2
1 2
gcd( , )
N N
N
N N
=
1
2
0
1
( )
N
n
P x n
N
=
=

Even and odd signals
A signal is said to be even when
A signal is said to be odd when

Every real valued signal can be written (decomposed) as a sum of an even and
an odd signal, that is

where

( ) ( ) x n x n =
( ) ( ) ( )
e o
x n x n x n = +
1
( ) [ ( ) ( )]
2
1
( ) [ ( ) ( )]
2
e
o
x n x n x n
x n x n x n
= +
=
( ) ( ) x n x n =
Even and odd signals

( ) ( ) ( 10) x n u n u n =
1
( ) [ ( ) ( )]
2
e
x n x n x n = +
1
( ) [ ( ) ( )]
2
o
x n x n x n =

.6 Signal analysis and synthesis
with impulses
Let x(n) a discrete time signal.
(n-k) is zero everywhere except at shift (position) n = k.
The product x(n)(n-k) equals to the value of x(n) at the position n = k, that is

The above is true for any shift k. Repeating this procedure for all k we can
reproduce x(n) as a sum of weighted unit sample sequences (impulses), as
follows
( ) ( ) ( ) ( ) x n n k x k n k =
( ) ( ) ( ) ( )
( ) ( ) ( ) ( )
( ) ( ) ( )
k k
k k
k
x n n k x k n k
x n n k x k n k
x n x k n k

= =

= =
=
=
=
=


.7 Correlation
Auto correlation
Let x(n) a discrete time, real valued energy signal. The autocorrelation
function is defined as

Auto correlation gives us information about the similarity of a signal and its
shifted (delayed) replicas.
For periodic signals

( ) ( ) ( ), 1, 2, 3,...
xx
n
r l x n x n l l
=
= =
2
(0) ( )
xx
n
r x n E
=
= =
1
0
1
0
1
( ) ( ) ( ),
1
( ) ( ) ( ),
N
xx
n
N
xy
n
r l x n x n l Nthe period
N
r l x n y n l Nthe period
N
=
=
=

Calculation of autocorrelation

( 6) ( ) ( 6)
xx
n
r x n x n
=
= +
(0)
xx
r E =
(2) ( ) ( 2)
xx
n
r x n x n
=
=

Cross correlation
Let x(n) and y(n) two real valued discrete time signals. The cross correlation
function of the two signals is defined as

or
Cross correlation informs us about the similarity of two shifted signals
between each other.
When two sequences that are synchronized (l = 0) have a cross correlation
value equal to zero, then these sequences are called orthogonal

( ) ( ) ( ), 1, 2, 3,...
xy
n
r l x n y n l l
=
= =
( ) ( ) ( ) ( ), 1, 2, 3,...
yx xy
n
r l x n l y n r l l
=
= + = =
(0) ( ) ( ) 0
xy
n
r x n y n
=
= =

Signal correlation applications
Auto and cross correlation between signals are used in several applications of
telecommunications:
Distance estimation (.. radar)
Signal synchronization (Barker, Golay sequences, etc)
Spread spectrum signals for multipath mitigation.
CDMA systems (PN, Gold sequences, etc.)
In these applications specific sequences that present very low auto and cross
correlation values are used, so that the sequences and their shifted versions
can be easily separated (discriminated) among each other.

.8 Examples
.8 Examples
Signal representation Proakis 2.1(a,)

Representation of the above signal with the use of unit sample and unit step
signals
1 , 3 1
3
( ) 1, 0 3
0,
n
n
x n n
+ s s
= s s
1 2
( ) {...0, , ,1,1,1,1,0...}
3 3
x n
|
=
1 2
( ) ( 2) ( 1) ( ) ( 4)
3 3
x n n n u n u n = + + + +
.8 Examples
Signal transformations Proakis 2.2(a), 2.2()

Find y(n) = x(4 n)

First I shift the signal and then fold it.
1 1
( ) {...,0,1,1,1,1, , ,0,...}
2 2
x n
|
=
( ) (4 )
1 1
{...,0, , ,1,1,1,1,0,...}
2 2
y n x n
|
=
=
.8 Examples
Signal transformations Proakis 2.2()

Find
First I crate x(n-1)

1 1
( ) {...,0,1,1,1,1, , ,0,...}
2 2
x n
|
=
( ) ( 1) ( 3) y n x n n =
( 3) {...,0,0,0,0,0,1,0,0,...} n
|
=
1 1
( 1) {...,0,0,1,1,1,1, , ,0,...}
2 2
x n
|
=
( 1) ( 3) {...,0,0,0,0,0,1,0,0,...} x n n
|
=
.8 Examples
Are these periodic signals?

( ) cos( / 8)cos( / 8) x n n n =
1 2
( ) ( ) ( ) x n x n x n =
( ) cos( / 2) sin( / 8) x n n n =
.8 Examples
Even and odd signals decomposition 2.4 Proakis

( ) {2,3,4,5,6} x n
|
=
1
( ) [ ( ) ( )]
2
1
[{2,3,4,5,6} {6,5,4,3,2}]
2
{4,4,4,4,4}
e
x n x n x n
| |
|
= + =
= + =
=
1
( ) [ ( ) ( )]
2
1
[{2,3,4,5,6} {6,5,4,3,2}]
2
{ 2, 1,0,1,2}
o
x n x n x n
| |
|
= =
= =
=
Autocorrelation application to distance estimation
Transmitted signal
x(n) barker code
(very good autocorrelation
properties)
Received signal after
attenuation and noise
addition

D delay
w(n) Gaussian noise
Correlation of x(n)
and y(n)
Distance D estimation

.8 Examples
( ) ( ) ( ) y n ax n D w n = +

Itroduction To Discrete Time Signals

Caricato da

Informazioni sul documento

Titolo originale

Copyright

Formati disponibili

Condividi questo documento

Condividi o incorpora il documento

Opzioni di condivisione

Hai trovato utile questo documento?

Questo contenuto è inappropriato?

Copyright:

Formati disponibili

Itroduction To Discrete Time Signals

Caricato da

Copyright:

Formati disponibili

Digital Signal Processing

B. Discrete time signals

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 5

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 20

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 26

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 28

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 29

Athanassios Iossifides DIGITAL SIGNAL PROCESSING 30

Potrebbero piacerti anche