Logic Synthesis Primer Alan Mishchenko UC Berkeley

Outline Introduction to logic synthesis Goals Exact vs. heuristic Sequential vs. combinational Technology-independent synthesis Optimization for area and delay Mapping Standard cells, LUTs, macro-cells Verification Conclusion

Goals of Synthesis Generating good circuit structure from Truth tables, BDDs Irredundant sums-of-products (used in strash) Boolean decomposition (bidec) Converting decision trees into MUX circuits (muxes) Sums-of-products Factoring (used in strash) Kernel extraction (not implemented in ABC) fast_extract algorithm (command fx) Improving available circuit structure Technology-independent synthesis

Technology Independent Synthesis AIG rewriting for area Scripts drwsat, compress2rs AIG rewriting for delay Scripts dc2, resyn2 Scripts &syn2, &synch2 High-effort delay optimization Perform SOP balancing (st; if –g –K 6) Follow up with area-recovery (resyn2) and technology mapping (map, amap, if) Iterate, if needed

Exact Synthesis Exact synthesis attempts to minimize the number of logic gates / logic levels needed to implement a given function Minimum solutions are known only for simple circuits, or circuits with special properties Minimum solutions are often not unique A new approach to synthesis is being developed, which uses pre-computed minimum solutions for practical functions up to 16 inputs to construct good (but not minimum) solutions for larger circuits See recent IWLS’14 paper for details

Sequential Synthesis Uses reachable state information to further improve the quality of results Reachable states are often approximated Types of AIG-based sequential synthesis Retiming (retime, dretime, etc) Detecting and merging sequentrial equivalences (lcorr, scorr, &scorr, etc) Negative experiences Sequential redundancy removal is often hard Using sequential don’t-cares in combinational synthesis typically gives very small improvement

Logic Synthesis for PLAs Enter PLA (.type fd) into ABC using read Perform logic sharing extraction using fx If fx is complaining that individual covers are not prime and irredundant, try “bdd; sop; fx” After fx, convert shared logic into AIG and continue AIG-based synthesis and mapping Consider using high-effort synthesis with don’t-cares First map into 6-LUTs (if –K 6; ps), optimize (mfs2), synthesize with choices (st; dch) and map into 6-LUTs (if –K 6; ps) Iterate until no improvement, then remap into target technology To find description of PLA format, google for “Espresso PLA format”, for example: http://www.ecs.umass.edu/ece/labs/vlsicad/ece667/links/espresso.5.html

Technology Mapping for SCs Read library using read_genlib (for libraries in GENLIB format) read_liberty (for libraries in Liberty format) For standard-cells map: Boolean matching, delay-oriented, cells up to 5 inputs amap: structural mapping, area-oriented, cells up to 15 inputs If Liberty library is used, run topo followed by stime (accurate timing analysis) buffer (buffering) upsize; dnsize (gate sizing) Structural choices are an important way of improving mapping (both area and delay) Run “st; dch” before calling map or amap

Technology Mapping for LUTs It is suggested to use mapper if –K <num> For area-oriented mapping, try “if -a” For delay-oriented mapping, try delay-oriented AIG-based synthesis with structural choices Structural choices are an important way of improving mapping (both area and delay) Run “st; dch” before calling if

Technology Mapping for Macrocells Custom mapping options LUT structures composed of two or three LUTs if –S <XYZ> User-defined macro-cells up to 16 inputs, composed of LUTs, MUXes, and standard-cells Under development Minimizing circuit parameters number of factored-form literals (renode) number of cubes (renode –s) number of BDD nodes (renode –b) number of CNF clauses (write_cnf) As usual, structural choices can help

Verification Verification and synthesis are closely related and should be co-developed Combinational verification “r <file1>; cec <file2>” (small/medium circuits) “&r <file1.aig>; &cec <file2.aig> (large circuits) Sequential verification “r <file1>; dsec <file2>” Running cec or dsec any time during a synthesis flow compares the current version with the spec The spec is the circuit obtained from the original file

Future Work Improve usability of ABC Develop mapping for user-specified macro-cells Develop more scalable technology-dependent synthesis

Conclusion Reviewed logic synthesis Proposed ABC commands for Technology-independent synthesis Technology mapping Formal verification Discussed future developments

Assignment: Using ABC Using BLIF manual http://www.eecs.berkeley.edu/~alanmi/publications/other/blif.pdf create a BLIF file representing a full-adder Perform the following sequence: read the file into ABC (command "read") check statistics (command "print_stats") visualize the network structure (command "show“) convert to AIG (command "strash") visualize the AIG (command "show") convert to BDD (command "collapse") visualize the BDD (command "show_bdd")

Assignment: Programming ABC Write a procedure in ABC environment to iterate over the objects of the network and list each object ID number and type on a separate line. Integrate this procedure into ABC, so that running command "test" would invoke your code, and print the result. Compare the print-out of the new command "test" with the result of command "show" for the full-adder example above Comment 1: For commands "show" and "show_bdd" to work, please download the binary of software "dot" from GraphVis webpage and put it in the same directory as the ABC binary or anywhere else in the path: http://www.graphviz.org Comment 2: Make sure GSview is installed on your computer. http://pages.cs.wisc.edu/~ghost/gsview/

Programming Help Example of code to iterate over the objects void Abc_NtkCleanCopy( Abc_Ntk_t * pNtk ) { Abc_Obj_t * pObj; int i; Abc_NtkForEachObj( pNtk, pObj, i ) pObj->pCopy = NULL; } Example of code to create new command “test” Call the new procedure (say, Abc_NtkPrintObjs) from Abc_CommandTest() in file “abc\src\base\abci\abc.c” Abc_NtkPrintObjs( pNtk );

ABC Resources A tutorial can be found here: Windows binary R. Brayton and A. Mishchenko, "ABC: An academic industrial-strength verification tool", Proc. CAV'10, Springer, LNCS 6174, pp. 24-40. http://www.eecs.berkeley.edu/~alanmi/publications/2010/cav10_abc.pdf Windows binary http://www.eecs.berkeley.edu/~alanmi/abc/abc.exe http://www.eecs.berkeley.edu/~alanmi/abc/abc.rc Complete source code https://bitbucket.org/alanmi/abc/downloads