State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm

Aiman H. El-Maleh

doi:10.1109/ISSPIT.2015.7394349

State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm

Aiman H. El-Maleh^*

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

State assignment (SA) for Finite State Machines (FSMs) has a significant impact on the area and power of synthesized sequential circuits. In this paper, we propose a novel probabilistic pairwise swap search (PPSS) state assignment algorithm. The algorithm is based on assigning probabilities for each pair of code swaps and intelligently updating these probabilities such that potentially useful code swaps will get higher chance of being explored. Experimental results demonstrate the effectiveness of the proposed algorithm by achieving significantly better power results in comparison to other evolutionary state assignment algorithms.

Original language	English
Title of host publication	2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	305-308
Number of pages	4
ISBN (Electronic)	9781509004805
DOIs	https://doi.org/10.1109/ISSPIT.2015.7394349
State	Published - 28 Jan 2016

Publication series

Name	2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

ASJC Scopus subject areas

Signal Processing

Access to Document

10.1109/ISSPIT.2015.7394349

Cite this

El-Maleh, A. H. (2016). State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm. In 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015 (pp. 305-308). Article 7394349 (2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISSPIT.2015.7394349

El-Maleh, Aiman H. / State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm. 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 305-308 (2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015).

@inproceedings{28c429eb65474a44bec9802107166aee,

title = "State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm",

abstract = "State assignment (SA) for Finite State Machines (FSMs) has a significant impact on the area and power of synthesized sequential circuits. In this paper, we propose a novel probabilistic pairwise swap search (PPSS) state assignment algorithm. The algorithm is based on assigning probabilities for each pair of code swaps and intelligently updating these probabilities such that potentially useful code swaps will get higher chance of being explored. Experimental results demonstrate the effectiveness of the proposed algorithm by achieving significantly better power results in comparison to other evolutionary state assignment algorithms.",

author = "El-Maleh, {Aiman H.}",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.",

year = "2016",

month = jan,

day = "28",

doi = "10.1109/ISSPIT.2015.7394349",

language = "English",

series = "2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "305--308",

booktitle = "2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015",

address = "United States",

}

El-Maleh, AH 2016, State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm. in 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015., 7394349, 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015, Institute of Electrical and Electronics Engineers Inc., pp. 305-308. https://doi.org/10.1109/ISSPIT.2015.7394349

State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm. / El-Maleh, Aiman H.
2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015. Institute of Electrical and Electronics Engineers Inc., 2016. p. 305-308 7394349 (2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm

AU - El-Maleh, Aiman H.

PY - 2016/1/28

Y1 - 2016/1/28

N2 - State assignment (SA) for Finite State Machines (FSMs) has a significant impact on the area and power of synthesized sequential circuits. In this paper, we propose a novel probabilistic pairwise swap search (PPSS) state assignment algorithm. The algorithm is based on assigning probabilities for each pair of code swaps and intelligently updating these probabilities such that potentially useful code swaps will get higher chance of being explored. Experimental results demonstrate the effectiveness of the proposed algorithm by achieving significantly better power results in comparison to other evolutionary state assignment algorithms.

AB - State assignment (SA) for Finite State Machines (FSMs) has a significant impact on the area and power of synthesized sequential circuits. In this paper, we propose a novel probabilistic pairwise swap search (PPSS) state assignment algorithm. The algorithm is based on assigning probabilities for each pair of code swaps and intelligently updating these probabilities such that potentially useful code swaps will get higher chance of being explored. Experimental results demonstrate the effectiveness of the proposed algorithm by achieving significantly better power results in comparison to other evolutionary state assignment algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84963813196&partnerID=8YFLogxK

U2 - 10.1109/ISSPIT.2015.7394349

DO - 10.1109/ISSPIT.2015.7394349

M3 - Conference contribution

AN - SCOPUS:84963813196

T3 - 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015

SP - 305

EP - 308

BT - 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

El-Maleh AH. State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm. In 2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015. Institute of Electrical and Electronics Engineers Inc. 2016. p. 305-308. 7394349. (2015 IEEE International Symposium on Signal Processing and Information Technology, ISSPIT 2015). doi: 10.1109/ISSPIT.2015.7394349

State assignment for power optimization of sequential circuits based on a probabilistic pairwise swap search algorithm

Abstract

Publication series

Bibliographical note

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this