Automatic generation of bus functional models from transaction level models

Authors:
Dongwan Shin;Samar Abdi;Daniel D. Gajski
Affiliations:
University of California, Irvine, CA;University of California, Irvine, CA;University of California, Irvine, CA
Venue:
Proceedings of the 2004 Asia and South Pacific Design Automation Conference
Year:
2004

Citing 6
Cited 0

Communication synthesis for distributed embedded systems

ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Communication synthesis for distributed embedded systems

Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design
Automatic generation of application-specific architectures for heterogeneous multiprocessor system-on-chip

Proceedings of the 38th annual Design Automation Conference
Component-based design approach for multicore SoCs

Proceedings of the 39th annual Design Automation Conference
System Design with SystemC

System Design with SystemC
Automatic communication refinement for system level design

Proceedings of the 40th annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents methodology and algorithms for generating bus functional models from transaction level models in system level design. Transaction level models are often used by designers for prototyping the bus functional architecture of the system. Being at a higher level of abstraction gives transaction level models the unique advantage of high simulation speed. This means that the designer can explore several bus functional architectures before choosing the optimal one. However, the process of converting a transaction level model to a bus functional model is not trivial. A manual conversion would not only be time consuming but also error prone. A bus functional model should also accurately represent the corresponding transaction level model. We present algorithms for automating this refinement process. Experimantal results presented using a tool based on these algorithms show their usefulness and feasibility.