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 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 - 1998 |
| Externally published | Yes |
Fingerprint
Keywords
- AND
- Bi-decomposition
- Functional decomposition
- Look-up table
- XOR
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Hardware and Architecture
- Information Systems
Cite this
Yamashita, S., Sawada, H., & Nagoya, A. (1998). An efficient method for finding an optimal bi-decomposition. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E81-A(12), 2529-2537.