JPS59189471A - Wiring route searching system - Google Patents

Abstract

PURPOSE:To search wiring route in a short time by obtaining starting point and end point of existing wiring from tracing from a fault point, cancelling this wiring and at the same time, developing obtained route on a memory map. CONSTITUTION:When making wiring beween routes (1)-(3), if a fault point (3) between existing wiring route (4)-(5) is given, starting point (4), end point (5) are determined by tracing existing wiring. The starting point (4) and end point (5) are stored in a stack, and the wiring route (4)-(5) is deleted from a memory map. Then, a route (1)-(2) is searched by a route searching section and developed on the memory map. When the route is not found, deletion of existing wiring route is repeated from next fault point. When the route (1)-(2) is found, the starting point and end point data stored in the stack are taken out. Adjoining route (6)-(7) is stored in the stack by similar processing, and the route (4)-(5) is inserted.

Description

DETAILED DESCRIPTION OF THE INVENTION TECHNICAL FIELD The present invention relates to a wiring route search system for wiring design of logic circuit diagrams.

BACKGROUND ART Conventionally, in this type of wiring route search, a program is used to search for routes between bins in the order determined by priority determination processing. If a route cannot be found, the route search is repeated by moving the existing wiring one by one. Such methods require a large number of trials and require a large amount of computer time. Therefore, if it is not found after a certain number of repeats, a connector is generated to perform interlaced display.

Purpose of the Invention The purpose of the present invention is to search for wiring routes in logic circuit diagrams.
The object of the present invention is to solve the problem that FL computers and software require a large amount of computer time, and to provide a wiring route search system that searches for wiring routes in a short time.

Structure of the Invention The system of the present invention includes a route search processing unit that searches for a wiring route between two given points, and a route search unit that searches for a wiring route between two given points, and a route search unit that searches for a route that has already been routed when wiring cannot be completed.
゛A route change processing unit for moving, a wiring control unit that performs search and change repeat control, and input/output of data, a memory map that stores the occupation status of wiring grids, and a route data storage that stores route information. including the section.

Example Next, the present invention will be explained in detail with reference to the drawings.

Referring to FIG. 1, one embodiment of the present invention includes a wiring control unit 3
, a wiring route searching section 5, a wiring route changing section 6, and a memory map 7.

Next, the operation of this embodiment will be explained in detail.

First, the wiring control section 3 inputs fault data and develops it on the memory map 7 as a prohibited area. Next, the wiring control section 3 manually sends the connection data, in which the wiring has been prioritized, to the route search processing section 5 one after another.

The route search processing unit 5 searches the memory map for the given connection data between two points using several types of limited patterns to find a route with the fewest bends and least intersections with existing wiring. If no route is found, the route change processing section 6 changes the existing wiring. In this wiring change processing, first, the route search processing unit 5 stores the failure point on the existing route that has caused the failure, and the route change processing unit performs tracing from the failure point to find the start and end points of the existing wiring. At the same time, this wiring is canceled and the determined route is developed on the memory map.

Next, a route search is performed again in an area adjacent to the canceled connection data, and if no route is found, an attempt is made to change other existing wiring.

If the route is not found even after the wiring change processing is repeated at the last trench, a connector is generated and an interlaced display is made.

The above processing is repeated until no connection data is inputted, and when all is completed, the wiring control section 3 traces the memory map, extracts wiring route data, and performs a check.

Next, an example of the route search processing section 5 will be explained using FIG. 2. Basic patterns as shown in FIG. 2 are defined for data between two given points, and searches are performed sequentially starting from the simplest patterns. Figure 2 (b) within the same pattern
), the search is performed within the shaded area in the direction of the arrow. When a route is found, the number of intersections with existing wiring is memorized and the search continues. Next, when a route is found, the one with the least number of intersections is chosen.

Searching for a route using one pattern ends when all areas within the shaded area are completed, or when the number of intersections in the route excluding the connections in the shaded area has already exceeded the number of intersections stored, and the route is found. If so, the route is developed on the memory map and the search process ends.

If no route is found, the search proceeds according to the next pattern.

Next, an example of the route change processing section 6 will be explained using FIG. In Fig. 3(a), when wiring between ■ and ■, if a failure point (3) between the existing wiring route property) and ■ is given, the starting point ■ the ending point (5) can be traced by tracing the existing wiring. is required. The starting point ■ and ending point ■ are stored in the stack,
Wiring routes (4) to (2) are deleted from the memory map.

Next, the route search unit searches for the route ■~ri and stores it in the memory.
Expanded on map. If no route is found here, deletion of the already wired route from the next failure point is repeated.

When the route ■～■ is found, the start and end point data stored in the stack is retrieved and the @contact route ('G) is retrieved.
~■ is stored in the stack in the same way ((1) ~ (5
). This process is repeated until there are no more adjacent failed routes.

The present invention has the advantage that a wiring route can be easily determined in a short time using a wiring route search processing system.

[Brief explanation of drawings]

FIG. 1 is a diagram showing an embodiment of the present invention, FIG. 2 is a diagram showing an example of a wiring route pattern in the present invention, and FIG. 3 is a diagram showing an example of a wiring route change processing section. . As shown in Figure 1, 1... connection information data, 2...
...Fault information data, 3...Wiring control unit, 4...Wiring route cap data, Death/ring...Wiring route search unit, 6... Wiring route changing section, 7...
...Memory mump section start end (ar) φhs (b) (I))' (C) Figure 3

Claims (1)

[Scope of Claims] A route search processing unit that searches for a wiring route in a logic circuit diagram using several types of limited connection patterns, a route data storage unit that stores the searched route data, and a case in which wiring cannot be completed. A wiring route search system comprising: a wiring change processing unit for moving an existing wiring route; and a route search control unit for controlling execution of route search and change processing.