New methods to find optimal non-disjoint bi-decompositions

Shigeru Yamashita, Hiroshi Sawada, Akira Nagoya

Research output: Chapter in Book/Report/Conference proceedingChapter

15 Citations (Scopus)

Abstract

This paper presents new efficient methods to find `optimal bi-decomposition' forms of logic functions. An `optimal bi-decomposition' form of f(X) is f = α(g1(X1), g2(X2)) where the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. We consider two methods; one's decomposition form is (g1·g2) and the other's is (g1⊕g2). The proposed methods can find one of the existing `optimal' decomposition forms efficiently based on the Branch-and-Bound algorithm. These methods can decompose incompletely specified functions. Preliminary experimental results show that the proposed methods can construct networks with fewer levels than conventional methods.

Original languageEnglish
Title of host publicationProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
PublisherIEEE
Pages59-68
Number of pages10
Publication statusPublished - 1998
Externally publishedYes
EventProceedings of the 1998 3rd Conference of the Asia and South Pacific Design Automation (ASP-DAC '98) - Yokohama, Jpn
Duration: Feb 10 1998Feb 13 1998

Other

OtherProceedings of the 1998 3rd Conference of the Asia and South Pacific Design Automation (ASP-DAC '98)
CityYokohama, Jpn
Period2/10/982/13/98

Fingerprint

Decomposition

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Yamashita, S., Sawada, H., & Nagoya, A. (1998). New methods to find optimal non-disjoint bi-decompositions. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 59-68). IEEE.

New methods to find optimal non-disjoint bi-decompositions. / Yamashita, Shigeru; Sawada, Hiroshi; Nagoya, Akira.

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE, 1998. p. 59-68.

Research output: Chapter in Book/Report/Conference proceedingChapter

Yamashita, S, Sawada, H & Nagoya, A 1998, New methods to find optimal non-disjoint bi-decompositions. in Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE, pp. 59-68, Proceedings of the 1998 3rd Conference of the Asia and South Pacific Design Automation (ASP-DAC '98), Yokohama, Jpn, 2/10/98.
Yamashita S, Sawada H, Nagoya A. New methods to find optimal non-disjoint bi-decompositions. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE. 1998. p. 59-68
Yamashita, Shigeru ; Sawada, Hiroshi ; Nagoya, Akira. / New methods to find optimal non-disjoint bi-decompositions. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. IEEE, 1998. pp. 59-68
@inbook{71f749b969254f22a5e5e1fcf5ded5c1,
title = "New methods to find optimal non-disjoint bi-decompositions",
abstract = "This paper presents new efficient methods to find `optimal bi-decomposition' forms of logic functions. An `optimal bi-decomposition' form of f(X) is f = α(g1(X1), g2(X2)) where the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. We consider two methods; one's decomposition form is (g1·g2) and the other's is (g1⊕g2). The proposed methods can find one of the existing `optimal' decomposition forms efficiently based on the Branch-and-Bound algorithm. These methods can decompose incompletely specified functions. Preliminary experimental results show that the proposed methods can construct networks with fewer levels than conventional methods.",
author = "Shigeru Yamashita and Hiroshi Sawada and Akira Nagoya",
year = "1998",
language = "English",
pages = "59--68",
booktitle = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",
publisher = "IEEE",

}

TY - CHAP

T1 - New methods to find optimal non-disjoint bi-decompositions

AU - Yamashita, Shigeru

AU - Sawada, Hiroshi

AU - Nagoya, Akira

PY - 1998

Y1 - 1998

N2 - This paper presents new efficient methods to find `optimal bi-decomposition' forms of logic functions. An `optimal bi-decomposition' form of f(X) is f = α(g1(X1), g2(X2)) where the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. We consider two methods; one's decomposition form is (g1·g2) and the other's is (g1⊕g2). The proposed methods can find one of the existing `optimal' decomposition forms efficiently based on the Branch-and-Bound algorithm. These methods can decompose incompletely specified functions. Preliminary experimental results show that the proposed methods can construct networks with fewer levels than conventional methods.

AB - This paper presents new efficient methods to find `optimal bi-decomposition' forms of logic functions. An `optimal bi-decomposition' form of f(X) is f = α(g1(X1), g2(X2)) where the total number of variables in X1 and X2 is the smallest among all bi-decomposition forms of f. We consider two methods; one's decomposition form is (g1·g2) and the other's is (g1⊕g2). The proposed methods can find one of the existing `optimal' decomposition forms efficiently based on the Branch-and-Bound algorithm. These methods can decompose incompletely specified functions. Preliminary experimental results show that the proposed methods can construct networks with fewer levels than conventional methods.

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

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

M3 - Chapter

AN - SCOPUS:0032218703

SP - 59

EP - 68

BT - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

PB - IEEE

ER -