Geodesic
State assignment in a~discrete automaton targeting an implementing low power circuit
Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 62-71.

Voir la notice de l'article provenant de la source Math-Net.Ru

The problem of the state assignment in a discrete automaton aimed to decrease the switching activity of memory elements in an implementing circuit is considered. A method for solving this problem based on an approach connected with the “desirable neighborhood” method is proposed.
Keywords: discrete automaton, state assignment. 
@article{PDM_2011_4_a7,
     author = {Yu. V. Pottosin},
     title = {State assignment in a~discrete automaton targeting an implementing low power circuit},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {62--71},
     publisher = {mathdoc},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/}
}
TY  - JOUR
AU  - Yu. V. Pottosin
TI  - State assignment in a~discrete automaton targeting an implementing low power circuit
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 62
EP  - 71
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/
LA  - ru
ID  - PDM_2011_4_a7
ER  - 
%0 Journal Article
%A Yu. V. Pottosin
%T State assignment in a~discrete automaton targeting an implementing low power circuit
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 62-71
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/
%G ru
%F PDM_2011_4_a7
Yu. V. Pottosin. State assignment in a~discrete automaton targeting an implementing low power circuit. Prikladnaâ diskretnaâ matematika, no. 4 (2011), pp. 62-71. http://geodesic.mathdoc.fr/item/PDM_2011_4_a7/

[1] Muroga S., Sistemnoe proektirovanie sverkhbolshikh integralnykh skhem, V 2 kn., Kn. 1, Mir, M., 1985, 288 pp.

[2] Pedram M., “Power minimization in IC design: Principles and applications”, ACM Trans. Design Automat. Electron. Syst., 1 (1996), 3–56 | DOI

[3] Kashirova L., Keevallik A., 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, National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, Minsk, 1997, 60–67

[4] Sudnitson A., “Partition search for FSM low power synthesis”, Fourth Inter. Conf. Computer-Aided Design of Discrete Devices, CAD DD' 01 (Minsk, Republic of Belarus, November 14–16, 2001), v. 1, National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, Minsk, 2001, 44–49

[5] Zakrevskii A. D., “Ob optimalnom razmeschenii grafa v bulevom prostranstve”, Vestnik Tomskogo gosuniversiteta, 2005, Prilozhenie No 14, 13–17

[6] Zakrevskii A. D., “Algoritmy energosberegayuschego kodirovaniya sostoyanii avtomata”, Informatika, 2011, no. 1(29), 68–78

[7] Armstrong D. B., “A programmed algorithm for assigning internal codes for sequential machines”, IRE Trans., EC-11:4 (1962), 466–472 | MR | Zbl

[8] Armstrong D. B., “On the efficient assignment of internal codes to sequential machines”, IRE Trans, EC-11:5 (1962), 611–622 | MR | Zbl

[9] Oranov A. M., “Razmeschenie mnozhestva vershin vzveshennogo grafa v prostoi tsepi”, Logicheskoe proektirovanie diskretnykh ustroistv, In-t tekhn. kibernetiki AN BSSR, Minsk, 1984, 54–61

[10] Zakrevskii A. D., Pottosin Yu. V., Cheremisinova L. D., Logicheskie osnovy proektirovaniya diskretnykh ustroistv, Fizmatlit, M., 2007, 592 pp.

[11] 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, National Academy of Sciences of Belarus, Institute of Engineering Cybernetics, Minsk, 1997, 54–59

[12] Macii E., Pedram M., Somenzi F., “High-level power modeling, estimation and optimization”, IEEE Trans. Computer-Aided Design Integrated Circuits and Systems, 17:11 (1998), 1061–1079 | DOI