By Topic

On the complexity of connectivity binding

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

1 Author(s)
B. M. Pangrle ; Dept. of Comput. Sci., Pennsylvania State Univ., University Park, PA, USA

The complexity of the assignment of operations to hardware components to specify the design at a register-transfer level, which is referred to as connectivity binding, is discussed. Connectivity binding is an important issue in high-level behavior synthesis systems that start with abstract behavioral descriptions and synthesize register-transfer level architectures for implementation. The corresponding decision problem is shown to be NP-complete and the complexity of the optimization problem is discussed. This research is intended to provide insight into the nature of this problem. It is shown that problems as simple as performing optimal function unit binding for a hardware structure containing only one commutative operator are hard

Published in:

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