A new state assignment method targeting FPGA implementations

Conference Proceedings of the EUROMICRO

Volumn 1, Issue , 2000, Pages 50-59

  Jozwiak, Lech ^a   Slusarczyk, Aleksander ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY FUNCTIONS; FPGA IMPLEMENTATIONS; FPGA TECHNOLOGY; HARDWARE IMPLEMENTATIONS; INFORMATION FLOWS; PRACTICAL IMPORTANCE; PROGRAMMABILITY; SYNTHESIS METHOD;

FIELD PROGRAMMABLE GATE ARRAYS (FPGA); MICROPROCESSOR CHIPS; OPTIMIZATION; STATE ASSIGNMENT; TOOLS;

HARDWARE;

EID: 24444476347     PISSN: 10896503     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EURMIC.2000.874615     Document Type: Conference Paper

References (32)

1. A. E. A. Almaini, J. F. Miller, P. Thomson, and S. Billina. State assignment of finite state machines using a genetic algorithm. IEE Proc. on Computers and Digital Techniques, pages 279-286, July 1995.
2. D. B. Armstrong. On the efficient assignment of intemal codes to sequential machines. IRE Trans. on Electronic Computers, pages 61 1-622, October 1962.
3. D. B. Armstrong. A programmed algorithm for assigning internal codes to sequential machines. IRE Trans. on Electronic Computers, pages 466-472, August 1962.
4. P. Ashar, S. Devadas, and A. R. Newton. Sequential Logic Synthesis. Kluwer Academic Publishers, 1992.
5. E. Bruce Lee and M. A. Perkowski. Concurrent minimization and state assignment of finite state machines. Proc. of Int. Con$ on Systems, Man and Cybernetics, pages 248-260, October 1984.
6. S. Chattopadhyay and P. Pal Chaudhuri. Genetic algorithm based approach for integrated state assignment and flipflop selection in finite state machine synthesis. Proc. of Int. Con$ on VLSI Design, pages 522-527, 1997.
7. M. J. Ciesielski and J. Shen. A unified approach to inputoutput encoding for fsm state assignment. Proc. of 28th Design Automation Con$, pages 176-181, 1991.
8. G. de Micheli, R. K. Brayton, and A. Sangiovanni-Vincentelli. Optimal state assignment for finite state machines. IEEE Trans. on CAD, pages 269-284, 1985.
9. S. Devadas, H. TonyMa, A. R. Newton, and A. Sangiovanni-Vincentelli. MUSTANGs:t ate assignment of finite state machines for optimal multi-level logic implementation. Proc. of Int. Con$ on CAD, pages 16-19, 1987.
10. T. A. Dolotta and E. J. McCluskey. The coding of internal sates of sequential circuits. IEEE Trans. on Electronic Computers, pages 549-562, October 1964.
11. X. Du, G. Hachtel, B. Lin, and A. R. Newton. MUSE: a multilevel symbolic encoding algorithm for state assignment. IEEE Trans. on CAD, pages 28-38, January 1991.
12. J. Hartmanis and R. E. Steams. Algebraic Structure Theory of Sequential Machines. Prentice Hall, 1966.
13. W. S. Humphrey. Switching Circuits with Computer Applications. McGraw-Hill, New York, 1958.
14. L. Jbiwiak. Minimal realization of sequential machines: The method of maximal adjacencies, EUT-Report 88-E-209. Eindhoven Univ. of Tech., the Netherlands, 1988. ISBN 90-6 144-209-5
15. L. Jbiwiak. Efficient suboptimal state assignment of large sequential machines. Proc. of EDAC, pages 536-541, 1990.
16. L. Jbiwiak. Simultaneous decomposition of sequential machines. Microprocessing and Microprogramming, 30:305-312, 1990
17. L. Jbiwiak. An efficient heuristic method for state assignment of large sequential machines. Journal of Circuits, Systems and Computers, 2( 1): 1-26, 1992.
18. L. Jbiwiak. General decomposition and its use in digital circuit synthesis. VLSI Design, 3(3):225-248, 1995.
19. L. Jbiwiak. Information relationships and measures: an analysis apparatus for efficient information system synthesis. Proc. of 23rd Euromicro Con$, pages 13-23, 1997.
20. L. Jdiwiak and A. Postuia. Genetic engineering versus natural evolution: Genetic algorithms with deterministic operators. Proc. of Int. Con$ on ArtiJicial Inteligence IGA1'99, pages 58-64, 1999.
21. L. Jbiwiak and E Vankan. Bit full decomposition of sequential machines: Algorithms and results. Proc. of Canadian Con$ on Electrical and Computer Engineering, September 1989.
22. L. Lavagno, S. Malik, R. K. Brayton, and A. Sangiovanni-Vincentelli. MIS-MV: optimization of multi-level logic with multiple-valued inputs. Proc. of Int. ConJ on CAD ICCAD' 92, pages 560-563, 1992.
23. I. Lemberski. Modified approach to automata state encoding for lut-fpga implementation. Proc. of of24th Euromicro Con$, pages 196-199, 1998.
24. B. Lin and A. R. Newton. Synthesis of multiple level logic from symbolic high-level description languages. Proc. of IFIP Int. Con$ on VLSI, pages 187-196, 1989.
25. M. Martinez, M. J. Avedillo, J. M. Quintana, and J. L. Huertas. A dynamic model for the state assignment problem. Proc. ofDATE Con$, pages 835-839, 1998.
26. K. McElvain. IWLS'93 Benchmark Set: Version 4. 0. Distributed as a part of IWLS'93 benchmark set, 1993.
27. J. Monteiro, J. Kukula, S. Devadas, and H. Neto. Bitwise encoding of finite state machines. Proc. of7th Con$ on VU1 Design, pages 379-382, 1994.
28. C. Sarwary, E. Prado Lopes, L. Burgun, and A. Greiner. Fsm synthesis on fpga architectures. Proc. of 7th IEEE ASIC Con$, pages 178-181, 1994.
29. E. Sentovich, K. Singh, L. Lavagno, C. Moon, R. Murgai, A. Saldanha, H. Savoj, P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. SIS: A System for Sequential Circuit Synthesis, Memorandum No. UCB/ERL M92/4I. University of California, Berkeley, 1992.
30. J. Shen, Z. Hasan, and M. J. Ciesielski. State assignment for general fsm networks. Proc. of EDAC, pages 245-249, 1992.
31. T. Villa and A. Sangiovanni-Vincentelli. NOVA: state assignment of finite state machines for optimal two-level logic implementation. IEEE Trans. on CAD, pages 905-924, 1990.
32. M. K. Yajnik and M. J. Ciesielski. Finite state machine decomposition using multiway partitioning. Proc. of Int. Con$ on Computer Design: VLSI in Computers and Processors, ICCD'92, pages 320-323, 1992.