DAG based library-free technology mapping

This paper proposes a library-free technology mapping algorithm to reduce delay in combinational circuits. The algorithm reduces the overall number of series transistors through the longest path, considering that each cell network has to obey to a maximum admitted chain. The number of series transistors is computed in a Boolean way, reducing the structural bias. The mapping algorithm is performed on a Directed Acyclic Graph (DAG) description of the circuit. Preliminary results for delay were obtained through SPICE simulations. When compared to the SIS technology mapping, the proposed method shows significant delay reductions, considering circuits mapped with different libraries. Categories and Subject Descriptors B.6.3 [Logic Design]: Design Aids – automatic synthesis, optimization. General Terms Algorithms, Performance, Design, Experimentation, Theory. Keywords Logic Synthesis, Switching Theory, Technology Mapping, Library Free Synthesis, Virtual Libraries.

• Type: Conference
• Year: 2007
• Where: GLVLSI
• Authors: Felipe S. Marques, Leomar S. da Rosa Jr., Renato P. Ribas, Sachin S. Sapatnekar, André Inácio Reis
• Keywords: GLVLSI 2007, Mapping Algorithm, Series Transistors, Technology Mapping Algorithm, VLSI