Structural simplification and decomposition of asynchronous sequential circuits

1 October 1968

proceedings article
Published by Institute of Electrical and Electronics Engineers (IEEE)

https://doi.org/10.1109/swat.1968.29

Abstract

In this paper, we extend the partition theory developed by Hartmanis and learns for synchronous sequential circuits to asynchronous sequential circuits. method which utilizes the concept of partition pairs to obtain single transition time asynchronous state assignments with reduced dependence is presented. procedures are also presented for obtaining parallel and serial decompositions of synchronous sequential circuits.

Keywords

This publication has 13 references indexed in Scilit:

Synthesis of Asynchronous Sequential Circuits with Multiple-Input Changes
IEEE Transactions on Computers, 1968
Feedback in Asynchronous Sequential Circuits
IEEE Transactions on Electronic Computers, 1966
Internal State Assignments for Asynchronous Sequential Machines
IEEE Transactions on Electronic Computers, 1966
A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential Networks
IEEE Transactions on Electronic Computers, 1965
Decomposition of sequential machines
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1965
Sequential circuit synthesis using input delays
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1963
Loop-free structure of sequential machines
Information and Control, 1962
The Cascade Decomposition of Sequential Machines
IEEE Transactions on Electronic Computers, 1961
On the State Assignment Problem for Sequential Machines. I
IEEE Transactions on Electronic Computers, 1961
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
IEEE Transactions on Electronic Computers, 1959