DocumentCode :
2065555
Title :
Analog routing considering min-area constraint
Author :
Weijie Chen ; Hailong Yao ; Yici Cai ; Qiang Zhou
Author_Institution :
Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China
fYear :
2013
fDate :
28-31 Oct. 2013
Firstpage :
1
Lastpage :
4
Abstract :
With the advancement of analog and mixed-signal (AMS) circuits, analog routing is attracting more and more concern. This paper presents a new analog gridless routing method fully considering different design rule constraints, including wire and via width/spacing constraints, especially the minimum area constraint. A modified A* searching algorithm is presented to search the multi-layer routing path that satisfies the minimum area constraint for each routing layer. Experimental results are promising and show that the presented analog router successfully finds valid routing paths for all the testcases without any min-area design rule violations.
Keywords :
analogue integrated circuits; network routing; analog gridless routing method; min-area constraint; modified A* searching algorithm; multilayer routing path; Algorithm design and analysis; Analog circuits; Design automation; Layout; Routing; Tiles; Wires; Analog and mixed signal circuit; Analog routing; Gridless routing; Min-area constraint;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
ASIC (ASICON), 2013 IEEE 10th International Conference on
Conference_Location :
Shenzhen
ISSN :
2162-7541
Print_ISBN :
978-1-4673-6415-7
Type :
conf
DOI :
10.1109/ASICON.2013.6811904
Filename :
6811904
Link To Document :
بازگشت