The University of Southampton
University of Southampton Institutional Repository

A behavioral synthesis system for asynchronous circuits

Sacker, Matthew, Brown, Andrew D., Rushton, Andrew and Wilson, Peter R. (2004) A behavioral synthesis system for asynchronous circuits IEEE Transactions on Very Large Systems Integration (VLSI), 12, (9), pp. 978-994.

Record type: Article

Abstract

Behavioral synthesis of synchronous systems is a well established and researched area. The transformation of behavioral description into a datapath and control graph, and hence, to a structural realization usually requires three fundamental steps: 1) scheduling (the mapping of behavioral operations onto time slots); 2) allocation (the mapping of the behavioral operations onto abstract functional units); and 3) binding (the mapping of the functional units onto physical cells). Optimization is usually achieved by intelligent manipulation of these three steps in some way. Key to the operation of such a system is the (automatically generated) control graph, which is effectively a complex sequence generator controlling the passage of data through the system in time to some synchronizing clock. The maximum clock speed is dictated by the slowest time slot. (This is the timeslot containing the longest combinational logic delay.) Timeslots containing quicker (less) logic will effectively waste time: the output of the combinational logic in the state will have settled long before the registers reading the data are enabled. If we allow the state to change as soon as the data is ready, by introducing the concepts of "ready" and "acknowledge," the control graph becomes a disjoint set of single-state machines-it effectively disappears, with the consequence that the timeslot-timeslot transitions become self controlling. Having removed the necessity for the timeslots to be of equal duration the system becomes selftiming: asynchronous. This paper describes a behavioral asynchronous synthesis system based on this concept that takes as input an algorithmic description of a design and produces an asynchronous structural implementation. Several example systems are synthesized both synchronously and asynchronously (with no modification to the high level description). In keeping with the well-established observation that asynchronous systems operate at average case time complexity rather than worse case, the asynchronous structures usually operate some 30% faster than their synchronous counterparts, although interesting counterexamples are observed.

PDF async_tvlsi.pdf - Other
Download (879kB)

More information

Published date: September 2004
Organisations: EEE

Identifiers

Local EPrints ID: 260032
URI: http://eprints.soton.ac.uk/id/eprint/260032
PURE UUID: 391f9b9c-5221-47ba-8a91-aaa7f92a7ed5

Catalogue record

Date deposited: 16 Oct 2004
Last modified: 18 Jul 2017 09:17

Export record

Contributors

Author: Matthew Sacker
Author: Andrew D. Brown
Author: Andrew Rushton
Author: Peter R. Wilson

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×