Ployphase Decomposition

1
Copyright 2001, S. K. Mitra

Polyphase Decomposition
The Decomposition
Consider an arbitrary sequence {x[n]} with
a z-transform X(z) given by

We can rewrite X(z) as

where
=

=
n
n
z n x z X ] [ ) (

=

=
1
0
M
k
M
k
k
z X z z X ) ( ) (

=

=

+ = =
n
n
n
n
k k
z k Mn x z n x z X ] [ ] [ ) (
1 0 s s M k
2
The subsequences are called the
polyphase components of the parent
sequence {x[n]}
The functions , given by the
z-transforms of , are called the
polyphase components of X(z)
]} [ { n x
k
]} [ { n x
k
) (z X
k
3
The relation between the subsequences
and the original sequence {x[n]} are given
by

In matrix form we can write
]} [ { n x
k
1 0 s s + = M k k Mn x n x
k
], [ ] [
| |
(
(
(
(

) (
) (
) (
. . . .
) (
) (
M
M
M
M
M
z X
z X
z X
z z z X
1
1
0
1 1
1
.
.
.
.
4
A multirate structural interpretation of the
polyphase decomposition is given below
5
The polyphase decomposition of an FIR
transfer function can be carried out by
inspection
For example, consider a length-9 FIR
transfer function:
=

=
8
0 n
n
z n h z H ] [ ) (
6
Its 4-branch polyphase decomposition is
given by

where
) ( ) ( ) ( ) ( ) (
4
3
3 4
2
2 4
1
1 4
0
z E z z E z z E z z E z H

+ + + =
2 1
0
8 4 0

+ + = z h z h h z E ] [ ] [ ] [ ) (
1
1
5 1

+ = z h h z E ] [ ] [ ) (
1
2
6 2

+ = z h h z E ] [ ] [ ) (
1
3
7 3

+ = z h h z E ] [ ] [ ) (
7
The polyphase decomposition of an IIR
transfer function H(z) = P(z)/D(z) is not that
straight forward
One way to arrive at an M-branch polyphase
decomposition of H(z) is to express it in the
form by multiplying P(z) and
D(z) with an appropriately chosen
polynomial and then apply an M-branch
polyphase decomposition to
) ( ' / ) ( '
M
z D z P
) ( ' z P
8
Example - Consider

To obtain a 2-band polyphase decomposition we
rewrite H(z) as

Therefore,

where
1
1
3 1
2 1
=
z
z
z H ) (
2
1
2
2
2
2 1
1 1
1
1
9 1
5
9 1
6 1
9 1
6 5 1
) 3 1 )( 3 1 (
) 3 1 )(
2 1
(
) (

+
+

+ = = =
z
z
z
z
z
z z
z z
z
z
z H
) ( ) ( ) (
2
1
1 2
0
z E z z E z H

+ =
1 1
1
9 1
5
1
9 1
6 1
0

+
= =
z z
z
z E z E ) ( , ) (
9
Note: The above approach increases the
overall order and complexity of H(z)
However, when used in certain multirate
structures, the approach may result in a
more computationally efficient structure
An alternative more attractive approach is
discussed in the following example
10
Example - Consider the transfer function of
a 5-th order Butterworth lowpass filter with
a 3-dB cutoff frequency at 0.5t:

It is easy to show that H(z) can be expressed
as
1 5
2 4
0.0527864 (1 )
1 0.633436854 0.0557281
( )
z
z z
H z

+
+ +
=
(
|
.
|
\
|
+
|
.
|
\
|
=

+
+
+
+
2
2
2
2
52786 0 1
52786 0
1
105573 0 1
105573 0
2
1
z
z
z
z
z z H
.
.
.
.
) (
11
Therefore H(z) can be expressed as

where

|
.
|
\
|
=

+
+
1
1
52786 0 1
52786 0
2
1
1
z
z
z E
.
.
) (
|
.
|
\
|
=

+
+
1
1
105573 0 1
105573 0
2
1
0
z
z
z E
.
.
) (
) ( ) ( ) (
2
1
1 2
0
z E z z E z H

+ =
12
Note: In the above polyphase decomposition,
branch transfer functions are stable
allpass functions
Moreover, the decomposition has not
increased the order of the overall transfer
function H(z)
) (z E
i
13
FIR Filter Structures Based on
We shall demonstrate later that a parallel
realization of an FIR transfer function H(z)
based on the polyphase decomposition can
often result in computationally efficient
multirate structures
Consider the M-branch Type I polyphase
decomposition of H(z):
) ( ) (
1
0
M
k
M
k
k
z E z z H

=

=
14
A direct realization of H(z) based on the
Type I polyphase decomposition is shown
below
15
The transpose of the Type I polyphase FIR
filter structure is indicated below
16
An alternative representation of the
transpose structure shown on the previous
slide is obtained using the notation

Substituting the above notation in the Type
I polyphase decomposition we arrive at the
Type II polyphase decomposition:
) ( ) (
1
0
) 1 ( M
M
M
z R z z H

=

=
1 0 ), ( ) (
1
s s =

M z E z R
M
M
M

17
A direct realization of H(z) based on the
Type II polyphase decomposition is shown
below
18
Computationally Efficient
Decimators
Consider first the single-stage factor-of-M
decimator structure shown below

We realize the lowpass filter H(z) using the
Type I polyphase structure as shown on the
next slide
M
] [n x ) (z H
] [n y
v[n]
19
Decimators
Using the cascade equivalence #1 we arrive
at the computationally efficient decimator
structure shown below on the right
Decimator structure based on Type I polyphase decomposition
y[n] y[n] x[n] x[n]
] [n v
20
Decimators
To illustrate the computational efficiency of
the modified decimator structure, assume
H(z) to be a length-N structure and the input
sampling period to be T = 1
Now the decimator output y[n] in the
original structure is obtained by down-
sampling the filter output v[n] by a factor of
M
21
Decimators
It is thus necessary to compute v[n] at

Computational requirements are therefore N
multiplications and additions per
output sample being computed
However, as n increases, stored signals in
the delay registers change
. . . , 2 , , 0 , , 2 , . . . M M M M n =
) 1 ( N
22
Decimators
Hence, all computations need to be
completed in one sampling period, and for
the following sampling periods the
arithmetic units remain idle
The modified decimator structure also
requires N multiplications and
additions per output sample being computed

) 1 ( N
) 1 ( M
23
Decimators and Interpolators
However, here the arithmetic units are
operative at all instants of the output
sampling period which is M times that of
the input sampling period
Similar savings are also obtained in the case
of the interpolator structure developed using
the polyphase decomposition

24
Interpolators
Figures below show the computationally
efficient interpolator structures
Interpolator based on
Type I polyphase decomposition
Interpolator based on
Type II polyphase decomposition
25
More efficient interpolator and decimator
structures can be realized by exploiting the
symmetry of filter coefficients in the case of
linear-phase filters H(z)
Consider for example the realization of a
factor-of-3 (M = 3) decimator using a
length-12 Type 1 linear-phase FIR lowpass
filter
26
The corresponding transfer function is

A conventional polyphase decomposition of
H(z) yields the following subfilters:
5 4 3 2 1
] 5 [ ] 4 [ ] 3 [ ] 2 [ ] 1 [ ] 0 [ ) (

+ + + + + = z h z h z h z h z h h z H
11 10 9 8 7 6
] 0 [ ] 1 [ ] 2 [ ] 3 [ ] 4 [ ] 5 [

+ + + + + + z h z h z h z h z h z h
3 2 1
0
] 2 [ ] 5 [ ] 3 [ ] 0 [ ) (

+ + + = z h z h z h h z E
3 2 1
1
] 1 [ ] 4 [ ] 4 [ ] 1 [ ) (

+ + + = z h z h z h h z E
3 2 1
2
] 0 [ ] 3 [ ] 5 [ ] 2 [ ) (

+ + + = z h z h z h h z E
27
Note that still has a symmetric
impulse response, whereas is the
mirror image of
These relations can be made use of in
developing a computationally efficient
realization using only 6 multipliers and 11
two-input adders as shown on the next slide
) (
1
z E
) (
0
z E
) (
2
z E
28
Factor-of-3 decimator with a linear-phase
decimation filter
29
A Useful Identity
The cascade multirate structure shown
below appears in a number of applications

Equivalent time-invariant digital filter
obtained by expressing H(z) in its L-term
Type I polyphase form
is shown below
L L H(z)
x[n] y[n]
) (
1
0
L
k
L
k
k
z E z

=

x[n]
y[n] ) (
0
z E

Ployphase Decomposition

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Ployphase Decomposition

Uploaded by

Copyright:

Available Formats

1

Copyright 2001, S. K. Mitra

You might also like