State Assignment Technique for Synchronous Sequential Networks
Author | : Stanford University. Stanford Electronics Laboratories |
Publisher | : |
Total Pages | : 44 |
Release | : 1961 |
ISBN-10 | : STANFORD:36105046371147 |
ISBN-13 | : |
Rating | : 4/5 (47 Downloads) |
Download or read book State Assignment Technique for Synchronous Sequential Networks written by Stanford University. Stanford Electronics Laboratories and published by . This book was released on 1961 with total page 44 pages. Available in PDF, EPUB and Kindle. Book excerpt: The way in which states are assigned in synchronous sequential networks greatly influences the cost of the associated logic. The state assignment problem is discussed, and an assignment technique is described that is very effective for non-cyclic circuits whose logical equations contain les than five variables. The principal advantages of this technique are that it is simple and that it can be applied effectively to find low-cost assignments for almost all synchronous sequential networks. A new approach to the assignment problem is introduced. Statistical predictions rather than absolute minimality are used as a criterion for evaluating the quality of an assignment. An assignment is considered to be good if the probability of finding a better assignment is small. (Author).