Geodesic
Low power assignment of partial states of a parallel automaton
Prikladnaâ diskretnaâ matematika, no. 2 (2022), pp. 113-122

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

The problem of a low-power assignment of the partial states of a parallel automaton is considered. A method to solve that problem is suggested that provides minimizing the number of memory elements in the implementing circuit of the automaton and minimization of their switching activity. The problem is reduced to finding a minimal weighted cover of a graph with its complete bipartite sub-graphs (bi-cliques).
Keywords: parallel automaton, partial state, state assignment, complete bipartite sub-graph, weighted cover problem. 
@article{PDM_2022_2_a6,
     author = {Yu. V. Pottosin},
     title = {Low power assignment of partial states of a parallel automaton},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {113--122},
     publisher = {mathdoc},
     number = {2},
     year = {2022},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/PDM_2022_2_a6/}
}
TY  - JOUR
AU  - Yu. V. Pottosin
TI  - Low power assignment of partial states of a parallel automaton
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2022
SP  - 113
EP  - 122
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2022_2_a6/
LA  - en
ID  - PDM_2022_2_a6
ER  - 
%0 Journal Article
%A Yu. V. Pottosin
%T Low power assignment of partial states of a parallel automaton
%J Prikladnaâ diskretnaâ matematika
%D 2022
%P 113-122
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2022_2_a6/
%G en
%F PDM_2022_2_a6
Yu. V. Pottosin. Low power assignment of partial states of a parallel automaton. Prikladnaâ diskretnaâ matematika, no. 2 (2022), pp. 113-122. http://geodesic.mathdoc.fr/item/PDM_2022_2_a6/