# US 2015/0149972 A1 · Method, design apparatus, and program product for incremental design space exploration

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2015/0149972 A1
- Document ID: US20150149972A1
- Status: Published application
- Kind: A1
- Application number: 14/611,584
- Filed: 2015-02-02
- Published: 2015-05-28
- Earliest claimed: 2013-06-03
- Assignees: NEC Corporation
- Inventors: Benjamin CARRION SCHAFER
- Web page: https://patentgrep.com/patent/US20150149972A1

## CPC

- G06F 30/327: Logic synthesis; Behaviour synthesis, e.g. mapping logic, HDL to netlist, high-level language to RTL or netlist
- G06F 2111/06: Multi-objective optimisation, e.g. Pareto optimisation using simulated annealing [SA], ant colony algorithms or genetic algorithms [GA]
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A design apparatus generates an optimal design condition by design space exploration. The apparatus including a source code parsing (301) which parses source code and generates a parse tree, a cluster generation task (302) which generates clusters based on the parse tree, each of the clusters including a group of source codes which can operate independently, a log file task (303) which generates a log file based on a structure of the cluster, and a comparison task (304) which compares a first log file of a previous cluster with a second log file of a current cluster and re-uses previous exploration result based on a comparison result, the first log file being obtained from a previous design space exploration, the second log file being generated from a current operation.

## Claims

### Claim 1

A method for performing incremental exploration of LSI circuits given a behavioral circuit description, comprising method operation of:
parsing a behavioral LSI description generating unique identifiers for each part of source codes explored independently;
recording a main information of designs being explored so that this information can be retrieved at later explorations;
identifying which parts of the source code have been modified between different exploration runs; and
exploring only parts of the designs which have been affected by manual changes in the source code.

### Claim 2 (depends on 11)

The method according to claim 11, wherein the method operation includes the generation of a log file where all the necessary information to recover a design generated during an exploration is recorded including the results of a high level synthesis, the attributes applied to the explorable operations, and a cluster contents index.

### Claim 3 (depends on 11)

The method according to claim 11, wherein the method operation includes a cluster contents index, which is represented in a single unique alpha numerical value, and the contents of a piece of a behavioral description being explored.

### Claim 4 (depends on 11)

The method according to claim 11, wherein the method operation includes:
an execution of an exploration in an incremental mode, where the information recorded in the log file is read and the data is loaded into the program; and
re-generation of the data structure based on the information specified in the log file for each valid design created during a previous exploration.

### Claim 5 (depends on 11)

The method according to claim 11, wherein the method operation includes:
checking at the designs from a previous exploration before a new design is generated in order to avoid applying the same synthesis directives to a new design being generated.
