Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/54610
Title: | A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank | Authors: | Yu, Y.J. Lim, Y.C. |
Keywords: | Canonical signed power-of-two Genetic algorithm Perfect reconstruction Quadrature mirror filter bank |
Issue Date: | May-2002 | Citation: | Yu, Y.J.,Lim, Y.C. (2002-05). A novel genetic algorithm for the design of a signed power-of-two coefficient quadrature mirror filter lattice filter bank. Circuits, Systems, and Signal Processing 21 (3) : 263-276. ScholarBank@NUS Repository. | Abstract: | A novel genetic algorithm (GA) for the design of a canonical signed power-of-two (SPT) coefficient lattice structure quadrature mirror filter bank is presented in this paper. Genetic operations may render the SPT representation of a value noncanonical. In this paper, a new encoding scheme is introduced to encode the SPT values. In this new scheme, the canonical property of the SPT values is preserved under genetic operations. Additionally, two new features that drastically improve the performance of our GA are introduced. (1) An additional level of natural selection is introduced to simulate the effect of natural selection when sperm cells compete to fertilize an ovule; this dramatically improves the offspring survival rate. A conventional GA is analogous to intracytoplasmic sperm injection and has an extremely low offspring survival rate, resulting in very slow convergence. (2) The probability of mutation for each codon of a chromosome is weighted by the reciprocal of its effect. Because of these new features, the performance of our new GA outperforms conventional GAs. | Source Title: | Circuits, Systems, and Signal Processing | URI: | http://scholarbank.nus.edu.sg/handle/10635/54610 | ISSN: | 0278081X |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.