AIG Rewriting Using 5-Input Cuts
Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesis
Rewriting is a common approach to logic optimization based on local transformations. Most commercially available logic synthesis tools include a rewriting engine that may be used multiple times on the same netlist during optimization. This thesis presents an And-Inverter graph based rewriting algorithm using 5-input cuts. The best circuits are pre-computed for a subset of NPN classes of 5-variable functions.
Cut enumeration and Boolean matching are used to identify replacement candidates. The presented approach is expected to complement existing rewriting approaches which are usually based on 4-input cuts. The experimental results show that, by adding the new rewriting algorithm to ABC synthesis tool, we can further reduce the area of heavily optimized large circuits by 5.57% on average.
Place, publisher, year, edition, pages
2011. , 28 p.
IdentifiersURN: urn:nbn:se:kth:diva-37227OAI: oai:DiVA.org:kth-37227DiVA: diva2:432722
Subject / course
Electronic- and Computer Systems
Master of Science - System-on-Chip Design
Dubrova, Elena, Professor