TY - GEN

T1 - A clock net reassignment algorithm using Voronoi diagram

AU - Edahiro, Masato

PY - 1990

Y1 - 1990

N2 - A novel algorithm is presented for the clock net reassignment problem in semi-custom layout design. The clock net reassignment is used to shorten clock nets by reconnecting clock drivers and flip-flops so as to obtain high performance LSIs. The proposed algorithm, by using the Voronoi diagram in computational geometry, is quite efficient and gives better assignments than existing techniques. The experimental results show that the algorithm yields a 10% reduction in net lengths in comparison with existing algorithms. The algorithm takes only 18 s to find an assignment for 167 drivers and 833 flip-flops.

AB - A novel algorithm is presented for the clock net reassignment problem in semi-custom layout design. The clock net reassignment is used to shorten clock nets by reconnecting clock drivers and flip-flops so as to obtain high performance LSIs. The proposed algorithm, by using the Voronoi diagram in computational geometry, is quite efficient and gives better assignments than existing techniques. The experimental results show that the algorithm yields a 10% reduction in net lengths in comparison with existing algorithms. The algorithm takes only 18 s to find an assignment for 167 drivers and 833 flip-flops.

UR - http://www.scopus.com/inward/record.url?scp=0025568050&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025568050&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025568050

SN - 0818620552

T3 - 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers

SP - 420

EP - 423

BT - 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers

PB - Publ by IEEE

T2 - 1990 IEEE International Conference on Computer-Aided Design - ICCAD-90

Y2 - 11 November 1990 through 15 November 1990

ER -