Abstract—This paper treats the problem of finding efficient secondary assignments for synchronous sequential circuits. It presents a straightforward approach which identifies codes resulting in the least number of memory elements and sets of simple next-state functions, expressed in the sum-of-product form.
No takes yet. Share an insight, caveat, or question.
H. C. Torng (1968) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: