Minimization of SOPs for Bi-Decomposable Functions and Non-Orthodox/Orthodox Functions

Abstract

Minimization is one of the most important issues in logical design. When we decide to develop a circuit to perform a certain task, one of the most important steps is to create this circuit with the minimum number of logical elements, since this reduces the cost, area and latency issues. However, minimization may require too much time, affecting the circuit's cost. There are many minimization tools. Each of them uses a different approach to solve the minimization problem. Considering the speed of the minimization process, those that split the functions into components and minimize each component separately yield the highest efficiency.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 2002
Accession Number
ADA403706

Entities

People

  • Birol Ulker

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Automata Theory
  • California
  • Computations
  • Computer Programming
  • Computer Programs
  • Computer Science
  • Computers
  • Converters
  • Decomposition
  • Electrical Engineering
  • Engineering
  • Language
  • Notation
  • Object Oriented Programming
  • Operating Systems
  • Schools

Fields of Study

  • Computer science

Readers

  • Integrated Circuit Design and Technology.
  • Operations Research