Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method comprising: providing a layout with at least three pins to be coupled together using a single net; adding a Steiner point to the layout; determining a path between the Steiner point and a first pin of the at least three pins by using a computer, wherein the determining comprises: determining a position of a spine segment between the Steiner point and the first pin; connecting the Steiner point to the spine segment using a first subspine segment; and connecting the first pin to the spine segment using a second subspine segment; determining a path between the Steiner point and a second pin of the at least three pins; and determining a path between the Steiner point and a third pin of the at least three pins, wherein the determining a path between the Steiner point and a first pin of the at least three pins comprises: ordering portions of the nets, wherein the ordering comprises: when n pins of a net are to be routed, where n is an integer two or greater, determining at least n−1 routing problems to be solved; determining an order of solving the at least n−1 routing problems; when an X-orientation section of a first one of the at least n−1 routing problems is longer than a second one of the at least n−1 routing problems, ordering the first one of the at least n−1 routing problems before the second one of the at least n−1 routing problems; and when an X-orientation section of a third one of the at least n−1 routing problems is longer than the second, but shorter than the first, ordering the third one of the at least n−1 routing problems after the first one of the at least n−1 routing problems, but before the second one of the at least n−1 routing problems.
This invention relates to integrated circuit (IC) design, specifically to optimizing the routing of electrical connections (nets) between multiple pins in a layout. The problem addressed is efficiently connecting three or more pins using a single net while minimizing routing congestion and wirelength. The method involves adding a Steiner point to the layout, which acts as a central connection hub for the pins. A computer determines paths between the Steiner point and each pin by constructing a spine segment and connecting it to subspine segments. The routing process prioritizes longer X-orientation sections first to reduce congestion. For nets with n pins, the method breaks the routing into n-1 subproblems, solving them in an order based on their X-orientation lengths. This ensures that longer horizontal segments are routed before shorter ones, improving layout efficiency. The approach optimizes both the physical routing and the computational steps required to achieve a valid connection.
2. The method of claim 1 where the spine segment may be longer than the first subspine segment, and the spine segment may be longer than the second subspine segment.
This invention relates to a method for constructing a hierarchical data structure, specifically a spine-and-subspine configuration, to improve data organization and retrieval efficiency. The problem addressed is the need for a scalable and flexible data structure that can accommodate varying lengths of data segments while maintaining efficient access and manipulation. The method involves creating a primary spine segment and at least two subspine segments. The spine segment serves as the main data container, while the subspine segments are secondary containers that branch from the spine. A key feature is that the spine segment can be longer than either of the subspine segments, allowing for greater flexibility in data distribution. This design enables efficient partitioning of data, where the spine can hold larger datasets or more complex structures, while the subspines handle smaller, more specific subsets. The hierarchical relationship ensures that data retrieval follows a logical path, reducing search time and computational overhead. The method also includes mechanisms for dynamically adjusting the lengths of the spine and subspine segments based on data requirements, ensuring adaptability to different use cases. This approach is particularly useful in applications requiring hierarchical data management, such as databases, file systems, or network routing tables, where efficient organization and quick access are critical. The invention provides a scalable solution that balances performance and flexibility in data handling.
3. The method of claim 1 where the determining a path between the Steiner point and a second pin of the at least three pins results in a path having at most three segments.
This invention relates to optimizing interconnect routing in integrated circuits, specifically for reducing the number of segments in paths between pins and a Steiner point. The problem addressed is the inefficiency in traditional routing methods that create excessive segments, leading to longer wire lengths, increased resistance, and higher manufacturing complexity. The solution involves determining a path between a Steiner point and a second pin among at least three pins, ensuring the path has no more than three segments. This constraint simplifies the routing structure while maintaining connectivity. The method may also include selecting the Steiner point based on geometric relationships with the pins, such as minimizing the total wire length or ensuring the path adheres to design rules. The approach is particularly useful in high-density integrated circuits where minimizing routing complexity is critical for performance and yield. By limiting the number of segments, the invention reduces the risk of signal integrity issues and improves manufacturability. The technique can be applied in automated routing tools to enhance efficiency in physical design flows.
4. The method of claim 1 where the net coupling the three pins together will intersect at the Steiner point, or at as near a point as is possible.
This invention relates to electrical circuit design, specifically optimizing the routing of electrical connections between three pins to minimize signal delay and interference. The problem addressed is the inefficient routing of electrical connections in integrated circuits, which can lead to increased signal propagation delays, crosstalk, and power consumption. The solution involves a method for coupling three pins together using a net that intersects at the Steiner point, or as close to it as possible. The Steiner point is the optimal geometric location that minimizes the total wire length connecting the three pins, reducing signal delays and improving circuit performance. The method ensures that the net connecting the three pins follows the shortest possible path, thereby minimizing resistance and capacitance effects. This approach is particularly useful in high-speed digital circuits where signal integrity and timing are critical. By optimizing the routing of the net, the invention reduces the overall footprint of the circuit, improves signal quality, and enhances energy efficiency. The technique can be applied in various electronic design automation (EDA) tools to automate the placement and routing of interconnects in integrated circuits.
5. The method of claim 1 where the net coupling the three pins together will include two or more layers of conductor.
A method for electrically coupling three pins in an electronic device involves using a conductive net with two or more layers of conductive material. The conductive net is designed to provide a robust electrical connection between the pins, ensuring reliable signal or power transmission. The use of multiple conductive layers enhances the net's conductivity, reduces resistance, and improves durability, particularly in high-stress or high-frequency applications. This approach is useful in integrated circuits, printed circuit boards, or other electronic assemblies where stable electrical connections are critical. The method addresses challenges such as signal integrity degradation, thermal stress, and mechanical wear, which can occur in single-layer conductive nets. By incorporating multiple conductive layers, the net maintains consistent performance under varying environmental and operational conditions. The technique is particularly beneficial in applications requiring high reliability, such as aerospace, automotive, or medical electronics, where failure of electrical connections can have significant consequences. The conductive layers may be composed of materials like copper, aluminum, or conductive polymers, depending on the specific requirements of the application. The method ensures that the three pins remain electrically coupled even under mechanical stress or temperature fluctuations, improving overall system reliability.
6. The method of claim 1 where the determining a path between the Steiner point and a third pin of the at least three pins is according to a gridless approach.
This invention relates to integrated circuit (IC) design, specifically optimizing interconnect routing for multi-pin nets using a gridless approach. The problem addressed is efficiently determining optimal paths between multiple pins in a net, particularly when using Steiner points to minimize wire length and improve signal integrity. Traditional grid-based routing methods can be restrictive, leading to suboptimal paths or increased complexity. The method involves selecting a Steiner point, which is a virtual point used to connect multiple pins in a net, and determining a path between this Steiner point and a third pin in the net. Unlike grid-based routing, which relies on predefined grid lines, this approach uses a gridless method, allowing for more flexible and potentially shorter paths. The gridless approach evaluates possible routes without being constrained by a fixed grid, enabling better optimization of wire length and routing efficiency. This method can be applied to any multi-pin net in an IC design, improving overall routing performance and reducing manufacturing complexity. The invention enhances routing algorithms by leveraging gridless techniques to achieve more efficient and adaptable interconnect solutions.
7. The method of claim 1 wherein a net connecting the three pins is detemined not to be legal, selecting a new Steiner point at different position than the previous Steiner point.
The invention relates to integrated circuit design, specifically to routing methods for connecting multiple pins in a layout while ensuring compliance with design rules. The problem addressed is the need to efficiently route connections between pins while avoiding illegal configurations, such as those that violate spacing or connectivity constraints. The method involves determining a net connecting three pins and checking whether the net is legal according to predefined design rules. If the net is found to be illegal, the method selects a new Steiner point—a virtual point used to optimize routing paths—at a different position than the previously selected Steiner point. This adjustment ensures that the routing path adheres to the design rules, preventing violations such as excessive wire congestion or improper spacing. The process may involve iterative adjustments to the Steiner point until a legal configuration is achieved. The method is part of a broader routing technique that optimizes the placement of Steiner points to minimize wire length and improve manufacturability while ensuring compliance with electrical and physical constraints. By dynamically repositioning Steiner points, the method avoids illegal routing configurations that could lead to manufacturing defects or performance issues. The approach is particularly useful in high-density integrated circuits where precise routing is critical.
8. The method of claim 1 wherein as a result of the determining a path between the Steiner point and a first pin of the at least three pins by using a computer, a first region within the initial structure is an increasing cost region and a second region within the initial structure is a minimum cost region.
This invention relates to computer-aided design (CAD) for integrated circuits, specifically optimizing interconnect routing in a semiconductor layout. The problem addressed is efficiently determining low-cost routing paths between multiple pins in a circuit while minimizing wiring congestion and ensuring manufacturability. The method involves analyzing an initial layout structure containing at least three pins and a Steiner point—a theoretical point used to optimize connections between the pins. A computer determines a path between the Steiner point and a first pin, dividing the layout into two regions: an increasing cost region and a minimum cost region. The increasing cost region represents areas where routing would incur higher costs due to congestion, design rules, or other constraints, while the minimum cost region identifies optimal routing paths with minimal cost. The method ensures that routing decisions balance performance, area, and manufacturability by leveraging cost-based analysis. By identifying these regions, the system can prioritize routing in the minimum cost region, reducing overall layout complexity and improving circuit performance. This approach is particularly useful in advanced semiconductor nodes where routing congestion and design rule constraints are critical. The technique enhances automated routing tools by providing a structured way to evaluate and select optimal paths.
9. The method of claim 1 wherein the determining a path between the Steiner point and a first pin of the at least three pins by using a computer comprises: sorting the at least n−1 routing problems according to distance in a first dimension; and solving one of the at least n−1 routing problems with a longest distance in the first dimension before other routing problems.
This invention relates to optimizing routing paths in electronic circuit design, specifically for connecting multiple pins via a Steiner point to minimize total wire length. The problem addressed is efficiently determining the shortest path between a Steiner point and multiple pins in a circuit layout, which is computationally intensive due to the combinatorial nature of routing problems. The method involves solving multiple routing problems between a Steiner point and at least three pins. The routing problems are sorted based on their distance in a first dimension (e.g., x or y-axis). The routing problem with the longest distance in this dimension is solved first, followed by the remaining problems. This prioritization reduces computational complexity by leveraging geometric properties, ensuring that the longest path is resolved early, which can simplify subsequent routing decisions. The solution is implemented using a computer to automate the path determination process. By sorting and prioritizing routing problems based on dimensional distance, the method improves efficiency in circuit layout optimization, particularly in high-density designs where minimizing wire length is critical for performance and manufacturability. The approach is applicable to various routing algorithms in electronic design automation (EDA) tools.
10. The method of claim 1 wherein the determining a path between the Steiner point and a first pin of the at least three pins by using a computer is performed using shape-based routing.
This invention relates to electronic circuit design, specifically optimizing signal routing in integrated circuits. The problem addressed is efficiently determining optimal paths between multiple connection points (pins) in a circuit layout, particularly when using intermediate connection points (Steiner points) to minimize routing congestion and improve signal integrity. The method involves using a computer to calculate a path between a Steiner point and at least one of the pins in the circuit. The path determination is performed using shape-based routing, which constructs paths as geometric shapes (e.g., rectangles or other polygons) rather than traditional wire-like connections. This approach simplifies routing in dense layouts by reducing the number of sharp turns and overlaps, improving manufacturability and performance. The method may also include generating a routing graph representing possible connections, identifying Steiner points to reduce routing complexity, and optimizing the paths to avoid conflicts with other circuit elements. Shape-based routing ensures that the paths are compatible with manufacturing constraints while maintaining signal integrity. The technique is particularly useful in high-density designs where traditional routing methods may fail due to congestion or design rule violations.
11. The method of claim 1 wherein the layout is not grid based.
Electronics design and layout. A method for generating an electronic circuit layout. The method includes arranging electronic components on a substrate. The arrangement of these components defines a spatial relationship between them. Crucially, this spatial arrangement is not constrained to a predefined grid of discrete positions. Instead, components can be positioned and oriented with arbitrary precision, allowing for a more flexible and potentially optimized placement that deviates from a rigid, rectilinear structure. This non-grid-based approach offers a departure from traditional, grid-aligned layout methodologies.
12. The method of claim 1 wherein the layout is grid based.
This invention relates to a method for organizing and displaying data in a grid-based layout. The method addresses the challenge of efficiently presenting structured information in a clear and accessible format, particularly for applications requiring precise spatial arrangement, such as user interfaces, data visualization, or design tools. The method involves arranging elements within a grid structure, where each element is positioned according to predefined rows and columns. This grid-based approach ensures consistent alignment and spacing, improving readability and usability. The grid can be dynamically adjusted to accommodate varying data sizes or user preferences, allowing for flexible yet structured layouts. Additionally, the method may include features such as snapping elements to grid lines, resizing elements proportionally within grid constraints, and aligning elements to grid intersections. These features enhance precision and reduce manual adjustments, making the method suitable for applications where alignment accuracy is critical. The grid-based layout can be applied to various types of data, including text, images, or interactive components, and can be adapted for different display sizes or orientations. This method is particularly useful in digital design, data dashboards, or any system requiring organized visual presentation. By providing a structured yet adaptable framework, the method improves efficiency in data organization and user interaction, addressing the need for both consistency and flexibility in visual layouts.
13. A shape-based routing method comprising: providing n pins of a layout to be routing using a single net, where n is an integer two or greater; determining whether to add and adding at least one Steiner point to the layout; decomposing the net into at least n−1 routing problems to be solved by using a computer; determining an order to solve the routing problems; solving the routing problems in the order determined; and finding the net coupling the n pins together, wherein the decomposing the net into at least n−1 routing problems to be solved by using a computer comprises: ordering portions of the nets, wherein the ordering comprises: when n pins of a net are to be routed, where n is an integer two or greater, determining the at least n−1 routing problems to be solved; when an X-orientation section of a first one of the at least n−1 routing problems is longer than a second one of the at least n−1 routing problems, ordering the first one of the at least n−1 routing problems before the second one of the at least n−1 routing problems; and when an X-orientation section of a third one of the at least n−1 routing problems is longer than the second, but shorter than the first, ordering the third one of the at least n−1 routing problems after the first one of the at least n−1 routing problems, but before the second one of the at least n−1 routing problems.
This technical summary describes a shape-based routing method for connecting multiple pins in an integrated circuit layout using a single net. The method addresses the challenge of efficiently routing complex nets with multiple pins by decomposing the routing problem into smaller, more manageable subproblems. The process begins by providing a layout with n pins, where n is an integer of two or greater, and optionally adding Steiner points to optimize the routing. The net is then decomposed into at least n−1 routing subproblems, which are solved in a specific order to ensure optimal connectivity. The decomposition involves ordering the subproblems based on the length of their X-orientation sections, prioritizing longer sections to be solved first. This ensures that the routing process is systematic and efficient, reducing congestion and improving overall layout performance. The method leverages computational techniques to determine the optimal routing paths, ultimately producing a net that couples all n pins together while minimizing routing complexity and resource usage.
14. The method of claim 13 where when a Steiner point is added, there will be at least n routing problems to be solved.
This invention relates to network optimization, specifically improving the efficiency of routing in networks by strategically adding Steiner points. The problem addressed is the computational complexity and suboptimal routing that occurs when determining the shortest paths in networks, particularly in scenarios where intermediate nodes (Steiner points) are introduced to reduce overall path lengths. Traditional methods often fail to account for the increased complexity when adding Steiner points, leading to inefficient routing solutions. The invention describes a method for optimizing network routing by ensuring that when a Steiner point is added to a network, the routing problem is decomposed into at least n distinct subproblems. Each subproblem corresponds to a different segment of the network, allowing for parallel processing or sequential optimization. This approach reduces the computational burden by breaking down the problem into manageable parts, ensuring that the addition of Steiner points does not lead to an intractable routing problem. The method also includes techniques for dynamically adjusting the number of subproblems based on network conditions, such as node density or traffic patterns, to further enhance efficiency. The result is a more scalable and adaptable routing solution that maintains optimal path lengths while minimizing computational overhead.
15. The method of claim 13 where when a Steiner point is added, there will be a separate routing problem for each route between one of the n pins to the Steiner point.
This invention relates to optimizing routing in electronic circuit design, specifically addressing the challenge of efficiently connecting multiple pins in a network while minimizing total wire length. The method involves adding Steiner points to reduce the overall routing complexity and improve signal integrity. When a Steiner point is introduced, the routing process is divided into separate sub-problems, each corresponding to a distinct route between one of the n pins and the Steiner point. This decomposition allows for more precise control over individual connections, ensuring that each segment of the network is optimized independently. The approach helps in reducing congestion, balancing load distribution, and minimizing signal delays by strategically placing Steiner points to create shorter, more direct paths. The method is particularly useful in high-density integrated circuits where traditional routing techniques may lead to inefficiencies or bottlenecks. By breaking down the routing into smaller, manageable problems, the invention enhances the overall performance and reliability of the circuit design.
16. The method of claim 13 where the determining an order to solve the at least n−1 routing problems comprises: sorting the routing problems according to a distance between a pin and the Steiner point.
This invention relates to electronic design automation, specifically optimizing routing in integrated circuits. The problem addressed is efficiently solving multiple routing problems in a network, particularly when connecting multiple pins to a common Steiner point, which is a central node in a minimum spanning tree. The challenge is determining an optimal sequence to solve these routing problems to minimize computational effort and improve routing efficiency. The method involves solving at least n−1 routing problems, where n is the number of pins to be connected. The key innovation is determining the order in which these routing problems are solved by sorting them based on the distance between each pin and the Steiner point. By prioritizing routing problems with shorter distances, the method reduces the complexity of subsequent routing steps, as shorter connections are easier to resolve first. This approach leverages the geometric properties of the network to streamline the routing process, ensuring that the most straightforward connections are addressed early, which simplifies the remaining routing tasks. The method is particularly useful in high-density integrated circuit designs where efficient routing is critical to performance and manufacturability.
17. The method of claim 13 wherein n is 3 or greater.
A system and method for optimizing data processing in a distributed computing environment addresses inefficiencies in handling large-scale data operations. The invention focuses on improving computational efficiency by dynamically adjusting the number of parallel processing nodes (n) to balance workload distribution and resource utilization. When n is set to 3 or greater, the system enables enhanced parallelism, allowing multiple nodes to process data concurrently while minimizing bottlenecks. This configuration ensures that tasks are distributed evenly, reducing idle time and improving overall throughput. The method includes dynamically scaling the number of nodes based on workload demands, ensuring optimal performance without overloading individual components. By increasing n to 3 or more, the system achieves better fault tolerance and load balancing, making it suitable for high-performance computing applications. The invention is particularly useful in scenarios requiring real-time data processing, such as big data analytics, machine learning, and cloud computing, where efficient resource management is critical. The dynamic adjustment of processing nodes ensures adaptability to varying workloads, enhancing system reliability and performance.
18. The method of claim 13 wherein as a result of the decomposing the net into at least n−1 routing problems to be solved by using a computer, a first region within the initial structure is an increasing cost region and a second region within the initial structure is a minimum cost region.
This invention relates to network optimization, specifically methods for decomposing complex routing problems into simpler subproblems to improve computational efficiency. The problem addressed is the computational complexity of solving large-scale routing problems in networks, which can be impractical for real-time applications due to high computational costs. The method involves decomposing a network into multiple routing subproblems, where the original network is divided into regions based on cost characteristics. The decomposition results in at least n−1 routing problems, where n is the number of nodes or subproblems in the original network. The decomposition identifies at least two distinct regions within the network: a first region where routing costs increase and a second region where routing costs are minimized. These regions are determined using computational techniques to analyze the network structure and cost functions. The subproblems are then solved independently or in parallel, reducing the overall computational burden while maintaining solution accuracy. This approach is particularly useful in large-scale network optimization, such as in logistics, telecommunications, or transportation systems, where efficient routing is critical. The method leverages computational efficiency to handle complex routing scenarios that would otherwise be computationally infeasible.
19. The method of claim 13 wherein the layout is not grid based.
This invention relates to a method for organizing and displaying data elements in a non-grid layout. The core problem addressed is the rigidity and inflexibility of traditional grid-based layouts, which often fail to accommodate dynamic or irregularly shaped data elements efficiently. The solution involves a layout system that dynamically arranges elements without relying on a predefined grid structure, allowing for more natural and adaptable visual presentations. The method includes generating a layout for a set of data elements, where the layout is not constrained by a grid. Instead, it uses spatial relationships and constraints to position elements in a way that optimizes visual clarity and usability. This approach is particularly useful for applications where data elements vary in size, shape, or orientation, such as interactive dashboards, data visualizations, or user interfaces with complex content. The system may also incorporate user-defined rules or algorithms to determine element placement, ensuring that the layout adapts to different contexts or user preferences. Additionally, the method may include dynamic adjustments to the layout in response to changes in the data or user interactions, maintaining an optimal arrangement without manual intervention. By eliminating grid-based constraints, this method enables more flexible and intuitive data presentations, improving user experience and adaptability in various applications.
20. A method comprising: providing n pins of a layout to be routing using a single net, where n is an integer two or greater; determining whether to add and adding at least one connection point to the layout; decomposing the net into at least n−1 routing problems to be solved by using a computer; determining an order to solve the routing problems; solving the routing problems in the order determined; and finding the net coupling the n pins together, wherein the decomposing the net into at least n−1 routing problems to be solved by using a computer comprises: ordering portions of the nets, wherein the ordering comprises: when n pins of a net are to be routed, where n is an integer two or greater, determining the at least n−1 routing problems to be solved; when an X-orientation section of a first one of the at least n−1 routing problems is longer than a second one of the at least n−1 routing problems, ordering the first one of the at least n−1 routing problems before the second one of the at least n−1 routing problems; and when an X-orientation section of a third one of the at least n−1 routing problems is longer than the second, but shorter than the first, ordering the third one of the at least n−1 routing problems after the first one of the at least n−1 routing problems, but before the second one of the at least n−1 routing problems.
The field of electronic design automation (EDA) involves routing multiple pins in an integrated circuit layout using a single net. A challenge in this process is efficiently connecting all pins while minimizing congestion and ensuring manufacturability. This invention addresses this by decomposing a net with n pins (where n is two or more) into at least n−1 smaller routing problems. The method first determines whether to add connection points to the layout. It then decomposes the net into routing subproblems, prioritizing those with longer X-orientation sections to be solved first. The routing problems are solved in a determined order, ensuring the net connects all pins. The decomposition and ordering strategy optimizes routing efficiency by handling longer sections early, reducing congestion and improving layout quality. The method is implemented using a computer to automate the routing process, enhancing design automation in integrated circuit manufacturing.
21. The method of claim 20 wherein the layout is gridless.
A system and method for designing and manufacturing printed circuit boards (PCBs) with a gridless layout approach. Traditional PCB design relies on predefined grid systems to align components and traces, which can limit design flexibility and optimization. This invention eliminates the grid constraint, allowing for precise, non-aligned placement of components and routing of conductive traces. The gridless layout enables finer control over component spacing, trace widths, and routing paths, improving signal integrity, reducing electromagnetic interference, and optimizing space utilization. The method includes generating a gridless design file, where components and traces are positioned without reference to a fixed grid, and then manufacturing the PCB based on this design. The system may also include automated tools for verifying design rules, ensuring manufacturability, and optimizing performance in the absence of a grid. This approach is particularly useful in high-density, high-performance applications where traditional grid-based designs may introduce inefficiencies or limitations. The invention enhances design flexibility, reduces material waste, and improves overall PCB performance.
22. The method of claim 20 wherein the layout is gridded.
A system and method for organizing and displaying data in a structured format to improve user interaction and efficiency. The invention addresses the challenge of presenting complex or large datasets in a way that is intuitive and easily navigable, particularly in applications such as user interfaces, dashboards, or data visualization tools. The method involves arranging data elements in a predefined grid layout, where each element is positioned according to a structured grid pattern. This grid-based approach ensures consistent spacing, alignment, and organization of data, enhancing readability and usability. The grid layout may include adjustable parameters such as cell size, spacing, and orientation to accommodate different types of data and user preferences. Additionally, the system may allow dynamic adjustments to the grid structure in response to user input or changes in the underlying data. The gridded layout can be applied to various types of data, including text, images, or interactive elements, and may be integrated into software applications, web interfaces, or other digital platforms. The invention improves user experience by providing a clear, organized, and adaptable framework for data presentation.
Unknown
September 8, 2020
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.