This paper considers the design of low complexity FIR filters. Complexity is reduced by constraining the filters to have integer coefficients, which can be efficiently implemented using primitive operator directed graphs (PODG). Genetic algorithms (GAs) are used in conjunction with a heuristic graph design algorithm, to provide a solution set which represents different compromises between performance, complexity and filter order. Example results are presented for both one and two dimensional filters, and are shown to provide both superior performance and complexity, compared to previous methods. The main benefits result from the use of a joint optimization, rather than a separable 2-stage approach. The use of a PODG representation is shown to provide significant improvements over a canonic signed digit (CSD) or signed power-of-two (SPT) representation
|Translated title of the contribution||Automated design of low complexity FIR filters|
|Title of host publication||Unknown|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||429 - 432|
|Publication status||Published - May 1998|
|Event||International Symposium on Circuits and Systems - Monterey, CA, United States|
Duration: 1 May 1998 → …
|Conference||International Symposium on Circuits and Systems|
|Period||1/05/98 → …|
Bibliographical noteConference Proceedings/Title of Journal: Proc. IEEE Intl. Conference on Circuits and Systems, Monterey
Rose publication type: Conference contribution
Sponsorship: This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) grant number GRK25892
This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Bristol's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.