HomeIssuesState assignment in a discrete automaton targeting an implementing low power circuit

State assignment in a discrete automaton targeting an implementing low power circuit | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 4(14).

The problem of thestate assignment in a discrete automaton aimed to decrease the switching activity of memoryelements in an implementing circuit is considered. A method for solving this problembased on an approach connected with the "desirable neighborhood" method is proposed.
Download file
Counter downloads: 70
  • Title State assignment in a discrete automaton targeting an implementing low power circuit
  • Headline State assignment in a discrete automaton targeting an implementing low power circuit
  • Publesher Tomask State UniversityTomsk State University
  • Issue Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics 4(14)
  • Date:
  • DOI
Keywords
discrete automaton, энергосбережение, кодирование состояний, дискретный автомат, state assignment
Authors
References
Macii E., Pedram M., and Somenzi F. High-level power modeling, estimation and optimization // IEEE Trans. Computer-Aided Design Integrated Circuits and Systems. 1998. V. 17. No. 11. P. 1061-1079.
Pottosin Yu. V. «Assembling» a Boolean hypercube: an approach to state assignment of finite state machines // Second Inter. Conf. Computer-Aided Design of Discrete Devices - CAD DD'97. Minsk, Republic of Belarus, November 12-14, 1997. V. 1. Minsk: National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, 1997. P. 54-59.
Закревский А. Д., Поттосин Ю. В., Черемисинова Л. Д. Логические основы проектирования дискретных устройств. М.: Физматлит, 2007. 592 с.
Оранов A. M. Размещение множества вершин взвешенного графа в простой цепи // Логическое проектирование дискретных устройств. Минск: Ин-т техн. кибернетики АН БССР, 1984. С. 54-61.
Armstrong D. B. On the efficient assignment of internal codes to sequential machines // IRE Trans, EC-11. 1962. No. 5. P. 611-622.
Armstrong D. B. A programmed algorithm for assigning internal codes for sequential machines // IRE Trans., EC-11. 1962. No. 4. P. 466-472.
Закревский А. Д. Алгоритмы энергосберегающего кодирования состояний автомата // Информатика. 2011. №1(29). С. 68-78.
Закревский А. Д. Об оптимальном размещении графа в булевом пространстве // Вестник Томского госуниверситета. Приложение. 2005. №14. С. 13-17.
Sudnitson A. Partition search for FSM low power synthesis // Fourth Inter. Conf. Computer- Aided Design of Discrete Devices -CAD DD'2001. Minsk, Republic of Belarus, November 14-16, 2001. V. 1. Minsk: National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, 2001. P. 44-49.
Kashirova L., Keevallik A., and Meshkov M. State assignment of finite state machine for decrease of power dissipation // Second Inter. Conf. Computer-Aided Design Discrete Devices -CAD DD'97. Minsk, Republic of Belarus, November 12-14, 1997. V. 1. Minsk: National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, 1997. P. 60-67.
Pedram M. Power minimization in IC design: Principles and applications // ACM Trans. Design Automat. Electron. Syst. 1996. V. 1. P. 3-56.
Мурога С. Системное проектирование сверхбольших интегральных схем. В 2 кн. Кн. 1. М.: Мир, 1985. 288 с.
State assignment in a discrete automaton targeting an implementing low power circuit | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 4(14).
State assignment in a discrete automaton targeting an implementing low power circuit | Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 4(14).
Download full-text version
Counter downloads: 212
Download file