Fitness function circuit, genetic algorithm machine, and fitness evaluation method

Abstract

An optimization method for extracting a model parameter in a semiconductor circuit. A fitness function circuit 15 installed in a genetic algorithm machine 900 is provided with an evaluated value calculation section 21, which receives an offspring model parameter from an offspring model parameter file 44, obtains k model evaluated values based on the offspring model parameter received, and stores the k model evaluated values in an evaluated value file 32 in a storage section 17. The fitness function circuit 15 is also provided with an area calculation section 22, which reads the k model evaluated values stored in the evaluated value file 32 by the evaluated value calculation section 21, calculates the size of an area formed by the k model evaluated values read, and stores the size of the area in an area value file 33 in the storage section 17. The fitness function circuit 15 is also provided with a fitness evaluation section 23, which reads the size of the area stored in the area value file 33 by the area calculation section 22, evaluates fitness of the offspring model parameter based on the size of the area read, and stores the fitness in a fitness file 34 in the storage section 17.

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates to fitness evaluation for a genetic algorithm machine. For example, the present invention relates to an optimization technique including a method of comparing the areas of two functions as an evaluation method of fitness. More particularly, the present invention relates to parameter extracting equipment for a semiconductor circuit, which is used for a model parameter optimization in a circuit simulator that is designed mainly for circuit design.

2. Description of the Related Art

In the design phase of a large-scale integrated circuit, a circuit simulation is performed using a circuit simulator. A circuit simulator, in general, includes a semiconductor device model f(P) for simulating the actual electrical characteristics. For a highly accurate circuit simulation, it is required for the semiconductor device model f(P) to simulate the electrical characteristics of an observed device highly accurately. Now, since the device model f(P) has a constituent factor of a model parameter P={p₁, p₂, . . . , p_n} that includes n components, it is required that f(P) determine a model parameter {p₁, p₂, . . . , p_n} that can simulate measured electrical characteristics of a device highly accurately.

Techniques of extracting the model parameter (p₁, p₂, . . . , p_n) highly accurately from observed data include a genetic algorithm based method as described in references in Nonpatent Literature 1 and Nonpatent Literatures 2.

The following shows a conventional method of fitness evaluation.

[Equation 1]

Method 1.

Model of Nonpatent Literature 1: $g=\sum _i\left(\frac{I_d-f\left(P,x_i\right)}{I_d}\right)$ Method 2. Model of Nonpatent Literature 2: $g=\sum _i\left(\frac{I_d-f\left(P,x_i\right)}{\left(x_i-x_{i-1}\right)·f\left(P,x_i\right)}\right)$

In the equations, x denotes an applied voltage to a device, f(P,x) denotes a model evaluated value that is obtained by calculating the model parameter P=(p₁, p₂, . . . , p_n) and x, and I_d denotes the value of electrical characteristics of an observed device. Now, the equations are calculated at every evaluation point, thereby obtaining fitness g.

[Nonpatent Literature 1] V. Melikian, V. Mnatsakanian, and N. Uzunoglou, “Optimization of SPICE System LEVEL 3 MOSFET Transistor Models Based on DC Measurements,” Microelectronics Journal 29 (1998), pp. 151-156.

[Nonpatent Literature 2] Josef Watts, Calvin Bittner, Douglas Heaberlin, and James Hoffmann, “Extraction of Compact Model Parameters for ULSI MOSFETs Using a Genetic Algorithm”, Technical Proceedings of the 1999 International Conference on Modeling and Simulation of Microsystems, pp. 697.

The conventional genetic algorithm based method may lead to incorrect selection of parameters of highest fitness to be selected.

SUMMARY OF THE INVENTION

The present invention is directed to improving fitness evaluation method involving a genetic algorithm based calculation. For instance, it is to propose a method that allows extracting a model parameter that matches an observed value with high accuracy in the optimization of a model function parameter representing observed data.

These and other objects of the embodiments of the present invention are accomplished by the present invention as hereinafter described in further detail.

According to one aspect of the present invention, a fitness function circuit used for genetic algorithms receives a model parameter, obtains a model evaluated value, and outputs fitness for a specific problem. The fitness function circuit may include,

• • an evaluated value calculation section, which receives the model parameter, for obtaining the model evaluated value based on the model parameter received, and storing the model evaluated value in a storage section;
  • an area calculation section, which reads the model evaluated value stored in the storage section by the evaluated value calculation section, for calculating the size of an area that is formed by the model evaluated value read, and storing the size of the area in the storage section; and
  • a fitness evaluation section, which reads the size of the area stored in the storage section by the area calculation section, for evaluating the fitness of the model parameter based on the size of the area read, and storing the fitness in the storage section.

The area calculation section may calculate an area based on a true value and an area based on the model evaluated value, and store the areas in the storage section. Then, the fitness evaluation section may evaluate the fitness according to a difference between the area based on the true value and the area based on the model evaluated value.

The evaluated value calculation section may calculate a model evaluated value f(P, x_i) based on a model parameter P and a variable value x_i where P denotes a model parameter that has n components {p₁, p₂, . . . , p_n}, x denotes a variable, x_i denotes a variable value, f denotes a function with variables of the model parameter P and the variable value x_i, and f (P, x_i) denotes the model evaluated value. Then, the area calculation section may calculate, for every i, a first area that is based on the variable value x_i, a variable value x_i+1, a true value I_d (x_i) and a true value I_d(x_i+1) and a second area that is based on the variable value x_i, the variable value x_i+1, the model evaluated value f(P, x_i) and a model evaluated value f(P, x_i+1) where I_d(x_i) denotes the true value of the variable value x_i, g denotes the fitness, and i=1, 2, . . . , k. Then, the fitness evaluation section may calculate a difference between the first area and the second area and calculate a sum of differences between the areas calculated for the every i as the fitness.

