JPH05101147A - Method for determining wiring order - Google Patents

Method for determining wiring order

Info

Publication number
JPH05101147A
JPH05101147A JP3262036A JP26203691A JPH05101147A JP H05101147 A JPH05101147 A JP H05101147A JP 3262036 A JP3262036 A JP 3262036A JP 26203691 A JP26203691 A JP 26203691A JP H05101147 A JPH05101147 A JP H05101147A
Authority
JP
Japan
Prior art keywords
wiring
net
length
pin pair
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP3262036A
Other languages
Japanese (ja)
Inventor
Sadayuki Mizunuma
貞幸 水沼
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
NEC Solution Innovators Ltd
Original Assignee
NEC Software Hokuriku Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by NEC Software Hokuriku Ltd filed Critical NEC Software Hokuriku Ltd
Priority to JP3262036A priority Critical patent/JPH05101147A/en
Publication of JPH05101147A publication Critical patent/JPH05101147A/en
Pending legal-status Critical Current

Links

Landscapes

  • Design And Manufacture Of Integrated Circuits (AREA)

Abstract

PURPOSE:To prevent the wiring length of a network from exceeding a wiring limit length without decreasing the wiring rate of a wiring process by determin ing the wiring order of pin pairs by the wiring order determining method for the layout design of an LSI, etc., in consideration of the degree of wiring conges tion and the wiring limit length. CONSTITUTION:Boxes 1-1-1-2 input logical connection information, arrangement information, and wiring limit lengths of respective networks. Boxes 1-3-1-5 find the permissible values of bypass wiring of respective pin pairs in consideration of the wiring limit lengths of the respective networks. Boxes 1-6-1-7 calculate expected values of wiring of the pin pairs by the shortest paths in consideration of the degree of wiring congestion in consideration of the degree of wiring congestion. Boxes 1-8-1-10 determine wiring order so that the pin pairs can be wired from pair pins which are smaller in the permissible value of bypass wiring and low in the expected value of shortest-path wiring.

Description

【発明の詳細な説明】Detailed Description of the Invention

【0001】[0001]

【産業上の利用分野】本発明は、プリント配線基板、L
SI等の配線設計における配線の順序を決定する方法に
関する。
The present invention relates to a printed wiring board, L
The present invention relates to a method for determining the wiring order in wiring design such as SI.

【0002】[0002]

【従来の技術】従来、この種の配線順序決定方法では、
配線率を向上させることを優先とした配線順序決定方法
と配線制限長のみを考慮した配線順序決定方法がある。
2. Description of the Related Art Conventionally, in this kind of wiring order determining method,
There are a wiring order determination method that prioritizes improving the wiring rate and a wiring order determination method that considers only the wiring limit length.

【0003】配線率を向上させることを優先とした配線
順序決定方法では、ピンペア間の距離が短いものより優
先して配線するように決定する方法と、配線混雑度の高
い領域を走行するピンペアより優先して配線するように
決定する方法がある。関連文献として、「VLSIの設
計 I」 1985年 岩波書店発行 著者 渡辺誠
他3名 4章 レイアウト設計 がある。
In the wiring order determination method which gives priority to improving the wiring rate, a method of deciding the wiring to give priority to a wiring having a short distance between the pin pairs and a pin pair traveling in an area having a high wiring congestion degree. There is a method of deciding to preferentially wire. As a related document, "Design of VLSI I" 1985, published by Iwanami Shoten Author Makoto Watanabe
There are 3 other 4 chapters layout design.

【0004】[0004]

【発明が解決しようとする問題点】上述した従来の配線
率の向上を優先した配線順序決定方法では、配線率の向
上は期待できるが、配線した結果によっては、配線長制
限を違反するネットが発生するという欠点がある。
In the above-described conventional wiring sequence determining method that prioritizes improvement of the wiring rate, the wiring rate can be expected to be improved, but depending on the wiring result, a net that violates the wiring length limit may be generated. It has the drawback of occurring.

【0005】また、配線制限長のみを考慮した配線順序
決定方法では、配線長制限を違反するネットは発生しな
いが、一般的に、配線長制限を違反しそうなネットほ
ど、ピンペア間の距離が長いものであり、このものより
優先して配線するのでピンペア間の短いピンペアは、配
線順序が遅くなり、その結果、配線率は低下するという
欠点がある。
Further, in the wiring order determination method considering only the wiring length limitation, no net violating the wiring length limitation is generated, but generally, the net which is likely to violate the wiring length limitation has a longer distance between the pin pairs. Since the wiring is prioritized over this wiring, the short pin pair between the pin pairs has a drawback that the wiring sequence is delayed and, as a result, the wiring rate is reduced.

