Referenced Items are not available for this document.
In this paper, an assignment based approach to the data-path synthesis is studied, which aims to identify and to manage the connectivity between modules more explicitly throughout the design process. In contrast to conventional approaches, the assignment solution space will be explored concurrently with evaluations of scheduling length and the other criteria relevant to the connectivity. Especially in this paper, a scheduling method suitable for this design strategy is proposed, and is incorporated with the branch-and-bound search of the assignment solution space
Published in:
Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on
(Volume:2
)
Date of Conference: 2000
- Page(s):
- 57 - 60 vol.2
- Meeting Date :
- 28 May 2000-31 May 2000
- Print ISBN:
- 0-7803-5482-6
- INSPEC Accession Number:
- 6709928
- Conference Location :
- Geneva
- Digital Object Identifier :
- 10.1109/ISCAS.2000.856257
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
