An algorithm to find optimum support-reducing decompositions for index generation functions
- 1 March 2017
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Design, Automation & Test in Europe Conference & Exhibition (DATE), 2017
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- A Realization of Index Generation Functions Using Multiple IGUsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2016
- A Memory-Based IPv6 Lookup Architecture Using Parallel Index Generation UnitsIEICE Transactions on Information and Systems, 2015
- Memory-Based Logic SynthesisPublished by Springer Science and Business Media LLC ,2011
- Handbook of Data Structures and ApplicationsPublished by Taylor & Francis Ltd ,2004
- A new approach to the decomposition of incompletely specified multi-output functions based on graph coloring and local transformations and its application to FPGA mappingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Constructive library-aware synthesis using symmetriesPublished by Association for Computing Machinery (ACM) ,2000
- Switching Theory for Logic SynthesisPublished by Springer Science and Business Media LLC ,1999
- Finding all simple disjunctive decompositions using irredundant sum-of-products formsPublished by Association for Computing Machinery (ACM) ,1998
- The disjunctive decomposition of logic functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1997