【0006】[0006]

【問題点を解決するための手段】本発明の配線順序決定
方法は、プリント配線板、LSI等の配線設計でピンペ
アの配線順序の決定において、論理接続情報とブロック
配置情報を入力し、また各ネットの配線制限長を入力
し、記憶する手段と、配置後のネットの仮想配線長を計
算し、配線制限長より仮想配線長を引いた値を、ネット
の各ピンペアの迂回配線の許容値として、各ピンペアの
迂回配線の許容値を計算し、記憶する手段と、基板上の
配線混雑度より、各ピンペアの二点間を最短経路で配線
できる期待値を求める手段と、各ピンペアの迂回配線の
許容値と二点間を最短経路で配線できる期待値より、迂
回配線の許容値が小さく、二点間を最短経路で配線でき
る期待値が低いピンペアより配線されるように配線順位
を決定する手段とを含むことを特徴とする。
The wiring order determining method of the present invention inputs logical connection information and block layout information in determining the wiring order of a pin pair in wiring design of a printed wiring board, LSI, etc. A means for inputting and storing the wiring limit length of the net, calculating the virtual wiring length of the net after placement, and subtracting the virtual wiring length from the wiring limit length is used as the allowable value of the bypass wiring for each pin pair of the net. , A method of calculating and storing the allowable value of the bypass wiring of each pin pair, a means of obtaining an expected value that can be wired in the shortest route between two points of each pin pair based on the wiring congestion degree on the board, and a bypass wiring of each pin pair The allowable value of detour wiring is smaller than the allowable value of and the expected value that can be routed between two points, and the wiring order is determined so that wiring is performed from a pin pair with a lower expected value that can be routed between two points with a shorter expected value. Means and And wherein the Mukoto.

【0007】[0007]

【実施例】次に本発明について図面を参照して説明す
る。
The present invention will be described below with reference to the drawings.

【0008】図1は、本発明の実施例における処理手順
を示す流れ図である。
FIG. 1 is a flow chart showing a processing procedure in an embodiment of the present invention.

【0009】処理ボックス1−1では、プリント配線
板、LSI等の設計上必要とする論理接続情報と各ブロ
ックの配置情報を入力し、記憶する。
In the processing box 1-1, logical connection information necessary for designing a printed wiring board, LSI, etc. and layout information of each block are input and stored.

【0010】処理ボックス1−2では、各ネットにおけ
る配線制限長を入力し、記憶する。この時、配線制限長
が存在しないネットについては、配線制限長を基板の2
辺の長さの和である半周長として記憶する。
In the processing box 1-2, the wiring limit length for each net is input and stored. At this time, if the net has no wiring limit length, the wiring limit length is
It is stored as a half circumference that is the sum of the side lengths.

【0011】処理ボックス1−3では、全ネットから1
ネットを取り出し、取り出したネットを構成するブロッ
クの配置結果より、そのネットが接続する端子の端子位
置を求め、当該ネットのスタイナー木を構成し、構成し
たスタイナー木よりそのネットの仮想配線長を計算して
求める。
In the processing box 1-3, 1 is selected from all nets.
The net is taken out, the terminal position of the terminal to which the net is connected is obtained from the placement result of the blocks constituting the taken out net, the Steiner tree of the net is constructed, and the virtual wiring length of the net is calculated from the constructed Steiner tree. And ask.

【0012】処理ボックス1−4では、次に、ネットを
各ピンペアに分解し、各ネットの配線制限長より各ネッ
トの仮想配線長を引算して求めた値を、そのネットにお
ける各ピンペアの迂回配線に対する合計の許容値として
記憶する。
In the processing box 1-4, next, the net is disassembled into each pin pair, and the value obtained by subtracting the virtual wiring length of each net from the wiring limit length of each net is the value of each pin pair in that net. It is stored as the total allowable value for the bypass wiring.

【0013】判断ボックス1−5では、全ネットについ
て、それぞれの仮想配線長を計算して、さらに許容値を
計算したか否かを判断し、全ネットについて許容値を計
算した場合は処理ボックス1−6に行き、まだ許容値を
計算していないネットが存在している場合は、処理ボッ
クス1−3に戻る。
In the judgment box 1-5, the virtual wiring lengths of all nets are calculated, and it is judged whether or not the allowable values are calculated. If the allowable values are calculated for all the nets, the processing box 1 is selected. Go to -6, and if there is a net for which the allowable value has not been calculated yet, return to processing box 1-3.

