Low power state assignment using ILP techniques

Abstract

-State assignment for finite state machines is a critical optimization problem in the synthesis of sequential circuits. In this paper we address the state assignment problem from a low power perspective. We experiment with Boolean Satisfiability and Integer Linear Programming techniques to solve the assignment problem where the primary goal is the reduction of switching activity during state transitions. We also detect and evaluate the use of symmetries in speeding up the search process. These techniques have been applied to the MCNC benchmark circuits and yielded promising results.

Majority‐based evolution state assignment algorithm for area and power optimisation of sequential circuits

“…They are based on heuristics that try to maximise factoring of expressions to reduce the number of literals in the resulting multi‐level circuit. Examples of deterministic techniques for power optimisation include the work in [8, 9]. The work in [8] is based on sequentially assigning states with highest transition probability state codes with Hamming distance (HD) of 1.…”

“…The work in [8] is based on sequentially assigning states with highest transition probability state codes with Hamming distance (HD) of 1. The work in [9] attempts to optimise power by modelling the minimisation of flip‐flops (FFs) switching activity using integer linear programming.…”