The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Penguraian disjungtif mudah ialah kes khas penguraian fungsi logik, di mana pembolehubah dibahagikan kepada dua set bercapah dan hanya terdapat satu pembolehubah yang baru diperkenalkan. Ia menawarkan struktur optimum untuk fungsi output tunggal. Kertas kerja ini membentangkan dua teknik yang membolehkan kita menggunakan penguraian disjungtif mudah dengan sedikit overhed. Pertama, kami mencadangkan kaedah untuk mencari bentuk penguraian disjungtif simple dengan cekap dengan mengehadkan jenis penguraian untuk ditemui kepada dua: penguraian dengan set terikat ialah set pembolehubah simetri dan penguraian dengan fungsi output ialah fungsi 2-input. Kedua, kami mencadangkan algoritma yang membina perwakilan logik baharu untuk penguraian disjungtif mudah hanya dengan memberikan nilai malar kepada pembolehubah dalam perwakilan asal. Algoritma ini membolehkan kami menggunakan penguraian dengan mengekalkan struktur yang baik bagi perwakilan asal. Kami melakukan eksperimen untuk fungsi penguraian dan mengesahkan kecekapan kaedah kami. Kami juga melakukan eksperimen untuk menstruktur semula kon bebas fanout bagi litar logik pelbagai peringkat, dan memperoleh keputusan yang lebih baik daripada apabila tidak menstrukturkannya semula.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Hiroshi SAWADA, Shigeru YAMASHITA, Akira NAGOYA, "Restructuring Logic Representations with Simple Disjunctive Decompositions" in IEICE TRANSACTIONS on Fundamentals,
vol. E81-A, no. 12, pp. 2538-2544, December 1998, doi: .
Abstract: Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced variable. It offers an optimal structure for a single-output function. This paper presents two techniques that enable us to apply simple disjunctive decompositions with little overhead. Firstly, we propose a method to find symple disjunctive decomposition forms efficiently by limiting decomposition types to be found to two: a decomposition where the bound set is a set of symmetric variables and a decomposition where the output function is a 2-input function. Secondly, we propose an algorithm that constructs a new logic representation for a simple disjunctive decomposition just by assigning constant values to variables in the original representation. The algorithm enables us to apply the decomposition with keeping good structures of the original representation. We performed experiments for decomposing functions and confirmed the efficiency of our method. We also performed experiments for restructuring fanout free cones of multi-level logic circuits, and obtained better results than when not restructuring them.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_12_2538/_p
Salinan
@ARTICLE{e81-a_12_2538,
author={Hiroshi SAWADA, Shigeru YAMASHITA, Akira NAGOYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Restructuring Logic Representations with Simple Disjunctive Decompositions},
year={1998},
volume={E81-A},
number={12},
pages={2538-2544},
abstract={Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced variable. It offers an optimal structure for a single-output function. This paper presents two techniques that enable us to apply simple disjunctive decompositions with little overhead. Firstly, we propose a method to find symple disjunctive decomposition forms efficiently by limiting decomposition types to be found to two: a decomposition where the bound set is a set of symmetric variables and a decomposition where the output function is a 2-input function. Secondly, we propose an algorithm that constructs a new logic representation for a simple disjunctive decomposition just by assigning constant values to variables in the original representation. The algorithm enables us to apply the decomposition with keeping good structures of the original representation. We performed experiments for decomposing functions and confirmed the efficiency of our method. We also performed experiments for restructuring fanout free cones of multi-level logic circuits, and obtained better results than when not restructuring them.},
keywords={},
doi={},
ISSN={},
month={December},}
Salinan
TY - JOUR
TI - Restructuring Logic Representations with Simple Disjunctive Decompositions
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2538
EP - 2544
AU - Hiroshi SAWADA
AU - Shigeru YAMASHITA
AU - Akira NAGOYA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1998
AB - Simple disjunctive decomposition is a special case of logic function decompositions, where variables are divided into two disjoint sets and there is only one newly introduced variable. It offers an optimal structure for a single-output function. This paper presents two techniques that enable us to apply simple disjunctive decompositions with little overhead. Firstly, we propose a method to find symple disjunctive decomposition forms efficiently by limiting decomposition types to be found to two: a decomposition where the bound set is a set of symmetric variables and a decomposition where the output function is a 2-input function. Secondly, we propose an algorithm that constructs a new logic representation for a simple disjunctive decomposition just by assigning constant values to variables in the original representation. The algorithm enables us to apply the decomposition with keeping good structures of the original representation. We performed experiments for decomposing functions and confirmed the efficiency of our method. We also performed experiments for restructuring fanout free cones of multi-level logic circuits, and obtained better results than when not restructuring them.
ER -