|Title of host publication||Unknown|
|Publisher or commissioning body||Institute of Electrical and Electronics Engineers (IEEE)|
|Pages||93 - 96|
|Number of pages||3|
|State||Published - May 1994|
|Conference||International Symposium on Circuits and Systems|
|Period||1/05/94 → …|
This paper introduces a method for optimising digital filter realisations at the gate level. The method is based on a derivative of the primitive operator approach of Bull and Horrocks which is extended using a carry-save decomposition of the primitive operator graph. This facilitates the generation of a set of Boolean expressions for the multiply-accumulate section of the filter which can be minimised using standard sum of products or Reed Muller techniques. The technique is fully described and results are presented for a representative range of FIR filters. Savings of up to 83% are obtained for sum-of-products minimisation when compared to a CSD coded hard-wired multiplier solution. Initial results suggest further improvements in excess of 20% for the Reed Muller case
Conference Proceedings/Title of Journal: Proc. 1994 IEEE Int. Sym. on Circuits and Systems
Rose publication type: Conference contribution
Sponsorship: The authors would like to express their thanks to Nigel Lester of the Department of Electrical and Electronic Engineering at
the University of Bristol for his assistance in producing the logic minimisation results presented here
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 email@example.com.
By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
International Symposium on Circuits and Systems
|Duration||1 May 1994 → …|