Combining event and data-flow graphs in behavioral synthesis

Combining event and data-flow graphs into a single unified representation is addressed. A unified behavior graph is presented, and the algorithms required to support automatic synthesis are obtained. The new descriptive conventions are shown to be concise and to possess straightforward mappings to hardware. The algorithms are demonstrated to be of practical complexity (O(n/sup 2/), where N is the number of interface events). A practical example demonstrates how the representation is used, and synthesis results from five examples show that the synthesized circuitry is comparable to that achieved with other automatic methods or by experienced human designers.<>