306
PROCEEDINGS OF THE IEEE, VOL.
69,
NO.
3,
MARCH
1981
to values of
2d/M
it
can be seen that only specific frequency
bands are allowed by this method.
As
a consequence the
choice
of
the filter
Hap
(e'")
is
restricted to approximate one
of
the
M
ideal characteristics
I
1, kn/M<IwI<(k+l)n/M
iiBp
(eiw
=
(54)
0,
otherwise
where
k
=
0,
1,
2,
,
M
-
1, i.e.,
HBP
(e'")
is restricted to
bands
w
=
kn/M
to
w
=
(k
+
1)
n/M
where
n/M
is the
bandwidth.
Figs. 5(b)-(e) illustrate this approach. Fig. 5(b) shows the
M
possible modulating frequencies which are a consequence of
the
M
to 1 sampling rate reduction, i.e., the digital sampling
function (a periodic train of unit samples spaced
M
samples
apart) has spectral components spaced
2nl/M
apart. Fig. 5(c)
shows the "sidebands" that are associated with these spectral
components which correspond to the
M
choices of bands as
defined by (54). They correspond to the bands that are aliased
into the baseband of the output signal
Y(ei"')
according
to
(54).
(As
seen by (53) and (54) and Figs. 5(b) and (c), the re-
lationship between
k
and
1
is nontrivial).
Fig. 5(d) illustrates an example in which the
k
=
2
band is
used, such that
X,,
(e'")
is bandlimited
to
the range
2n/M
<
I
w
I
<
3n/M.
Since the process of sampling rate reduction by
M
to 1 corresponds to a convolution of the spectra of
XBp
(eiw
)
(Fig. 5(d)) and the sampling function (Fig. 5fb)) this band
is
lowpass translated to the baseband of
Y(eiw
)
as seen in Fig.
5(e). Thus, the processes of modulation and sampling rate re-
duction are achieved simultaneously by the
M
to 1 sampling
rate reduction.
The process of bandpass interpolation is the inverse to that
of bandpass decimation and it can be accomplished in a similar
manner. Referring to Fig. 3(c)
it
is seen that we can use a
bandpass filter with a characteristic similar to that described
by (54) (with
M
replaced by
L)
to remove one of the harmonic
images of the baseband signal rather than the baseband signal
itself. The net result
is
that we achieve both an interpolation
and a modulation
of
the input signal to one of its harmonic
locations in the spectrum.
III.
SIGNAL
PROCESSING
STRUCTURES
FOR
DECIMATORS
AND
INTERPOLATORS
It is easy to understand the need for studying structures for
realizing sampling rate conversion systems by examining the
simple block diagram
of
Fig. 4(b) which can be used to con-
vert the sampling rate of a signal by a factor of
L/M.
As
dis-
cussed in Section
I1
the theoretical model for this system is
increasing the signal sampling rate by a factor of
L
(by filling
in
L
-
1
zero-valued samples between each sample of
x(n)
to
give the signal w(k)), filtering w(k)
to
eliminate the images
of
X(e'")
by a standard linear time-invariant low-pass filter,
h(k),
to
give
u(k),
and sampling rate compressing
u(k)
by a
factor
M
(by retaining 1 of each
M
samples of
u(k)).
A
direct
implementation of the system of Fig. 4(b) is grossly inefficient
since the low-pass filter
h(k)
is
operating at the
high
sampling
rate on a signal for which
L
-
1 out of each
L
input values are
zero, and the values of the filtered output are required only
once each
M
samples. For this example, one can directly ap-
ply this knowledge in implementing the system
of
Fig. 4(b) in
a more efficient manner
as
will be discussed in this section.
Later in Section
V
we will extend these concepts to include
Fig.
6.
Direct form structure for 811 FIR fdter.
multistage implementations which can achieve greater effi-
ciencies
than
single stage designs when the conversion ratios
are large.
Before discussing specific classes
of
structures for sampling
rate conversion we
will
first briefly review in Section 111-A a
number of fundamental network and signal-flowgraph con-
cepts which
will
be used in developing these structures. We
will
then discuss three principle classes of FIR structures for
realizing single stage interpolators and decimators and com-
pare their properties.
A.
Signal-Flowgraphs
In order to precisely define the sets of operations necessary
to implement these digital systems we
will
strongly rely on the
concepts
of
signal-flowgraph representation in this section
[
171
-[
191
.
Signal-flowgraphs provide a graphical representa-
tion
of
the explicit set of equations that are used to implement
such systems. Furthermore, manipulating the flowgraphs in a
pictorial way
is
equivalent to manipulation of the mathe-
matical equations.
Fig.
6
illustrates an example
of
a signal-flowgraph of a direct-
form FIR digital filter. The input branch applies the external
signal
x
(n)
to the network and the output of the network
y
(n)
is identified as one
of
the node values. Branches define the
signal operations in the structure such as delays, gains, and
sampling rate expanders and compressors. Nodes define the
connection points and summing points. The signal entering a
branch is taken as the signal associated with the input node
value of the branch. The node value of a branch is the sum of
all branch signals entering the node.
Therefore from the signal-flowgraph (Fig.
6)
we can im-
mediately write down the network equation as
y(n)
=x(n)
h
(0)
+x(n
-
1)
h
(1)
+
*
*
+x(n
-
N+
1)h
(N-
1).
An important concept
in
the manipulation
of
signal-flow-
graphs
is
the principle of commutation of branch operations.
Two branch operations commute if the order of their cascade
operation can be interchanged without affecting the input-to-
output response of the cascaded system. Thus interchanging
commutable branches in a network
is
one way of modifying