The area calculation section may calculate an area enclosed with a true value and the model evaluated value, and store the area enclosed with the true value and the model evaluated value in the storage section. Then, the fitness evaluation section may evaluate the fitness based on the area enclosed with the true value and the model evaluated value.

The evaluated value calculation section may calculate a model evaluated value f(P, x_i) based on a model parameter P and a variable value x_i where P denotes a model parameter that has n components {p₁, p₂, . . . , p_n}, x denotes a variable, x_i denotes a variable value, f denotes a function with variables of the model parameter P and the variable value x_i, and f(P, x_i) denotes the model evaluated value. Then, the area calculation section may calculate, for every i, a first area that is based on the variable value x_i, a variable value x_i+1, a true value I_d (x_i) and a true value I_d(x_i+1) and a second area that is based on the variable value x_i, the variable value x_i+1, the model evaluated value f(P,x_i) and a model evaluated value f(P,x_i+1) where I_d(x_i) denotes the true value of the variable value x_i, g denotes the fitness, and i=1, 2, . . . , k. Then, the fitness evaluation section may calculate a difference between the first area and the second area and calculates a sum of absolute values of differences between the areas calculated for the every i as the fitness.

According to another aspect of the present invention, a genetic algorithm machine executes a genetic algorithm using a model parameter. Then, the genetic algorithm machine includes,

• • a population memory for storing a population of model parameters having fitness;
  • a select section for selecting a parent model parameter from among the population of model parameters stored in the population memory;
  • a crossover module for crossing parent model parameters selected by the select section and producing an offspring model parameter; and
  • a fitness function circuit for evaluating the fitness for a specific problem of the offspring model parameter obtained from the crossing by the crossover module.

Then, the fitness function circuit may include,

• • an evaluated value calculation section, which receives the offspring model parameter, for calculating k model evaluated values based on the offspring model parameter received, and storing the k model evaluated values in a storage section;
  • an area calculation section, which reads a model evaluated value stored in the storage section by the evaluated value calculation section, for calculating the size of an area formed by the model evaluated value read, and storing the size of the area in the storage section; and
  • a fitness evaluation section, which reads the size of the area stored in the storage section by the area calculation section, for evaluating the fitness of the offspring model parameter based on the size of the area read, and storing the fitness in the storage section.

According to still another aspect of the present invention, a fitness evaluation method is used by a fitness function circuit that is installed in a genetic algorithm machine. The fitness evaluation method may include,

• • retrieving a variable value string and an observed data string corresponding to the variable value string from a storage section, calculating the size of an area based on observed data using the variable value string and the observed data string, and storing the size of the area based on the observed data calculated in the storage section;
  • retrieving the variable value string and a model parameter from the storage section, calculating a model evaluated value string using the variable value string and the model parameter, calculating the size of an area based on the model parameter using the variable value string and the model evaluated value string, and storing the size of the area based on the model parameter calculated in the storage section; and
  • retrieving from the storage section the size of the area based on the observed data and the size of the area based on the model parameter, evaluating fitness of the model parameter based on a difference between the sizes, and storing the fitness in the storage section.

The fitness evaluation method may include,

• • calculating the size of an area formed by a minimum value of the variable value string, a maximum value of the variable value string, the observed data string, and an X-axis, according to a two-dimensional coordinate graph where the X-axis indicates the variable value string and a Y-axis indicates the observed data string, for the size of the area based on the observed data;
  • calculating the size of an area formed by the minimum value of the variable value string, the maximum value of the variable value string, the model evaluated value string, and an X-axis, according to a two-dimensional coordinate graph where the X-axis indicates the variable value string and a Y-axis indicates the model evaluated value string, for the size of the area based on model parameter; and
  • storing the sizes in the storage section.

According to still another aspect of the present invention, a fitness evaluation method is used by a fitness function circuit that is installed in a genetic algorithm machine. The genetic algorithm machine may include,

• • retrieving a variable value sting and a model parameter from a storage section, and calculating a model evaluated value string based on the variable value sting and the model parameter;
  • retrieving an observed data string corresponding to the variable value string from the storage section; and
  • calculating fitness of the model parameter based on an absolute value of a difference between the observed data string and the model evaluated value string, and storing the fitness in the storage section.

The fitness evaluation method may include evaluating the fitness by obtaining a value by integrating the absolute value of the difference between the observed data string and the model evaluated value string.

According to this invention, fitness is evaluated based on size of area. For instance, in the extraction of a model parameter from observed data, the value of a model calculated based on an extracted parameter and the observed data (a true value) almost match like a visual match. This may eliminate incorrect selection of parameters.

Further scope of applicability of the present invention will become apparent from the detailed description given hereinafter. However, it should be understood that the detailed description and specific examples, while indicating preferred embodiments of the invention, are given by way of illustration only, since various changes and modifications within the spirit and scope of the invention will become apparent to those skilled in the art from this detailed description.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention will become more fully understood from the detailed description given hereinafter and the accompanying drawings which are given by way of illustration only, and thus are not limitative of the present invention, and wherein:

FIG. 1 is an exterior view of a genetic algorithm machine according to a first embodiment;

FIG. 2 is a diagram showing a hardware architecture of the genetic algorithm machine according to the first embodiment;

FIG. 3 is a diagram showing a logical configuration of an genetic algorithm machine 900;

FIG. 4 is a chart showing an operation of the genetic algorithm machine 900;

FIG. 5 is a diagram showing areas Sd and Sf that are enclosed with respective function values;

FIG. 6 is a diagram showing a relationship between an applied voltage x and a value I_d of electrical characteristics of a device;

FIG. 7 is a chart of numerical values of true values, evaluated values-1, and evaluated values-2 shown in FIG. 6;

FIG. 8 is a chart of differences between true values and values obtained by assigning the evaluated values-1 with Methods 1, 2, and 3, respectively;

FIG. 9 is a chart of differences between true values and values obtained by assigning the evaluated values-2 with Methods 1, 2, and 3, respectively;

FIG. 10 is a diagram showing a relationship between an applied voltage x and a value I_d of electrical characteristics of a device;

FIG. 11 is a chart of numerical values of true values, evaluated values-1, and evaluated values-2 shown in FIG. 10;

FIG. 12 is a chart of differences between true values and values obtained by assigning the evaluated values-1 with Methods 1, 2, and 3, respectively;

FIG. 13 is a chart of differences between true values and values obtained by assigning the evaluated values-2 with Methods 1, 2, and 3, respectively;

FIG. 14 is a chart of fitness g, which is evaluated based on the results of FIG. 7 and FIG. 8 with Method 1 and Method 2 of the conventional art, and Method 3 of the first embodiment, respectively;

FIG. 15 is a chart of fitness g, which is evaluated based on the results of FIG. 11 through FIG. 13 with Method 1 and Method 2 of the conventional art, and Method 3 of this embodiment, respectively;

FIG. 16 is a diagram showing a relationship between an applied voltage x and a value I_d of electrical characteristics of a device;

FIG. 17 is a chart of numerical values of true values, evaluated values-A, and evaluated values-B shown in FIG. 16;

FIG. 18 is a chart with Method 1 illustrating differences between true values and values obtained by assigning the evaluated values-A or values obtained by assigning the evaluated values-B;

FIG. 19 is a chart with Method 3 illustrating differences between true values and values obtained by assigning the evaluated values-A or values obtained by assigning the evaluated values-B;

FIG. 20 is a chart with Method 4 illustrating differences between true values and values obtained by assigning the evaluated values-A or values obtained by assigning the evaluated values-B;

FIG. 21 shows an effect in the case of using the proposed Method 4 of this invention;

FIG. 22 shows differences in areas between true values I_d(X) and the evaluated values f(P,x); and

FIG. 23 shows differences in areas between true values I_d(x) and the evaluated values f(P,x).

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

Reference will now be made in detail to the present preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings, wherein like reference numerals indicate like devices through out the several views.

Embodiment 1

FIG. 1 is an exterior view of a genetic algorithm machine according to a first embodiment.

With referring to FIG. 1, a genetic algorithm machine 900 is provided with a system unit 910, a CRT (Cathode Ray Tube) display 901, a keyboard (K/B) 902, a mouse 903, a compact disk drive (CDD) 905, a printer 906, and a scanner 907, which are connected to one another by cables.

Also, the genetic algorithm machine 900 is connected to a FAX machine 932 and a telephone machine 931 by cables, and connected also to the Internet 940 via a local area network (LAN) 942 and a gateway 941.

FIG. 2 is a diagram illustrating a hardware architecture of the genetic algorithm machine according to the first embodiment.

With referring to FIG. 2, the genetic algorithm machine 900 has a CPU (Central Processing Unit) 911 for executing programs. The CPU 911 is connected to a ROM 913, a RAM 914, a communication board 915, the CRT display 901, the K/B 902, the mouse 903, an FDD (Flexible Disk Drive) 904, a magnetic disk drive 920, the CDD 905, the printer 906, and the scanner 907 via a bus 912.

The RAM 914 is an example of volatile memory. The ROM 913, the FDD 904, the CDD 905, and the magnetic disk drive 920 are examples of nonvolatile memory. Those are examples of storage devices or storage sections.

The communication board 915 is connected to the FAX machine 932, the telephone machine 931, the LAN 942, etc.

For instance, the communication board 915, the K/B 902, the FDD 904, and the scanner 907 are examples of input sections.

For instance, the communication board 915 and the CRT display 901 are examples of output sections.

Now, the communication board 915 may alternatively be connected directly to the Internet 940 or a WAN (Wide Area Network) such as ISDN, instead of being connected to the LAN 942. If the communication board 915 has a direct connection to the Internet 940 or a WAN such as ISDN, then the genetic algorithm machine 900 is connected to the Internet 940 or a WAN such as ISDN. This eliminates the use of the gateway 941.

The magnetic disk drive 920 stores an operating system (OS) 921, a window system 922, a program group 923, and a file group 924. The program group 923 is executed by the CPU 911, the OS 921, and the window system 922.

The program group 923 stores programs that execute the functions that will be described as a “section”, a “device”, a “module”, an “operator”, and a “circuit” in later descriptions of the embodiment. The programs are retrieved by the CPU 911 to be executed.

The file group 924 stores a “judgement result”, a calculation results, and a “process result” that will be illustrated in later descriptions of the embodiment each as a “file”.

Then, arrows in a flow chart that will be described in later descriptions of the embodiment mainly indicate data inputs/outputs. For the data input/output, data is stored in FD (Flexible Disk), Optical Disk, CD (Compact Disk), MD (Mini Disk), DVD (Digital Versatile Disk), or other types of storage media. Alternatively, data may be transmitted over a signal line or other types of transmission media.

