A design space exploration scheme for data-path synthesis

Mandal, C. A. ; Chakrabarti, P. P. ; Ghose, S. (1999) A design space exploration scheme for data-path synthesis IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 7 (3). pp. 331-338. ISSN 1063-8210

Full text not available from this repository.

Official URL: http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arn...

Related URL: http://dx.doi.org/10.1109/92.784094


In this paper, we examine the multicriteria optimization involved in scheduling for data-path synthesis (DPS). The criteria we examine are the area cost of the components and schedule time. Scheduling for DPS is a well-known NP-complete problem. We present a method to find nondominated schedules using a combination of restricted search and heuristic scheduling techniques. Our method supports design with architectural constraints such as the total number of functional units, buses, etc. The schedules produced have been taken to completion using GABIND as written by Mandal et al., and the results are promising.

Item Type:Article
Source:Copyright of this article belongs to Institute of Electrical and Electronic Engineers.
ID Code:5991
Deposited On:19 Oct 2010 09:58
Last Modified:20 May 2011 09:40

Repository Staff Only: item control page