A fast technique for linear wire-length calculation of very large scale integration circuits
Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2003), pp. 37-41.

Voir la notice de l'article provenant de la source Math-Net.Ru

Many algorithms for very large scale integration placement improvement require fast calculation of the linear wire-length depending on the position of given cell and assuming other cells fixed. Particularly it is required to find optimal locations of the cell. This paper suggests a fast algorithm for this problem. Complexity of the algorithm is $O(n \log n)$, where $n$ is the number of nets of this cell.
Keywords: Very large scale integration placement, fast algorithm.
@article{UZERU_2003_1_a4,
     author = {V. E. Pogosyan},
     title = {A fast technique for linear wire-length calculation of very large scale integration circuits},
     journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
     pages = {37--41},
     publisher = {mathdoc},
     number = {1},
     year = {2003},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/UZERU_2003_1_a4/}
}
TY  - JOUR
AU  - V. E. Pogosyan
TI  - A fast technique for linear wire-length calculation of very large scale integration circuits
JO  - Proceedings of the Yerevan State University. Physical and mathematical sciences
PY  - 2003
SP  - 37
EP  - 41
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/UZERU_2003_1_a4/
LA  - ru
ID  - UZERU_2003_1_a4
ER  - 
%0 Journal Article
%A V. E. Pogosyan
%T A fast technique for linear wire-length calculation of very large scale integration circuits
%J Proceedings of the Yerevan State University. Physical and mathematical sciences
%D 2003
%P 37-41
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/UZERU_2003_1_a4/
%G ru
%F UZERU_2003_1_a4
V. E. Pogosyan. A fast technique for linear wire-length calculation of very large scale integration circuits. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 1 (2003), pp. 37-41. http://geodesic.mathdoc.fr/item/UZERU_2003_1_a4/

[1] N. A. Sherwani, Algorithms for VLSI Physical Design Automation, 3rd ed., Kluwer Academic Publishers, 1999 | Zbl

[2] A. A. Kennings , I. L. Markov, “Analytical Minimization of Half-Perimeter Wirelength”, ASPDAC, 2000, 179–184

[3] M. Areibi Shawki, “Iterative Improvement Heuristics for the Standard Cell Placement: A comparison”, SCI/ISAS Proceedings, 9 (2001)

[4] V. E. Poghosyan, Iterative Improvement for Standard Cell Placement, Dep. ArmNIINTI 25.07.02, No 34, 2002 | Zbl