Then, equipment that will be explained as a “section”, a “device”, a “module”, an “operator”, or a “circuit” in later descriptions of the embodiment may be implemented in firmware that is stored in the ROM 913. Alternatively, they may be implemented in software only, hardware only, a combination of software and hardware, or a combination of software, hardware and firmware.

Then, programs to implement the embodiment discussed hereinafter may be stored using a storage device such as the magnetic disk drive 920, FD (Flexible Disk), Optical Disk, CD (Compact Disk), MD (Mini Disk), DVD (Digital Versatile Disk) or other types of storage media.

FIG. 3 is a diagram illustrating a logical configuration of the genetic algorithm machine 900.

The genetic algorithm machine 900 executes a genetic algorithm using the model parameter P. It is assumed here that one model parameter P has n component parameters {p₁, p₂, . . . , p_n}.

The genetic algorithm machine 900 is provided with a control section 10, which controls respective sections that will be discussed hereinafter and executes operations that will be discussed hereinafter. This control may be implemented by the CPU 911, firmware, and the program group 923.

The genetic algorithm machine 900 is also provided with a population memory 11, which stores a population of model parameters 42, p₁, p₂, . . . , p_m, each provided with fitness 41.

The genetic algorithm machine 900 is also provided with a storage section 17, which stores various types of files. The storage section 17 stores a variable value string (x₁, x₂, . . . , x_k) in a variable value string file 45. The storage section 17 also stores an observed data string, which is corresponding to the variable value string, in a true value file 31 as a true value string (I_d(x₁), . . . , I_d(x_k)).

The population memory 11 and the storage section 17 may be implemented by a storage device such as the magnetic disk drive 920.

The genetic algorithm machine 900 is provided with a select section 12, which selects a parent model parameter from among the population of model parameters 42 stored in the population memory 11, and stores the parent model parameter in a parent model parameter file 43 in the storage section 17.

The genetic algorithm machine 900 is also provided with a crossover module 13, which crosses parent model parameters selected by the select section 12, thereby producing an offspring model parameter, and stores the offspring model parameter in an offspring model parameter file 44 in the storage section 17.

The genetic algorithm machine 900 is also provided with a mutation operator 14, which mutates the offspring model parameter stored in the offspring model parameter file 44. The mutation operator 14 is optional.

The genetic algorithm machine 900 is also provided with a fitness function circuit 15, which retrieves from the offspring model parameter file 44 the offspring model parameter mutated by the mutation operator 14 or the offspring model parameter crossed by the crossover module 13, evaluates the fitness of the offspring model parameter for a specific problem, and stores the fitness in a fitness file 34 in the storage section 17.

The genetic algorithm machine 900 is also provided with a population update section 16, which retrieves the fitness evaluated by the fitness function circuit 15 and stored in the fitness file 34, selects an offspring model parameter with a high level of fitness based on the fitness, and updates the population memory 11.

A configuration of the fitness function circuit 15 will now be described.

The fitness function circuit 15 is provided with an evaluated value calculation section 21, which receives an offspring model parameter from the offspring model parameter file 44, obtains k model evaluated values based on the offspring model parameter received, and stores the k model evaluated values in an evaluated value file 32 in the storage section 17.

The fitness function circuit 15 is also provided with an area calculation section 22, which reads the k model evaluated values stored in the evaluated value file 32 by the evaluated value calculation section 21, calculates the size of an area formed by the k model evaluated values read, and stores the size of the area in an area value file 33 in the storage section 17.

The fitness function circuit 15 is also provided with a fitness evaluation section 23, which reads the size of the area stored in the area value file 33 by the area calculation section 22, evaluates the fitness of the offspring model parameter based on the size of the area read, and stores the fitness in the fitness file 34 in the storage section 17.

FIG. 4 is a diagram illustrating an operation of the genetic algorithm machine 900.

In the extraction of a model parameter using a genetic algorithm, the optimization of the combination of parameter devices is performed, assuming that a device of the model parameter P is a gene.

The following is the procedure for this case.

S9: The control section 10 forms at random parent populations {p₁, p₂, . . . , p_n}_m including 1000 sets (m=1000), for example, of a model parameter P in the population memory 11. The control section 10 also sets an operating time of the genetic algorithm. Time may be replaced by the number of times to be set.

S10: The control section 10 repeats the following operations from S11 to S18 until the operating time or number of times of the genetic algorithm is reached.

S11: The select section 12 selects two parent model parameters, for example, from among the parent populations including the m sets of model parameters P in the population memory 11 as parent individuals, and stores the two parent model parameters in the parent model parameter file 43.

S12: The crossover module 13 crosses the two parent individuals selected, produces ten (j=1, 2, . . . , 10) offspring model parameters, for example, as a new population of parameters {p₁, p₂, . . . , p_n}_j, and stores the new population of parameters in the offspring model parameter file 44.

S13: The mutation operator 14 changes a parameter value or inverts a bit value at a random position of the offspring model parameter stored in the offspring model parameter file 44, if necessary, for mutation.

S14-S16: The fitness function circuit 15 evaluates fitness for desired electrical characteristics based on the newly produced population of ten parameters {p₁, p₂, . . . , p_n}_j, and stores the fitness in the fitness file 34.

