Reduction of feedback loops in sequential circuits and carry leads in iterative networks

Techniques are presented for making use of “previous≓ inputs and outputs in designing sequential circuits and iterative networks. Theorems are proved regarding the maximum reduction in feedback loops or carry leads which can be obtained by the use of such techniques. An algorithm for testing whether a given state table corresponds to a definite event results as a by-product of the more general techniques presented here