High Rate Realization of Finite-State Machines

This paper is concerned with the high rate realization of finite-state machines. Two new techniques for high rate realization of finite-state machines are presented, one applicable to finite, the other to infinite memory span machines. It is found that any finite-state machine can be realized by a tree of component machines of a proper size with a given high rate, where the propagation delay of the component machine is less than or equal to the reciprocal of the given high rate. For a given set of logic devices, a synthesis procedure for the component machine with a given propagation delay is proposed.