Cart (Loading....) | Create Account
Close category search window
 

Functional synthesis of digital systems with TASS

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)
Amellal, S. ; Dept. of Electr. Eng., Ecole Polytech. de Montreal, Que., Canada ; Kaminska, B.

Synthesizing a digital system from a functional description is a complex process requiring the solution of various different problems. TASS (Tabu Search Synthesis System) is a functional synthesis system made up of interdependent modules based on new and more efficient algorithms. First, a control and data flow graph model for system representation is developed and presented. This model generates a single graph representing both the data and control flows of a VHDL behavioral description. A new representation of conditional branches and a mutual exclusion testing procedure offering optimized resource sharing and critical path reduction possibilities have been developed. This graph model is an environment used for various synthesis needs starting from high-level transformations to FSM synthesis for controller implementation. A new mathematical formulation of the scheduling problem is developed using a new approach based on penalty weights. This approach avoids the inflexibility of the ILP formulations developed in related works where the functional unit performing each type of operation is fixed prior to scheduling. The Tabu Search technique, which has been effective in finding optimal solutions for many types of large and difficult combinatorial optimization problems, has been adapted for this purpose. This technique, which performs an intelligent and fast solution space exploration, combined with an effective mathematical formulation makes the scheduling algorithm presented here very powerful

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:13 ,  Issue: 5 )

Date of Publication:

May 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.