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

详细信息    查看全文

• 作者：Aiman H. El-Maleh ^{aimane@kfupm.edu.sa}
• 关键词：State assignment ; State encoding ; Evolutionary algorithms ; Probabilistic pairwise swap search ; Synthesis and optimization of sequential circuits
• 刊名：Integration, the VLSI Journal
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：56
• 期：Complete
• 页码：32-43
• 全文大小：667 K
• 卷排序：56

文摘

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.