【0014】処理ボックス1−6では、全ピンペアから
1ピンペアを取り出し、取り出したピンペアのピンとピ
ンを囲む最小矩形内の配線容量と配線混雑度とを求め、
配線容量を配線混雑度で割った値を、そのピンペアの二
点間を最短経路で配線できる期待値として記憶する。
In the processing box 1-6, one pin pair is extracted from all the pin pairs, and the pins of the extracted pin pairs and the wiring capacity and the wiring congestion degree within the minimum rectangle surrounding the pins are obtained,
A value obtained by dividing the wiring capacity by the wiring congestion degree is stored as an expected value that can be wired in the shortest route between two points of the pin pair.

【0015】判断ボックス1−7では、全ピンペアにつ
いて、その二点間の最短経路で配線できる期待値を計算
したか否かを判断し、計算を終了している場合は処理ボ
ックス1−8に行き、未だ計算を終了していないピンペ
アが存在している場合は、処理ボックス1−6に戻る。
In the judgment box 1-7, it is judged whether or not the expected value that can be wired on the shortest route between the two points has been calculated for all pin pairs, and if the calculation is completed, the processing box 1-8 is entered. If there is a pin pair for which calculation has not been completed yet, the processing box 1-6 is returned to.

【0016】処理ボックス1−8では、各ピンペアの迂
回配線の許容値と二点間を最短経路で配線できる期待値
を加味して定義される評価値Vを、次式 V=α・L+β・D (Lはピンペアの迂回配線の許容値、Dは二点間を最短
経路で配線できる期待値、α,βは係数)を用いて算出
し、記憶する。
In the processing box 1-8, the evaluation value V defined by taking into consideration the allowable value of the detour wiring of each pin pair and the expected value that can be wired in the shortest route between two points is defined by the following equation V = α · L + β · It is calculated and stored using D (L is a permissible value of detour wiring of a pin pair, D is an expected value for wiring between two points in the shortest route, and α and β are coefficients).

【0017】判断ボックス1−9では、全ピンペアの迂
回配線の許容値と二点間を最短経路で配線できる期待値
とを加味した評価値を計算したか否かを判断し、計算を
終了している場合は処理ボックス1−10に行き、未だ
評価値を計算していないピンペアが存在している場合
は、処理ボックス1−8に戻る。
In the judgment box 1-9, it is judged whether or not the evaluation value in which the allowable value of the detour wiring of all pin pairs and the expected value for wiring between the two points are taken into consideration is calculated, and the calculation is ended. If there is a pin pair for which the evaluation value has not been calculated yet, the process returns to process box 1-10.

【0018】処理ボックス1−10では、処理ボックス
1−8で算出したピンペアの迂回配線の許容値と二点間
を最短経路で配線できる期待値とを加味した評価値をソ
ースキーとして、全ピンペアを評価値の小さい順にソー
トし、ソートされたピンペアの並び順に、ピンペアの配
線順序として記憶し、次の配線処理に行く。
In the processing box 1-10, all the pin pairs are used with the evaluation value considering the detour wiring allowable value of the pin pair calculated in the processing box 1-8 and the expected value for wiring the shortest route between two points as the source key. Are sorted in ascending order of evaluation value, the sorted pin pair is arranged and stored as the wiring order of the pin pair, and the next wiring process is performed.

【0019】配線処理では、処理ボックス1−10で決
定したピンペアの順序で各ピンペアを配線する。
In the wiring process, the pin pairs are wired in the order of the pin pairs determined in the processing box 1-10.

【0020】図2は、3ピンで構成されるネットで配線
制限長の厳しいネットの配線において、配線順序によっ
て配線経路が、異なることを示すイメージ図であり、分
図(A),(B),(C)の3図とも同じ配置結果であ
る。分図(A)において、2つのピンペアとも配線順序
が遅いため、両ピンペアの配線が迂回配線となり、ネッ
トの配線長が、ネットの配線制限長をオーバーしてい
る。分図(B)では、1つのピンペアの配線順序が、は
やいために迂回配線となっていないが、もう1つのピン
ペアの配線順序がおそいため迂回配線となり、ネットの
配線長としては、ネットの配線制限長をオーバーしてい
る。分図(C)は、2つのピンペアとも配線順序がはや
いため、迂回配線は起こらず、ネットの配線長も配線制
限長はオーバーしていない。
FIG. 2 is an image diagram showing that the wiring route is different depending on the wiring order in the wiring of the net having three pins and the wiring length is severe, and the diagrams (A), (B), The same arrangement result is obtained in all three views of FIG. In the diagram (A), since the wiring order of the two pin pairs is slow, the wirings of both pin pairs are detour wirings, and the net wiring length exceeds the net wiring limit length. In the diagram (B), the wiring order of one pin pair is not a detour wiring because it is fast, but it is a detour wiring because the wiring order of another pin pair is slow, and the net wiring length is the wiring of the net. The limit length is exceeded. In the diagram (C), since the wiring order of both the two pin pairs is short, detour wiring does not occur, and the wiring length of the net and the wiring limit length do not exceed.

