JPS6367679A - Automatic wiring method - Google Patents

Automatic wiring method

Info

Publication number
JPS6367679A
JPS6367679A JP61213183A JP21318386A JPS6367679A JP S6367679 A JPS6367679 A JP S6367679A JP 61213183 A JP61213183 A JP 61213183A JP 21318386 A JP21318386 A JP 21318386A JP S6367679 A JPS6367679 A JP S6367679A
Authority
JP
Japan
Prior art keywords
search
point
searching
segment
singular
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.)
Granted
Application number
JP61213183A
Other languages
Japanese (ja)
Other versions
JPH0543149B2 (en
Inventor
Ichiro Kato
一郎 加藤
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 Corp
Original Assignee
NEC Corp
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 Corp filed Critical NEC Corp
Priority to JP61213183A priority Critical patent/JPS6367679A/en
Publication of JPS6367679A publication Critical patent/JPS6367679A/en
Publication of JPH0543149B2 publication Critical patent/JPH0543149B2/ja
Granted legal-status Critical Current

Links

Abstract

PURPOSE:To ensure a high wiring factor at high speed in an automatic wiring system by combining the characteristics of a riber method that assures the high-speed searching properties and a highly efficient wiring procedure and the characteristics of a meys method that always detects a route if exists. CONSTITUTION:A searching segment 3 moving down from a start point 1 of a pin pair along a peculiar line 2 having its search priority direction set downward travels along a fault 4 and avoiding this fault 4 at the right side. Then the segment 3 hits a fault 5 and carries on searching like a searching segment 6. When the segment 6 meets the line 2, the searching direction of the segment 6 is changed to the down side with preference to be followed by a searching segment 7. Then the segment 7 hits the fault 5. At this time point, the latest spot where a searching action is carried out on the line 2 is equal to a peculiar point 8. The searching job is taken over by a searching segment 9 and reaches a closed loop point 10 so that a fault exists at a pointer near the right side of a traveling course. Then the searching segment travels again by a right moving rule to perform the searching job like the segment 6.

Description

【発明の詳細な説明】 〔産業上の利用分野〕 本発明は自動配線方法、特に、電気系CADシステムの
プリント基板やハイブリッドIC等のCADで、最適な
配線レイアクトの自動配線方法に関するものである。
[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to an automatic wiring method, in particular, to an automatic wiring method for optimal wiring layout in CAD for printed circuit boards, hybrid ICs, etc. of electrical CAD systems. .

〔従来の技術〕[Conventional technology]

従来の自動配線方法は、配線経路が存在していてもそj
、が複雑な経路である場合必ず5見するとは限らないも
のが多く、確実に経路?見つけ出す方法としては、メイ
ズ法(Lee、C,V、:An algo −rith
m for Path Connections an
d ItsApplications、IRE Tra
ns、Electron、Co −mput、、Vol
、ECl0.pp、346−365(1961)と呼ば
詐るものがおるのみである。しかるに、ノイズ法は平面
上に波紋を広げるように経路を探索するため他の自動配
線方法に比べ多くの処理時間を要する。
Conventional automatic wiring methods do not allow wiring even if a wiring route exists.
If , is a complicated route, there are many cases where it is not always possible to see 5, so it is definitely a route? As a method for finding
m for Path Connections an
d Its Applications, IRE Tra
ns, Electron, Co-mput,, Vol.
, ECl0. pp. 346-365 (1961). However, since the noise method searches for a route so as to spread ripples on a plane, it requires more processing time than other automatic wiring methods.

Proc、12th  Annual  ACM Sy
mp、on  Th−eory of Computi
ng、pp、161−176(1980))は−直線上
に経路探索を行ない必要に応じて探索方向を変更してい
く方法であり、処理速度が速い。しかもこの方法は、複
数の結線すべきピンの対、すなわちピンベアの結線順位
を一括して考慮するtめ、他の自動配線方法には見らf
′L、ない効率的な配線手順が見られる。
Proc, 12th Annual ACM Sy
mp, on Theory of Computi
ng, pp. 161-176 (1980)) is a method in which a route is searched along a straight line and the search direction is changed as necessary, and the processing speed is fast. Moreover, this method is different from other automatic wiring methods because it considers the connection order of multiple pin pairs, that is, pin bears, all at once.
'L, no efficient wiring procedure is seen.

高速メイズ法(Soukup、J、:Fast Maz
eRouter、Proc、15th  Design
  Aut。
Fast Maz method (Soukup, J.: Fast Maz
eRouter, Proc, 15th Design
Out.

mation  Conf、、pp、100−102(
1978))等、処理時間の速いメイズ法も発表さnて
いるが、このような効率的な特性は持っていない。
tion Conf,, pp, 100-102 (
Although Maze methods with fast processing times have been announced, such as 1978), they do not have such efficient characteristics.

次に従来の自動配線方法の内リバー法について図面を参
照して詳細に説明する。第3図は従来の自動配線方法の
リバー法の一例を示すレイアウト図である。開始点19
から直下に引かれた特異線20に沿って探索線分21が
下方向に進み、障害22に出合う。ここで探索線分21
は、進行方向右手近傍に常に障害が存在するように向き
を変え、その後もこの法則に従って探索線分23のよう
に障害に沿って進む。探索線分23が特異線24に出会
うと優先的に方向を上方に変え探索線分25のように探
索を進める。探索は終了点26に到達し九時点で完了し
、開始点19から終了点26までの配線経路が探索線分
21,23.25によって得ら詐る。
Next, the river method among conventional automatic wiring methods will be explained in detail with reference to the drawings. FIG. 3 is a layout diagram showing an example of the river method of the conventional automatic wiring method. Starting point 19
A search line segment 21 moves downward along a singular line 20 drawn directly below the point , and encounters an obstacle 22 . Here search line segment 21
changes direction so that the obstacle is always near the right hand in the direction of travel, and then continues along the obstacle as shown by the search line segment 23 according to this law. When the search line segment 23 encounters the singular line 24, the direction is preferentially changed upward and the search proceeds as in the search line segment 25. The search is completed when the end point 26 is reached and the wiring route from the start point 19 to the end point 26 is obtained by the search line segments 21, 23, and 25.

〔発明が解決しようとする問題点〕[Problem that the invention seeks to solve]

上述した従来の自動配線方法のリノ(−法は、配線経路
が存在していてもそれが複雑な経路である場合、ノイズ
法のように必ず発見するとは限らない0 第4図はリバー法における経路発見失敗の一例を示すレ
イアクト図である。ピンペアの開始点1から、探索優先
方向が下方になる特異線2に沿って下に降りた探索線分
3は、障害4を右手づたい避けながら障害に沿って進み
、障害5にぶつかって探索線分6のように、嘔らに探索
を進める。探索線分6が障害5にぶつかシ、探索は探索
線分9にひきつが扛て進行方向右手近傍に障害がおるよ
うに探索し閉ループ点10に到達する。ここの地点は既
に探索済みであシ、こCから同様の探索規則を芙行して
も同じ探索の繰り返しにな、す、障害5を抜は出る事な
く探索は失敗り終わる。
The above-mentioned conventional automatic wiring method, Reno (- method, does not always discover the wiring route even if it exists, if it is a complicated route, unlike the noise method. It is a layout diagram showing an example of route discovery failure.A search line segment 3 descends from the starting point 1 of a pin pair along a singular line 2 whose search priority direction is downward, while avoiding an obstacle 4 on the right. Proceed along the obstacles, hit obstacle 5, and proceed with the search like search line segment 6. Search line segment 6 hits obstacle 5, and the search continues with search line segment 9. Search so that the obstacle is near the right hand side of the direction and reach closed loop point 10.This point has already been searched, so even if you repeat the same search rule from here C, the same search will not be repeated. , the search ends in failure without getting past obstacle 5.

すなわち従来のリバー法は、特異線2があるために障害
から脱出できず配線できないという欠点があった。
In other words, the conventional river method has the disadvantage that it is impossible to escape from a fault and cannot be wired due to the presence of the singular line 2.

〔問題点を解決するための手段〕[Means for solving problems]

本発明の自動配線方法は、結線開始点から直下に基板下
辺まで探索を優先的にその線分に沿って下方向に行なう
第一の特異線を引き結線終了点から直下に基板下辺まで
探索を優先的にその線分に沿って上方向に行なう第二の
特異線を引く特異線設定段階と、探索点が前記第一の特
異線あるいは第二の特異線上にある場合を除いて前記結
線開始点から配線経路を進行方向に対し右手方向近傍に
障害が存在するように右手づたいに探索を進める第一の
経路探索段階と、前記第一の経路探索段階で第一の特異
線上に探索点があるが故に右手方向近傍に障害がない場
合でもそのまま下方向に探索を進めるに至った最新の点
を第一の特異点として記憶し第二の特異線上に探索点が
あるが故に右手方向近傍に障害がない場合でもそのまま
上方向に探索を進めるに至った最新の点を第二の特異点
として記憶する特異点記憶段階と、前記第一の探索段階
を適用して前記結線開始点と前記結線終了点が結線でき
なかった場合前記結線開始点から前記第一の特異点まで
の特異線の特性を無効にし前記第二の特異線と基板下辺
の交わる点から前記第二の特異点までの特異線の特性を
無効にして前記第一の経路探索段階と同様の探索法則で
探索を再開する第二の経路探索段階とを含んで構成ざn
る。
The automatic wiring method of the present invention is to draw a first singular line that searches directly below the connection start point to the bottom edge of the board, preferentially searching downward along that line segment, and searches directly below the connection end point to the bottom edge of the board. A singular line setting step in which a second singular line is drawn upwardly along the line segment; and a step in which the connection is started, except when the search point is on the first singular line or the second singular line. A first route search stage in which the wiring route is searched from a point to the right hand so that an obstacle exists in the vicinity of the right hand direction with respect to the traveling direction, and a search point is located on the first singular line in the first route search stage. Therefore, even if there is no obstacle near the right hand direction, the latest point that led to the search proceeding downward is stored as the first singular point, and since the search point is on the second singular line, there is no fault near the right hand direction. Even if there is no singular point, the search continues upward, and the latest point is stored as a second singular point, and the first search step is applied to store the connection start point and the connection end point. If the points cannot be connected, the characteristics of the singular line from the connection start point to the first singular point are invalidated, and the singular line from the point where the second singular line intersects the bottom side of the board to the second singular point is disabled. and a second route searching stage in which the characteristics of the route searching stage are invalidated and the search is resumed using the same search rule as the first route searching stage.
Ru.

〔実施例〕〔Example〕

次に、本発明の実施例について、図面を参照して詳細に
・説明する。
Next, embodiments of the present invention will be described in detail with reference to the drawings.

第1図は本発明の一実施例を示すレイアウト図である。FIG. 1 is a layout diagram showing an embodiment of the present invention.

ビンベアの開始点1から、探索優先方向が下方になる特
異線2に沿って下に降夛た探索線分3は、障害4を右手
づたい避けながら障害に沿って進み、障害5にぶつかっ
て探索線分6のように、さらに探索を進める。このよう
な探索の最中に逐次、特異線21にどこまで探索したか
特異点として記憶しておく。探索線分6が特異線2に出
会うと、優先的に下方向に探索方向を変え探索線分7に
引き継がれ、探索線分7は、障害5にぶつかる。この時
点で、′特異線2上の探索がなされた最新の地点は特異
点8である。探索は、探索線分9にひきつがれて進行方
向右手近傍に障害があるように探索し閉ループ点10に
到達する。
Search line segment 3 descends from Bin Bear's starting point 1 along singular line 2 whose search priority direction is downward, moves along the obstacle while avoiding obstacle 4 on the right, and hits obstacle 5. The search is further advanced as shown in the search line segment 6. During such a search, the extent to which the search has been made is sequentially stored on the singular line 21 as a singular point. When the search line segment 6 encounters the singular line 2, the search direction is preferentially changed downward and is taken over by the search line segment 7, and the search line segment 7 collides with the obstacle 5. At this point, the latest point searched on singular line 2 is singular point 8. The search follows the search line segment 9 and searches for an obstacle near the right hand in the direction of travel until a closed loop point 10 is reached.

ここの地点は既に探索済みであるが、閉ループ点10は
開始点1と特異点8との間に位置しているので再探索?
実行する。再探索は、探索線分9゜7.6と後戻りしな
がら、閉ループ点10まで戻りそこから再開する。
This point has already been searched, but since closed loop point 10 is located between starting point 1 and singular point 8, should we search again?
Execute. The re-search goes back through the search line segment 9°7.6, returns to the closed loop point 10, and restarts from there.

この閉ループ点10よシ再び右手づたいの法則で進み探
索線分6のように探索をする。探索線分6は、特異線2
に出会うがこの地点は開始点1と特異点8との間に位置
しているので、特異線2の持つ下方向の優先探索の特性
は効果を示さず、探索線分6は右手づたいの法則をその
まま適応して探索線分11に引き継がれる。障害5に沿
って探索は進み、探索線分12が特異線2に到達すると
、この地点は開始点1と特異点8との間にはないので、
4!IF異線2の優先方向指定の効果が効き、探索線分
12は優先的に特異線2に沿って下方向に降pる。探索
線分12Fi、障害13にぶつかって進行方向右手近傍
に障害があるように方向を変え、探索線分14として障
害13に沿って探索を進める。探索線分14が、第二の
特異線15に出会うと優先的に上方向に向きを変更する
。探索線分14は、障害16にぶつかり右手づたいに障
害16に沿って進み、再び特異線15に出会う。ここで
優先的に上方向に向きが変更さ詐、探索線分17に引き
継がnて特異線17に沿って上方向に進行し、終了点1
8に到達して探索を完了する。
From this closed loop point 10, proceed again according to the right hand rule and search as shown in the search line segment 6. Search line segment 6 is singular line 2
However, since this point is located between the starting point 1 and the singular point 8, the downward preferential search characteristic of the singular line 2 has no effect, and the search line segment 6 follows the right-hand rule. The search line segment 11 is adapted as it is and carried over to the search line segment 11. The search proceeds along the obstacle 5, and when the search line segment 12 reaches the singular line 2, this point is not between the starting point 1 and the singular point 8, so
4! The effect of specifying the priority direction of the IF unusual line 2 is effective, and the search line segment 12 descends downward along the singular line 2 preferentially. The search line segment 12Fi hits the obstacle 13 and changes direction so that the obstacle is near the right hand side in the direction of travel, and the search proceeds along the obstacle 13 as the search line segment 14. When the search line segment 14 encounters the second singular line 15, it preferentially changes its direction upward. The search line segment 14 encounters an obstacle 16, moves along the obstacle 16 to the right, and encounters the singular line 15 again. Here, the direction is changed preferentially upward, and the search line segment 17 takes over and proceeds upward along the singular line 17, ending at the end point 1.
Reach 8 to complete the search.

第2図は、第1図の実施例の説明図を流j、図で示した
ものである。
FIG. 2 is a diagrammatic illustration of the embodiment of FIG. 1.

〔発明の効果〕〔Effect of the invention〕

本発明の自動配線方法は、リバー法の高速探索性と効率
の良い配線手順という特性を失わず、なおかつメイズ法
のよりに経路があればかならず発見するという重要な特
性を合わせ持った方法であフ、自動配線実行における高
配線率が高速に得られるという効果がある。
The automatic wiring method of the present invention does not lose the characteristics of the River method, such as high-speed search performance and efficient wiring procedures, and also has the important characteristic of always finding a route, if any, than the Maze method. The second advantage is that a high wiring rate can be quickly obtained during automatic wiring execution.

【図面の簡単な説明】[Brief explanation of the drawing]

第1図は本発明の一実施例を示すレイアクト図、第2図
は第1図に示す自動配線方法の手順?示す7°−7・−
1・第3図$9(D−例を示す′イト・・・・・開始点
、2・−・・・・特異線、3・・・・・・探索線分、4
〜5・・・・・・障害、6〜7・・・・・・探索線分、
8・・・・・・特異点、9・・・・・・探索線分、10
・・・・・・閉ループ点、11〜12・・・・・−探索
線分、13・・・・・・障害、14・・・・・・探索線
分、15・・・・・・特異線、16・・・・・・障害、
17・・・・・・探索線分、18・・・・・・終了点、
19・・・・・・開始点、20・・・・・・特異線、2
1・・・・・・探索線分、22・・・・・・障害、23
・・・・・・探索線分、24・・・・・・特異線、25
・・・・・・探索線分、26・・・・・・終了点。 、  )・ 代理人 弁理士  内 原   晋 ゝ−2−
Figure 1 is a layout diagram showing one embodiment of the present invention, and Figure 2 is the procedure for the automatic wiring method shown in Figure 1. 7°−7・−
1. Figure 3 $9 (D-Example)... Starting point, 2... Singular line, 3... Search line segment, 4
~5... Obstacle, 6~7... Search line segment,
8... Singularity, 9... Search line segment, 10
......Closed loop point, 11-12...-Search line segment, 13...Obstacle, 14...Search line segment, 15...Singularity Line, 16... Obstacle,
17...search line segment, 18...end point,
19...Starting point, 20...Singular line, 2
1...search line segment, 22...obstacle, 23
...Search line segment, 24...Singular line, 25
...Search line segment, 26...End point. )・Representative Patent Attorney Susumu Uchihara-2-

Claims (1)

【特許請求の範囲】[Claims] 結線開始点から直下に基板下辺まで探索を優先的にその
線分に沿って下方向に行なう第一の特異線を引き結線終
了点から直下に基板下辺まで探索を優先的にその線分に
沿つて上方向に行なう第二の特異線を引く特異線設定段
階と、探索点が前記第一の特異線あるいは第二の特異線
上にある場合を除いて前記結線開始点から配線経路を進
行方向に対し右手方向近傍に障害が存在するよりに右手
づたいに探索を進める第一の経路探索段階と、前記第一
の経路探索段階で第一の特異線上に探索点があるが故に
右手方向近傍に障害がない場合でもそのまま下方向に探
索を進めるに至った最新の点を第一の特異点として記憶
し第二の特異線上に探索点があるが故に右手方向近傍に
障害がない場合でもそのまま上方向に探索を進めるに至
った最新の点を第二の特異点として記憶する特異点記憶
段階と、前記第一の探索段階を適用して前記結線開始点
と前記結線終了点が結線できなかった場合前記結線開始
点から前記第一の特異点までの特異線の特性を無効にし
前記第二の特異線と基板下辺の交わる点から前記第二の
特異点までの特異線の特性を無効にして前記第一の経路
探索段階と同様の探索法則で探索を再開する第二の経路
探索段階とを含むことを特徴とする自動配線方法。
Draw a first singular line that preferentially searches from the connection start point to the bottom edge of the board, and searches downwards along that line segment. and a singular line setting step in which a second singular line is drawn in the upward direction, and the wiring route is moved in the traveling direction from the connection starting point except when the search point is on the first singular line or the second singular line. On the other hand, there is a first route search stage in which the search is performed in a right-hand manner because there is an obstacle in the vicinity of the right hand direction, and in the first route search stage, there is an obstacle in the vicinity of the right hand direction because the search point is on the first singular line. Even if there is no obstacle, the search continues downward.The latest point that led to the search is stored as the first singular point.Since the search point is on the second singular line, even if there is no obstacle near the right hand direction, the search continues upward. A singularity storage stage in which the latest point at which the search has proceeded is stored as a second singularity, and a singularity storage stage in which the first search stage is applied to the case where the connection start point and the connection end point cannot be connected. The characteristic of the singular line from the connection start point to the first singular point is invalidated, and the characteristic of the singular line from the point where the second singular line and the lower side of the board intersect to the second singular point is invalidated, An automatic wiring method characterized by comprising a second route searching stage in which the search is restarted using the same search rule as the first route searching stage.
JP61213183A 1986-09-09 1986-09-09 Automatic wiring method Granted JPS6367679A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP61213183A JPS6367679A (en) 1986-09-09 1986-09-09 Automatic wiring method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP61213183A JPS6367679A (en) 1986-09-09 1986-09-09 Automatic wiring method

Publications (2)

Publication Number Publication Date
JPS6367679A true JPS6367679A (en) 1988-03-26
JPH0543149B2 JPH0543149B2 (en) 1993-06-30

Family

ID=16634918

Family Applications (1)

Application Number Title Priority Date Filing Date
JP61213183A Granted JPS6367679A (en) 1986-09-09 1986-09-09 Automatic wiring method

Country Status (1)

Country Link
JP (1) JPS6367679A (en)

Also Published As

Publication number Publication date
JPH0543149B2 (en) 1993-06-30

Similar Documents

Publication Publication Date Title
US5615128A (en) Towards optimal steiner tree routing in the presence of rectilinear obstacles
JP3608832B2 (en) Automatic wiring method and automatic wiring apparatus
JPS6367679A (en) Automatic wiring method
CN109933857B (en) Clock tree trunk topology generation method and system for sensing integrated circuit layout information
JP3052561B2 (en) Automatic wiring method
JPH0477949B2 (en)
JP2646818B2 (en) Automatic wiring method
JPH10198722A (en) Production system for interactive wiring pattern
JPS63204301A (en) Method for deciding optimum packing route of nc packing machine
JPH0544058B2 (en)
JP3014157B2 (en) Automatic wiring method
JP3560451B2 (en) Layout method of semiconductor integrated circuit
JPH0460774A (en) Automatic wiring system
JPH0652260A (en) Automatic wiring method
JPH0677321A (en) Automatic wiring method
JPH04289975A (en) Wiring layout searching system
JP2982017B2 (en) Automatic wiring processing method
JPH04141779A (en) System for searching wiring path
JPH05258016A (en) Automatic wiring device
JPH07152814A (en) Route searching method using idle segment
JPH04130967A (en) Method for processing wiring
JPH07249065A (en) Wiring path search method
JPH01321563A (en) Searching system for wiring route
JPH04236671A (en) Automatic peeling/rewiring method
JPH0683911A (en) Method and device for determining wiring path

Legal Events

Date Code Title Description
R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

S531 Written request for registration of change of domicile

Free format text: JAPANESE INTERMEDIATE CODE: R313531

R350 Written notification of registration of transfer

Free format text: JAPANESE INTERMEDIATE CODE: R350

R250 Receipt of annual fees

Free format text: JAPANESE INTERMEDIATE CODE: R250

EXPY Cancellation because of completion of term