In S14, the evaluated value calculation section 21 calculates the model evaluated value f (P, x_i) for each offspring model parameter P of the new population of ten parameters. The evaluated value calculation section 21 receives an offspring model parameter, and obtains k model evaluated values f(P, x_i) (i=1, 2, . . . , k) based on the offspring model parameter received using a predetermined function f, and stores the k model evaluated values in the evaluated value file 32 as a model evaluated value string.

In S15, the area calculation section 22 calculates an area based on true value and an area based on model evaluated value.

First, the area calculation section 22 retrieves the variable value string, x₁, x₂, . . . , x_k, from the variable value string file 45, retrieves the observed data string, I_d(x₁), . . . , I_d(x_k), corresponding to the variable value string from the true value file 31, calculates the size of an area based on observed data using the variable value string and the observed data string, and stores in the area value file 33 the size of the area based on observed data calculated.

The area calculation section 22 also retrieves the k model evaluated values f(P, x_i) (i=1, 2, . . . , k) from the evaluated value file 32, calculates the size of the area based on model parameter using the variable value string and the model evaluated value string, and stores in the area value file 33 the size of the area based on model parameter calculated.

In S16, the fitness evaluation section 23 evaluates the fitness based on a difference between the area based on true value and the area based on model parameter.

The fitness evaluation section 23 reads the area based on observed data and the area based on model parameter stored in the area value file 33, calculates the difference between the areas read as the fitness of the offspring model parameter, and stores the fitness in the fitness file 34.

S17: The population update section 16 selects a parameter set having the highest fitness from among the new population of ten parameters {p₁, p₂, . . . , p_n}_j and a parameter set selected by a random number. Note that there are a variety of possible conditions for updating this population memory 11. For example, if the highest fitness among the new population of parameters is still lower than the lowest fitness among the model parameters of the population memory 11, then no selection is required and the process goes back to S10.

S18: The population update section 16 returns the parameter set selected in S17 to the parent populations of parameters {p₁, p₂, . . . , p_n}_m, and the process goes back to S10.

S99: When the predetermined time or number of times for calculation is reached, the control section 10 stops and outputs the best parameter. The control section 10 outputs a model parameter P with a combination of component parameters that shows the highest fitness among the parent population of parameters {p₁, p₂, . . . , p_n}_m calculated as a final solution.

The method of this embodiment will be referred to as Method 3. Method 3 is used for fitness evaluation for extracting an optimized model parameter P corresponding to the observed data I_d.

The observed data I_d is assumed to be the function of the variable x, and have a value I_d={I_d(x₁), . . . , I_d(x_k)}, which corresponds to a set of variables x, x={x₁, . . . , x_k}, which are sampled at regular or irregular intervals.

Then, the optimized model parameter P is defined as P=(p₁, p₂, . . . , p_n), and assumed to consist of n component parameters (p₁, p₂, . . . , p_n).

Now, it should be noted that the fitness evaluation here evaluates the level of matching between the observed data I_d and a model evaluated value f(P, x) calculated based on the parameter P and the variable x, thereby evaluating the level of matching between a value I_d={I_d(x₁), . . . , I_d(x_k)} and a value {f(P, x₁), . . . , f(P, x_k)}.

Now, the fitness evaluation of this embodiment is performed by the following method.

At an arbitrary evaluation point x_i and an adjacent evaluation point x_i+1 (i=1˜k−1), observed data I_d(x_i) and I_d(x_i+1) corresponding to the respective points are selected. Then, the model evaluated values f(P, x_i) and f(P, x_i+1) are calculated.

Then, according to the trapezoid formula, areas Sd that is enclosed by the function I_d showing observed data and Sf that is enclosed by a model function are calculated as shown in FIG. 5. In FIG. 5, the horizontal axis indicates evaluation points x. The vertical axis in FIG. 5 indicates the observed data I_d (x) or the model evaluated values f(P, x).

Specifically, the calculations are as follows. Sd_i=(I_d(x_i+1)+I_d(x_i))*(x_i+1−x_i)/2 Sf_i=(f(P,x_i+1)+f(P,x_i))*(x_i+1−x_i)/2

More specifically, the area calculation section 22 calculates the size of an area that is formed by a lower value of the variable value string, a higher value of the variable value string, the observed data string, and the X-axis, as an area size Sd_i based on observed data, in a two dimensional coordinate graph where the X-axis indicates the variable value string, and the Y-axis indicates the observed data string. The area calculation section 22 also calculates the size of an area that is formed by a lower value of the variable value string, a higher value of the variable value string, the model evaluated value string, and the X-axis, as an area size Sf_i based on model parameter, in a two dimensional coordinate graph where the X-axis indicates the variable value string, and the Y-axis indicates the model evaluation value string. Then, the area calculation section 22 stores the area size Sd_i based on observed data and the area size Sf_i based on model parameter in the storage section.

Now, a difference between Sd_i and Sf_i for each every i (i=1˜k−1) is obtained as an evaluated value of fitness. Then, all the differences obtained are added to find the fitness g of the parameter P. The following is the formula. $\begin{array}{cc}g=\sum _{i=1}^{k-1}\left({\mathrm{Sd}}_i-{\mathrm{Sf}}_i\right)& \left[\mathrm{Equation}2\right]\end{array}$

