• DocumentCode
    2073126
  • Title

    MIXSyn: An efficient logic synthesis methodology for mixed XOR-AND/OR dominated circuits

  • Author

    Amaru, Luca ; Gaillardon, Pierre-Emmanuel ; De Micheli, G.

  • Author_Institution
    Integrated Syst. Lab. (LSI), EPFL, Lausanne, Switzerland
  • fYear
    2013
  • fDate
    22-25 Jan. 2013
  • Firstpage
    133
  • Lastpage
    138
  • Abstract
    We present a new logic synthesis methodology, called MIXSyn, that produces area-efficient results for mixed XOR-AND/OR dominated logic functions. MIXSyn is a two step synthesis process. The first step is a hybrid logic optimization that enables selective and distinct optimization of AND/OR and XOR-intensive portions of the logic circuit. The second step is a library-free technology mapping that enhances design flexibility with a tractable computational cost. MIXSyn has been tested on a set of large MCNC benchmarks. Experimental results indicate that MIXSyn produces CMOS circuits with 18.0% and 9.2% fewer devices, on the average, with respect to state-of-art academic and commercial synthesis tools, respectively. MIXSyn is also capable to exploit the opportunity of novel XOR implementations offered by the use of double-gate ambipolar devices. Experimental results show that MIXSyn can reduce the number of ambipolar transistors by 20.9% and 15.3%, on the average, with respect to state-of-art academic and commercial synthesis tools, respectively.
  • Keywords
    logic circuits; logic design; optimisation; MIXSyn; distinct optimization; hybrid logic optimization; library-free technology mapping; logic functions; logic synthesis methodology; mixed XOR-AND/OR dominated circuits; state-of-art academic and commercial synthesis tools; Benchmark testing; CMOS integrated circuits; CMOS technology; Logic gates; Optimization; Transistors; Vegetation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Design Automation Conference (ASP-DAC), 2013 18th Asia and South Pacific
  • Conference_Location
    Yokohama
  • ISSN
    2153-6961
  • Print_ISBN
    978-1-4673-3029-9
  • Type

    conf

  • DOI
    10.1109/ASPDAC.2013.6509585
  • Filename
    6509585