Evolving Tree Representations of Stack Filters (1998)
by
A. Beatriz Garmendia-doval
,
Chilukuri K. Mohan
,
Mohit K. Prasad
,
S. Cedar Crest Blvd
Add To MetaCart
Abstract:
Evolutionary algorithms are applied to the design of a class of nonlinear discrete-time filters: the positive Boolean function defining a stack filter is derived from its properties specified in terms of `selection probabilities'. For window size 9, with search space of at least 2 126 , best results were obtained using a tree representation for each positive Boolean function.
Citations
| 1921 | Genetic Programming I : On the Programming of Computers by Means of Natural Selection – Koza - 1992 |
| 15 | Two scientific applications of genetic programming: Stack filters and non-linear equation fitting to chaotic data – Oakley - 1994 |
| 4 | A Genetic Algorithm Approach to the Configuration of Stack Filters – Chu - 1989 |
| 2 | The theory and VLSI implementation of stack filters – Coyle - 1986 |
| 2 | Filters and Selection – Prasad, Lee - 1994 |
| 1 | filter design using evolutionary algorithms – Garmendia-Doval - 1998 |

