An Algorithm for Exact Extended Algebraic Division

スポンサーリンク

概要

• 論文の詳細を見る

• Mothods usually employed for carrying out. Division in logic arc based on algebraic or Boolean techniques. Algebraic division is fast but results may be less than optimal. Boolean division will yield better results but generally it is much slower because a minimization step is required. In [4], Kim and Dietmeyer proposed a new type of division, called extended algebraic division, and described a heuristic algorithm for it. A feature is that, unlike Boolean division, it does not require a minimization step. The present paper is concerned with an efficient algorithm for exact extended algebraic division. The algorithm was developed within the SIS environment, a program for logic synthesis developed at U.C. Berkeley. Experiments on factoring PLA's demonstrate a significant improvement in quality with a reasonable increase in run time.

• 社団法人電子情報通信学会の論文
• 2003-02-01

著者

• Caruso Giuseppe

  Dipartimento Di Ingegneria Elettrica Elettronica E Delle Telecomunicazioni Universita Di Palermo

• CARUSO Giuseppe

  Dipartimento di Ingegneria Elettrica,Universita di Palermo

関連論文

• 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

スポンサーリンク