MINIMIZING OF INCOMPLETELY SPECIFIED SEQUENTIAL SWITCHING CIRCUITS
Abstract
Given a low-table of a sequential switching function which is not completely specified, a method for reducing the number of states in the flow-table is developed. The method eliminates the need to find all the maximal compatibles in order to get the simplest flow-table, and it simplifies the technique of finding the maximal compatibles. A graphical method is developed to simplify the search for the compatibles that will give a simple flow-table. Even though this method was developed for incompletely specified sequential switching functions, it can be applied to completely specified sequential functions, where it simplifies the technique of reducing the number of states in the flow-table. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 10, 1962
- Accession Number
- AD0286174
Entities
People
- Zvi Kohavi
Organizations
- New York University Tandon School of Engineering