The Use of Searching Algorithms for the Minimization of Multi-Valued Logic Functions

Abstract

The goal of this thesis was to develop a searching algorithm for simplifying Multi-Valued Logic (MVL) functions. The algorithm was implemented as a program written in C for the UNIZ operating system. The algorithm accepts an MVL function in the format required by HAMLET, an MVL computer aided design tool, and produces a minimal or near-minimal realization. The output also conforms to that required by HAMLET to produce a layout of a programmable logic array (PLA) integrated circuit that realized the given function. The advantage of the algorithm is that it allows backtracking to investigate alternate solutions, producing a greater expectation of minimal results. It stops upon finding a solution, thus producing results much faster than an exhaustive search of all possible solutions.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1990
Accession Number
ADA238018

Entities

People

  • Alan W. Watts

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Energy and Power Technologies
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Circuits
  • Computer Programs
  • Computer Science
  • Computer-Aided Design
  • Computers
  • Electrical Engineering
  • Electronics
  • Engineering
  • Information Processing
  • Information Science
  • Integrated Circuits
  • Operating Systems
  • Trees (Data Structures)
  • United States
  • Very Large Scale Integration

Readers

  • Computational Modeling and Simulation
  • Computer Programming and Software Development.