Abstract
The previous chapters showed how we can build digital circuits to implement any of the required computations for a particular algorithm. In order to handle the control structures, that is, the ifs and fors and whiles, in an algorithm, we need to consider state machines in addition to datapaths. This chapter introduces stand-alone state machines and the next chapter will talk about how we can link a state machine to a datapath to fully implement an algorithm in hardware.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Seiffertt, J. (2017). State Machines. In: Digital Logic for Computing. Springer, Cham. https://doi.org/10.1007/978-3-319-56839-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-56839-3_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-56837-9
Online ISBN: 978-3-319-56839-3
eBook Packages: Computer ScienceComputer Science (R0)