IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0824942
(2010-06-28)
|
등록번호 |
US-8307323
(2012-11-06)
|
우선권정보 |
TW-99114823 A (2010-05-10) |
발명자
/ 주소 |
- Jiang, Iris Hui-Ru
- Yang, Yu-Ming
|
출원인 / 주소 |
- National Chiao Tung University
|
대리인 / 주소 |
Muncy, Geissler, Olds & Lowe, PLLC
|
인용정보 |
피인용 횟수 :
0 인용 특허 :
4 |
초록
▼
A method for analog placement and global routing considering wiring symmetry performs a layout for a circuit which is described by a netlist having a set of devices and wires. First, the method inputs the netlist, and each device thereof has a design constraint and a corresponding priority. Based on
A method for analog placement and global routing considering wiring symmetry performs a layout for a circuit which is described by a netlist having a set of devices and wires. First, the method inputs the netlist, and each device thereof has a design constraint and a corresponding priority. Based on the priorities, it performs a sorting on the devices to establish a constraint library. Then, based on the design constraint and corresponding priority of each device, the method establishes a hierarchical constraint tree. According to the hierarchical constraint tree, the method performs placement of each device, wherein possible shape of each device is represented by a shape curve. For each placement of the device, the method calculates a corresponding cost function. Then, it selects an optimum placement of the device according to the cost functions. The method establishes an RSMT for each wire and then performs an analog routing.
대표청구항
▼
1. A method for analog placement and global routing considering wiring symmetry, which is executed in a computer to perform a layout for an analog circuit described by a netlist having a set of devices and wires connected thereon, the method comprising the steps of: (A) inputting the netlist, using
1. A method for analog placement and global routing considering wiring symmetry, which is executed in a computer to perform a layout for an analog circuit described by a netlist having a set of devices and wires connected thereon, the method comprising the steps of: (A) inputting the netlist, using the computer, each device of the netlist having a design constraint, each design constraint corresponding to a priority;(B) establishing a hierarchical constraint tree based on the design constraint and corresponding priority of each device;(C) performing a sorting on the devices based on the priorities;(D) performing a placement on each device according to the hierarchical constraint tree, wherein possible shapes of each device are represented by a shape curve;(E) calculating a corresponding cost function for each placement of the device, and selecting an optimum placement of the device according to the cost functions;(F) establishing a rectilinear Steiner minimal tree (RSMT) for each wire; and(G) performing an analog routing. 2. The method as claimed in claim 1, wherein the design constraint is selectively to be input, differential, mirroring, matching, proximity, power, and others. 3. The method as claimed in claim 2, wherein the design constraints of input, differential, mirroring, matching, proximity, power, and others have descending priorities of 6, 5, 4, 3, 2, 1 and 0, respectively. 4. The method as claimed in claim 3, wherein for the design constraints with identical priority, an alphabetic order is used to establish a constraint library. 5. The method as claimed in claim 4, wherein the netlist is described in a SPICE format, and the design constraints are annotated into the netlist. 6. The method as claimed in claim 5, wherein a structure of the hierarchical constraint tree is generated based on functionalities of the devices of the netlist. 7. The method as claimed in claim 6, wherein a proximity design constraint in the hierarchical constraint tree covers a mirroring design constraint and a matching design constraint. 8. The method as claimed in claim 7, wherein the shape curve of each device is generated by a device folding. 9. The method as claimed in claim 8, wherein a number of points in each shape curve correspond to a number of feasible folded dimensions. 10. The method as claimed in claim 9, wherein the shape curve is discrete. 11. The method as claimed in claim 10, wherein a force-directed method is used to place each device. 12. The method as claimed in claim 11, wherein step (G) comprises: (G1) performing a wiring symmetry analysis on each wire by using the constraint library to sum all priorities of connected devices to the wire to thereby generate a corresponding routing weight; and (G2) performing the analog routing based on the corresponding routing weight of each wire. 13. The method as claimed in claim 12, wherein step (G) performs the analog routing on the wires by a pattern routing and then by a maze routing on remaining wires which cannot be routed by the pattern routing.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.