An efficient method for finding an optimal bi-decomposition

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

Research output: Contribution to journalArticle

2 Citations (Scopus)

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

Original languageEnglish
Pages (from-to)2529-2537
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE81-A
Issue number12
Publication statusPublished - Jan 1 1998
Externally publishedYes

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