Canonical and Minimal Forms for NAND and NOR Logic

Abstract

A method is described for deriving 2-level canonical expressions for NAND and for NOR logic using complemented and uncomplemented variables. Both expressions may be obtained directly from the truth table of the given Boolean function. It is also proven that the Quine-McCluskey minimization technique can be extended to minimize the proposed 2-level canonical expressions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1965
Accession Number
AD0628169

Entities

People

  • M. A. Marin
  • M. A. Melkanoff

Organizations

  • University of California, Los Angeles

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • California
  • Circuits
  • Classification
  • Commerce
  • Computer Programs
  • Computers
  • Contractors
  • Contracts
  • Energy
  • Engineering
  • Integrated Circuits
  • Military Research
  • Nuclear Energy
  • Security
  • Standards
  • Switching Circuits

Readers

  • Graph Algorithms and Convex Optimization.
  • Regression Analysis.