Ch2 (2) Handouts 4e

Operations on Finite-
Finite-Length Operations on Finite-

Finite-Length
Sequences Sequences
Consider the length-N sequence x[n] Likewise, a linear time-shift of x[n] by
defined for 0 n N 1 integer-valued M will result in a length-N
sequence x[n + M] no longer defined for
Its sample values are equal to zero for n < 0
0 n N 1
and n N
Similarly, a convolution sum of two length-
A time-reversal operation on x[n] will result N sequences defined for 0 n N 1 will
in a length-N sequence x[ n] defined for result in a sequence of length 2 N + 1
( N 1) n 0 defined for 0 n 2 N 2
1 Copyright 2010, S. K. Mitra 2 Copyright 2010, S. K. Mitra
Operations on Finite-
Finite-Length
Modulo Operation
Sequences
Thus we need to define new type of time- The time-reversal operation on a finite-
reversal and time-shifting operations, and length sequence is obtained using the
also new type of convolution operation for modulo operation
length-N sequences defined for 0 n N 1 Let 0 ,1,K , N 1 be a set of N positive
so that the resultant length-N sequences are integers and let m be any integer
also are in the range 0 n N 1 The integer r obtained by evaluating
m modulo N
is called the residue
Modulo Operation Modulo Operation

The residue r is an integer with a value Example For N = 7 and m = 25, we have
between 0 and N 1 r = 25 + 7l = 25 7 3 = 4
The modulo operation is denoted by the Thus, 25 7 = 4
notation m N = m modulo N Example For N = 7 and m = 15, we get
If we let r = m N then r = m + lN
r = 15 + 7l = 15 + 7 3 = 6
where l is a positive or negative integer
chosen to make m + lN an integer between Thus, 15 7 = 6
0 and N 1
Circular Time-
Time-Reversal Operation Circular Shift of a Sequence
The circular time-reversal version {y[n]} of The time shifting operation for a finite-
a length-N sequence {x[n]} defined for length sequence, called circular shift
0 n N 1 is given by { y[ n]} = {x[ -n N ]} operation, is defined using the modulo
operation
Example Consider
Let x[n] be a length-N sequence defined for
{x[ n]} = {x[0], x[1], x[ 2], x[3], x[ 4]} 0 n N 1
Its circular time-reversed version is given Its circularly shifted version xc [n] , shifted
by { y[ n]} = {x[ n 5 ]} no by samples, is given by
= {x[0], x[ 4], x[3], x[ 2], x[1]} xc [n] = x[ n no N ]
Circular Shift of a Sequence Circular Shift of a Sequence

xc [n] = x[ n no N ] If the length-N sequence is displayed on a
xc [n] is also a length-N sequence defined circle at N equally spaced points, then the
for 0 n N 1 circular shift operation can be viewed as a
For no > 0 (right circular shift), the above clockwise or anti-clockwise rotation of the
equation implies sequence by no sample spacings as shown
on the next slide
x[n no ], for no n N 1
xc [n] =
x[ N no + n], for 0 n < no
Circular Shift of a Sequence Circular Shift of a Sequence

Illustration of the concept of a circular shift
x[ 2 ] x[1] x[ 4 ] x[ 3 ]
n = 2 n =1 n = 2 n =1
x[ 3 ] n = 3 n = 0 x[ 0 ] x[ 5 ] n = 3 n = 0 x[ 2 ]
n = 4 n =5 n = 4 n =5
x[ 4 ] x[ 5 ] x[ 0 ] x[1]
x[n] x[ n 4 6 ] = x[ n + 2 6 ]
x[n] x[ n 1 6 ] x[ n 4 6 ]
= x[ n + 5 6 ] = x[ n + 2 6 ]
Circular Shift of a Sequence Classification of Sequences
As can be seen from the previous figure, a There are several types of classification
right circular shift by no is equivalent to a One classification is in terms of the number
left circular shift by N no sample periods of samples defining the sequence
A circular shift by an integer number no Another classification is based on its
greater than N is equivalent to a circular symmetry with respect to time index n = 0
shift by no N Other classifications in terms of its other
properties, such as periodicity, summability,
energy and power
Classification of Sequences Classification of Sequences

Based on Symmetry Based on Symmetry
Conjugate-symmetric sequence: Conjugate-antisymmetric sequence:
x[n] = x * [ n] x[n] = x * [ n]
If x[n] is real, then it is an even sequence If x[n] is real, then it is an odd sequence
An even sequence An odd sequence


