Minimizing input logic for a sequential network Public Deposited

http://ir.library.oregonstate.edu/concern/graduate_thesis_or_dissertations/qj72pb86x

Descriptions

Attribute NameValues
Creator
Abstract or Summary
  • A complete procedure of minimizing input logic in designing both completely and incompletely specified synchronous, finite state sequential networks is presented in detail. This procedure consists of three important steps: 1) state simplification, 2) state assignment and 3) input logic realization. Two new ideas are presented in the procedure of minimizing internal states. First, the number in the minimal final class which is chosen from the final class is used as the lower bound of a minimal closed set. Second, the minimal closed set is found by means of the implication graph. The implication graph is also used to find a partition with a substitution property for given internal states in state assignment. This partition always leads to an economical state assignment. Useful and important principles are developed for deriving the input logic set for any type of flipflop. The results provided a much simpler and faster way to derive the input logic than do analytic methods.
Resource Type
Date Available
Date Copyright
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Advisor
Academic Affiliation
Non-Academic Affiliation
Subject
Rights Statement
Peer Reviewed
Language
Digitization Specifications
  • File scanned at 300 ppi using Capture Perfect 3.0 on a Canon DR-9050C in PDF format. CVista PdfCompressor 5.0 was used for pdf compression and textual OCR.
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2014-04-09T17:43:56Z (GMT). No. of bitstreams: 1 PengTe-Fu1967_Redacted.pdf: 1111504 bytes, checksum: 617814fd297b69b8c6863cd9d0f25b38 (MD5) Previous issue date: 1966-08-08
  • description.provenance : Approved for entry into archive by Patricia Black(patricia.black@oregonstate.edu) on 2014-04-03T21:14:29Z (GMT) No. of bitstreams: 1 PengTe-Fu1967_Redacted.pdf: 1111504 bytes, checksum: 617814fd297b69b8c6863cd9d0f25b38 (MD5)
  • description.provenance : Approved for entry into archive by Katy Davis(kdscannerosu@gmail.com) on 2014-04-09T17:43:56Z (GMT) No. of bitstreams: 1 PengTe-Fu1967_Redacted.pdf: 1111504 bytes, checksum: 617814fd297b69b8c6863cd9d0f25b38 (MD5)
  • description.provenance : Submitted by Alex McFerrin (amscannerosu@gmail.com) on 2014-04-03T20:44:21Z No. of bitstreams: 1 PengTe-Fu1967_Redacted.pdf: 1111504 bytes, checksum: 617814fd297b69b8c6863cd9d0f25b38 (MD5)

Relationships

In Administrative Set:
Last modified: 08/17/2017

Downloadable Content

Download PDF
Citations:

EndNote | Zotero | Mendeley

Items