Title :
State assignment based on the reduced dependency theory and recent experimental results
Author :
Duff, C. ; Saucier, G.
Author_Institution :
Inst. Nat. Polytech de Grenoble, France
Abstract :
A state assignment method is described. The first step of this method recognizes predictive minimization situations in the control flow graph. It is based on the partition pair theory and privileges the cube collapsing in the next state and output equations with regard to factorization. The second step uses a powerful intersecting face embedding theory in the Boolean lattice. This approach has been implemented by software in the ASYL system, and tested on official as well as industrial examples. The gain in silicon area, critical path, and routing factor with respect to random assignment appears to be the best presently known.<>
Keywords :
state assignment; ASYL; Boolean lattice; control flow graph; critical path; cube collapsing; factorization; industrial examples; intersecting face embedding theory; partition pair theory; predictive minimization; reduced dependency theory; routing factor; silicon area; state assignment; Automata; Design automation; Encoding; Equations; Flow graphs; Hypercubes; Integrated circuit synthesis; Lattices; Minimization methods; Silicon compiler;
Conference_Titel :
Computer-Aided Design, 1991. ICCAD-91. Digest of Technical Papers., 1991 IEEE International Conference on
Conference_Location :
Santa Clara, CA, USA
Print_ISBN :
0-8186-2157-5
DOI :
10.1109/ICCAD.1991.185237
