Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
1 2
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Up-Sampler Up-Sampler
Figure below shows the up-sampling by a
Up-sampling operation is implemented by factor of 3 of a sinusoidal sequence with a
inserting L 1 equidistant zero-valued frequency of 0.12 Hz obtained using
samples between two consecutive samples Program 13_1
Input Sequence Output sequence up-sampled by 3
of x[n] 1 1
Amplitude
n = 0, L, 2 L,L
xu [n] =
0 0
x[n / L],
0, otherwise -0.5 -0.5
-1 -1
0 10 20 30 40 50 0 10 20 30 40 50
Time index n Time index n
3 4 2 zero-valued
Copyright 2010, S. K. Mitra samples Copyright 2010, S. K. Mitra
Down-Sampler
Up-Sampler
Time-Domain Characterization
In practice, the zero-valued samples An down-sampler with a down-sampling
inserted by the up-sampler are replaced with factor M, where M is a positive integer,
appropriate nonzero values using some type develops an output sequence y[n] with a
of filtering process sampling rate that is (1/M)-th of that of the
Process is called interpolation and will be input sequence x[n]
discussed later Block-diagram representation
x[n] M y[n]
5 6
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
1
Down-Sampler
Down-Sampler
Figure below shows the down-sampling by
Down-sampling operation is implemented a factor of 3 of a sinusoidal sequence of
by keeping every M-th sample of x[n] and frequency 0.042 Hz obtained using Program
removing M 1 in-between samples to 13_2
Input Sequence Output sequence down-sampled by 3
1 1
generate y[n]
0.5 0.5
Input-output relation
Amplitude
Amplitude
0 0
y[n] = x[nM]
-0.5 -0.5
-1 -1
0 10 20 30 40 50 0 10 20 30 40 50
Time index n Time index n
Removed
7 8
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
2
Serial-to-Parallel Converter Serial-to-Parallel Converter
The multirate structure shown on the The multirate structure shown on the
previous slide converts an input sequence previous slide converts an input sequence
into a sequence vector of length 3 into a sequence vector of length 3
The first 4 samples of the sequences v1[n] , At time instant n, the vector generated is
v2 [n], and v3[n] are shown below:
x[n]
v1[ n] : x[n] x[n + 3] x[n + 6] x[ n + 9] L x[n + 1]
v2 [ n] : x[n + 1] x[ n + 4] x[n + 7] x[n + 10] L
x[n + 2]
v3[n] : x[ n + 2] x[n + 5] x[n + 8] x[n + 11] L
13 14
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
15 16
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
u2 [n ]
z1 y[ n ] v1 [ n ] v2 [ n ] v3 [ n ] v1 [ n +1] v2 [ n +1] v3 [ n +1] v1 [ n + 2 ] v2 [ n + 2 ] v3 [ n + 2 ]
v2 [n ] 3 +
z1 y[ n ] = v1[ n ]+ v 2 [ n 1]+ v 3 [ n 2 ]
u1[n ]
v1 [n ] 3 + y[n ]
17 18
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
3
Parallel-to-Serial Converter Parallel-to-Serial Converter
19 20
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
x[ n ]: x[ 0 ] x[1] x[ 2 ] x[3] x[ 4 ] x[ 5] x[6 ] x[ 7] x[8] x[ n ]: x[ 0 ] x[1] x[ 2 ] x[3] x[ 4 ] x[5] x[6 ] x[7] x[8]
v[ n ]: x[ 0 ] x[2 ] x[ 4 ] x[6 ] x[8] x[10 ] x[12 ] x[14 ] x[16 ]
w[ n ]: x[ 1] x[1] x[3] x[5] x[7] x[9] x[11] x[13] x[15]
23 24
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
4
A Simple Multirate Structure A Simple Multirate Structure
n: 0 1 2 3 4 5 6 7 8 n: 0 1 2 3 4 5 6 7 8
25 26
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Up-Sampler Up-Sampler
domain is given by
X u ( z) = xu [n] z n = x[n / 2] z n
n = n =
n even
x[n / 2], n = 0, 2, 4,K
xu [n] =
0, otherwise
= x[m] z 2m = X ( z 2 )
m =
29 30
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
5
Up-Sampler Up-Sampler
Figure below shows the relation between
In a similar manner, we can show that for a X (e j ) and X u (e j ) for L = 2 in the case of
factor-of-L up-sampler a typical sequence x[n]
X u ( z) = X ( z L )
On the unit circle, for z = e j , the input-
output relation is given by
X u ( e j ) = X ( e j L )
31 32
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Up-Sampler Up-Sampler
As can be seen, a factor-of-2 sampling rate Similarly in the case of a factor-of-L
expansion leads to a compression of X (e j ) sampling rate expansion, there will be L 1
by a factor of 2 and a 2-fold repetition in the additional images of the input spectrum in
baseband [0, 2] the baseband
This process is called imaging as we get an Lowpass filtering of xu [n] removes the L 1
additional image of the input spectrum images and in effect fills in the zero-
valued samples in xu [n] with interpolated
sample values
33 34
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Up-Sampler Down-Sampler
Program 13_3 can be used to illustrate the Frequency-Domain Characterization
frequency-domain properties of the up- Applying the z-transform to the input-output
sampler shown below for L = 4 relation of a factor-of-M down-sampler
y[n] = x[Mn]
Input spectrum Output spectrum
1 1
0.8 0.8
we get
Magnitude
Magnitude
x[Mn] z n
0.6
Y ( z) =
0.6
0.4 0.4
0.2 0.2 n =
0 0
The expression on the right-hand side
0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1
/ / cannot be directly expressed in terms of
35 36
X(z)
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
6
Down-Sampler Down-Sampler
To get around this problem, define a new Now, xint [n] can be formally related to x[n]
sequence xint [n] : through
xint [n] = c[n] x[n]
x[n], n = 0, M , 2M ,K
xint [n] = where
0, otherwise 1, n = 0, M , 2 M ,K
c[n] =
Then 0, otherwise
A convenient representation of c[n] is given
Y ( z) = x[Mn] z n = xint [Mn] z n by 1 M 1 kn
n =
n = c[n] = WM
M k =0
= xint [k ] z k / M = X int ( z1/ M ) where WM = e j 2 / M
37 k = 38
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Down-Sampler Down-Sampler
Taking the z-transform of xint [n] = c[n] x[n]
and making use of Hence,
M 1
c[n] =
1
WMkn Y ( z ) = X int ( z1 / M )
1 M 1
M k =0 1/ M k )
= X ( z WM )
we arrive at M
k =0
M 1 kn
1
X int ( z ) = c[n]x[n] z n = M WM x[n] z n On the unit circle,
n = n = k =0 1 M 1
Y ( e j ) = X (e j (2k ) / M )
=
1 M 1 kn n 1 M 1
x[n]WM z = M X z WMk
M k =0 n =
( ) M k =0
39 k =0 40
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Down-Sampler
Down-Sampler
Consider a factor-of-2 down-sampler with
an input x[n] whose spectrum is as shown Now X (e j / 2 ) = X (e j ( 2 ) / 2 ) implying
below that the second term X (e j / 2 ) in the
previous equation is simply obtained by
shifting the first term X (e j / 2 ) to the right
by an amount 2 as shown below
7
Down-Sampler Down-Sampler
The plots of the two terms have an overlap, This overlap causes the aliasing that takes
and hence, in general, the original shape place due to under-sampling
of X (e j ) is lost when x[n] is down- There is no overlap, i.e., no aliasing, only if
sampled as indicated below X ( e j ) = 0 for / 2
Note: Y (e j ) is indeed periodic with a
period 2, even though the stretched version
of X (e j ) is periodic with a period 4
43 44
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Down-Sampler
Down-Sampler Aliasing is absent if and only if
Down-Sampler
Down-Sampler
The input and output spectra of a down-
Program 13_4 can be used to illustrate the sampler with M = 3 obtained using Program
frequency-domain properties of the down- 13_4 are shown below
sampler shown below for M = 2 1
Input spectrum
0.5
Output spectrum
0.6 0.3
0.8 0.4
0.4 0.2
Magnitude
Magnitude
0.6 0.3
0.2 0.1
0.4 0.2
0 0
0.2 0.1 0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1
/ /
0 0
0 0.2 0.4 0.6 0.8 1 0 0.2 0.4 0.6 0.8 1
/ / Effect of aliasing can be clearly seen
47 48
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
8
Up-Sampler and
Cascade Equivalences
Down-sampler Cascade
A complex multirate system is formed by an
interconnection of the up-sampler, the To implement a fractional change in the
down-sampler, and the components of an sampling rate we need to employ a cascade
LTI digital filter of an up-sampler and a down-sampler
In many applications these devices appear Consider the two cascade connections
in a cascade form shown below
v1[n ]
x[n ] L M y1[n ]
An interchange of the positions of the
branches in a cascade often can lead to a v 2 [n ]
x[n ] M L y2 [n ]
computationally efficient realization
49 50
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Up-
Up-Sampler and
Down-
Down-sampler Cascade Noble Identities
It follows from the above that Y1 ( z ) = Y2 ( z ) Two other cascade equivalences are shown
if below
1 M 1 L / M kL 1 M 1 L / M k Cascade equivalence #1
X (z WM ) = X (z WM )
M k =0 M k =0 x[n ] M H (z ) y1 [ n ]
9
Multirate Structures for Multirate Structures for
Sampling Rate Conversion Sampling Rate Conversion
From the sampling theorem it is known that Likewise, the zero-valued samples
the sampling rate of a critically sampled introduced by an up-sampler must be
discrete-time signal with a spectrum
interpolated to more appropriate values for
occupying the full Nyquist range cannot be
reduced any further since such a reduction an effective sampling rate increase
will introduce aliasing We shall show shortly that this interpolation
Hence, the bandwidth of a critically can be achieved simply by digital lowpass
sampled signal must be reduced by lowpass filtering
filtering before its sampling rate is reduced
by a down-sampler
1 2
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
3 4
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
5 6
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
1
Basic Structures Basic Structures
A fractional change in the sampling rate by
Here, the lowpass filter H (z ), called the a rational factor L/M can be achieved by
decimation filter, bandlimits the input signal cascading a factor-of-L interpolator with a
x[n] to < / M prior to down-sampling, factor-of-M decimator
to ensure no aliasing
The interpolator must precede the decimator
It can be shown that the transpose of a as shown below to ensure that the baseband
factor-of-M decimator is a factor-of-M of w[n] is greater than or equal to that of
interpolator x[n] or y[n]
x[ n ] L H u (z) w[ n ] Hd (z) M y[n ]
7 8
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
2
Input-Output Relation of the Input-Output Relation of the
Interpolator Interpolator
For the interpolator structure shown below, Combining the last two equations and
let h[n] denote the impulse response of the making a change of a variable, we arrive at
decimation filter H(z) the desired time-domain input-output
xu [n] relation of the interpolator as
x[ n ] L H (z ) y[n ]
Then y[n] = h[n Lm] x[ m]
y[n] = h[ n l] xu [l] m =
l =
and In the z-domain, the input-output relation of
xu [ Lm] = x[m], m = 0, 1, 2,K the interpolator is thus given by
13 14
Y ( z) = H ( z) X ( z L )
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
x[n]
17 18
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
3
Interpolation Filter Interpolation Filter
Specifications Specifications
Since the sampling is being performed at the Figure below show the Fourier transform of
Nyquist rate, there is no overlap between the y[n]
shifted spectras of X ( j / To )
If we instead sample xa (t ) at a much higher
rate T = To / L yielding y[n], its Fourier
transform Y (e j ) is related to X a ( j)
through
1 j j 2 k = L X j j 2 k
Y ( e j ) = Xa a
T k = T To k = To / L
19 20
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
21 22
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
4
Decimation Filter
Filter Design Methods
Specifications
In a similar manner, we can develop the The design of the filter H(z) is a standard
specifications for the lowpass decimation IIR or FIR lowpass filter design problem
filter that are given by Any one of the techniques outlined in
Chapter 7 can be applied for the design of
1, c / M
H ( e j ) = these lowpass filters
0, / M
25 26
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
5
Computational Requirements Computational Requirements
Now assume H(z) to be an IIR filter of order Its direct form implementation is given by
K with a transfer function w[n] = d1w[n 1] d 2 w[n 2] L
V ( z) P( z ) d K w[n K ] + x[n]
= H ( z) =
X ( z) D( z ) v[n] = p0 w[n] + p1w[n 1] + L + pK w[n K ]
where K Since v[n] is being down-sampled, it is
P( z ) = pn z n sufficient to compute v[n] only for values of
n =0
K n that are integer multiples of M
D( z ) = 1 + dn z n
31 n =1 Copyright 2010, S. K. Mitra
32
Copyright 2010, S. K. Mitra
Computational Requirements
Computational Requirements
However, the intermediate signal w[n] must
be computed for all values of n Example - We compare the computational
For example, in the computation of complexity of various implementations of a
v[M ] = p0 w[M ] + p1w[ M 1] + L + pK w[ M K ] factor-of-M decimator
K+1 successive values of w[n] are still Let the sampling frequency be FT
required Then the number of multiplications per
As a result, the savings in the computation second, to be denoted as RM , are as follows
in this case is going to be less than a factor for various computational schemes
of M
33 34
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
6
Sampling Rate Alteration
Computational Requirements Using MATLAB
For the case of interpolator design, very
The function decimate can be employed
similar arguments hold
to reduce the sampling rate of an input
If H(z) is an FIR interpolation filter, then signal vector x by an integer factor M to
the computational savings is by a factor of L generate the output signal vector y
(since v[n] has L 1 zeros between its
The decimation of a sequence by a factor of
consecutive nonzero samples)
M can be obtained using Program 10_5
On the other hand, computational savings is which employs the function decimate
significantly less with IIR filters
37 38
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Amplitude
-2 -2
0 20 40 60 80 100 0 10 20 30 40 50
Time index n Time index n
39 40
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
Amplitude
41
interp 42
Time index n Time index n
7
Sampling Rate Alteration
Sampling Rate Alteration
Using MATLAB
Using MATLAB
The function resample can be employed
to increase the sampling rate of an input Example - The input and output plots of a
vector x by a ratio of two positive integers, factor-of-5/3 interpolator designed using
L/M, generating an output vector y Program 13_7 are given below
The M-file employs a lowpass FIR filter Input sequence Output sequence
2 2
designed using fir1 with a Kaiser
1 1
window
Amplitude
Amplitude
0 0
The fractional interpolation of a sequence
-1 -1
can be obtained using Program 13_7 which
employs the function resample -2
0 10 20 30
-2
0 10 20 30 40 50
Time index n Time index n
43 44
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
45 46
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
8
Multistage Design of Multistage Design of
Decimator and Interpolator
Decimator and Interpolator
Assume H(z) to be designed as an
Specifications for the decimation filter H(z) equiripple linear-phase FIR filter
are assumed to be as follows:
Now Kaisers formula for estimating the
Fp = 180 Hz , Fs = 200 Hz , order of H(z) to meet the specifications is
p = 0.002 , s = 0.001 given by
20 log10 p s 13
N=
14.6 f
where f = ( Fs Fp ) / FT is the normalized
transition bandwidth
49 50
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
9
Multistage Design of Multistage Design of
Decimator and Interpolator Decimator and Interpolator
This can be compensated for by designing Thus, specifications for the two filters G(z)
F(z) and G(z) to have a passband ripple of and F(z) are as follows:
p = 0.001 each G(z): p = 0.001, s = 0.001, f = 300
12,000
On the other hand, the cascade of F(z) and 420
G( z15) has a stopband at least as good as F ( z ): p = 0.001, s = 0.001, f =
12,000
F(z) or G( z15), individually
The filter orders obtained using the M-file
So we can choose s = 0.001 for both filters kaiord are: Order of G(z) =129
Order of F(z) = 92
55 56
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
10
Multistage Design of
Decimator and Interpolator
The total complexity of the IFIR-based
implementation of the factor-of-30
decimator is therefore
52,000 + 74,400 = 126,400 mult/sec
which is about 5.72 times smaller than that
of a direct implementation of the
decimation filter H(z)
61
Copyright 2010, S. K. Mitra
11
Polyphase Decomposition
Polyphase Decomposition
The Decomposition
Consider an arbitrary sequence {x[n]} with The subsequences {xk [n]} are called the
a z-transform X(z) given by polyphase components of the parent
X ( z ) = n = x[n]z
n
sequence {x[n]}
We can rewrite X(z) as The functions X k (z ), given by the
X ( z ) = kM=01 z k X k ( z M ) z-transforms of {xk [n]}, are called the
where polyphase components of X(z)
X k ( z ) = n = xk [n] z
n
= n = x[ Mn + k ] z
n
0 k M 1
1 2
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
[ ]
M x2 [n] = x[M n + 2]
M
X ( z ) = 1 z 1 .... z ( M 1) X1.( z )
.. z
X . ( z M ) M x M1[n] = x[M n + M 1]
3 M 1 4
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
E3 ( z ) = h[3] + h[7]z 1 E 3 (z 4)
5 6
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
1
Polyphase Decomposition Polyphase Decomposition
The polyphase decomposition of an IIR Example - Consider 1
transfer function H(z) = P(z)/D(z) is not that H ( z ) = 1 2 z 1
1+3 z
straight forward To obtain a 2-band polyphase decomposition
One way to arrive at an M-branch polyphase we rewrite H(z) as
(1 2 z 1 )(13 z 1 ) 15 z 1 + 6 z 2 1+ 6 z 2 5 z 1
decomposition of H(z) is to express it in the H ( z) = = = +
(1+3 z 1 )(13 z 1 ) 19 z 2 19 z 2 19 z 2
form P '( z ) / D '( z M ) by multiplying P(z) and Therefore,
D(z) with an appropriately chosen
H ( z ) = E0 ( z 2 ) + z 1E1( z 2 )
polynomial and then apply an M-branch
where 1 5
polyphase decomposition to P '( z ) E0 ( z ) = 1+ 6 z 1 , E1( z ) = 1
7 8 19 z 19 z
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
11 12
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
2
FIR Filter Structures Based on FIR Filter Structures Based on
Polyphase Decomposition Polyphase Decomposition
We shall demonstrate later that a parallel A direct realization of H(z) based on the
realization of an FIR transfer function H(z) Type I polyphase decomposition is shown
based on the polyphase decomposition can below x[n] E (z ) y[n]
M +
0
often result in computationally efficient _
z1
multirate structures _
E 1(z M) +
z1
Consider the M-branch Type I polyphase E 2 (z M) +
decomposition of H(z):
H ( z ) = kM=01 z k Ek ( z M )
_
z1
E M _ 1(z M)
13 14
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
R 1(z M) +
_
z1
We realize the lowpass filter H(z) using the
R 2 (z M) + Type I polyphase structure as shown on the
next slide
_
z1
R M _ 1(z M) + y[n]
17 18
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
3
Computationally Efficient
Decimators Computationally Efficient
Using the cascade equivalence #1 we arrive Decimators
at the computationally efficient decimator To illustrate the computational efficiency of
structure shown below on the right the modified decimator structure, assume
FT FT FT /M FT FT /M FT /M
x[n] E 0(z M) + M y[n] x[n] M E 0(z) + y[n] H(z) to be a length-N structure and the input
_
z1 v[n ]
_
z1 sampling period to be T = 1
E 1(z M) + M E 1 (z) +
_
z1
_
z1 Now the decimator output y[n] in the
E 2 (z M) + M E2 (z) +
original structure is obtained by down-
_1
z
_1
z sampling the filter output v[n] by a factor of
E M _ 1(z M) M E M _ 1(z)
M
Decimator structure based on Type I polyphase decomposition
19 20
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
21 22
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
L + R 0(z) L
sampling period which is 1/M times that of E 0(z)
_
z1
_
z1
E L _ 1 (z) L R L _1(z) L +
4
Computationally Efficient Computationally Efficient
Decimators and Interpolators Decimators and Interpolators
More efficient interpolator and decimator The corresponding transfer function is
structures can be realized by exploiting the H ( z ) = h[ 0] + h[1] z 1 + h[ 2] z 2 + h[3] z 3 + h[ 4] z 4 + h[5] z 5
symmetry of filter coefficients in the case of + h[5] z 6 + h[ 4] z 7 + h[3] z 8 + h[ 2] z 9 + h[1] z 10 + h[ 0] z 11
linear-phase filters H(z)
A conventional polyphase decomposition of
Consider for example the realization of a H(z) yields the following subfilters:
factor-of-3 (M = 3) decimator using a
E0 ( z ) = h[0] + h[3]z 1 + h[5]z 2 + h[2]z 3
length-12 Type 1 linear-phase FIR lowpass
filter E1 ( z ) = h[1] + h[ 4]z 1 + h[4] z 2 + h[1]z 3
E2 ( z ) = h[2] + h[5]z 1 + h[3]z 2 + h[0]z 3
25 26
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
_ _ _
z1
These relations can be made use of in _
3 z1 z1
h[3]
z1 + +
developing a computationally efficient _1
_1 _1
z
_1
+
h[0]
z z z +
realization using only 6 multipliers and 11 3 +
h[2]
+
5
Rational Sampling Rate Rational Sampling Rate
Converter Converter
The sampling rates of the digital component We outline next the implementation of a
video signal are 13.5 MHz and 6.75 MHz computationally efficient FIR fractional rate
for the luminance and the color-difference converter with a rational conversion factor
signals, respectively, for the NTSC and L/M, where L and M are mutually prime
PAL systems Now two mutually prime integers L and M
satisfy the relation
Here, again there are different sampling rate
M L = 1
conversion factors
where and are unique distinct positive
integers
31 32
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
E 1 (z) L z
_1
M +
Using the identity M L = 1 we can write
z k = z k (M L ) = z kM z kL
Ek (z) L
_
z k M + Hence, we can replace the block of k delays
with a block of kM unit delays and a block
E L _ 1 (z) L
_ _
z (L 1) M of kL unit advances as shown next
35 36
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
6
Rational Sampling Rate Rational Sampling Rate
Converter Converter
E k (z) L z kL
_
z kM M As a result, the general rational sampling
This branch can be further redrawn by rate converter structure in Slide 36 can be
invoking the noble identites as shown below redrawn as indicated below
_ E 0(z) M L +
Ek (z) z k L M z k _
z z
_ _
z z
E L _ 1 (z) M L
39 40
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
7
Rational Sampling Rate Rational Sampling Rate
Converter Converter
For this design we have L = 2 and M = 3 By realizing the sub-filters E0 ( z ) and E1( z )
The identity 3 2 = 1 is thus satisfied in Type I polyphase forms and then
with = = 1 applying the cascade equivalence we arrive
Hence, the general structure of this at the final computationally efficient
converter is as indicated below structure shown in the next slide
E0 (z) 3 2 +
Here, all filters operate at the 16-kHz rate
_ _
z1 z 1
E 1(z) 3 2
43 44
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
3 E 10 (z) + 2
48-kHz _
z1
Equivalent time-invariant digital filter
_
3 E 11 (z) + obtained by expressing H(z) in its L-term
z1
3 E 12 (z) Type I polyphase form kL=10 z k Ek ( z L )
16-kHz is shown below
x[n] E0 ( z ) y[n]
45 46
Copyright 2010, S. K. Mitra Copyright 2010, S. K. Mitra
8
Upsampler/Downsampler Identities
L/1Interpolator 1/MDecimator
L/MResampler
L/1Interpolator 1/MDecimator
L/MResampler