State Assignment of Finite-State Machines by Using the Values of Input Variables

被引：2

作者：

Salauyou, Valery ^{[1
]}

Ostapczuk, Michal ^{[1
]}

机构：

[1] Bialystok Tech Univ, Fac Comp Sci, Bialystok, Poland

来源：

COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT (CISIM 2017) | 2017年 / 10244卷

关键词：

Finite state machine (FSM); Field programmable gate array (FPGA); State assignment; Area minimization; State splitting; Look up table;

D O I：

10.1007/978-3-319-59105-6_51

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we propose the method of FSM synthesis on field programmable gate arrays (FPGAs) when input variables are used for state assignment. For this purpose we offer a combined structural model of class A and class E FSMs. This paper also describes in detail the algorithms for synthesis a class AE FSM which consists of splitting of internal states for performance of necessary conditions for synthesis of the class E FSM and state assignment of the class AE FSM. It is shown that the proposed method reduces the area for all families of FPGAs by a factor of 1.19-1.39 on average and by a factor of three for certain families. Practical issues concerning the method and the specific features of its use are discussed, and possible directions of the elaboration of this approach are proposed.

引用

页码：592 / 603

页数：12

共 50 条

[31] OPTIMAL STATE ASSIGNMENT FOR FINITE STATE MACHINES
DEMICHELI, G
BRAYTON, RK
SANGIOVANNIVINCENTELLI, A
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1985, 4 (03) : 269 - 285
[32] A state assignment algorithm for finite state machines
Skias, D
Haniotakis, T
Tsiatouhas, Y
Arapoyanni, A
ICECS 2000: 7TH IEEE INTERNATIONAL CONFERENCE ON ELECTRONICS, CIRCUITS & SYSTEMS, VOLS I AND II, 2000, : 823 - 826
[33] LANG - algorithm for constructing unique input/output sequences in finite-state machines
Ahmad, I
Ali, FM
Das, AS
IEE PROCEEDINGS-COMPUTERS AND DIGITAL TECHNIQUES, 2004, 151 (02): : 131 - 140
[34] On test generation for interconnected finite-state machines - The input sequence propagation problem
Pomeranz, I
Reddy, SM
PROCEEDINGS OF THE FIFTH ASIAN TEST SYMPOSIUM (ATS '96), 1996, : 16 - 21
[35] MINIMAL INPUT-MEMORY AND OUTPUT-MEMORY FINITE-STATE MACHINES
VAIRAVAN, K
IEEE TRANSACTIONS ON COMPUTERS, 1972, C 21 (06) : 598 - &
[36] On state assignment of finite state machines using hypercube embedding approach
Ahmad, Imtiaz
Ul-Mustafa, Raza
Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1999, : 608 - 613
[37] An efficient algorithm for Gaussian blur using finite-state machines
Waltz, FM
Miller, JWV
MACHINE VISION SYSTEMS FOR INSPECTION AND METROLOGY VII, 1998, 3521 : 334 - 341
[38] Formal Modeling of RESTful Systems Using Finite-State Machines
Zuzak, Ivan
Budiselic, Ivan
Delac, Goran
WEB ENGINEERING, ICWE 2011, 2011, 6757 : 346 - 360
[39] Logic Locking of Finite-State Machines Using Transition Obfuscation
Muzaffar, Shahzad
Elfadel, Ibrahim M.
PROCEEDINGS OF THE 2022 IFIP/IEEE 30TH INTERNATIONAL CONFERENCE ON VERY LARGE SCALE INTEGRATION (VLSI-SOC), 2022,
[40] Implementation of supervisory control using extended finite-state machines
Yang, Y.
Mannani, A.
Gohari, P.
INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2008, 39 (12) : 1115 - 1125

← 1 2 3 4 5 →