By Topic

A graph-based symbolic functional decomposition algorithm for FSM implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Piotr Szotkowski ; Warsaw University of Technology, Poland ; Mariusz Rawski

Currently widespread approaches to implementation of finite state machines in Field Programmable Gate Array circuits consist of separate encoding and mapping steps. This paper presents a graph-based algorithm that implements a symbolic functional decomposition of the FSMs - a method that does not pre-encode the machinepsilas states, but instead encodes them gradually during every step of the functional decomposition process (used for mapping the FSM to the FPGA circuitpsilas LUT cells). The symbolic functional decomposition method guarantees high quality of the final decomposition, with better results than the current two-step approaches.

Published in:

2008 Conference on Human System Interactions

Date of Conference:

25-27 May 2008