【0021】[0021]

【発明の効果】以上説明したように本発明は、プリント
配線板、LSI等の配線設計でピンペアの配線順序の決
定において、論理接続情報とブロック配置情報を入力
し、また各ネットの配線制限長を入力して記憶し、配置
後のネットの仮想配線長を計算し、配線制限長より仮想
配線長を引いた値を、ネットの各ピンペアの迂回配線の
許容値として、各ピンペアの迂回配線の許容値を計算し
て記憶し、また、基板上の配線混雑度より、各ピンペア
の二点間を最短経路で配線できる期待値を求め、前記各
ピンペアの迂回配線の許容値と二点間を最短経路で配線
できる期待値より、迂回配線の許容値が小さく、二点間
を最短経路で配線できる期待値が低いピンペアより配線
されるように配線順序を決定することによって、配線処
理において、迂回配線の許容値の小さい、迂回配線とな
る可能性の低いピンペアより優先的に配線するので、配
線が迂回されることによる配線長制限を違反するネット
を発生しない。また、二点間を最短経路で配線できる期
待値が低いピンペアより優先的に配線することで配線混
雑度を考慮しているので、配線率が低下することを防い
でいる。
As described above, the present invention inputs the logical connection information and the block layout information in determining the wiring order of the pin pair in the wiring design of the printed wiring board, the LSI, etc., and the wiring limit length of each net. The virtual wiring length of the net after placement is calculated, and the value obtained by subtracting the virtual wiring length from the wiring limit length is set as the allowable value of the bypass wiring of each pin pair of the net, and the value of the bypass wiring of each pin pair is stored. The allowable value is calculated and stored, and the expected value that can be wired between the two points of each pin pair by the shortest route is calculated from the wiring congestion degree on the board, and the allowable value of the bypass wiring of each pin pair and the distance between the two points are calculated. By determining the wiring order so that the allowable value of detour wiring is smaller than the expected value that can be routed on the shortest route and the expected value that can be routed on the shortest route between two points is low, the detouring is performed in the routing process. Distribution Of small tolerance, since preferentially wiring lower possibly be bypass wiring pin pair generates no net violates the wiring length limited by the wiring is bypassed. In addition, since the wiring congestion degree is taken into consideration by preferentially wiring the pin pair having a low expected value that can be wired between the two points with the shortest route, it is possible to prevent the wiring rate from decreasing.

【図面の簡単な説明】[Brief description of drawings]

【図1】本発明実施例の処理手順を示す流れ図FIG. 1 is a flow chart showing a processing procedure of an embodiment of the present invention.

【図2】同一配置結果において、ピンペアの配線順序に
よって配線経路が、異なることを示すイメージ図 分図(A)は、ネットの2つのピンペアの配線順序が遅
いため、迂回配線されたことを示すイメージ図 分図(B)は、ネットの1つのピンペアの配線順序がは
やいために迂回配線されず、もう1つのピンペアは配線
順序が遅いため、迂回配線されたことを示すイメージ図 分図(C)は、ネットの2つのピンペアの配線順序がは
やいために、迂回配線されなかったことを示すイメージ
FIG. 2 is an image diagram showing that the wiring route is different depending on the wiring order of the pin pairs in the same placement result. The partial diagram (A) is an image diagram showing that the two pin pairs of the net are routed late, and thus the detour wiring is performed. The diagram (B) is an image diagram showing that one pin pair of the net is not routed by detouring because the pin order is fast, and the other pin pair is routed slowly, so the diagram (C) is Image diagram showing that the detour wiring was not performed because the wiring order of the two pin pairs of the net was quick

【符号の説明】[Explanation of symbols]

