Abstract
Module binding is the behavioral synthesis step that derives a structural representation of the datapath. It involves three tasks: functional unit, storage unit, and interconnection unit binding. This paper presents GLASS, a graph-theoretical formulation of the binding problem that performs all binding tasks simultaneously. Operations, variables, and data transfers are represented as vertices of the same compatibility graph and binding decisions are interfaced among different types of hardware modules (ALUs, registers, buses, …) in order to minimize the estimated datapath area. The solutions generated by GLASS are superior to those obtained by existing graph-theoretical P-time techniques.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
