© The Institution of Electrical Engineers
A state assignment algorithm for two-level logic implementation based on a simulated annealing algorithm is proposed. To save CPU time an efficient cost estimation method is devised without losing much estimation accuracy. The experimental results based on 40 benchmark example finite state machines show that the number of cubes and area obtained by the proposed approach is ∼ 10% less than that of NOVA within a comparable CPU time. For a large example, it could reduce the number of product terms by more than 40%.
References
-
-
1)
-
ACM/SIGDA Benchmark Distribution at MCNC, LCSSynth91–1991 International Workshop on Logic Synthesis, 1991.
-
2)
-
T. Villa ,
A. Sangiovanni-Vincentelli
.
NOVA: state assignment of finite state machines for optimal two-level logic implementation.
IEEE Trans.
,
905 -
924
-
3)
-
G. de Micheli ,
R.K. Brayton ,
A. Sangiovanni-Vincentelli
.
Optimal state assignment for finite state machines.
IEEE Trans.
,
269 -
285
-
4)
-
G. de Micheli
.
Symbolic design of combinational and sequential logic circuits implemented by two-level logic macros.
IEEE Trans.
,
597 -
616
-
5)
-
S. Devadas ,
A.R. Newton
.
Exact algorithms for output encoding, state assignment, and four-level boolean minimisation.
IEEE Trans.
,
13 -
27
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19931082
Related content
content/journals/10.1049/el_19931082
pub_keyword,iet_inspecKeyword,pub_concept
6
6