PAPERS
Abstract: For an n-variable logic function,the power dissipation and area of the REED-MULLER (RM) circuit corresponding to each polarity are different.Based on the propagation algorithm of signal probability,the decomposition algorithm of a multi-input XOR/AND gate,and the multiple segment algorithm of polarity conversion,this paper successfully applies the whole annealing genetic algorithm (WAGA) to find the best polarity of an RM circuit.Through testing eight large-scale circuits from the Microelectronics Center North Carolina (MCNC) Benchmark,the SYNOPSYS synthesis results show that the RM circuits corresponding to the best polarity found using the proposed algorithm attain average power,area,and max delay savings of 77.2%,62.4%,and 9.2% respectively,compared with those under polarity 0.
Key words: whole annealing genetic algorithm, REED-MULLER, low power, polarity conversion
Article views: 3144 Times PDF downloads: 1005 Times Cited by: 0 Times
Received: 18 August 2015 Revised: 14 August 2007 Online: Published: 01 February 2008
| Citation: |
Wang Pengjun, Lu Jingang, Chen Ken, Xu Jian. Low Power Polarity Conversion Based on the Whole Annealing Genetic Algorithm[J]. Journal of Semiconductors, 2008, 29(2): 298-303.
****
Wang P J, Lu J G, Chen K, Xu J. Low Power Polarity Conversion Based on the Whole Annealing Genetic Algorithm[J]. J. Semicond., 2008, 29(2): 298.
|
Journal of Semiconductors © 2017 All Rights Reserved 京ICP備05085259號-2