By Topic

A heuristic algorithm for ordering the columns in one-dimensional logica arrays

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

3 Author(s)
Youn-Sik Hong ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Kyu-Ho Park ; Kim, Myunghwan

The authors focus on the ordering of the columns to minimize the necessary number of tracks in one-dimensional logic array. They use a column-orientation approach to this problem. Each net is converted into a complete graph (or clique). The weighted graph using such topological transformation is unique. The necessary number of tracks can be evaluated by the cut of the two seeds of orderings, the left seed vertex and the right seed vertex. The authors find the minimal track assignments by minimizing the cut of the seed vertex. Additionally, a useful concept called the overriding property is introduced. It determines the local optimal assignments for two or more columns with the above property. The author's algorithm works well with either a uni- or bidirectional approach to select the seed of ordering. Results obtained by the proposed algorithm and the simulated annealing approach are compared

Published in:

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