DocumentCode
3620059
Title
Application of symbolic functional decomposition concept in FSM implementation targeting FPGA devices
Author
M. Rawski;H. Selvaraj;T. Luba;P. Szotkowski
Author_Institution
Warsaw Univ. of Technol., Poland
fYear
2005
fDate
6/27/1905 12:00:00 AM
Firstpage
153
Lastpage
158
Abstract
This paper presents an FSM implementation method based on symbolic functional decomposition. This novel approach in multilevel logic synthesis of finite state machines targets FPGA architectures. Traditional methods are based on two steps: internal state encoding and then mapping the encoded state transition table into target architecture. In the case of FPGAs, functional decomposition is recognized as the most efficient method of implementing digital circuits. However none of the known state encoding algorithms can be considered as a good method to be used with functional decomposition. In this paper the concept of symbolic functional decomposition is applied to obtain a multilevel structure that is suitable for implementing in FPGA logic cells. The symbolic decomposition does not require separate encoding step. It accepts FSM description with symbolic states and performs decomposition introducing such a state encoding that guarantees the best solution known.
Keywords
"Field programmable gate arrays","Logic","Encoding","Flip-flops","Minimization","Automata","Circuit synthesis","Digital circuits","Boolean functions","Table lookup"
Publisher
ieee
Conference_Titel
Computational Intelligence and Multimedia Applications, 2005. Sixth International Conference on
Print_ISBN
0-7695-2358-7
Type
conf
DOI
10.1109/ICCIMA.2005.11
Filename
1540718
Link To Document