MINIMAL SYNTHESIS OF THE WYE-FORM TWO-OUTPUT SWITCHING NETWORK

Abstract

The problem treated is the simultaneous minimization of three Boolean functions X, Y, and Z such that if F1 and F2 are any two given Boolean functions we have F1 = XY and F2 = XZ. In switchingcircuit terminology the problem consists of synthesizing a minimal wye (Y) network to realize two arbitrary switching functions. By reducing the given two-output problem to an equivalent single-output problem, the required minimal synthesis procedure is found for the case where each of the functions X, Y, and Z is restricted to be of the product-of-sums form. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1961
Accession Number
AD0255842

Entities

People

  • S.r. Petrick

Organizations

  • Air Force Cambridge Research Laboratories

Tags

DTIC Thesaurus Topics

  • Complex Variables
  • Functions (Mathematics)
  • Mathematical Analysis
  • Mathematics
  • Switching

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Analytical Mechanics
  • Graph Algorithms and Convex Optimization.