Process and apparatus to assign coordinates to nodes of logical trees without increase of wire lengths
US7111267B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 27, 2004 |
| Grant date | Sep 19, 2006 |
| Priority date | — |
| Expiry date | Dec 9, 2024 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F30/392
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
An iterative process assigns nodes of a new logical tree to positions in a space that was previously assigned to an old logical tree equivalent to the new logical tree. A path in the new tree is identified for an essential node of the new tree. Coordinates of a position in the space are identified for an old tree node that is equivalent to a son of the essential node. Coordinates are iteratively identified for each node in the new tree path using a free space algorithm and based on the nodes of the new tree path and the coordinates identified for the old tree node that is equivalent to the son of the essential node. If all sons of the essential node are leaves of the new tree, the old tree node is a leaf node equivalent to the son. Otherwise, the old tree node is identified in a prior iteration.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.