By Topic

High-level synthesis of digital circuits by finding fixpoints

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
$33 $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

3 Author(s)
L. Ghatraju ; Dept. of Comput. Sci., Saskatchewan Univ., Saskatoon, Sask., Canada ; M. H. Abd-El-Barr ; C. McCrosky

A technique for the synthesis of two-level and nested logic from recursive behavioral specifications is presented. The two-level circuits derived are optimal (up to product term sharing). Different specifications of the same function always yield the same hardware. Any recursive first-order function can be synthesized without a stack - no other high-level synthesis systems have demonstrated this capability. The technique is extended to synthesize circuits for a wide range of sequential circuits. The formal techniques used are based on domain theory and “frontiers” algorithms

Published in:

European Design and Test Conference, 1994. EDAC, The European Conference on Design Automation. ETC European Test Conference. EUROASIC, The European Event in ASIC Design, Proceedings.

Date of Conference:

28 Feb-3 Mar 1994