Abstract
Before proceeding to the new optimal sequential algorithms, it is useful to consider a basic non-optimal synthesis flow. This chapter briefly walks through a burst-mode asynchronous synthesis path. Each step of asynchronous synthesis is illustrated using a simple burst-mode specification as a running example. Here, optimal solutions are not presented, but rather the focus is on the basic requirements at each step. Later chapters formalize the correctness requirements, as well as introduce optimal algorithms, for each step.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Fuhrer, R.M., Nowick, S.M. (2001). Burst-Mode Synthesis Path Walkthrough. In: Sequential Optimization of Asynchronous and Synchronous Finite-State Machines. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1417-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1417-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5543-4
Online ISBN: 978-1-4615-1417-6
eBook Packages: Springer Book Archive