首页    期刊浏览 2024年11月10日 星期日
登录注册

文章基本信息

  • 标题:Complexity reduction of Toffoli networks based on FDD
  • 本地全文:下载
  • 作者:Stojković Suzana ; Stanković Milena ; Moraga Claudio
  • 期刊名称:Facta universitatis - series: Electronics and Energetics
  • 印刷版ISSN:0353-3670
  • 电子版ISSN:2217-5997
  • 出版年度:2015
  • 卷号:28
  • 期号:2
  • 页码:251-262
  • DOI:10.2298/FUEE1502251S
  • 出版社:University of Niš
  • 摘要:

    Synthesis of switching functions by Toffoli gates has become a very important research topic in the last years, since Toffoli gates are used in the synthesis of reversible circuits. Early methods based on the truth-table representation of Boolean functions are applicable to functions with a relatively small number of variables. Later on, methods for synthesis by Toffoli gates based on decision diagrams (BDDs, FDDs or OKFDDs) were introduced and applied to the synthesis of both reversible and irreversible functions. This paper presents a method for the reduction of the number of lines and gates in the Toffoli gate realization of Boolean functions based on their Functional Decision Diagram (FDD) representation. Experiments show that, when the proposed reduction is used, the realization of the given function based on FDD will, on the average, be smaller in terms of the number of lines and the number of gates than the realizations based on an OKFDD, an optimal BDD or based on a FDD by using previously defined algorithms.

  • 关键词:Switching functions synthesis; Toffoli gates; Binary Decision Diagrams; Functional Decision Diagrams
国家哲学社会科学文献中心版权所有