Autonomous Clocks in Sequential Machines

S. S. Yau

doi:10.1109/PGEC.1965.264156

Autonomous Clocks in Sequential Machines

S. S. Yau

Research output: Contribution to journal › Letter › peer-review

3 Scopus citations

Abstract

A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

Original language	English (US)
Pages (from-to)	467-472
Number of pages	6
Journal	IEEE Transactions on Electronic Computers
Volume	EC-14
Issue number	3
DOIs	https://doi.org/10.1109/PGEC.1965.264156
State	Published - Jun 1965
Externally published	Yes

ASJC Scopus subject areas

Software
Theoretical Computer Science
Hardware and Architecture
Computational Theory and Mathematics

Access to Document

10.1109/PGEC.1965.264156

Cite this

@article{c0a4d3173e0542b2988a698b2d624973,

title = "Autonomous Clocks in Sequential Machines",

abstract = "A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT",

author = "Yau, {S. S.}",

year = "1965",

month = jun,

doi = "10.1109/PGEC.1965.264156",

language = "English (US)",

volume = "EC-14",

pages = "467--472",

journal = "IEEE Transactions on Electronic Computers",

issn = "0367-7508",

publisher = "IEEE Computer Society",

number = "3",

}

TY - JOUR

T1 - Autonomous Clocks in Sequential Machines

AU - Yau, S. S.

PY - 1965/6

Y1 - 1965/6

N2 - A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

AB - A necessary and sufficient condition for the existence of an autonomous clock in a sequential machine M is found to be the existence of a nontrivial input-independent partition on the set of internal states of M, no matter whether M is completely specified or incompletely specified. Two different techniques are given for generating the smallest input-independent partition π1, from which all other input-independent partitions can be obtained. One is suitable for a sequential machine whose state behavior is specified in the form of a flow table, while the other is convenient for a sequential machine whose state behavior is specified in the form of a connection matrix. Both techniques are efficient, and give all possible assignments to the redundant conditions of an incompletely specified sequential machine to reach the same nontrival input-independent partition, and hence the same autonomous clock. COPYRIGHT

UR - http://www.scopus.com/inward/record.url?scp=84931934751&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84931934751&partnerID=8YFLogxK

U2 - 10.1109/PGEC.1965.264156

DO - 10.1109/PGEC.1965.264156

M3 - Letter

AN - SCOPUS:84931934751

SN - 0367-7508

VL - EC-14

SP - 467

EP - 472

JO - IEEE Transactions on Electronic Computers

JF - IEEE Transactions on Electronic Computers

IS - 3

ER -

Autonomous Clocks in Sequential Machines

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this