On the Linearity of Autonomous Sequential Machines
- 1 December 1964
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Electronic Computers
- Vol. EC-13 (6) , 673-679
- https://doi.org/10.1109/pgec.1964.263900
Abstract
This paper presents a method of determining, from the flow table of an autonomous sequential machine, whether the machine can be realized by a linear circuit which uses the minimum possible number of secondary variables. The method is based on a class of binary partitions of states, which are used to find a minimal assignment of the secondary variables such that the next state and output functions are linear. The partitions are examined in detail and the properties necessary to produce a valid assignment are developed.Keywords
This publication has 6 references indexed in Scilit:
- On the State Assignment Problem for Sequential Machines. IIEEE Transactions on Electronic Computers, 1961
- Synthesis of Binary Ring Counters of Given PeriodsJournal of the ACM, 1960
- On periodicity of states in linear modular sequential circuits (Corresp.)IRE Transactions on Information Theory, 1959
- The Theory of Autonomous Linear Sequential NetworksIRE Transactions on Circuit Theory, 1959
- Analysis of Sequential MachinesIEEE Transactions on Electronic Computers, 1957
- A method for synthesizing sequential circuitsBell System Technical Journal, 1955