By Topic

Finite state machine has unlimited concurrency

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
$33 $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)
H. -D. Lin ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; D. G. Messerschmitt

General methods for introducing concurrency, by which the throughput of finite-state machines (FSM) can be improved at the expense of latency, are described. The methods are applicable to software and hardware implementation using parallelism or pipelining and demonstrate that there is no theoretical limit to concurrency in a discrete-time finite-state machine. The methods can arbitrarily improve the iteration bound of discrete-time FSMs with low hardware overhead. They are efficient when the state size is finite and moderate, as in controllers, encoders, source decoders, etc. When the state size is large and the recurrence is not a closed-form function of specific classes, the methods cannot be applied directly. Another limitation is the latency induced by the block methods. In most cases, this is not a problem because the overall cost and throughput rather than latency are at stake

Published in:

IEEE Transactions on Circuits and Systems  (Volume:38 ,  Issue: 5 )