@inproceedings{9a4052599ae94aa4bf5d7f721dcdd50f,
title = "Routing wires with non-uniform width and spacing in data paths",
abstract = "Datapath layout designs exhibit special layout properties in that most wires connect one stage to another and are straight wires. Use of track based routing algorithms suffices for the routing needs of the bit-lines. The left edge algorithm (LEA) may be used for this purpose. With the increase in performance requirements for deep sub-micron datapath designs, the use of nonuniform wire widths and spacing is becoming necessary and using LEA is not feasible. This paper defines the datapath bit-line assignment problem. We then present a heuristic algorithm that achieves optimal results in most test cases when the wire widths are nonuniform. The time complexity of our solution is O(NlogN), where N is the number of bit-wire segments to be assigned.",
keywords = "Crosstalk, Data engineering, Delay, Design engineering, Educational institutions, Heuristic algorithms, Routing, Signal design, Testing, Wires",
author = "B. Krishna and Chen, {C. Y.R.} and Sehgal, {N. K.}",
note = "Publisher Copyright: {\textcopyright} 1999 Kuwait University.; 11th International Conference on Microelectronics, ICM 1999 ; Conference date: 22-11-1999 Through 24-11-1999",
year = "1999",
doi = "10.1109/ICM.2000.884811",
language = "English (US)",
series = "Proceedings of the International Conference on Microelectronics, ICM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "85--88",
booktitle = "ICM 1999 - 11th International Conference on Microelectronics",
}