It follows from the definition that for a Any complex sequence can be expressed as
conjugate-symmetric sequence {x[n]}, x[0] a sum of its conjugate-symmetric part and
must be a real number its conjugate-antisymmetric part:
Likewise, it follows from the definition that x[ n] = xcs [n] + xca [ n]
for a conjugate anti-symmetric sequence where
{y[n]}, y[0] must be an imaginary number
xcs [n] = 12 ( x[n] + x * [ n])
From the above, it also follows that for an
odd sequence {w[n]}, w[0] = 0 xca [n] = 12 ( x[ n] x * [ n])
As indicated in the previous slide, The decomposition of a finite-length

computation of conjugate-symmetric and sequence into a sum of conjugate-
conjugate anti-symmetric parts of a symmetric and conjugate anti-symmetric
sequence involves conjugation, time- sequences is possible if the parent sequence
reversal, addition, and multiplication is an odd sequence defined for a symmetric
operations interval, i.e.,
M nM

Example - Consider the length-7 sequence Therefore {g cs [n]} = 12 {g [n] + g * [ n]}
defined for 3 n 3 : = {1.5, 0.5+ j 3, 3.5+ j 4.5, 4, 3.5 j 4.5, 0.5 j 3, 1.5}
{g [ n ]} = {0, 1+ j 4, 2+ j 3, 4 j 2, 5 j 6, j 2, 3}

Its conjugate sequence is then given by Likewise {g ca [n]} = 1 {g [n] g * [ n]}
2
{g * [ n ]} = {0, 1 j 4, 2 j 3, 4 + j 2, 5+ j 6, j 2, 3}
= {1.5, 0.5+ j , 1.5 j1.5, j 2, 1.5 j1.5, 0.5 j , 1.5}
The time-reversed version of the above is
{g * [ n ]} = {3, j 2, 5+ j 6, 4+ j 2, 2 j 3, 1 j 4, 0} It can be easily verified that gcs [n] = gcs
* [ n]
and gca [n] = gca [n]
*

Based on Symmetry Based on Periodicity
Any real sequence can be expressed as a A sequence ~ x [n] satisfying ~
x [n] = ~x [n + kN ]
sum of its even part and its odd part: is called a periodic sequence with a period N
x[ n] = xev [n] + xod [n] where N is a positive integer and k is any
where integer
Smallest value of N satisfying ~ x [n] = ~x [n + kN ]
xev [ n] = 12 ( x[n] + x[n])
is called the fundamental period
xod [n] = 12 ( x[n] x[ n])

Based on Periodicity Based on Periodicity
Example - If ~
xa [n] and ~ xb [n] are two periodic
sequences with fundamental periods N a
and N b , respectively, then the sequence
y [ n] = ~
~ xa [ n] + ~
xb [ n ]
is a periodic sequence with a fundamental
period N given by
A sequence not satisfying the periodicity Na Nb
condition is called an aperiodic sequence N=
GCD( Na, Nb )
Classification of Sequences:
Classification of Sequences
Energy and Power Signals
Based on Periodicity
If ~
xa [n] and ~ xb [n] are two periodic Total energy of a sequence x[n] is defined by
sequences with fundamental periods N a
and N b , respectively, then the sequence x = x[ n]
2
n =
y [ n] = ~
~ xa [ n ] ~
xb [ n ]
An infinite length sequence with finite sample
is a periodic sequence with a fundamental values may or may not have finite energy
period N given by
A finite length sequence with finite sample
Na Nb
N= values has finite energy
GCD( Na, Nb )
Classification of Sequences: Classification of Sequences:

Energy and Power Signals Energy and Power Signals
Example The infinite-length sequence Example The infinite-length sequence
1 / n, n 1,
x[n] = y[n] = 1 / n , n 1,
0, n 0, 0, n 0,
has an energy equal to has an energy equal to
E x= n =1 (1 / n)
2 E y = n =1 (1 / n)
2
which converges to / 6 , indicating that which does not converge indicating that
x[n] has finite energy y[n] has infinite energy

Then
The average power of an aperiodic Px = lim 2 K1+1 x. K
K
sequence is defined by
K The average power of a periodic sequence
Px = lim 2 K1+1 x[ n]
2
K n= K
x~[n] with a period N is given by
N 1

1 ~ 2
Define the energy of a sequence x[n] over a Px = x [n]
N
n =0
finite interval K n K as
The average power of an infinite-length
x,K
K
= x[n]
n= K
2
sequence may be finite or infinite
Classification of Sequences: Classification of Sequences:

Energy and Power Signals Energy and Power Signals
Example - Consider the causal sequence An infinite energy signal with finite average
defined by power is called a power signal
n
x[n] = 3( 1) , n 0 Example - A periodic sequence which has a
0, n<0 finite average power but infinite energy
Note: x[n] has infinite energy A finite energy signal with zero average
Its average power is given by power is called an energy signal
Example - A finite-length sequence which
1 K 9( K + 1)
Px = lim 9 1 = lim = 4.5 has finite energy but zero average power
K 2 K + 1 n = 0 K 2 K + 1
Other Types of Classifications Other Types of Classifications

A sequence x[n] is said to be bounded if A sequence x[n] is said to be absolutely
x[n] Bx < summable if
x[n] <
n =
Example - The sequence x[n] = cos 0.3n is a Example - The sequence

n
y[n] = 0.3 , n 0
bounded sequence as
x[n] = cos 0.3n 1 0, n < 0
is an absolutely summable sequence as
1
0.3n = 1 0.3 = 1.42857 <
35 Copyright 2010, S. K. Mitra 36 n =0 Copyright 2010, S. K. Mitra
Basic Sequences
Other Types of Classifications
1, n = 0
Unit sample sequence - [n] =
A sequence x[n] is said to be square- 0, n 0
1
summable if
x[n] <
2
n
n = 4 3 2 1 0 1 2 3 4 5 6
Example - The sequence

Unit step sequence - 1, n 0
sin 0.4 n
h[ n] = n [ n] =
0, n < 0
is square-summable but not absolutely 1
summable
n
4 3 2 1 0 1 2 3 4 5 6
Basic Sequences Basic Sequences

Real sinusoidal sequence - Exponential sequence -
x[ n] = A cos(o n + ) x[n] = A n , < n <
where A is the amplitude, o is the angular where A and are real or complex numbers
frequency, and is the phase of x[n] j
If we write = e( o + jo ) , A = A e ,
Example - = 0.1 then we can express
o
2
1 x[ n] = A e je( o + jo ) n = xre [n] + j xim [n],

Amplitude
0 where
-1
xre [n] = A eon cos(o n + ),
xim [ n] = A eon sin(o n + )
-2
0 10 20 30 40
Time index n

xre [n] and xim [n] of a complex exponential Real exponential sequence -
sequence are real sinusoidal sequences with x[ n] = A n , < n <
constant (o = 0), growing (o > 0), and
where A and are real numbers
decaying (o < 0 ) amplitudes for n > 0
Real part Imaginary part = 1.2 = 0.9
1 1 50 20
40
0.5 0.5 15
Amplitude
Amplitude
Amplitude
Amplitude
30
0 0 10
20
-0.5 -0.5 10 5
-1 -1 0 0
0 10 20 30 40 0 10 20 30 40 0 5 10 15 20 25 30 0 5 10 15 20 25 30
Time index n Time index n Time index n Time index n

41
x[n] = exp( + j 6 )n 1
12 42
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Basic Sequences
Sinusoidal sequence A cos(o n + ) and
Basic Sequences
complex exponential sequence B exp( jo n)
Now x2 [n] = cos(o ( n + N ) + )
are periodic sequences of period N if o N = 2r
= cos(o n + ) cos o N sin(o n + ) sin o N
where N and r are positive integers
which will be equal to cos(o n + ) = x1[n]
Smallest value of N satisfying o N = 2r only if
is the fundamental period of the sequence
sin o N = 0 and cos o N = 1
To verify the above fact, consider These two conditions are met if and only if
x1[n] = cos(o n + )
o N = 2 r or 2 = N
x2 [n] = cos(o ( n + N ) + ) o r

=0
0
2
1.5
Amplitude
1
If 2/o is a noninteger rational number, then 0.5
the period will be a multiple of 2/o
0
0 10 20 30 40
Otherwise, the sequence is aperiodic Time index n
Example - x[ n] = sin( 3n + ) is an aperiodic Here o = 0

sequence
2 r
Hence period N = = 1 for r = 0
0
Basic Sequences
2
= 0.1
0 Basic Sequences
1
Property 1 - Consider x[ n] = exp( j1n) and

Amplitude
-1 y[n] = exp( j2n) with 0 1 < and

