Abstract
Given a clustered flow graph, the next step in the Cathedral-3 script is to assign each cluster to one of the allocated ASUs. This type of assignment problem differs significantly from the classical way in which assignment is performed in high level synthesis.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Geurts, W., Catthoor, F., Vernalde, S., de Man, H. (1997). Cluster to ASU Assignment. In: Accelerator Data-Path Synthesis for High-Throughput Signal Processing Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8720-4_7
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8720-4_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4674-6
Online ISBN: 978-1-4419-8720-4
eBook Packages: Springer Book Archive