By Topic

The Application of Shift Registers to Secondary State Assignment: Part I

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

2 Author(s)

Abstract—An algorithm, which determines whether or not an arbitrary sequential machine can be realized using a set of equal-length shift registers, is developed. When realization is possible, a basis for state assignment is also given.

Published in:

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