Re: Seprarating algorithms from implementations (long)

Julius Kusuma <kusuma@eecs.berkeley.edu>
2 Sep 2000 16:18:51 -0400

          From comp.compilers
Related articles
Seprerating algorithms from implementations (long) TSharp@Serif.com (Toby Sharp) (2000-08-27)
Re: Seprarating algorithms from implementations (long) kusuma@eecs.berkeley.edu (Julius Kusuma) (2000-09-02)
| List of all articles for this month |
From: Julius Kusuma <kusuma@eecs.berkeley.edu>
Newsgroups: comp.graphics.algorithms,comp.compilers,comp.dsp
Date: 2 Sep 2000 16:18:51 -0400
Organization: University of California at Berkeley
References: 00-08-124
Keywords: design, performance

Well, this seems like the dream of all CAD researchers. feasibility
depends on the set of constraints and objectives that you apply to the
problem.


For One Thing, the BWRC (Berkeley Wireless Research Center) has a project
called SSHAFT (Simulink to Silicon blah blah blah), which takes a Simulink
block and then uses CAD tools to create a chip based on your Simulink
block. however, the floorplanning is done manually, for efficiency
reasons. they assured me that this is very easy to learn, even in minutes,
with great results. i'm not involved with this project but it's at
http://bwrc.eecs.berkeley.edu.


julius


--
BASiCS - Berkeley Audio-visual Signal Processing and Communication Systems
http://www.eecs.berkeley.edu/~kusuma

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.