By Topic

A Mixed HVH-VHV Algorithm for Three-Layer Channel Routing

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)
Pitchumani, V. ; Syracuse University, ECE Dept., Syracuse, NY, USA ; Qisui Zhang

We present a hybrid three-layer channel-routing algorithm that combines horizontal-vertical-horizontal (HVH) and vertical-horizontal-vertical (VHV) approaches [1]. The result is the best of both approaches. VHV excels when the vertical constraint graph (VCG) has long chains; HVH is strong when the VCG has a large number of incomparable nodes. In hybrid routing, the VCG is partitioned into two portions, one ideally suited for HVH and the other for VHV. The portions are routed with a transition track in between. It is shown that, for many channel-routing problems, the hybrid method can do with fewer tracks than the theoretical lower bounds of the algorithms given in [1][2][3]. A heuristic algorithm is given for determining an optimum partitioning into HVH and VHV portions. The algorithm is powerful and its performance on Deutsch's difficult example [8] is discussed as an illustration.

Published in:

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