THE SELECTION PROBLEM FOR MINIMAL-STATE SEQUENTIAL CIRCUITS
Abstract
A technique is discussed that will select from the set of minimal-state circuits those which will have the lowest expected logic cost. The relation between information content and the expected cost of the logic is clearly demonstrated for the cases discussed. This indicates that if circuits can be designed that have small information contents, they will also have inexpensive associated logic. It may be possible to find design procedures that will generate circuits with small information contents and thus with low-cost logic. Also, it seems reasonable to expect that a relation should exist between an appropriately defined information content for the circuit's input-output sequences and its information content. (Author 0
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 20, 1961
- Accession Number
- AD0260782
Entities
People
- W.h. Davidson
Organizations
- Stanford University