Three-value fprm circuit area and delay optimization method using particle swarm optimization
A particle swarm algorithm and circuit area technology, applied in multi-objective optimization, calculation, calculation model and other directions, can solve the problem of difficult to obtain the optimal solution in the concave area of the front curve, different, poor optimization effect, etc.
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0075] Embodiment one: a kind of ternary FPRM circuit area and delay optimization method utilizing particle swarm optimization algorithm, comprising the following steps:
[0076] ①Establish the area estimation model and delay estimation model of the ternary FPRM circuit under p polarity:
[0077] ①-1 Express the ternary FPRM circuit under p polarity with the ternary FPRM logic expression as:
[0078]
[0079] Among them, n is the function f p (x n-1 ,x n-2 ,...,x 0 ) the number of input variables; x n-1 ,x n-2 ,...,x 0 for the function f p (x n-1 ,x n-2 ,...,x 0 ) of n input variables; ⊕Σ is the modulo 3 addition operation symbol; b i is the AND coefficient, and b i ∈{0,1,2}; i is the ordinal number of AND item, i=0,1,2,...,3 n -1, i can be expressed as i in ternary n-1 i n-2 …i 0 , i j ∈{0,1,2}, j is an integer greater than or equal to 0 and less than or equal to n-1; p is the polarity of the ternary FPRM circuit, and p can be expressed as p in ternary n-...
Embodiment 2
[0126] Embodiment two: this embodiment is basically the same as embodiment one, the only difference is that in this embodiment, the specific process of calculating the crowding distance of the position of each particle with the lowest number of non-dominated ranks in the initial state in Step3 is:
[0127] Step3-1. Record the number of particles with the lowest non-dominated rank number as size(rep);
[0128] Step3-2. According to the size of the area of the ternary FPRM circuit under the polarity corresponding to the position of each particle with the lowest non-dominated level number, sort the particles with the lowest non-dominated level number in ascending order of area; the initial state The crowding distance of the particle with the lowest non-dominated rank number ranked a is recorded as distance a (0), a=1, 2, ..., size(rep);
[0129] Step3-3. Make the crowding distance distance of the particle with the lowest number of non-dominated levels ranked first 1 (0)=10000...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


