An area optimization approach taking into account polarity conversion sequence.

At present, area has become one of the main bottlenecks restricting the development of EDA. The area optimization for XNOR/OR-based fixed polarity Reed–Muller (FPRM) circuits aims to find an FPRM circuit with a minimum area. Because the area optimization is a combinatorial optimization problem, we first propose an adaptive bacterial foraging algorithm based on tabu search (ABFA-TS), which includes fuzzy control theory and tabu search strategy. Few studies have considered the problem of polarity conversion sequence. In order to solve the problem of conversion sequence, we propose a hybrid genetic algorithm (HGA) based on the nearest neighbor. Moreover, based on the proposed ABFA-TS and proposed HGA, we propose an area optimization approach for FPRM circuits, which searches for an FPRM circuit with a minimum area. The experimental results confirmed that the maximum time saving rate of HGA reached 78%, and confirmed the superiority of the FPRM area optimization approach in optimizing the FPRM circuits area. • A hybrid genetic algorithm is proposed to solve the switching sequence problem. • An adaptive bacterial foraging algorithm is proposed to solve the combinatorial problem. • An area optimization approach for FPRM logic circuits is proposed. • Experimental results show that the proposed approaches are effective. [ABSTRACT FROM AUTHOR]