Lagrangian method for wire routing of layout design

Author

Nagamatu, Masahiro ; Ismail, Shakeel ; Yanaru, Torao

Author_Institution

Dept. of Comput. Sci., Kyushu Inst. of Technol., Japan

fYear

1995

Firstpage

350

Lastpage

354

Abstract

In this paper, we propose a new algorithm which solves the routing problem of LSI layout design as a continuous valued constrained optimization problem. All continuous valued wires change their values simultaneously according to the dynamic equations of Lagrangian method, hence this method is suitable for neurocomputing. We show that this method can solve the small switchbox routing problems with a higher completion rate as compared to the rip-up reroute maze router

Keywords

circuit layout CAD; circuit optimisation; integrated circuit layout; large scale integration; network routing; neural nets; LSI layout design; Lagrangian method; continuous valued constrained optimization problem; continuous valued wires; dynamic equations; layout design; neurocomputing; rip-up reroute maze router; small switchbox routing problems; wire routing; Fuzzy sets; Lagrangian functions; Law; Legal factors; Routing; Wire; Wiring;

fLanguage

English

Publisher

ieee

Conference_Titel

Artificial Neural Networks and Expert Systems, 1995. Proceedings., Second New Zealand International Two-Stream Conference on

Conference_Location

Dunedin

Print_ISBN

0-8186-7174-2

Type

conf

DOI

10.1109/ANNES.1995.499506

Filename

499506

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1662026