← Back to Patent Explorer
US5146583A Expired / Lapsed US ⏱️ 0.0 years remaining

Logic design system for creating circuit configuration by generating parse tree from hardware description language and optimizing text level redundancy thereof

Assignee: Panasonic Holdings Corp
•
Filing: 1991-07-24
•
Granted: 1992-09-08
•
Expires: 2011-07-24
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract An apparatus and method for translating a function description of a circuit presented in hardware description language includes parsing the function description of the circuit to generate a parse tree. The structure of the parse tree is deformed to optimize the test level redundancy of the function description to thereby generate a deformed parse tree. The deformed parse tree is then translated into function blocks representing a hardware configuration of the circuit set forth by the function description.

Inventors

  • 👤 Masahiko Matsunaka
  • 👤 Tamotsu Nishiyama
  • 👤 Masahiko Ueda

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 15:30
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; Y; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/919; Y10S706/921

Claims Analysis

Total Claims: 9
Claim 1
Independent Claim 119 words
A computer processing method for translating a function description of a circuit, said computer processing method comprising: a parsing step for parsing, using a computer system, the function description of the circuit in hardware description language to generating a parse tree; a tree structure deforming step for deforming, using the computer system, a structure of the parse tree generated during said parsing step and for optimizing a text level redundancy in said parse tree; and a function block generation processing step for translating, using the computer system, the thus deformed parse tree into a circuit configuration made up of function blocks, thereby translating the function description of the circuit into connection information among function blocks as a hardware image.
Claim 2
Dependent Claim 119 words
A computer processing method for translating a function description of a circuit, said computer processing method comprising: a parsing step for parsing, using a computer system, the function description of the circuit in hardware description language to generating a parse tree; a tree structure deforming step for deforming, using the computer system, a structure of the parse tree generated during said parsing step and for optimizing a text level redundancy in said parse tree; and a function block generation processing step for translating, using the computer system, the thus deformed parse tree into a circuit configuration made up of function blocks, thereby translating the function description of the circuit into connection information among function blocks as a hardware image.
Claim 3
Dependent Claim 31 words
A computer processing method according to claim 1, said tree structure deforming step further including a step for inquiring for information relating to a user's intention regarding conversion or logic designing.
Claim 4
Dependent Claim 61 words
A computer processing method according to claim 1, further comprising a module parsing processing step for adjusting among partial circuits between strata or within a same stratum, along with a change in a hierarchical structure of circuits by hierarchical design, wherein information relating to execution of adjusting resulting from the change is inquired during an inquiring step of said parsing step.
Claim 5
Dependent Claim 81 words
A logic design system for translating a function description of a circuit, said logic design system comprising: means for parsing the function description of a circuit to generate a parse tree; means for deforming a structure of said parse tree generated by said means for parsing to generate a deformed parse tree having an optimal text level redundancy, and means for translating said deformed parse tree, generated by said means for deforming, into a circuit configuration made up of function blocks.
Claim 6
Dependent Claim 81 words
A logic design system for translating a function description of a circuit, said logic design system comprising: means for parsing the function description of a circuit to generate a parse tree; means for deforming a structure of said parse tree generated by said means for parsing to generate a deformed parse tree having an optimal text level redundancy, and means for translating said deformed parse tree, generated by said means for deforming, into a circuit configuration made up of function blocks.
Claim 7
Dependent Claim 118 words
A logic design system as recited in claim 4, further comprising first memory means for storing the syntax and dictionary of hardware description language necessary for processing of said means for parsing, second memory means for storing deformation criteria necessary for tree structural deforming of said means for deforming, third memory means for storing criteria for converting the deformed tree structure into connection information among function blocks, and fourth memory means for storing the information obtained by inquiry to confirm the intent of the designer or the data of knowledge source as translation knowledge, which are combined into a first knowledge base, wherein said first knowledge base is used when translating from said function description into function blocks.
Claim 8
Dependent Claim 47 words
A logic design system recited in claim 5, wherein a fifth knowledge base for storing criteria for changing a hierarchical structure of the circuit is further combined to said first knowledge base to compose a second knowledge base and said second knowledge base is used during processing.
Claim 9
Dependent Claim 30 words
A logic design system as recited in claim 4, further comprising means for storing deformation criteria to be used by said means for deforming a structure of said parse tree.

References Cited (Backward Citations)

US4703435A Cited
US4803636A Cited
US4791356A Cited
US4817029A Cited
US4816999A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1995-09-08 1996-03-09 1996-09-08 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1999-09-08 2000-03-09 2000-09-08 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2003-09-08 2004-03-09 2004-09-08 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag