Record Details
Minimizing input logic for a sequential network
ScholarsArchive at Oregon State University
| Field | Value |
|---|---|
| Title | Minimizing input logic for a sequential network |
| Names |
Peng, Te-fu
(creator) Stone, Louis N. (advisor) |
| Date Issued | 1966-08-08 (iso8601) |
| Note | Graduation date: 1967 |
| Abstract | 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. |
| Genre | Thesis/Dissertation |
| Topic | Sequential machine theory |
| Identifier | http://hdl.handle.net/1957/47188 |
