loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
25th Euromicro Conference (EUROMICRO '99)-Volume 1
A Unified Algorithm for Mutual Exclusiveness Identification
Milan, Italy
September 08-September 10
ISBN: 0-7695-0321-7
O. Peñalba, Universidad Complutense de Madrid
J. M. Mendías, Universidad Complutense de Madrid
R. Hermida, Universidad Complutense de Madrid
This paper presents a new method for identifying mutually exclusive operations pairs in behavioral descriptions in the context of high-level synthesis. It is based in two main features: i) the choice of a suitable formal representation of the behavior that exploits its maximum degree of parallelism and ii) a behavior preserving transformation of that representation in order to overlook the "non-intended" design decisions (like implicit hardware reuse) taken by the designer when writing the system specification. As a result, a simple and unified method for identifying all the mutually exclusive pairs can be defined, which provides a higher potential reuse in the final implementation.
Citation:
O. Peñalba, J. M. Mendías, R. Hermida, "A Unified Algorithm for Mutual Exclusiveness Identification," euromicro, vol. 1, pp.1504, 25th Euromicro Conference (EUROMICRO '99)-Volume 1, 1999
Usage of this product signifies your acceptance of the Terms of Use.