Skip to main content

Area Targeted Minimization Method of Finite State Machines for FPGA Devices

  • Conference paper
  • First Online:
Computer Information Systems and Industrial Management (CISIM 2018)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11127))

Abstract

A new method for the minimization of finite state machines (FSMs) is proposed. In this method, such optimization criterion as the number of used logic elements is taken into account already at the stage of minimizing internal states. The method is based on sequential merging of two internal states. For this purpose, the set of all pairs of states that can be merged is found, and the pair that best satisfies the optimization criteria is chosen for merging. In addition, the proposed method allows one to minimize the number of transitions and input variables of the FSM. The binary, one-hot and JEDI state assignment methods are used. Experimental results show, that the used FPGA area is less on average by 18% comparing to traditional methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Hallbauer, G.: Procedures of state reduction and assignment in one step in synthesis of asynchronous sequential circuits. In: Proceedings of the International IFAC Symposium on Discrete Systems, Riga, 1974, pp. 272–282. Pergamons (1974)

    Google Scholar 

  2. Lee, E.B., Perkowski, M.: Concurrent minimization and state assignment of finite state machines, In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Minneapolis. IEEE Computer Society (1984)

    Google Scholar 

  3. Avedillo, M.J., Quintana, J.M., Huertas, J.L.: SMAS: a program for concurrent state reduction and state assignment of finite state machines. Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS), Singapore, 1991, pp. 1781–1784. IEEE (1991)

    Google Scholar 

  4. Rho, J.-K., Hachtel, G., Somenzi, F., Jacoby, R.: Exact and heuristic algorithms for the minimization of incompletely specified state machines. IEEE Trans. Comput. Aided Des. 13, 167–177 (1994)

    Article  Google Scholar 

  5. Wang, K.H., Wang, W.S., Hwang, T.T., et al.: State assignment for power and area minimization. In: Proceedings of the IEEE International Conference on Computer Design: VLSI in Computers and Processors, Cambridge, USA, pp. 250–254. IEEE Computer Society (1994)

    Google Scholar 

  6. Xia, Y., Almaini, A.E.A.: Genetic algorithm based state assignment for power and area optimization. IEE Proc. Comput. Digital Techn. 149(4), 128–133 (2002)

    Article  Google Scholar 

  7. Chaudhury, S., KrishnaTejaSistla, K.T., Chattopadhyay, S.: Genetic algorithmbased FSM synthesis with area-power trade-offs. Integr. VLSI J. 42, 376–384 (2009)

    Article  Google Scholar 

  8. Chattopadhyay, S., Yadav, P., Singh, R.K.: Multiplexer targeted finite state machine encoding for area and power minimization. In: Proceedings of the IEEE India Annual Conference on Kharagpur, India, 2004, pp. 12–16. IEEE Computer Society (2004)

    Google Scholar 

  9. Aiman, M., Sadiq, S.M., Nawaz, K.F.: Finite state machine state assignment for area and power minimization. In: Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS), Island of Kos, Greece, 2006, pp. 5303–5306. IEEE Computer Society (2004)

    Google Scholar 

  10. Yuan, L., Qu, G., Villa, T., Sangiovanni-Vincentelli, A.: An FSM reengineering approach to sequential circuit synthesis by state splitting. IEEE Trans. CAD 27, 1159–1164 (2008)

    Article  Google Scholar 

  11. Klimowicz, A., Solov’ev, V., Grzes, T.: Minimization method of finite state machines for low power design. In: Proceedings of Euromicro Conference on Digital System Design, Funchal, 2015, pp. 259–262 (2015)

    Google Scholar 

  12. Klimovich, A., Solov’ev, V.V.: Minimization of mealy finite-state machines by internal states gluing. J. Comput. Syst. Sci. Int. 51(2), 244–255 (2012)

    Article  MathSciNet  Google Scholar 

  13. Lin, B., Newton, R.A.: Synthesis of multiple level logic from symbolic high-level description languages. In: Proceedings of the International Conference on VLSI, pp. 187–196 (1989)

    Google Scholar 

  14. Klimowicz, A., Solov’ev, V.V.: Minimization of incompletely specified Mealy finite-state machines by merging two internal states. J. Comput. Syst. Sci. Int. 52(3), 400–409 (2013)

    Article  MathSciNet  Google Scholar 

  15. Zakrevskij, A.D.: Logic synthesis of cascade circuits. Nauka, Moscow (1981). [in Russian]

    MATH  Google Scholar 

  16. Yang, S.: Logic synthesis and optimization benchmarks user guide. Version 3.0. Technical Report. North Carolina. Microelectronics Center of North Carolina (1991)

    Google Scholar 

Download references

Acknowledgements

The research has been done in the framework of the grant S/WI/3/2018 and financed from the funds for science by MNiSW.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Adam Klimowicz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Klimowicz, A. (2018). Area Targeted Minimization Method of Finite State Machines for FPGA Devices. In: Saeed, K., Homenda, W. (eds) Computer Information Systems and Industrial Management. CISIM 2018. Lecture Notes in Computer Science(), vol 11127. Springer, Cham. https://doi.org/10.1007/978-3-319-99954-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-99954-8_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-99953-1

  • Online ISBN: 978-3-319-99954-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics