2000
DOI: 10.1049/ip-cds:20000694
|View full text |Cite
|
Sign up to set email alerts
|

Genetic synthesis of reduced complexity filters and filter banks using primitive operator directed graphs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2004
2004
2019
2019

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(28 citation statements)
references
References 19 publications
0
28
0
Order By: Relevance
“…Evolutionary algorithms have already been used to optimise filter coefficients, along with add and shift operations for multiplierless filter designs [25,26,29]. The GA presented in this paper extends this principle to the optimal configuration of hardwired PALUs in order to obtain a set of desired filter coefficients within our dedicated PLA architecture.…”
Section: Evaluating Filter Configurations Using a Genetic Algorithmmentioning
confidence: 97%
See 2 more Smart Citations
“…Evolutionary algorithms have already been used to optimise filter coefficients, along with add and shift operations for multiplierless filter designs [25,26,29]. The GA presented in this paper extends this principle to the optimal configuration of hardwired PALUs in order to obtain a set of desired filter coefficients within our dedicated PLA architecture.…”
Section: Evaluating Filter Configurations Using a Genetic Algorithmmentioning
confidence: 97%
“…Bull and Horrocks [5] have shown that FIR filters designed using POF are smaller in area than those designed using the CSD approach [5,25]. An exhaustive investigation of POF and related filter design approaches can be found in the Ph.D. thesis written by David Bull [27].…”
Section: Primitive Operator Filtersmentioning
confidence: 98%
See 1 more Smart Citation
“…To avoid them, graph-based approaches are commonly used in state-of-the-art MCM methods [22]- [27]. Some early work on multiplierless FIR filter design already considered this by incorporating the graph-based MCM algorithm of [22] into a genetic algorithm that optimizes the filter coefficients according to the adder cost [4]. A different approach is followed by [9], where a branch-and-bound-based ILP optimization is used; here, a pre-specified set of integer terms, called the subexpression space, has to be provided that can be shared among the different coefficient expansions.…”
Section: Multiplierless Fir Filtersmentioning
confidence: 99%
“…Therefore, a lot of effort in fixed-point FIR filter design has gone into optimizing for resource use. In this context, the problem of finding a minimal adder circuit for a given filter specification was addressed by several authors [1], [2], [4], [5], [7], [9], [15], [19]. However, to the best of our knowledge, no previous work has addressed the design of multiplierless FIR filters in an optimal way.…”
Section: Introductionmentioning
confidence: 99%