An efficient method for finding an optimal bi-decomposition

Shigeru Yamashita; Hiroshi Sawada; Akira Nagoya

An efficient method for finding an optimal bi-decomposition

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

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

Abstract

This paper presents a new efficient method for finding an optimal bi-decomposition form of a logic function. A bi-decomposition form of a logic function is the form: f(X) = α(g1(X¹),g2(X²)). We call a bi-decomposition form optimal when the total number of variables in X¹ and X² is the smallest among all bi-decomposition forms of f. This meaning of optimal is adequate especially for the synthesis of LUT (Look-Up Table) networks where the number of function inputs is important for the implementation. In our method, we consider only two bi-decomposition forms; (g₁ · g₂) and (g₁

Original language	English
Pages (from-to)	2529-2537
Number of pages	9
Journal	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume	E81-A
Issue number	12
Publication status	Published - Jan 1 1998
Externally published	Yes

Keywords

AND
Bi-decomposition
Functional decomposition
Look-up table
XOR

ASJC Scopus subject areas

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

Fingerprint Dive into the research topics of 'An efficient method for finding an optimal bi-decomposition'. Together they form a unique fingerprint.

Cite this

@article{8dfb23f70a1d49be9f66f9437f4d1566,

title = "An efficient method for finding an optimal bi-decomposition",

abstract = "This paper presents a new efficient method for finding an optimal bi-decomposition form of a logic function. A bi-decomposition form of a logic function is the form: f(X) = α(g1(X1),g2(X2)). We call a bi-decomposition form optimal when the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. This meaning of optimal is adequate especially for the synthesis of LUT (Look-Up Table) networks where the number of function inputs is important for the implementation. In our method, we consider only two bi-decomposition forms; (g1 · g2) and (g1",

keywords = "AND, Bi-decomposition, Functional decomposition, Look-up table, XOR",

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

year = "1998",

month = jan,

day = "1",

language = "English",

volume = "E81-A",

pages = "2529--2537",

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 - An efficient method for finding an optimal bi-decomposition

AU - Yamashita, Shigeru

AU - Sawada, Hiroshi

AU - Nagoya, Akira

PY - 1998/1/1

Y1 - 1998/1/1

N2 - This paper presents a new efficient method for finding an optimal bi-decomposition form of a logic function. A bi-decomposition form of a logic function is the form: f(X) = α(g1(X1),g2(X2)). We call a bi-decomposition form optimal when the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. This meaning of optimal is adequate especially for the synthesis of LUT (Look-Up Table) networks where the number of function inputs is important for the implementation. In our method, we consider only two bi-decomposition forms; (g1 · g2) and (g1

AB - This paper presents a new efficient method for finding an optimal bi-decomposition form of a logic function. A bi-decomposition form of a logic function is the form: f(X) = α(g1(X1),g2(X2)). We call a bi-decomposition form optimal when the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. This meaning of optimal is adequate especially for the synthesis of LUT (Look-Up Table) networks where the number of function inputs is important for the implementation. In our method, we consider only two bi-decomposition forms; (g1 · g2) and (g1

KW - AND

KW - Bi-decomposition

KW - Functional decomposition

KW - Look-up table

KW - XOR

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

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

M3 - Article

AN - SCOPUS:0032308380

VL - E81-A

SP - 2529

EP - 2537

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

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

SN - 0916-8508

IS - 12

ER -