A Heuristic Algorithm for Boolean Factoring

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, an algorithm for Boolean factoring is presented. The algorithm is based on a technique of rectangle covering. A distinctive feature of the algorithm is that no minimization step is required to achieve Boolean factoring. The method for computing Boolean products rests on the concepts of super-product, extended kernel and extended co-kernel-cube matrix. Results of a comparison with the algorithms GOOD_FACTOR and QUICK_FACTOR implemented in SIS are presented. SIS is a program for logic synthesis developed at the University of Berkeley. All performed tests indicated that the proposed algorithm realizes a good tradeoff between factoring quality and computing time.

• 社団法人電子情報通信学会の論文
• 1998-10-25

著者

• Caruso Giuseppe

  Dipartimento Di Ingegneria Elettrica Elettronica E Delle Telecomunicazioni Universita Di Palermo

• Caruso Giuseppe

  Dipartimento Di Ingegneria Elettrica Universita Di Palermo Viale Delle Scienze

関連論文

• A Methodology for the Design of MOS Current-Mode Logic Circuits
• An Algorithm for Exact Extended Algebraic Division
• A Local Cover Technique for the Minimization of Multiple-Valued Input Binary-Valued Output Functions
• A Heuristic Algorithm for Boolean Factoring

スポンサーリンク