This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05)
Application of Symbolic Functional Decomposition Concept in FSM Implementation Targeting FPGA Devices
Las Vegas, Nevada
August 16-August 18
ISBN: 0-7695-2358-7
Mariusz Rawski, Warsaw University of Technology
Henry Selvaraj, University of Nevada at Las Vegas
Tadeusz Łuba, Warsaw University of Technology
Piotr Szotkowski, Warsaw University of Technology
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.
Citation:
Mariusz Rawski, Henry Selvaraj, Tadeusz Łuba, Piotr Szotkowski, "Application of Symbolic Functional Decomposition Concept in FSM Implementation Targeting FPGA Devices," iccima, pp.153-158, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.