-2
0 10 20 30 40 2k 2 < 2(k + 1) where k is any positive
Time index n
integer
Here o = 0.1
If 2 = 1 + 2k , then x[n] = y[n]
2 r
Hence N = = 20 for r = 1
0.1 Thus, x[n] and y[n] are indistinguishable
Property 2 - The frequency of oscillation of Because of Property 1, a frequency o in
A cos(o n) increases as o increases from 0 the neighborhood of = 2 k is
to , and then decreases as o increases from indistinguishable from a frequency o 2 k
to 2 in the neighborhood of = 0
Thus, frequencies in the neighborhood of and a frequency o in the neighborhood of
= 0 are called low frequencies, whereas, = (2 k + 1) is indistinguishable from a
frequencies in the neighborhood of = are frequency o (2 k + 1) in the
called high frequencies neighborhood of =

An arbitrary sequence can be represented in
Frequencies in the neighborhood of = 2 k the time-domain as a weighted sum of some
are usually called low frequencies basic sequence and its delayed (advanced)
Frequencies in the neighborhood of versions
= (2k+1) are usually called high
frequencies
v1[ n] = cos(0.1 n) = cos(1.9 n) is a low-
frequency signal
v2[ n] = cos(0.8 n) = cos(1.2 n) is a high- x[ n] = 0.5 [ n + 2] + 1.5 [n 1] [n 2]
frequency signal + [n 4] + 0.75 [ n 6]
The Sampling Process The Sampling Process

Often, a discrete-time sequence x[n] is
Time variable t of xa (t ) is related to the time
developed by uniformly sampling a
variable n of x[n] only at discrete-time
continuous-time signal xa (t ) as indicated
instants tn given by
below
tn = nT = n = 2 n
FT T
with FT = 1 / T denoting the sampling
frequency and
The relation between the two signals is
T = 2 FT denoting the sampling angular
x[n] = xa (t ) t =nT = xa (nT ), n = K, 2, 1, 0,1, 2,K frequency
Consider the continuous-time signal
xa (t ) = Acos(2 fot + ) = Acos(ot + ) If the unit of sampling period T is in
The corresponding discrete-time signal is seconds
2 o
x[ n] = A cos(o nT + ) = A cos( n + ) The unit of normalized digital angular
T frequency o is radians/sample
= A cos(o n + ) The unit of normalized analog angular
where o = 2 o / T = oT frequency o is radians/second
is the normalized digital angular frequency The unit of analog frequency f o is hertz
of x[n] (Hz)

The three continuous-time signals Plots of these sequences (shown with circles)
g1 (t ) = cos(6 t) and their parent time functions are shown
g 2 (t ) = cos(14 t) below:
g3 (t ) = cos(26 t)
1
0.5
of frequencies 3 Hz, 7 Hz, and 13 Hz, are

Amplitude
sampled at a sampling rate of 10 Hz, i.e.

-0.5
with T = 0.1 sec. generating the three
-1
sequences 0 0.2 0.4 0.6 0.8 1
g1[n] = cos(0.6 n) g 2 [n] = cos(1.4 n)

time
Note that each sequence has exactly the same

g3[n] = cos(2.6 n)
57 58
sample value for any given n
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra

This fact can also be verified by observing that
The above phenomenon of a continuous-
g 2 [n] = cos(1.4 n) = cos(( 2 0.6)n ) = cos(0.6 n) time signal of higher frequency acquiring
the identity of a sinusoidal sequence of
g3[n] = cos(2.6 n) = cos((2 + 0.6)n ) = cos(0.6 n) lower frequency after sampling is called
As a result, all three sequences are identical aliasing
and it is difficult to associate a unique
continuous-time function with each of these
sequences
Since there are an infinite number of Example - Determine the discrete-time
continuous-time signals that can lead to the signal v[n] obtained by uniformly sampling
same sequence when sampled periodically, at a sampling rate of 200 Hz the continuous-
additional conditions need to imposed so time signal
that the sequence {x[n]} = {xa (nT )} can va (t ) = 6 cos(60 t) + 3 sin(300 t) + 2 cos(340 t)
uniquely represent the parent continuous- + 4 cos(500t ) + 10 sin(660t )
time signal xa (t )
Note: va (t ) is composed of 5 sinusoidal
In this case, xa (t ) can be fully recovered signals of frequencies 30 Hz, 150 Hz, 170
from {x[n]} Hz, 250 Hz and 330 Hz

The sampling period is T = 1 = 0.005 sec = 6 cos( 0.3 n) 3 sin( 0.5 n) + 2 cos( 0.3 n) + 4 cos( 0.5 n)
200 10 sin( 0.7 n)
The generated discrete-time signal v[n] is
= 8 cos( 0.3 n) + 5 cos( 0.5 n + 0.6435) 10 sin( 0.7 n)
thus given by
v[ n ] = 6 cos( 0.3 n) + 3 sin(1.5n) + 2 cos(1.7 n)
Note: v[n] is composed of 3 discrete-time
+ 4 cos( 2.5 n) + 10 sin( 3.3 n)
sinusoidal signals of normalized angular
= 6 cos( 0.3n ) + 3 sin(( 2 0.5) n) + 2 cos(( 2 0.3) n)
frequencies: 0.3, 0.5, and 0.7
+ 4 cos(( 2 + 0.5) n) + 10 sin(( 4 0.7 ) n)

2o
Note: An identical discrete-time signal is Recall o =
T
also generated by uniformly sampling at a
200-Hz sampling rate the following Thus if T > 2o , then the corresponding
continuous-time signals: normalized digital angular frequency o of
wa (t ) = 8 cos(60 t) + 5 cos(100 t + 0.6435) 10 sin(140 t) the discrete-time signal obtained by
g a (t ) = 2 cos( 60 t) + 4 cos(100 t) + 10 sin( 260 t) sampling the parent continuous-time
+ 6 cos( 460 t) + 3 sin( 700 t) sinusoidal signal will be in the range < <
No aliasing
On the other hand, if T < 2 o , the
normalized digital angular frequency will Generalization: Consider an arbitrary
foldover into a lower digital frequency continuous-time signal xa (t ) composed of a
o = 2o / T 2 in the range < < weighted sum of a number of sinusoidal
because of aliasing signals
Hence, to prevent aliasing, the sampling xa (t ) can be represented uniquely by its
frequency T should be greater than 2 sampled version {x[n]} if the sampling
times the frequency o of the sinusoidal frequency T is chosen to be greater than 2
signal being sampled times the highest frequency contained in
xa (t )
The Sampling Process

The condition to be satisfied by the
sampling frequency to prevent aliasing is
called the sampling theorem
A formal proof of this theorem will be
presented later
69 Copyright 2010, S. K. Mitra

Ch2 (2) Handouts 4e

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Ch2 (2) Handouts 4e

Загружено:

Авторское право:

Доступные форматы

Operations on Finite-

Finite-Length Operations on Finite-

1 Copyright 2010, S. K. Mitra 2 Copyright 2010, S. K. Mitra

Modulo Operation Modulo Operation

Circular Shift of a Sequence Circular Shift of a Sequence

9 Copyright 2010, S. K. Mitra 10 Copyright 2010, S. K. Mitra

Circular Shift of a Sequence Circular Shift of a Sequence

13 Copyright 2010, S. K. Mitra 14 Copyright 2010, S. K. Mitra

Classification of Sequences Classification of Sequences

An even sequence An odd sequence

Classification of Sequences Classification of Sequences

As indicated in the previous slide, The decomposition of a finite-length

19 Copyright 2010, S. K. Mitra 20 Copyright 2010, S. K. Mitra

Classification of Sequences Classification of Sequences

Classification of Sequences Classification of Sequences

23 Copyright 2010, S. K. Mitra 24 Copyright 2010, S. K. Mitra

Classification of Sequences: Classification of Sequences:

Classification of Sequences: Classification of Sequences:

Other Types of Classifications Other Types of Classifications

Example - The sequence x[n] = cos 0.3n is a Example - The sequence

Example - The sequence

Basic Sequences Basic Sequences

1 x[ n] = A e je( o + jo ) n = xre [n] + j xim [n],

Basic Sequences Basic Sequences

Basic Sequences Basic Sequences

Example - x[ n] = sin( 3n + ) is an aperiodic Here o = 0

Property 1 - Consider x[ n] = exp( j1n) and

-1 y[n] = exp( j2n) with 0 1 < and

Basic Sequences Basic Sequences

The Sampling Process The Sampling Process

The Sampling Process The Sampling Process

of frequencies 3 Hz, 7 Hz, and 13 Hz, are

sampled at a sampling rate of 10 Hz, i.e.

g1[n] = cos(0.6 n) g 2 [n] = cos(1.4 n)

Note that each sequence has exactly the same

The Sampling Process The Sampling Process

The Sampling Process The Sampling Process

63 Copyright 2010, S. K. Mitra 64 Copyright 2010, S. K. Mitra

The Sampling Process The Sampling Process

The Sampling Process

69 Copyright 2010, S. K. Mitra

Вам также может понравиться