Specifically, the fitness evaluation section 23 retrieves the area size Sd₁ based on observed data and the area size Sf₁ based on model parameter from the storage section, and stores a difference between Sd_i and Sf_i in the storage section as the fitness. This is equivalent to the following process. In the two-dimensional coordinate graph where the X-axis indicates the variable value string and the Y-axis indicates the observed data string, the size of an area formed by a maximum value in the variable value string, a minimum value in the variable value string, the observed data string, and the X-axis, is calculated as the size of the area based on observed data. Then, in the two-dimensional coordinate graph where the X-axis indicates the variable value string and the Y-axis indicates the model evaluation value string, the size of an area formed by a maximum value in the variable value string, a minimum value in the variable value string, the model evaluation value string, and the X-axis, is calculated as the size of the area based on model parameter. Then, the size of the area based on observed data and the size of the area based on model parameter are calculated and a difference between the sizes of the areas is stored in the storage section as the fitness of the model parameter.

As mentioned above. Method 3 is an optimization method used for fitness evaluation based on a model evaluated value string, which corresponds to the observed data string that has values corresponding to the variable value string sampled at regular or irregular intervals. The model evaluated value string is calculated based on a model parameter and the variable value string. Then, the optimization method uses the difference, as the fitness of a parameter, between the area that is calculated based on the variable value string and the corresponding observed data string and the area that is calculated based on the variable value string and the model evaluated value string that is obtained based on parameters.

A description will now be given of Method 3 of this embodiment in comparison with Methods 1 and 2 of the conventional art.

FIG. 6 is a diagram illustrating a relationship between an applied voltage (V(volt)) and a value (A(ampere)) of electrical characteristics of a device. The horizontal axis indicates an applied voltage x. The vertical axis indicates a value I_d(X) of electrical characteristics of a device and f(P, x). A circle indicates observed data, i.e., a true value I_d(x). A square indicates an evaluated value-1. A triangle indicates an evaluated value-2. The evaluated value-1 and the evaluated value-2 are different values of f(P,x) that have different component parameters from each other.

FIG. 7 is a chart of numerical values of the true values, evaluated values-1, and evaluated values-2 shown in FIG. 6. Each row in the chart of FIG. 7 includes a true value, an evaluated value-1 and an evaluated value-2 under each of the applied voltage x.

FIG. 8 is a chart of differences between true values and values obtained by assigning the evaluated values-1 with Methods 1, 2, and 3, respectively.

Values in each line of FIG. 8 at each applied voltage x are obtained by the following calculations.

[Equation 3]

With Method 1, the value is obtained by $\frac{I_d-f\left(P,x_i\right)}{I_d}.$ With Method 2, the value is obtained by $\frac{I_d-f\left(P,x_i\right)}{\left(x_i-x_{i-1}\right)·f\left(P,x_i\right)}.$ With Method 3, the value is obtained by Sd_i-Sf_i.

FIG. 9 is a chart of differences between true values and values obtained by assigning evaluated values-2 with Methods 1, 2 and 3, respectively.

Values in each line of FIG. 9 at each applied voltage x are obtained by the following calculations.

[Equation 4] With Method 1, the value is obtained by $\frac{I_d-f\left(P,x_i\right)}{I_d}.$ With Method 2, the value is obtained by $\frac{I_d-f\left(P,x_i\right)}{\left(x_i-x_{i-1}\right)·f\left(P,x_i\right)}.$ With Method 3, the value is obtained by Sd_i-Sf_i.

FIGS. 6, 7, 8 and 9 show the cases in which x is set at regular intervals.

FIGS. 10, 11, 12, and 13 show the cases in which x is set at irregular intervals, and correspond to FIGS. 6, 7, 8 and 9, respectively, with regular intervals.

The following are conditions assumed for purposes of illustration.

It is assumed that the electrical characteristics to be optimized is the function of voltage x, and the electrical characteristics of an observed device is a value shown as the true value of FIG. 7. Besides, two sets of parameters are produced as a newly produced population of parameters, and fitness is evaluated for the two sets of parameters. Then, it is assumed that the evaluated value f(P, x) that is calculated based on a set of parameters with higher fitness is the one that is calculated as the evaluated value-1 of FIG. 7. Then, the evaluated value f(P, x) calculated based on the other set of parameters with lower fitness is assumed to be the one that is calculated as the evaluated value-2 of FIG. 7.

Now, if the interval x is changed, it is also assumed that f(P, x) is calculated as the evaluated value-1 of FIG. 11 and the evaluated value-2 of FIG. 11.

FIG. 14 shows fitness g evaluated based on the results from FIG. 7 through FIG. 9 with Method 1 and Method 2 of the conventional art and Method 3 of this embodiment, respectively. FIG. 15 shows fitness g evaluated based on the results from FIG. 11 through FIG. 13 with Method 1 and Method 2 of the conventional art and Method 3 of this embodiment, respectively.

The following are results of comparisons of fitness evaluated. With the case of the regular interval x of FIG. 7, the values of fitness g of FIG. 14 are as follows.

With Method 1: a value obtained by the evaluated value-1 assigned<a value obtained by the evaluated value-2 assigned

With Method 2: a value obtained by the evaluated value-1 assigned>a value obtained by the evaluated value-2 assigned

It is to be noted here that the evaluated value-1 is a calculated value based on a parameter with high fitness. Therefore, fitness g may be obtained with accuracy in the case where a value obtained with the evaluated value-1 assigned is smaller than a value obtained with the evaluated value-2 assigned.

This indicates that Method 1 gives an accurate result, and Method 2 gives an inaccurate one.

On the other hand, with the case of irregular interval x of FIG. 11, the values of fitness g of FIG. 15 are as follows.

With Method 1: a value obtained by the evaluated value-1 assigned>a value obtained by the evaluated value-2 assigned

