Using SAT-based techniques in low power state assignment

Journal of Circuits, Systems and Computers

Volumn 20, Issue 8, 2011, Pages 1605-1618

  Sagahyroon, Assim ^a   Aloul, Fadi A ^a   Sudnitson, Alexander ^b  

^a AMERICAN UNIVERSITY OF SHARJAH   (United Arab Emirates)

^b TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

Boolean Satisfiability; integer linear programming; power; State assignment

Indexed keywords

ASSIGNMENT PROBLEMS; AVERAGE NUMBERS; BENCHMARK SUITES; BOOLEAN SATISFIABILITY; COMMERCIAL SOLVERS; INTEGER LINEAR PROGRAMMING; NP-HARD; OPTIMIZED SOLUTIONS; POWER; POWER MINIMIZATION; SEARCH PROCESS; STATE TRANSITIONS; SYMMETRY-BREAKING; SYNCHRONOUS SEQUENTIAL CIRCUITS;

FORMAL LOGIC; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LOW POWER ELECTRONICS; OPTIMIZATION; STATE ASSIGNMENT; SWITCHING CIRCUITS;

HEURISTIC METHODS;

EID: 84856045100     PISSN: 02181266     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218126611007980     Document Type: Article

References (31)

1. L. Benini and G. De Micheli, State assignment for low power dissipation, IEEE J. Solid-State Circuits 30 (1995) 258-268.
2. G. Hachtel, M. Hermida, A. Pardo, M. Poncino and F. Somenzi, Re-encoding sequential circuits to reduce power dissipation, Proc. Int. Conf. Computer Aided Design (1994), pp. 70-73.
3. M. Koegst, G. Franke and K. Feske, State assignment for FSM low power design, Proc. European Design Automation Conf. (1996), pp. 28-33.
4. L. Daldoss, D. Sciuto and C. Silvano, State encoding for low power embedded controllers, Proc. IEEE Int. Symp. Circuits and Systems (1998), pp. 421-424.
5. W. Noth and R. Kolla, Spanning tree based state encoding for low power dissipation, Proc. Design Automation and Test in Europe Conf. (1999), pp. 168-174.
6. P. Bacchetta, L. Daldoss, D. Sciuto and C. Silvano, Low-power state assignment techniques for finite state machines, Proc. IEEE Int. Symp. Circuits and Systems (2000), pp. 641-644.
7. R. Eggermont, S. Cotofana and C. Lageweg, Profiling-based state assignment for low power dissipation, Proc. Program for Research on Integrated Systems and Circuits (2004).
8. S. Park, S. Cho, S. Yang and M. Ciesielski, A new state assignment technique for testing and low power, Proc. Design Automation Conf. (2004), pp. 510-513.
9. L. Yuan, G. Qu, T. Villa and A. Sangiovanni-Vincentelli, FSM Re-engineering and its application in low power state encoding, Proc. Asia and South Pacific Design Automation Conf. (2005), pp. 254-259.
10. G. Audemard and L. Simon, Predicting learnt clauses quality in modern SAT solver, Proc. Int. Joint Conf. Artificial Intelligence (2009), pp. 399-404.
11. A. Biere, PicoSAT essentials, J. Satisfiability, Boolean Model. Comput. 4 (2008) 75-97.
12. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an efficient SAT solver, Proc. Design Automation Conf. (2001), pp. 530-535. (Pubitemid 32841010)
13. K. Pipatsrisawat and A. Darwiche, RSat 2.0: SAT solver description, Technical report D153, Automated Reasoning Group, Computer Science Department, University of California, Los Angeles (2007).
14. A. Biere, A. Cimatti, E. Clarke, M. Fujita and Y. Zhu, Symbolic Model Checking using SAT procedures instead of BDDs, Proc. Design Automation Conf. (1999), pp. 317-320.
15. G. Nam, F. Aloul, K. Sakallah and R. Rutenbar, A comparative study of two Boolean formulations of FPGA detailed routing constraints, IEEE Trans. Comput. 53 (2004) 688-696.
16. F. Aloul, A. Ramani, I. Markov and K. Sakallah, Generic ILP versus specialized 0-1 ILP: An update, Proc. Int. Conf. Computer-Aided Design (2002), pp. 450-457.
17. S. Memik and F. Fallah, Accelerated Boolean satisfiability-based scheduling of control/data flow graphs for high-level synthesis, Proc. Int. Conf. Computer Design (2002), pp. 395-400. (Pubitemid 35186490)
18. A. Sagahyroon and F. Aloul, Using SAT-based techniques in power estimation, Microelectron J. 38 (2007) 706-715. (Pubitemid 47175992)
19. D. Chai and A. Kuehlmann, A fast pseudo-Boolean constraint solver, Proc. Design Automation Conf. (2003), pp. 830-835.
20. H. Dixon and M. Ginsberg, Inference methods for a pseudo-Boolean satisfiability solver, Proc. National Conf. Artificial Intelligence (2002), pp. 635-640.
21. N. Een and N. Sorensson, An extensible SAT-solver, Proc. Int. Conf. Theory and Applications of Satisfiability Testing (2003), pp. 502-508.
22. H. Sheini and K. Sakallah, Pueblo: A modern pseudo-Boolean SAT solver, Proc. Design, Automation, and Test Conf. Europe (2005), pp. 684-685.
23. ILOG CPLEX, http://www.ilog.com/products/cplex.
24. F. Aloul, A. Ramani, I. Markov and K. Sakallah, Solving difficult instances of Boolean satisfiability in the presence of symmetry, IEEE Trans. Comput.-Aided Des. 22 (2003) 1117-1137.
25. J. Crawford, M. Ginsberg, E. Luks and A. Roy, Symmetry-breaking predicates for search problems, Proc. 5th Int. Conf. Principles of Knowledge Representation and Reasoning (1996), pp. 148-159.
26. A. Ramani, F. Aloul, I. Markov and K. Sakallah, Breaking instance-independent symmetries in exact graph coloring, J. Artif. Intell. Res. 26 (2006) 289-322. (Pubitemid 44452213)
27. J. Nelson, K. Tumer and J. Ghosh, Designing genetic algorithms for the state assignment problem, IEEE Trans. Syst. Man Cybern. 25 (1999) 687-694.
28. F. Aloul, K. Sakallah and I. Markov, Efficient symmetry breaking for Boolean satisfiability, IEEE Trans. Comput. 55 (2006) 549-558.
29. P. Darga, M. Lifiton, K. Sakallah and I. L. Markov, Exploiting structure in symmetry generation for CNF, Proc. Design Automation Conf. (2004), pp. 530-534.
30. MCNC Benchmarks, http://www.cbl.ncsu.edu/CBL Docs/Bench.htm.
31. F. Aloul, A. Ramani, I. Markov and K. Sakallah, Symmetry-breaking for pseudo-Boolean formulas, ACM J. Exp. Algorithmics 12 (2007).