Patents by Inventor Kobi Kresh
Kobi Kresh has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 8751981Abstract: A technique for reducing a circuit listing. According to examples of the technique, at least a portion of a circuit listing is analyzed to identify occurrences of a circuit structure made up of a plurality of circuit components. For each identified occurrence of the defined circuit structure, an injection data object is created corresponding to the plurality of components, and the injection data object is substituted into the portion of the circuit listing in place of the plurality of components. For each occurrence of the defined structure, one or more properties of the occurrence of the defined structure may be determined and contained by the corresponding injection data object.Type: GrantFiled: June 25, 2012Date of Patent: June 10, 2014Assignee: Mentor Graphics CorporationInventors: Fedor G. Pikus, Kobi Kresh
-
Publication number: 20120266117Abstract: A technique for reducing a circuit listing. According to examples of the technique, at least a portion of a circuit listing is analyzed to identify occurrences of a circuit structure made up of a plurality of circuit components. For each identified occurrence of the defined circuit structure, an injection data object is created corresponding to the plurality of components, and the injection data object is substituted into the portion of the circuit listing in place of the plurality of components. For each occurrence of the defined structure, one or more properties of the occurrence of the defined structure may be determined and contained by the corresponding injection data object.Type: ApplicationFiled: June 25, 2012Publication date: October 18, 2012Applicant: MENTOR GRAPHICS CORPORATIONInventors: Fedor G. Pikus, Kobi Kresh
-
Patent number: 8225246Abstract: A technique for reducing a circuit listing. According to examples of the technique, at least a portion of a circuit listing is analyzed to identify occurrences of a circuit structure made up of a plurality of circuit components. For each identified occurrence of the defined circuit structure, an injection data object is created corresponding to the plurality of components, and the injection data object is substituted into the portion of the circuit listing in place of the plurality of components. For each occurrence of the defined structure, one or more properties of the occurrence of the defined structure may be determined and contained by the corresponding injection data object.Type: GrantFiled: March 9, 2010Date of Patent: July 17, 2012Assignee: Mentor Graphics Corp.Inventors: Fedor G. Pikus, Kobi Kresh
-
Publication number: 20100162192Abstract: A technique for reducing a circuit listing. According to examples of the technique, at least a portion of a circuit listing is analyzed to identify occurrences of a circuit structure made up of a plurality of circuit components. For each identified occurrence of the defined circuit structure, an injection data object is created corresponding to the plurality of components, and the injection data object is substituted into the portion of the circuit listing in place of the plurality of components. For each occurrence of the defined structure, one or more properties of the occurrence of the defined structure may be determined and contained by the corresponding injection data object.Type: ApplicationFiled: March 9, 2010Publication date: June 24, 2010Applicant: MENTOR GRAPHICS CORPORATIONInventors: Fedor G. Pikus, Kobi Kresh
-
Patent number: 7716611Abstract: A technique for reducing a circuit listing. According to examples of the technique, at least a portion of a circuit listing is analyzed to identify occurrences of a circuit structure made up of a plurality of circuit components. For each identified occurrence of the defined circuit structure, an injection data object is created corresponding to the plurality of components, and the injection data object is substituted into the portion of the circuit listing in place of the plurality of components. For each occurrence of the defined structure, one or more properties of the occurrence of the defined structure may be determined and contained by the corresponding injection data object.Type: GrantFiled: November 13, 2004Date of Patent: May 11, 2010Assignee: Mentor Graphics CorporationInventors: Fedor G. Pikus, Kobi Kresh
-
Publication number: 20060107240Abstract: A technique for reducing a circuit listing. According to examples of the technique, at least a portion of a circuit listing is analyzed to identify occurrences of a circuit structure made up of a plurality of circuit components. For each identified occurrence of the defined circuit structure, an injection data object is created corresponding to the plurality of components, and the injection data object is substituted into the portion of the circuit listing in place of the plurality of components. For each occurrence of the defined structure, one or more properties of the occurrence of the defined structure may be determined and contained by the corresponding injection data object.Type: ApplicationFiled: November 13, 2004Publication date: May 18, 2006Applicant: Mentor Graphics Corp.Inventors: Fedor Pikus, Kobi Kresh
-
Patent number: 6918100Abstract: A technique is provided for determining a hierarchical effectiveness for a cell in a data structure. The hierarchical effectiveness indicates how effective the use of the cell will be in executing a task with the data structure. A technique is also provided for determining the hierarchical effectiveness of all of the cells in a data structure, to determine which cells should be employed to execute a task with the data structure.Type: GrantFiled: March 31, 2003Date of Patent: July 12, 2005Assignee: Mentor Graphics Corp.Inventors: Kobi Kresh, Phillip A. Brooks
-
Publication number: 20040199880Abstract: A technique is provided for determining a hierarchical effectiveness for a cell in a data structure. The hierarchical effectiveness indicates how effective the use of the cell will be in executing a task with the data structure. A technique is also provided for determining the hierarchical effectiveness of all of the cells in a data structure, to determine which cells should be employed to execute a task with the data structure.Type: ApplicationFiled: March 31, 2003Publication date: October 7, 2004Inventors: Kobi Kresh, Philip Brooks