By Topic

An Algorithm for Finding Secondary Assignments of Synchronous Sequential Circuits

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Torng, H.C. ; IEEE

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-17 ,  Issue: 5 )