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

Complete optimal Steiner tree construction method based on lookup table

A construction method and look-up table technology, which is applied in the field of complete and optimal Steiner tree construction based on look-up tables, can solve the problems that cannot meet the needs of complex integrated circuit environments and multi-network optimization.

Active Publication Date: 2022-01-18
南京集成电路设计服务产业创新中心有限公司
View PDF8 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

A single minimal Steiner tree selection is completely unable to meet the needs of complex environments and multi-network optimization in integrated circuit design

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
  • Complete optimal Steiner tree construction method based on lookup table
  • Complete optimal Steiner tree construction method based on lookup table
  • Complete optimal Steiner tree construction method based on lookup table

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0046] figure 1 For the complete optimal Steiner tree construction method flowchart based on the look-up table of the present invention, reference will be made below figure 1 , the method for constructing the complete optimal Steiner tree based on the lookup table of the present invention is described in detail.

[0047] First, in step 101, the index corresponding to the node set is calculated.

[0048]In the embodiment of the present invention, for a node set with n nodes (n is an integer greater than 1), the relative positions of the nodes distributed on the Hanan grid are n! One possibility is to establish the mapping between the relative position of the node and the label through mathematical calculation, and use the label as the entry of the potential minimum line length lookup table and the lookup table of the complete optimal Steiner tree.

[0049] In the embodiment of the present invention, by sorting each node in the set according to the X coordinate from small to 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 discloses a complete optimal Steiner tree construction method based on a lookup table. The complete optimal Steiner tree construction method comprises the following steps: calculating a node set corresponding mark number; obtaining a minimum line length vector through a potential minimum line length vector lookup table; through the complete optimal Steiner tree lookup table, constructing a complete optimal Steiner tree; constructing a minimum rectangular Steiner tree through the complete optimal Steiner tree; and by establishing a multi-layer lookup table, carrying out data compression on a potential minimum line length vector lookup table and the complete optimal Steiner tree lookup table. According to the complete optimal Steiner tree construction method based on the lookup table, a method for rapidly constructing all possible minimum rectangular Steiner trees is provided with a very small storage space, and enough freedom is provided for a wiring tool so that the optimal minimum rectangular Steiner trees in different environments are rapidly obtained.

Description

technical field [0001] The present invention relates to the technical field of Electronic Design Automation (EDA), in particular to a method for constructing a complete and optimal Steiner tree based on a lookup table. Background technique [0002] As the production process of VLSI is advancing to the deep submicron and nanometer scale, the scale of integrated circuits is getting larger and the system is becoming more and more complex. This also brings new challenges to electronic design automation (EDA) tools. In particular, new requirements are put forward for the performance and running speed of integrated circuit physical design (Physical Design) tools. [0003] The Rectilinear Steiner minimal tree (RSMT) is a tree with the shortest Manhattan distance connecting a given set of nodes (Pin) by adding additional nodes (steiner points, Steiner points). In the design of VLSI, the construction of the smallest rectangular Steiner tree is a basic problem. It can be applied in...

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): G06F30/394G06F30/398
CPCG06F30/394G06F30/398
Inventor 谢春蕾陈刚姜阳田
Owner 南京集成电路设计服务产业创新中心有限公司
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