AIG Rewriting Using 5-Input Cuts
2011 (English)In: Computer Design (ICCD), 2011 IEEE 29th International Conference on, IEEE conference proceedings, 2011, 429-430 p.Conference paper (Refereed)
Rewriting is a common approach to logic optimization based on local transformations. Most commercially availablelogic synthesis tools include a rewriting engine that may be usedmultiple times on the same netlist during optimization. This paperpresents an And-Inverter graph (AIG) based rewriting algorithmusing 5-input cuts. The best circuits are pre-computed for a subsetof NPN classes of 5-variable functions. Cut enumeration andBoolean matching are used to identify replacement candidates.The presented approach is expected to complement existingrewriting approaches which are usually based on 4-input cuts.The experimental results show that, by adding the new rewritingalgorithm to ABC synthesis tool, we can further reduce the areaof heavily optimized large circuits by 5.57% on average.
Place, publisher, year, edition, pages
IEEE conference proceedings, 2011. 429-430 p.
Logic optimization, rewriting, NPN classes, cut enumeration, Boolean matching
IdentifiersURN: urn:nbn:se:kth:diva-49706DOI: 10.1109/ICCD.2011.6081434ISI: 000298257400068ScopusID: 2-s2.0-83455225361ISBN: 978-1-4577-1953-0OAI: oai:DiVA.org:kth-49706DiVA: diva2:460113
International Conference on Computer Design (ICCD)
Copyright 2011 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. QC 201201102012-01-112011-11-292012-04-04Bibliographically approved