Softroniics

Two-Step Optimization Approach for the Design of

Multiplierless Linear-Phase FIR Filters
ABSTRACT:
Deterministic tree search algorithms for the design of multiplierless linear phase
finite impulse response filters are generally time consuming. Many researches
therefore focus on how to restrict the number of discrete values assigned to each
coefficient during a tree search. In this paper, a two-step tree search algorithm is
proposed. In the first step, a polynomial-time tree search algorithm where each
coefficient is fixed to a single one discrete value is introduced. Since the synthesis
of large coefficients is dominant in the hardware cost over small coefficients, in the
second step optimization, the small coefficients obtained in the first step is kept
unaltered and the large coefficients are further divided into several groups and the
coefficients are optimized group by group alternatingly. Such a two-step search
strategy maximally utilizes the limited computational resources and can achieve
lower hardware cost design in a shorter design time, compared with existing
algorithms.

EXISTING SYSTEM:
MULTIPLIERLESS linear phase finite impulse response (FIR) filters have been
very popular in the past decades, since the coefficient multipliers are implemented
by adders and hard-wired shifts, resulting in a low hardware cost. Among the
Softroniics
Calicut||Coimbatore||Palakkad

www.softroniics.com
9037291113,9037061113

Softroniics
multiplierless FIR filter techniques [1][6], the most successful one is the multiple
constant multiplication (MCM) method [3], in which an adder-and-shift network is
synthesized to realize the coefficient multipliers of an FIR filter as a whole. The
latest researches in the multiplierless FIR filter design incorporate the synthesis of
MCM coefficients into the optimization search of discrete coefficients [7][20].
These algorithms make use of the diversity of the solutions of given filter
specifications to minimize the hardware cost.

The techniques that address the coefficient optimization and MCM

implementation jointly can be classified into two categories, i.e., the heuristic
algorithms [7][12] and the deterministic algorithms [13][20]. The heuristic
algorithms generally use shorter time to design filters, but the resultant filters
require more hardware than that obtained using the deterministic algorithms. The
deterministic algorithms [13][19] systematically search the coefficient spaces
based on different tree search techniques. The more coverage of the search, the
better the result but also the longer the search time. The computational
complexities of most tree search based deterministic algorithms are exponentially
proportional to the filter orders and/or coefficient wordlength.

PROPOSED SYSTEM:
Inspired by the technique in [17], a two-step search is proposed in this paper. In the
first step, a polynomial-time tree search, constraining each coefficient to only a
single discrete value, the middle value in its feasible range, is proposed [21].
Instead of assigning more discrete values to each coefficient, the research shows
that floating the passband gain increases the chances to achieve lower hardwarcost
Softroniics
Calicut||Coimbatore||Palakkad

www.softroniics.com
9037291113,9037061113

Softroniics
and the algorithm remains in polynomial computational complexity. Besides a
proposed passband gain floating scheme, a low hardware cost scheme which fixes
some coefficients to 0 value prior to the tree search is introduced. In the second
step, a further optimization is proposed to refine the results obtained in the first
step.
Unlike the approaches in [17], [19] which assign the same number of
discrete values to each coefficient, in the proposed one, the coefficients are divided
into two categories, the small coefficients and the large coefficients. The small
coefficients are not further optimized, i.e., they keep the value obtained in the first
step, while the large ones are re-optimized. The reason is because that the synthesis
of large coefficients is dominant in the hardware cost over small coefficients. The
key issues in such technique are how to divide the coefficients into the large
coefficient set and the small coefficient set, and how to efficiently optimize the
large coefficients. In this paper, an extremely small value is used as a threshold to
discriminate the small and large coefficients. In order to optimize the large
coefficients efficiently, these large coefficients are further divided into several
groups and optimized alternatingly group by group.

SOFTWARE IMPLEMENTATION:
1.

Modelsim 6.0

2.

Xilinx 14.2

HARDWARE IMPLEMENTATION
3.

SPARTAN-III, SPARTAN-VI

Softroniics
Calicut||Coimbatore||Palakkad

www.softroniics.com
9037291113,9037061113