Design of discrete-coefficient FIR filters on loosely connected parallel machines
Citations
25 citations
Cites background from "Design of discrete-coefficient FIR ..."
...The total computing time reduction factor was 2.1....
[...]
20 citations
Cites methods from "Design of discrete-coefficient FIR ..."
...This problem can be efficiently optimized by B&B MILP [16], [22], [23]....
[...]
15 citations
Cites background from "Design of discrete-coefficient FIR ..."
...For a multiplierless filter implementation, the hardware complexity increases with the number of the adders, which is proportional to the filter wordlength [2]....
[...]
10 citations
10 citations
Cites methods from "Design of discrete-coefficient FIR ..."
...However, it should be noted that running MILP on parallel machines generally still requires more computation time than running other techniques on a single processor....
[...]
...There are two types of filter synthesis methodologies, namely, optimal approaches [19, 20] and suboptimal approaches [1, 4, 7, 9, 11, 14, 16, 32, 33, 38]....
[...]
...These include the use of mixed-integer linear programming (MILP) [19, 20], local search techniques [9, 14, 32, 38] and common subexpression elimination (CSE) [5, 6, 10, 12, 29, 31, 36, 37]....
[...]
...For example, MILP requires a few hours of computation time to design filters with length less than 70 when it is solved on a single machine....
[...]
...To tackle that problem, [20] presents a new MILP algorithm on loosely connected parallel machines such as a cluster of workstations....
[...]
References
[...]
4,336 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....
[...]
488 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....
[...]
451 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]....
[...]
191 citations