Verification method for area optimization of mixed-polarity Reed-Muller logic circuits

Chuandong Chen, Bing Lin, Michelle Zhu

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


Area minimization of mixed-polarity Reed-Muller (MPRM) logic circuits is an important step in logic synthesis. While previous studies are mainly based on various artificial intelligence algorithms and not comparable with the results from the mainstream electronics design automation (EDA) tool. Furthermore, it is hard to verify the superiority of intelligence algorithms to the EDA tool on area optimization. To address these problems, a multi-step novel verification method was proposed. First, a hybrid simulated annealing (SA) and discrete particle swarm optimization (DPSO) approach (SADPSO) was applied to optimize the area of the MPRM logic circuit. Second, a Design Compiler (DC) algorithm was used to optimize the area of the same MPRM logic circuit under certain settings and constraints. Finally, the area optimization results of the two algorithms were compared based on MCNC benchmark circuits. Results demonstrate that the SADPSO algorithm outperforms the DC algorithm in the area optimization for MPRM logic circuits. The SADPSO algorithm saves approximately 9.1% equivalent logic gates compared with the DC algorithm. Our proposed verification method illustrates the efficacy of the intelligence algorithm in area optimization compared with DC algorithm. Conclusions in this study provide guidance for the improvement of EDA tools in relation to the area optimization of combinational logic circuits.

Original languageEnglish
Pages (from-to)28-34
Number of pages7
JournalJournal of Engineering Science and Technology Review
Issue number1
StatePublished - 2018


  • Area optimization
  • Intelligence algorithm
  • Logic synthesis
  • Mixed-polarity Reed-Muller


Dive into the research topics of 'Verification method for area optimization of mixed-polarity Reed-Muller logic circuits'. Together they form a unique fingerprint.

Cite this