2−1 ネットを構成するピン 2−2 3ピンで構成されるネットの配線経路 2−3 他のネットのピン 2−4 他のネットの既配線経路 2−5 スルーホール(ヴィア) 2-1 Pins that make up a net 2-2 Wiring route for a net that is made up of 3 pins 2-3 Pins for another net 2-4 Routed route for another net 2-5 Through hole (via)

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】プリント配線板、LSI等の配線設計で結
線すべき全ピンペアの二点間の配線順序を決定する方法
として、 回路設計上必要な論理接続情報とブロック情報とが入力
され、また各ネットの配線パターンについての配線制限
長が入力され、 前記ブロックの配置結果より各ネットの仮想配線長を求
め、また、前記配線制限長より仮想配線長を引算した値
を求めてそのネットの各ピンペアの迂回配線についての
許容値とし、該許容値を全ネットについて求め、 次で、各ピンペアを囲む範囲内の配線容量と配線混雑度
とより、配線容量を配線混雑度で除算した値を、そのピ
ンペアの二点間を最短経路で配線できる期待値として求
め、 各ピンペアの迂回配線の前記許容値と各ピンペアの二点
間を最短経路で配線できる前記期待値との二つの値よ
り、迂回配線の許容値が小さく、かつ、二点間を最短経
路で配線できる期待値が低いピンペアより配線するよう
に配線順位を決定することを特徴とする配線順序決定方
法。
1. A method for determining a wiring order between two points of all pin pairs to be connected in a wiring design of a printed wiring board, an LSI or the like, in which logical connection information and block information necessary for circuit design are input, and The wiring limit length for the wiring pattern of each net is input, the virtual wiring length of each net is obtained from the placement result of the block, and the value obtained by subtracting the virtual wiring length from the wiring limitation length is obtained to obtain the net of that net. The allowable value for the detour wiring of each pin pair is determined, and the allowable value is calculated for all nets.Next, the value obtained by dividing the wiring capacity by the wiring congestion degree from the wiring capacity and the wiring congestion degree within the range surrounding each pin pair is calculated. , The expected value that can be routed between the two points of the pin pair by the shortest route, and the allowable value of the bypass wiring of each pin pair and the expected value that can be routed between the two points of each pin pair by the shortest route. A wiring order determining method characterized in that the wiring order is determined so that a pin pair having a smaller bypass wiring allowable value and a lower expected value that can be wired in a shortest route between two points is wired.
JP3262036A 1991-10-09 1991-10-09 Method for determining wiring order Pending JPH05101147A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3262036A JPH05101147A (en) 1991-10-09 1991-10-09 Method for determining wiring order

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3262036A JPH05101147A (en) 1991-10-09 1991-10-09 Method for determining wiring order

Publications (1)

Publication Number Publication Date
JPH05101147A true JPH05101147A (en) 1993-04-23

Family

ID=17370141

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3262036A Pending JPH05101147A (en) 1991-10-09 1991-10-09 Method for determining wiring order

Country Status (1)

Country Link
JP (1) JPH05101147A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6011912A (en) * 1996-08-15 2000-01-04 Nec Corporation Automatic routing method with net ordering for facilitated collision evasion

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6011912A (en) * 1996-08-15 2000-01-04 Nec Corporation Automatic routing method with net ordering for facilitated collision evasion

Similar Documents

Publication Publication Date Title
JP2759573B2 (en) Circuit board wiring pattern determination method
CN111709205B (en) FPGA wiring method
JPH1063697A (en) Automatic wiring method
JP2004287681A (en) Wiring design support system and wiring design support method
JPH05101147A (en) Method for determining wiring order
Chang et al. MANA: A shortest path maze algorithm under separation and minimum length nanometer rules
JP2674353B2 (en) General wiring processing method
JPH06325133A (en) Method for routing differential electric current switch pair
JP3530025B2 (en) Schematic wiring determination method and storage medium
JP3223902B2 (en) Semiconductor integrated circuit wiring method
JP2848097B2 (en) Layout design method
JP3548398B2 (en) Schematic route determination method and schematic route determination method
JPH04251961A (en) Placement design system for circuit block by cad
JP3005530B1 (en) Automatic placement and routing method
JPH05181935A (en) Automatic bundle wiring system for printed board
JP2508227B2 (en) Method for determining general wiring route of semiconductor integrated circuit
JPH05243383A (en) Automatic wiring method
JP2002215704A (en) Method and device for determining terminal position in module
JPH05159025A (en) Area division wiring system
JP2953504B2 (en) Cell placement method
JP2005107556A (en) Wiring treatment method of semiconductor integrated circuit
JPH05128212A (en) Wiring processing system
JPH07200639A (en) Automatic wiring method
JPH05258016A (en) Automatic wiring device
JPH0945775A (en) Wiring method and its automatic wiring method