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 serialization system for converting an input region of glyph design data into a pseudo-string; and a pattern searching system that identifies matching patterns in the glyph design data by analyzing pseudo-strings generated by the serialization system. Pattern searching may include, e.g., predefined pattern searching and redundant pattern searching.
Legal claims defining the scope of protection, as filed with the USPTO.
1. A glyph-based processing system for manipulating very large scale integrated circuit (VLSI) designs, comprising: a serialization system for converting an input region of glyph design data into a pseudo-string; and a pattern searching system that identifies matching patterns in the glyph design data by analyzing pseudo-strings generated by the serialization system.
2. The glyph-based processing system of claim 1 , wherein the glyph design data comprises L3GO design data.
3. The glyph-based processing system of claim 1 , wherein the serialization system places a serialization line within the input region and identifies glyph features that project onto the serialization line or cross boundaries of the input region, and orthogonally projects identified glyph features into a set of serialization intervals.
4. The glyph-based processing system of claim 3 , wherein each serialization interval is assigned a value that denotes: a type of interval it corresponds to, a length of the interval, and a list of glyph features that intersect the interval.
5. The glyph-based processing system of claim 1 , wherein the pattern searching system comprises a predefined pattern searching system that searches for predefined patterns by comparing generated pseudo-strings with known pseudo-strings.
6. The glyph-based processing system of claim 1 , wherein the pattern searching system comprises a redundant pattern search system that scans glyph design data, converts scanned data into pseudo-strings, and locates redundantly occurring patterns among the pseudo-strings.
7. The glyph-based processing system of claim 6 , wherein the redundant pattern search system utilizes a suffix tree to merge and store overlapping pseudo-strings.
8. The glyph-based processing system of claim 7 , wherein the redundant pattern search system further includes a sliding window system that eliminates entries in the suffix tree as associated glyph design data falls outside a scan window.
9. The glyph-based processing system of claim 8 , wherein the redundant pattern search system identifies and stores optimal patterns based on a cost function.
10. A computer program product stored on a non-transitory computer readable storage medium for processing glyph-based data in a manipulation of very large scale integrated circuit (VLSI) designs when executed by a computer device, the computer program product comprising program code for: converting an input region of glyph design data into a pseudo-string; and identifying matching patterns in the glyph design data by analyzing pseudo-strings generated from the glyph design data.
11. The computer program product of claim 10 , wherein the glyph design data comprises L3GO design data.
12. The computer program product of claim 10 : wherein the converting of an input region of glyph design data into a pseudo-string places a serialization line within the input region and identifies glyph features that project onto the serialization line or cross boundaries of the input region, and orthogonally projects identified glyph features into a set of serialization intervals; and wherein each serialization interval is assigned a value that denotes: a type of interval it corresponds to, a length of the interval, and a list of glyph features that intersect the interval.
13. The computer program product of claim 10 , wherein the identifying of matching patterns searches for predefined patterns by comparing generated pseudo-strings with known pseudo-strings.
14. The computer program product of claim 10 , wherein the identifying of matching patterns scans glyph design data, converts scanned data into pseudo-strings, and locates redundantly occurring patterns among the pseudo-strings.
15. The computer program product of claim 14 , wherein the identifying matching patterns: utilizes a suffix tree to merge and store overlapping pseudo-strings; eliminates entries in the suffix tree as associated glyph design data falls outside a scan window; and identifies and stores optimal patterns based on a cost function.
16. A method for processing glyph-based data in a manipulation of very large scale integrated circuit (VLSI) designs, comprising: utilizing a computer device for: providing a scan window for inputting glyph design data; locating the scan window on a selected input region; converting the input region of glyph design data into a pseudo-string; searching a suffix tree for matching suffixes of the pseudo-string; and storing matching suffixes in a repository.
17. The method of claim 16 , further comprising relocating the scan window to a new input region.
18. The method of claim 16 , further comprising providing a cost function to find an optimal set of matching suffixes.
19. The method of claim 16 , wherein the pseudo-string includes a set of serialization intervals, wherein each serialization interval is assigned a value that denotes: a type of interval, a length of the interval, and a list of glyph features that intersect the interval.
20. The method of claim 16 , wherein the glyph design data comprises L3GO design data.
Cooperative Patent Classification codes for this invention. Click any code to explore related patents in that topic.
January 9, 2007
October 26, 2010
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.