Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Construction method and device for barrier-bypassing eight-fork Steiner minimum tree

A construction method and minimum tree technology, applied in special data processing applications, instruments, electrical digital data processing, etc., can solve the problems of not considering the existence of obstacles, complex implementation, etc., and achieve the effect of improving wiring performance and reducing bus length

Inactive Publication Date: 2015-03-25
FUDAN UNIV
View PDF3 Cites 7 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the relevant research has not considered the situation of obstacles in the actual wiring.
Some studies have considered obstacles, but the construction process needs to divide the generated graph, which is very complicated to implement, and the length of the Steiner tree line obtained by considering the timing constraints is not necessarily optimal.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Construction method and device for barrier-bypassing eight-fork Steiner minimum tree
  • Construction method and device for barrier-bypassing eight-fork Steiner minimum tree
  • Construction method and device for barrier-bypassing eight-fork Steiner minimum tree

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0069] The heuristic idea based on tree decomposition and merging that test step 3 of the present invention proposes obtains the performance of the right-angle Steiner minimum tree that bypasses the obstacle of this line network wiring, and VoB S. The paper " Steiner's" published on Discrete Applied Mathematics "problem in graphs:heuristic methods" to compare several classic heuristic algorithms. The test examples used in the experiment are taken from the OR-Library standard test set, and the test results in Table 1 below are obtained. It can be seen that, compared with the traditional classical heuristic algorithms DNH and MPH, the tree-based decomposition and merging algorithm proposed by the present invention can obtain better wiring results.

[0070] Table 1 compares different heuristic algorithms

[0071] case

Embodiment 2

[0073] The wiring line length obtained by testing the eight-point Steiner minimum tree method for quickly and efficiently building around obstacles proposed by the present invention is compared with the traditional right-angle Steiner minimum tree line length around obstacles. The test examples are randomly generated on a wiring plane of 10000×10000. Group tests based on the number of endpoints and obstacles generated, and take the average of 20 instances in each group of tests. The test results in Table 2 below were obtained. Among them, N and M represent the number of endpoints to be connected and the number of obstacles respectively. V and E represent the number of vertices and edges of the Escape graph. L1 represents the line length of the traditional right-angle Steiner minimum tree that bypasses obstacles, and L2 represents the line length of the eight-point Steiner minimum tree that bypasses obstacles proposed by the present invention. As can be seen therefrom, the l...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention belongs to the technical field of integrated circuits and particularly relates to a construction method and device for a barrier-bypassing eight-fork Steiner minimum tree used for automatic wire arrangement of an X-shaped interconnection structure. According to the method, firstly, an Escape graph and a grid matrix of a wire arrangement plane are obtained; secondly, a barrier-bypassing right-angle Steiner minimum tree is obtained through the graph decomposition technology, the Steiner tree construction technology and the combination technology; thirdly, five kinds of geometric transformation are introduced according to newly-added 45-degree and 135-degree wire arrangement trends, and finally the required barrier-bypassing eight-fork Steiner minimum tree is obtained. The device comprises an input unit, an output unit, a program storage unit, an external bus, a memory, a storage management unit, an input and output bridging unit, a system bus and a processor. A program for the construction method of the Steiner minimum tree is stored in the program storage unit. By means of the construction method and device, a wire arrangement result of the barrier-bypassing eight-fork Steiner minimum tree of an input line network can be obtained quickly and effectively.

Description

technical field [0001] The invention belongs to the field of integrated circuits, and relates to a method for constructing an octagonal Steiner minimum tree that bypasses obstacles. Specifically, it relates to an eight-fork Steiner minimum tree construction method and a device thereof for bypassing obstacles in automatic wiring of an X-shaped interconnection structure. Background technique [0002] The Steiner minimum tree problem is a classic problem in combinatorial optimization and computational geometry, and has important applications in the fields of computer network layout, circuit design, and biological network analysis. The traditional Steiner minimum tree and its various derived problems have been widely concerned by scholars at home and abroad for many years. Due to its important role in the routing of integrated circuits, the construction of a right-angle Steiner minimum tree that bypasses obstacles has become a hot research topic in this field in recent years. ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F17/50
Inventor 曾璇朱恒亮杨帆董君
Owner FUDAN UNIV
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com