With Method 2: a value obtained by the evaluated value-1 assigned>a value obtained by the evaluated value-2 assigned

This shows that both Method 1 and Method 2 give inaccurate results. This proves that dependency on the interval x causes a change in the result of evaluation.

It is an object to solve the x dependency problem of the result of fitness evaluation. Fitness may be determined by visual judgement under a graph in human sense. From this point of view, fitness is evaluated with Method 3 performing a difference evaluation between areas f(P,x) and I_d. The following are results of comparisons of fitness evaluated accordingly.

With the case of regular interval x of FIG. 7, the values of fitness g of FIG. 14 are compared as follows.

With Method 3: a value obtained by the evaluated value-1 assigned<a value obtained by the evaluated value-2 assigned

With the case of irregular interval x of FIG. 11, the values of fitness g of FIG. 15 are compared as follows.

With Method 3: a value obtained by the evaluated value-1 assigned<a value obtained by the evaluated value-2 assigned

Thus, the proposed method (Method 3) allows selecting accurate fitness in every case.

Embodiment 2

According to a second embodiment, the configuration is the same as that according to the first embodiment. A description will now be given mainly of differences between the embodiments.

With Method 3 of the first embodiment as well as Method 1 and Method 2 of the conventional art, the x dependency of the true values and the estimated values may cause incorrect estimation of fitness g in case of the relationship of the true value and the evaluated value-B crossing along the line in FIG. 16. Accordingly, another method is proposed to evaluate fitness g based on the areas enclosed with the estimated values and the true values. More specifically, the process is the same as that of the first embodiment until Sd_j and Sf_j are obtained. Then, the absolute value of a difference between Sd_j and Sf_j is obtained, and then added with every i (i=1˜n) to obtain fitness g. The following is the formula. $\begin{array}{cc}g=\sum _{i=1}^{k-1}\left|{\mathrm{Sd}}_i-{\mathrm{Sf}}_i\right|& \left[\mathrm{Equation}5\right]\end{array}$

In other words, the fitness evaluation section 23 evaluates fitness by obtaining a value by integrating the absolute value of a difference between the observed data string and the model evaluated value string. This method according to this embodiment will be referred to hereinafter as Method 4.

FIG. 16 is a diagram illustrating a relationship between an applied voltage x and a value I_d of electrical characteristics of a device. The horizontal axis indicates the applied voltage x. The vertical axis indicates the value I_d of electrical characteristics of a device. A circle indicates the observed data, i.e., a true value. A square indicates the evaluated value-A that is calculated with a high-fitness parameter set. A triangle indicates the evaluated value-B that is calculated with a low-fitness parameter set.

FIG. 17 is a chart of numerical values of the true values, the evaluated values-A and the evaluated values-B shown in FIG. 16.

FIG. 18 is a chart with Method 1 illustrating differences between true values and values obtained by assigning the evaluated values-A or the evaluated values-B.

FIG. 19 is a chart with Method 3 illustrating differences between true values and values obtained by assigning the evaluated values-A or the evaluated values-B.

FIG. 20 is a chart with Method 4 illustrating differences between true values and values obtained by assigning the evaluated values-A or the evaluated values-B.

As shown in FIG. 18 and FIG. 19, minus values appear with Method 1 and Method 3 while only plus values appear with Method 4 as shown in FIG. 20.

FIG. 21 shows an effect in the case of using the proposed Method 4 of this embodiment.

The following shows the values of fitness g that are obtained through Methods 1, 3 and 4, respectively.

With Method 1 or Method 3: a value obtained by assigning the evaluated value-A>a value obtained by assigning the evaluated value-B

With Method 4: a value obtained by assigning the evaluated value-A<a value obtained by assigning the evaluated value-B It is to be noted here that the evaluated value-A is a calculated value based on a parameter with high fitness. Therefore, fitness g may be obtained with accuracy in the case where a value obtained with the evaluated value-A assigned is smaller than a value obtained with the evaluated value-B assigned.

This indicates that the proposed method of this embodiment (Method 4) allows selecting an accurate fitness even in the case that the relationship between the true value and the evaluated value changes in mid-course.

Embodiment 3

With the calculation formula of Method 3 of the first embodiment and that of Method 4 of the second embodiment, the area of a trapezoid is calculated and approximated by the area of function. With the following integral formula, however, the area can be obtained accurately as shown in FIG. 22 and FIG. 23. $\begin{array}{cc}\mathrm{Method}3\text{:}g={\int }_{x_0}^{x_1}{I}_d\left(x\right)dx-{\int }_{x_0}^{x_1}f\left(P,x\right)dx\mathrm{Method}4\text{:}g={\int }_{x_0}^{x_1}|I_d\left(x\right)-f\left(P,x\right)dx& \left[\mathrm{Equation}6\right]\end{array}$

The invention being thus described, it will be obvious that the same may be varied in many ways. Such variations are not to be regarded as a departure from the spirit and scope of the invention, and all such modifications as would be obvious to one skilled in the art are intended to be included within the scope of the following claims.

Claims

1. A fitness function circuit used for genetic algorithms, the fitness function circuit receiving a model parameter, obtaining a model evaluated value, and outputting fitness for a specific problem, the fitness function circuit comprising: an evaluated value calculation section, receiving the model parameter, for obtaining the model evaluated value based on the model parameter received, and storing the model evaluated value in a storage section; an area calculation section for reading the model evaluated value stored in the storage section by the evaluated value calculation section, calculating a size of an area that is formed by the model evaluated value read, and storing the size of the area in the storage section; and a fitness evaluation section for reading the size of the area stored in the storage section by the area calculation section, evaluating the fitness of the model parameter based on the size of the area read, and storing the fitness in the storage section.

