Graduate Thesis Or Dissertation
 

Multiple-output combinational network minimization

Public Deposited
default representative image
https://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/8623j198n

Descriptions

Attribute NameValues
Creator
Abstract
  • An important step in the design of digital networks lies in the derivation of the switching formulas which describe the combinational logic networks in the system. In most large systems the number of gates and the number of connections are major factors that affect the cost of the system. An algorithm MOMIN which minimizes these two factors according to a selected cost function in two- level, multiple-output combinational logic networks is presented in this thesis. Attempts have been made to solve the problem in two aspects: (1) Minimal solution, (2) subminimal solution. (2) is described in detail and (1) is implemented. A computer program MOMIN implemented in FORTRAN has been prepared which automatically derives a set of minimal cost switching expressions describing the given multiple-output combinational logic network.
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Publisher
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi (Monochrome) using Capture Perfect 3.0.82 on a Canon DR-9080C in PDF format. CVista PdfCompressor 4.0 was used for pdf compression and textual OCR.
Replaces

Relationships

Parents:

This work has no parents.

In Collection:

Items

Thumbnail Title Date Uploaded Visibility Actions
file details LinPeiChen1980.pdf 08/17/2017 Public
file details LinPeiChenFicheappendices1980.pdf 08/17/2017 Public