# Design of discrete-coefficient FIR filters on loosely connected parallel machines

TL;DR: A new branch-and-bound mixed-integer linear programming-based algorithm for designing discrete-coefficient finite-impulse response (FIR) filters using a cluster of workstations as the computation platform and test run results showed that super linear speedup may be achieved.

Abstract: This paper presents a new branch-and-bound mixed-integer linear programming-based algorithm for designing discrete-coefficient finite-impulse response (FIR) filters using a cluster of workstations as the computation platform. The discrete coefficient space considered is the sum of signed power-of-two space, but the technique is also applicable to other discrete coefficient spaces. The key issue determining the success of the algorithm is the ability to partition the original problem into several independent parts that can be distributed to a cluster of machines for solution. The master-slave model is adopted for the control of the machines. Test run results showed that super linear speedup (i.e., the speedup factor is more than the number of machines running in parallel) may be achieved.

...read more

##### Citations

163 citations

92 citations

### Cites methods from "Design of discrete-coefficient FIR ..."

...First we review the depth-first search branch and bound algorithm [21]–[23] which has successfully optimized filter coeffi-...

[...]

56 citations

### Cites background from "Design of discrete-coefficient FIR ..."

...All previous work on filter implementation [5]-[9] discussed hardware reduction in terms of the number of adders and has not addressed the complexity of adders....

[...]

...The number of adders needed in the multipliers is proportional to the coefficient wordlength [9]....

[...]

34 citations

28 citations

##### References

[...]

4,157 citations

### "Design of discrete-coefficient FIR ..." refers background in this paper

...The penalty value [28] of a constraint is the degradation on the objective function when the constraint is imposed....

[...]

470 citations

### "Design of discrete-coefficient FIR ..." refers background in this paper

...Many papers on finite wordlength or power-of-two design technique [1]–[7], [13]–[21] and sparse coefficient techniques [22]–[26] have been published in the literature....

[...]

443 citations

240 citations

### "Design of discrete-coefficient FIR ..." refers methods in this paper

...It should be noted that the computer time required by running MILP is several orders of magnitude [29] of that required by other suboptimum techniques if only one processor is used; running MILP on parallel machines still requires more computer time than running other techniques on a single…...

[...]

...Mixed-integer linear programming (MILP) is the only known method that can provide the global optimum solution to the design of FIR filters with SPT coefficient values [2], [4], [27], although other computationally very much less demanding technique exist [29]....

[...]

187 citations