An Algorithm for Finding Secondary Assignments of Synchronous Sequential Circuits

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.