On Bi-Decompositions of Logic Functions

Abstract

A logic function f has a disjoint bi-decomposition iff f can be represented as f = h(g1(X1); g2(X2)), where X1 and X2 are disjoint set of variables, and h is an arbitrary two-variable logic fuction. f has a non-disjoint bidecomposition i f can be represented as f(X1;X2; x) = h(g1(X1; x); g2(X2; x)), where x is the common variable. In this paper, we show a fast method to find bidecompositions. Also, we enumerate the number of functions having bidecompositions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1997
Accession Number
ADA593005

Entities

People

  • Jon T. Butler
  • Tsutomu Sasao

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Advanced Electronics

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Computations
  • Computer Science
  • Computers
  • Decomposition
  • Engineering
  • Information Operations
  • Logic
  • Logic Devices
  • Logic Elements
  • Standards

Fields of Study

  • Mathematics

Readers

  • Computer Programming and Software Development.
  • Graph Algorithms and Convex Optimization.