Referenced Items are not available for this document.
We present a new algorithm for cluster-oriented scheduling (COS) in pipelined data path synthesis. First, cluster structure information is extracted from the corresponding linear graph representation of a data flow graph (DFG). Then, scheduling and allocation globally interact with the cluster information under the timing constraints of pipeline latency and data initialization interval (DII). Using this technique, the costs of registers, multiplexors, and interconnection were reduced dramatically in both the FIR and elliptic filter examples
Published in:
Computer Design: VLSI in Computers and Processors, 1993. ICCD '93. Proceedings., 1993 IEEE International Conference on
Date of Conference: 3-6 Oct 1993
- Page(s):
- 374 - 378
- Meeting Date :
- 03 Oct 1993-06 Oct 1993
- Print ISBN:
- 0-8186-4230-0
- INSPEC Accession Number:
- 4955899
- Conference Location :
- Cambridge, MA
- Digital Object Identifier :
- 10.1109/ICCD.1993.393349
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.
