Programmed state assignment algorithms for asynchronous sequential machines.

Author

Wayne L. Schoeffel

Abstract

"An important step in the synthesis procedure for realizing a normal fundamental mode asynchronous sequential circuit is the internal state assignment. Although systematic methods have been developed to construct minimum-transition-time state assignments, they become long and tedious with hand methods for machines with more than 7 or 8 internal states. To extend the application of these algorithms to larger problems, this paper presents an efficient digital computer program for generating minimum-variable state assignments. An alternate program is also presented which, though shorter, does not guarantee a minimum-variable assignment"--Abstract, page ii.

Advisor(s)

Tracey, James H.

Committee Member(s)

Bertnolli, Edward C.
Johnson, Charles A.
Gillett, Billy E.

Department(s)

Electrical and Computer Engineering

Degree Name

M.S. in Electrical Engineering

Publisher

University of Missouri at Rolla

Publication Date

1967

Pagination

v, 66 pages

Rights

© 1967 Wayne L. Schoeffel, All rights reserved.

Document Type

Thesis - Open Access

File Type

text

Language

English

Subject Headings

Asynchronous circuits -- Computer-aided designElectronic circuit designSequential circuits

Thesis Number

T 2040

Print OCLC #

5988122

Electronic OCLC #

781291628

Recommended Citation

Schoeffel, Wayne L., "Programmed state assignment algorithms for asynchronous sequential machines." (1967). Masters Theses. 5040.
https://scholarsmine.mst.edu/masters_theses/5040