An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Maolin Tang Articles by Kamran Eshraghian Articles by Hon Nin Cheung

Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99)

Wanchai, Hong Kong

January 18-January 21

ISBN: 0-7803-5012-X

	ASCII Text	x
	Maolin Tang, Kamran Eshraghian, Hon Nin Cheung, "An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing," Asia and South Pacific Design Automation Conference, pp. 149, Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99), 1999.

	BibTex	x
	@article{ 10.1109/ASPDAC.1999.759982, author = {Maolin Tang and Kamran Eshraghian and Hon Nin Cheung}, title = {An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing}, journal ={Asia and South Pacific Design Automation Conference}, volume = {0}, year = {1999}, isbn = {0-7803-5012-X}, pages = {149}, doi = {http://doi.ieeecomputersociety.org/10.1109/ASPDAC.1999.759982}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Asia and South Pacific Design Automation Conference TI - An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing SN - 0-7803-5012-X SP EP A1 - Maolin Tang, A1 - Kamran Eshraghian, A1 - Hon Nin Cheung, PY - 1999 KW - null VL - 0 JA - Asia and South Pacific Design Automation Conference ER -

Maolin Tang, Edith Cowan University, Perth, Australia

Kamran Eshraghian, Edith Cowan University, Perth, Australia

Hon Nin Cheung, Edith Cowan University, Perth, Australia

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ASPDAC.1999.759982

Constrained Via Minimization is the problem of reassigning wire segments of a VLSI routing so that the number of vias is minimized. In this paper, a new approach is proposed for two-layer VLSI routing. This approach is able to handle any types of routing, and allows arbitrary number of wire segments split at a via candidate.

Citation:

Maolin Tang, Kamran Eshraghian, Hon Nin Cheung, "An Efficient Aopproach to Constrained Via Minimization for Two-Layer VLSI Routing," asp-dac, pp.149, Asia and South Pacific Design Automation Conference 1999 (ASP-DAC'99), 1999

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.