Finite state machine decomposition for I/O minimization

Author

Kuo, Ming-Ter ; Liu, Lung-Tien ; Cheng, Chung-Kuan

Author_Institution

Dept. of Comput. Sci. & Eng., California Univ., San Diego, La Jolla, CA, USA

Volume

2

fYear

1995

fDate

30 Apr-3 May 1995

Firstpage

1061

Abstract

In this paper, we consider the problem of decomposing a Finite State Machine (FSM) into communicating FSMs to minimize the number of inputs/outputs. We propose an FSM decomposition procedure based on partitioning the set of transitions that describes the behavior of an FSM. An extended FM-based partitioning algorithm is applied for transition partitioning. We also devise a state output encoding technique to further reduce the number of interconnections between the FSMs required for communication. Experimental results for MCNC benchmarks show that our algorithm has favorable results over circuit partitioning algorithms on the netlist level

Keywords

finite state machines; logic CAD; logic partitioning; sequential circuits; FM-based algorithm; I/O minimization; MCNC benchmarks; communicating FSMs; finite state machine decomposition; state output encoding technique; transition partitioning; Automata; Circuit synthesis; Clocks; Computer science; Encoding; Integrated circuit interconnections; Logic; Partitioning algorithms; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

0-7803-2570-2

Type

conf

DOI

10.1109/ISCAS.1995.520329

Filename

520329