Name
Abstract | ||
|---|---|---|
At present, although genetic algorithm (GA) is widely used in best polarity searching of MPRM logic circuit, there are few literatures pay attention to the polarity conversion sequence of the polarity set waiting for evaluation. An improved best polarity searching approach (IBPSA) based on GA is presented to optimize the polarity conversion sequence of polarity set and speed up the best polarity searching of MPRM logic circuits. In addition, we present an improved nearest neighbor (INN) to obtain the best polarity conversion sequence of the polarity set waiting for evaluation in each generation of GA and apply elitism strategy to IBPSA to guarantee its global convergence. Our proposed IBPSA is implemented in C and a comparative analysis has been presented for MCNC benchmark circuits. The experimental results show that the IBPSA can greatly reduce the time of best polarity searching of MPRM logic circuits compared to the approaches neglecting polarity conversion sequence. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/SOCC.2015.7406962 | 2015 28th IEEE International System-on-Chip Conference (SOCC) |
Keywords | Field | DocType |
Mixed Polarity Reed-Muller,Nearest Neighbor,Genetic Algorithm,Polarity Optimization,Polarity Conversion Sequence | Convergence (routing),k-nearest neighbors algorithm,Logic gate,Computer science,Algorithm,Electronic circuit,Genetic algorithm,Speedup | Conference |
Citations | PageRank | References |
2 | 0.51 | 4 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Limin Xiao | 1 | 6 | 1.95 |
| Zhenxue He | 2 | 11 | 5.88 |
| Ruan Li | 3 | 26 | 6.75 |
| Rong Zhang | 4 | 4 | 1.25 |
| Tongsheng Xia | 5 | 8 | 1.24 |
| Xiang Wang | 6 | 26 | 15.33 |