By Topic

A compiler for optimized arithmetic datapaths

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The authors present GAD, a compiler for arithmetic datapaths, i.e. systems characterized by the absence of conditional branches and abundance of arithmetic operations. GAD's inputs are the functional specification of the datapath in the form of a signal flow graph, as well as the required throughput rate. A netlist is generated for the synthesized datapath, which is optimized for the number of gates used. The synthesis problem is formulated into two parts: (1) pipeline design, where machine cycles are organized into pipeline stages according to operator delays; and (2) scheduling, where operators are assigned to cycles to maximize resource sharing. Heuristics have been developed for these problems; using the characteristics of arithmetic datapaths, they explore systematically and efficiently a large part of the design space

Published in:

Custom Integrated Circuits Conference, 1989., Proceedings of the IEEE 1989

Date of Conference:

15-18 May 1989