2. The fitness function circuit of claim 1, wherein the area calculation section calculates an area based on a true value and an area based on the model evaluated value, and stores the areas in the storage section, and wherein the fitness evaluation section evaluates the fitness according to a difference between the area based on the true value and the area based on the model evaluated value.

3. The fitness function circuit of claim 1, wherein the evaluated value calculation section calculates a model evaluated value f(P, xi) based on a model parameter P and a variable value xi where P denotes a model parameter that has n components {p1, p2, . . . , pn}, x denotes a variable, xi denotes a variable value, f denotes a function with variables of the model parameter P and the variable value xi, and f(P, xi) denotes the model evaluated value; wherein the area calculation section calculates, for every i, a first area that is based on the variable value xi, a variable value xi+1, a true value Id(xi) and a true value Id(xi+1) and a second area that is based on the variable value xi, the variable value xi+1, the model evaluated value f(P,xi) and a model evaluated value f(P, xi+1) where Id(xi) denotes the true value of the variable value xi, g denotes the fitness, and i=1, 2, . . . , k; and wherein the fitness evaluation section calculates a difference between the first area and the second area and calculates a sum of differences between the areas calculated for the every i as the fitness.

4. The fitness function circuit of claim 1, wherein the area calculation section calculates an area enclosed with a true value and the model evaluated value, and stores the area enclosed with the true value and the model evaluated value in the storage section, and wherein the fitness evaluation section evaluates the fitness based on the area enclosed with the true value and the model evaluated value.

5. The fitness function circuit of claim 1, wherein the evaluated value calculation section calculates a model evaluated value f(P, xi) based on a model parameter P and a variable value xi where P denotes a model parameter that has n components {p1, p2, . . . , pn}, x denotes a variable, x1 denotes a variable value, f denotes a function with variables of the model parameter P and the variable value xi, and f(P, xi) denotes the model evaluated value; wherein the area calculation section calculates, for every i, a first area that is based on the variable value xi, a variable value xi+1, a true value Id(xi) and a true value Id(xi+1) and a second area that is based on the variable value xi, the variable value xi+1, the model evaluated value f(P, xi) and a model evaluated value f(P,xi+1) where Id(xi) denotes the true value of the variable value xi, g denotes the fitness, and i=1, 2, . . . , k; and wherein the fitness evaluation section calculates a difference between the first area and the second area and calculates a sum of absolute values of differences between the areas calculated for the every i as the fitness.

6. A genetic algorithm machine, which executes a genetic algorithm using a model parameter, comprising: a population memory for storing a population of model parameters having fitness; a select section for selecting a parent model parameter from among the population of model parameters stored in the population memory; a crossover module for crossing parent model parameters selected by the select section and producing an offspring model parameter; and a fitness function circuit for evaluating the fitness for a specific problem of the offspring model parameter obtained from the crossing by the crossover module, wherein the fitness function circuit includes, an evaluated value calculation section, receiving the offspring model parameter, for calculating k model evaluated values based on the offspring model parameter received, and storing the k model evaluated values in a storage section; an area calculation section for reading a model evaluated value stored in the storage section by the evaluated value calculation section, calculating a size of an area formed by the model evaluated value read, and storing the size of the area in the storage section; and a fitness evaluation section for reading the size of the area stored in the storage section by the area calculation section, evaluating the fitness of the offspring model parameter based on the size of the area read, and storing the fitness in the storage section.

7. A fitness evaluation method used by a fitness function circuit installed in a genetic algorithm machine, comprising: retrieving a variable value string and an observed data string corresponding to the variable value string from a storage section, calculating a size of an area based on observed data using the variable value string and the observed data string, and storing the size of the area based on the observed data calculated in the storage section; retrieving the variable value string and a model parameter from the storage section, calculating a model evaluated, value string using the variable value string and the model parameter, calculating a size of an area based on the model parameter using the variable value string and the model evaluated value string, and storing the size of the area based on the model parameter calculated in the storage section; and retrieving from the storage section the size of the area based on the observed data and the size of the area based on the model parameter, evaluating fitness of the model parameter based on a difference between the sizes, and storing the fitness in the storage section.

8. The fitness evaluation method of claim 7, comprising: calculating a size of an area formed by a minimum value of the variable value string, a maximum value of the variable value string, the observed data string, and an X-axis, according to a two-dimensional coordinate graph where the X-axis indicates the variable value string and a Y-axis indicates the observed data string, for the size of the area based on the observed data; calculating a size of an area formed by the minimum value of the variable value string, the maximum value of the variable value string, the model evaluated value string, and an X-axis, according to a two-dimensional coordinate graph where the X-axis indicates the variable value string and a Y-axis indicates the model evaluated value string, for the size of the area based on model parameter; and storing the sizes in the storage section.

9. A fitness evaluation method used by a fitness function circuit installed in a genetic algorithm machine, comprising: retrieving a variable value sting and a model parameter from a storage section, and calculating a model evaluated value string based on the variable value sting and the model parameter; retrieving an observed data string corresponding to the variable value string from the storage section; and calculating fitness of the model parameter based on an absolute value of a difference between the observed data string and the model evaluated value string, and storing the fitness in the storage section.

10. The fitness evaluation method of claim 9, comprising: evaluating the fitness by obtaining a value by integrating the absolute value of the difference between the observed data string and the model evaluated value string.