Efficient kernel generation based on implicit cube set representations and its applications

Hiroshi Sawada; Shigeru Yamashita; Akira Nagoya

Efficient kernel generation based on implicit cube set representations and its applications

Hiroshi Sawada, Shigeru Yamashita, Akira Nagoya

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	2513-2519
Number of pages	7
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E83-A
Issue number	12
Publication status	Published - Dec 1 2000
Externally published	Yes

ASJC Scopus subject areas

Signal Processing
Computer Graphics and Computer-Aided Design
Electrical and Electronic Engineering
Applied Mathematics

Cite this

@article{c9595420cb7f40c8995ab55b52e4ef3c,

title = "Efficient kernel generation based on implicit cube set representations and its applications",

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.",

author = "Hiroshi Sawada and Shigeru Yamashita and Akira Nagoya",

year = "2000",

month = dec,

day = "1",

language = "English",

volume = "E83-A",

pages = "2513--2519",

journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",

issn = "0916-8508",

publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",

number = "12",

}

TY - JOUR

T1 - Efficient kernel generation based on implicit cube set representations and its applications

AU - Sawada, Hiroshi

AU - Yamashita, Shigeru

AU - Nagoya, Akira

PY - 2000/12/1

Y1 - 2000/12/1

N2 - 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.

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.

UR - http://www.scopus.com/inward/record.url?scp=0034505760&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034505760&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034505760

SN - 0916-8508

VL - E83-A

SP - 2513

EP - 2519

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

IS - 12

ER -

Efficient kernel generation based on implicit cube set representations and its applications

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this