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
Cet article présente une nouvelle méthode qui génère efficacement tous les noyaux d’une expression de somme de produits. Sa principale caractéristique est la mémorisation du processus de génération du noyau en utilisant une structure graphique et des représentations implicites d'ensembles de cubes. Nous montrons également ses applications pour l’extraction de logique commune. Notre méthode d'extraction produit des circuits plus petits grâce à plusieurs extensions que la méthode d'extraction basée sur des diviseurs à deux cubes connue comme la meilleure de tous les temps.
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.
Copier
Hiroshi SAWADA, Shigeru YAMASHITA, Akira NAGOYA, "Efficient Kernel Generation Based on Implicit Cube Set Representations and Its Applications" in IEICE TRANSACTIONS on Fundamentals,
vol. E83-A, no. 12, pp. 2513-2519, December 2000, doi: .
Abstract: This paper presents a new method that efficiently generates all of the kernels of a sum-of-products expression. Its main feature is the memorization of the kernel generation process by using a graph structure and implicit cube set representations. We also show its applications for common logic extraction. Our extraction method produces smaller circuits through several extensions than the extraction method based on two-cube divisors known as best ever.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e83-a_12_2513/_p
Copier
@ARTICLE{e83-a_12_2513,
author={Hiroshi SAWADA, Shigeru YAMASHITA, Akira NAGOYA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Kernel Generation Based on Implicit Cube Set Representations and Its Applications},
year={2000},
volume={E83-A},
number={12},
pages={2513-2519},
abstract={This paper presents a new method that efficiently generates all of the kernels of a sum-of-products expression. Its main feature is the memorization of the kernel generation process by using a graph structure and implicit cube set representations. We also show its applications for common logic extraction. Our extraction method produces smaller circuits through several extensions than the extraction method based on two-cube divisors known as best ever.},
keywords={},
doi={},
ISSN={},
month={December},}
Copier
TY - JOUR
TI - Efficient Kernel Generation Based on Implicit Cube Set Representations and Its Applications
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2513
EP - 2519
AU - Hiroshi SAWADA
AU - Shigeru YAMASHITA
AU - Akira NAGOYA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E83-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2000
AB - This paper presents a new method that efficiently generates all of the kernels of a sum-of-products expression. Its main feature is the memorization of the kernel generation process by using a graph structure and implicit cube set representations. We also show its applications for common logic extraction. Our extraction method produces smaller circuits through several extensions than the extraction method based on two-cube divisors known as best ever.
ER -