Decomposition-Based Methods for FSM Implementation
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.
KeywordsFSM Symbolic function decomposition Logic synthesis
- 1.Adamski, M., Karatkevich, A., & Węgrzyn, M. (eds.) (2005). Design of Embedded Control Systems. New York: Springer.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
- 6.Astola, J. T., & Stanković, R. S. (2006). Fundamentals of switching theory and logic design: A hands on approach. London: Springer.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
- 16.Humphrey, W. S. (1958). Switching circuits with computer applications. New York: McGraw-Hill.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
- 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
- 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
- 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
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.