Skip to main content
SpringerLink
Log in

Decomposition-Based Methods for FSM Implementation

  • Chapter
  • First Online:
Design of Reconfigurable Logic Controllers

Part of the book series: Studies in Systems, Decision and Control ((SSDC,volume 45))

  • 889 Accesses

Abstract

Designing a complex digital system requires an effective method for modeling the sequential part of the system. One of the methods is the Finite State Machine based modeling. The implementation efficiency of the sequential part of the designed system has usually a great impact on the processing performance of the whole digital system. Petri nets, which are another method of modeling the sequential part of systems, can also be transformed into FSM-based models. Thus, development of effective synthesis methods for FSM implementation is very important. Digital systems are often implemented in FPGA architectures. Because of their specific structure, the most efficient synthesis methods are based on functional decomposition. This chapter discusses decomposition-based methods for FSM implementation targeting programmable structures.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Adamski, M., Karatkevich, A., & Węgrzyn, M. (eds.) (2005). Design of Embedded Control Systems. New York: Springer.

    Google Scholar 

  2. Armstrong, D. B. (1962). On the efficient assignment of internal codes to sequential machines. IRE Transactions on Electronic Computers, EC, 11(5), 611–622.

    Article  MathSciNet  MATH  Google Scholar 

  3. Ashar, P., Devadas, S., & Newton, A. R. (1989). Optimum and heuristic algorithms for finite state machine decomposition and partitioning. In 1989 IEEE International Conference on Computer-Aided Design. ICCAD-89. Digest of Technical Papers (pp. 216–219).

    Google Scholar 

  4. Ashar, P., Devadas, S., & Newton, A. R. (1990). A unified approach to the decomposition and re-decomposition of sequential machines. In Proceedings of the 27th ACM/IEEE Design Automation Conference (pp. 601–606).

    Google Scholar 

  5. Ashar, P., Devadas, S., & Newton, A. R. (1992). Sequential logic synthesis. VLSI, computer architecture, and digital signal processing., Kluwer international series in engineering and computer science Boston: Kluwer Academic Publishers.

    Book  Google Scholar 

  6. Astola, J. T., & Stanković, R. S. (2006). Fundamentals of switching theory and logic design: A hands on approach. London: Springer.

    Google Scholar 

  7. Brayton, R. K., Rudell, R., Sangiovanni-Vincentelli, A., & Wang, A. R. (1987). MIS: a multiple-level logic optimization system. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 6(6), 1062–1081.

    Article  Google Scholar 

  8. Brzozowski, J. A., & Łuba, T. (2003). Decomposition of boolean functions specified by cubes. Journal of Multiple-Valued Logic and Soft Computing, 9, 377–417.

    MathSciNet  MATH  Google Scholar 

  9. Chang, S.-C., Marek-Sadowska, M., & Hwang, T. T. (1996). Technology mapping for TLU FPGAs based on decomposition of binary decision diagrams. IEEE Transactions onComputer-Aided Design of Integrated Circuits and Systems, 15(10), 1226–1236.

    Article  Google Scholar 

  10. De Micheli, G., Brayton, R. K., & Sangiovanni-Vincentelli, A. (1985). Optimal state assignment for finite state machines. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 4(3), 269–285.

    Article  Google Scholar 

  11. Devadas, S., Hi-Keung, Ma., Newton, A. R., & Sangiovanni-Vincentelli, A. (1988). MUSTANG: state assignment of finite state machines targeting multilevel logic implementations. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 7(12), 1290–1300.

    Article  Google Scholar 

  12. Dolotta, T. A., & McCluskey, E. J. (1964). The coding of internal states of sequential circuits. IEEE Transactions on Electronic Computers EC, 13(5), 549–562.

    Article  MATH  Google Scholar 

  13. Du, X., Hachtel, G., Lin, B., & Newton, A. R. (1991). MUSE: a multilevel symbolic encoding algorithm for state assignment. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 10(1), 28–38.

    Article  Google Scholar 

  14. Geiger, M., & Muller-Wipperfurth, T. (1991). FSM decomposition revisited: algebraic structure theory applied to MCNC benchmark FSMs. In 28th ACM/IEEE Design Automation Conference (pp. 182–185).

    Google Scholar 

  15. Hartmanis, J., & Stearns, R. E. (1966). Algebraic structure theory of sequential machines., Prentice-Hall international series in applied mathematics Englewood Cliffs: Prentice-Hall.

    MATH  Google Scholar 

  16. Humphrey, W. S. (1958). Switching circuits with computer applications. New York: McGraw-Hill.

    Google Scholar 

  17. Jóźwiak, L., & Chojnacki, A. (2003). Effective and efficient FPGA synthesis through general functional decomposition. Journal of Systems Architecture, 49(4–6), 247–265.

    Article  Google Scholar 

  18. Jóźwiak, L., & Ślusarczyk, A. (2000). A new state assignment method targeting FPGA implementations. In Proceedings of the 26th Euromicro Conference (Vol. 1, pp. 50–59).

    Google Scholar 

  19. Jóźwiak, L., Ślusarczyk, A., & Chojnacki, A. (2003). Fast and compact sequential circuits for the FPGA-based reconfigurable systems. Journal of Systems Architecture, 49(4–6), 227–246.

    Article  Google Scholar 

  20. Lemberski, I. ( 1998). Modified approach to automata state encoding for LUT FPGA implementation. In Proceedings of the 24th Euromicro Conference (Vol. 1, pp. 196–199).

    Google Scholar 

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

    Google Scholar 

  22. Lin, B., & Newton, A. R. (1989). Synthesis of multiple level logic from symbolic high-level description languages. In Proceedings of the IFIP TC 10/WG 10.5 International Conference on Very Large Scale Integration (pp. 187–196).

    Google Scholar 

  23. Lipsett, R., Ussery, C., & Schaefer, C. (1989). VHDL: Hardware description and design. Boston: Kluwer Academic Publishers.

    Book  Google Scholar 

  24. Łuba, T., Rawski, M., Tomaszewicz, P., & Zbierzchowski, B. (2008). Programowalne układy przetwarzania sygnałów i informacji. Wydawnictwa Komunikacji i Łączności.

    Google Scholar 

  25. Rawski, M. (2004). The novel approach to FSM synthesis targeted FPGA architectures. In Proceedings of IFAC Workshop on Programmable Devices and Systems, PDS, IFAC (pp. 169–174).

    Google Scholar 

  26. Rawski, M., Jóźwiak, L., & Łuba, T. (2001). Functional decomposition with an efficient input support selection for sub-functions based on information relationship measures. Journal of Systems Architecture, 47, 137–155. Elsevier Science B.V.

    Article  Google Scholar 

  27. Scholl, C. (2001). Functional decomposition with application to FPGA synthesis. Boston: Kluwer Academic Publisher.

    Book  MATH  Google Scholar 

  28. Sentovich, E., Singh, K., Lavagno, L., Moon, C., Murgai, R., Saldanha, A., et al. (1992). SIS: A system for sequential circuit synthesis. Berkeley: University of California.

    Google Scholar 

  29. Ślusarczyk, A. (2004). Decomposition and encoding of finite state machines for FPGA implementation. Eindhoven: Technische Universiteit Eindhoven.

    Google Scholar 

  30. Szotkowski, P. (2008). A comparison of symbolic functional decomposition algorithms for finite state machine implementation in FPGA devices. III Konferencja naukowo-techniczna doktorantów i młodych naukowców (pp. 381–385).

    Google Scholar 

  31. Szotkowski, P. (2009). Input selection methods for symbolic functional decomposition of finite state machines. In Proceedings of the 4th International PhD Students and Young Scientists Conference (pp. 362–367).

    Google Scholar 

  32. Szotkowski, P. (2010). Symbolic functional decomposition method for implementation of finite state machines in FPGA Devices. PhD thesis. Politechnika Warszawska.

    Google Scholar 

  33. Szotkowski, P. & Rawski, M. (2007). Symbolic functional decomposition algorithm for FSM implementation. In The International Conference on “Computer as a Tool” EUROCON (pp. 484–488).

    Google Scholar 

  34. Szotkowski, P. & Rawski, M. (2008). A graph-based symbolic functional decomposition algorithm for FSM implementation. In 2008 Conference on Human System Interactions (pp. 34–39).

    Google Scholar 

  35. Szotkowski, P., Rawski, M., & Selvaraj, H. (2009). A graph-based approach to symbolic functional decomposition of finite state machines. Systems Science, 35(2), 41–47.

    MATH  Google Scholar 

  36. Villa, T., & Sangiovanni-Vincentelli, A. (1990). NOVA: State assignment of finite state machines for optimal two-level logic implementation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 9(9), 905–924.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Telecommunications, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland

    Mariusz Rawski, Piotr Szotkowski & Paweł Tomaszewicz

Authors
  1. Mariusz Rawski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Szotkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paweł Tomaszewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mariusz Rawski .

Editor information

Editors and Affiliations

  1. Faculty of Computer Science, Electrical Engineering and Automatics, University of Zielona Góra, Zielona Góra, Poland

    Andrei Karatkevich

  2. Faculty of Computer Science, Electrical Engineering and Automatics, University of Zielona Góra, Zielona Góra, Poland

    Arkadiusz Bukowiec

  3. Faculty of Computer Science, Electrical Engineering and Automatics, University of Zielona Góra, Zielona Góra, Poland

    Michał Doligalski

  4. Faculty of Computer Science, Electrical Engineering and Automatics, University of Zielona Góra, Zielona Góra, Poland

    Jacek Tkacz

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Rawski, M., Szotkowski, P., Tomaszewicz, P. (2016). Decomposition-Based Methods for FSM Implementation. In: Karatkevich, A., Bukowiec, A., Doligalski, M., Tkacz, J. (eds) Design of Reconfigurable Logic Controllers. Studies in Systems, Decision and Control, vol 45. Springer, Cham. https://doi.org/10.1007/978-3-319-26725-8_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-26725-8_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26723-4

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

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation