Graph-Based Pattern Matching for L3GO VLSI Designs
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The manipulation of L3GO VLSI designs faces challenges due to variability in patterns and resolution of ambiguities, as existing methods require extensive sets of predefined patterns with fixed sizes, which is impractical and inefficient, especially when dealing with complex interactions and refinements between design features.
Innovation Solution
A system and method that utilize a pattern description language to define variable patterns and a graph-based pattern matching system, allowing for the creation of glyph layouts with variable properties and prioritization of pattern placements to resolve ambiguities and support complex pattern interactions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If predefined patterns with fixed sizes are used, then pattern matching is simpler, but the system cannot handle variability in patterns and requires tens of thousands of patterns to cover all potential size configurations
Solution Approach 1:
The patent applies parameter changes by transforming fixed-size patterns into variable-size patterns where dimensions are expressed as parameters rather than constants. This allows a single pattern definition to accommodate multiple size configurations through parameter instantiation, reducing the pattern set from tens of thousands to a manageable number while maintaining adaptability to different design requirements
Solution Approach 2:
The patent implements universality by creating a single pattern framework that can serve multiple functions through parameterization. Instead of requiring separate pattern definitions for each size configuration, the system uses one universal pattern template that adapts to different instances through parameter substitution, thereby reducing complexity while maintaining versatility
2Adaptability or versatility
If variable patterns are used to cover all size configurations, then pattern versatility is improved, but computational complexity of pattern identification increases
Solution Approach 1:
The patent applies segmentation by dividing the pattern matching process into distinct phases: pattern encoding into graph representations, graph construction from layout data, and graph comparison to identify matches. This segmentation allows the system to handle variable patterns systematically through structured processing steps, reducing the computational burden of identifying matches among variable-size pattern instances
3Adaptability or versatility
If multiple overlapping patterns are used to handle complex interactions, then design flexibility is improved, but ambiguity resolution becomes more difficult
Solution Approach 1:
The patent introduces graph representations as an intermediary between pattern definitions and layout implementations. Graphs serve as a mediating structure that encodes pattern relationships and interactions, allowing the system to systematically resolve ambiguities by comparing graph structures against each other and selecting consistent interpretations, thereby making ambiguity resolution more manageable despite having multiple overlapping patterns
Data Source
AI summary
A system and method for processing glyph-based data associated with generating very large scale integrated circuit (VLSI) designs. A system is provide that includes a system for defining variable patterns using a pattern description language to create a glyph layout; and a graph-based pattern matching system that can identify potential matches amongst variable patterns in the glyph layout.