3DIC Routing Graphs for Manufacturable Netlist Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The increasing complexity of three-dimensional integrated circuit (3DIC) designs makes it difficult to generate manufacturable netlists that adhere to changing configurations, leading to unmanufacturable devices due to violations of the 3DIC configuration, especially with the addition of interposers or complex die arrangements.
Innovation Solution
A method and system for generating a manufacturable netlist by creating a routing graph, performing net routing, determining valid modified routing graphs, and selecting an updated netlist that satisfies the 3DIC configuration and is logically equivalent to the initial netlist, using graph traversal algorithms for efficient routing.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If traditional netlist generation methods are used for 3DIC designs, then the design process can proceed with standard tools, but the generated netlists may violate 3DIC configuration constraints and result in unmanufacturable devices
Solution Approach 1:
The patent performs net routing and validates routing graphs against 3DIC configuration constraints before final netlist generation. This preliminary validation ensures that netlists are manufactured-compliant before being passed to fabrication, preventing costly rework and ensuring ease of manufacture while managing complexity through early constraint checking.
Solution Approach 2:
The system implements iterative validation where routing graphs are generated, validated against 3DIC constraints, and modified if violations are detected. This feedback loop continues until a compliant netlist is produced, ensuring manufacturability while systematically managing the complexity of configuration verification through automated constraint checking.
2Manufacturing precision
If routing validation is performed to ensure 3DIC configuration compliance, then manufacturable netlists are generated, but computational time and complexity increase
Solution Approach 1:
The patent segments the netlist generation process into distinct phases: initial net routing, routing graph generation, validation against 3DIC constraints, and iterative modification if needed. This segmentation allows for targeted computational effort at each stage, improving manufacturing precision through systematic validation while managing overall computational time by avoiding redundant processing.
Solution Approach 2:
The system performs validation on routing graphs at multiple levels, checking critical 3DIC configuration constraints thoroughly while potentially using simplified checks for less critical aspects. This partial validation approach ensures compliance with essential manufacturing requirements without expending excessive computational resources on all possible verification aspects.
3Reliability
If routing graphs are modified to satisfy 3DIC configuration, then correct netlists are produced, but the complexity of graph manipulation increases
Solution Approach 1:
The system implements automated self-validation and self-correction mechanisms where routing graphs are automatically checked against 3DIC constraints and modified programmatically if violations are detected. This self-service approach ensures reliability of the generated netlists while reducing the need for complex manual graph manipulation, as the automated system handles the complexity of modifications.
Solution Approach 2:
The patent modifies routing graphs by changing parameters such as net routing paths, connection topologies, and die-to-die interconnect configurations to satisfy 3DIC constraints. These parameter changes are performed systematically through algorithmic manipulation rather than complex structural reorganization, ensuring correctness while managing the complexity of graph manipulation through focused parameter adjustment.
Data Source
AI summary
A processing device generates a routing graph in accordance with a three-dimensional integrated circuit (3DIC) configuration of a 3DIC device. The processing device performs net routing with respect to the routing graph. The processing device determines, based on a net routing result of the net routing, whether at least one valid modified routing graph exists in view of an initial netlist corresponding to the 3DIC device. In response to determining that at least one valid modified routing graph exists, the processing device selects a modified routing graph from the at least one valid modified routing graph. The processing device generates, based on the modified routing graph, an updated netlist that satisfies the 3DIC configuration and is logically equivalent to the initial netlist.