A probabilistic pairwise swap search state assignment algorithm for sequential circuit optimization

Aiman H. El-Maleh

Abstract: Highlights•PPSS assigns probabilities for each pair of code swaps and intelligently updates them.•It explores code swaps in a gradual manner.•It uses Tabu lists to diversify search exploration and hill climbing.•PPSS algorithm is used for FSM state encoding targeting area and power minimization.•Significantly better results are achieved in comparison to other evolutionary and deterministic algorithms.