IMPLEMENTING COMBINED FSM WITH CPLDS
Journal Title: International Journal of Software Engineering and Computer Systems - Year 2018, Vol 4, Issue 1
Abstract
The subject of the research in this article is the logic circuit of the combined finite state machine (CFSM), which combines the functions of the both FSM Mealy and Moore. In practice, such a model of control automata is used widely, but in the literature there is almost no theoretical description CFSM models and ways to optimize them. The article considers the problem of optimizing the logic of the combined finite state machine implemented in complex programmable logic devices (CPLD) basis. The CFSM circuit using programmable array logic (PAL) macrocells is implemented. The number of CPLD components, required to implement the logic of the automaton circuit, depends on the CFSM parameters and characteristics of element basis. Obviously, the reduction of necessary number of components leads to a decrease area occupied CFSM scheme in CPLD, thereby leads to reducing the hardware amount and power consumption in the circuit, and as result, increases the efficiency of the whole project. To solve the problem of CFSM optimization for a criterion of hardware expenses in this article it’s proposed to use the structural features of the basis CPLD, as well as the method of pseudoequivalent states. The FSM states are defined as a pseudoequivalent, if they mark some vertices linked with the input of the same next vertex in flow-chart. The proposed method includes the following steps: forming a plurality of CFSM states; encoding of states; forming a set of classes pseudoequivalent states; formation PALer blocks and tables; implementation of the CFSM scheme in a given element basis, such as CPLD. As a result, it’s possible to reduce the necessary number of PAL macro cells for implementing CFSM circuit in CPLD. The general result is a decreasing of in the total area of CFSM circuit on a chip. The advisability conditions of this method are discussed.
Authors and Affiliations
Barkalov A
Keywords
Related Articles
- EP ID EP597370
- DOI -
- Views 92
- Downloads 0
FINGERPRINT WATERMARKING WITH TAMPER LOCALIZATION AND EXACT RECOVERY USING MULTI-LEVEL AUTHENTICATION
This paper presents the tamper localization and exact recovery using multi-level authentication in fingerprint watermarking. The proposed scheme will be detecting the tampered sector of fingerprint images when the waterm...
MODELLING THE UNIVERSITI MALAYSIA PAHANG EXAMINATION TIMETABLING PROBLEM
This paper presents a study of the Universiti Malaysia Pahang (UMP) examination timetabling problem and its constraints. UMP currently situated in two campuses (Gambang and Pekan) which presents many challenges in produc...
INVESTIGATION MODEL FOR DDOS ATTACK DETECTION IN REAL-TIME
Investigating traffic of distributed denial of services (DDoS) attack requires extra overhead which mostly results in network performance degradation. This study proposes an investigation model for detecting DDoS attack...
A MODIFIED ROUTE DISCOVERY APPROACH FOR DYNAMIC SOURCE ROUTING (DSR) PROTOCOL IN MOBILE AD-HOC NETWORKS
Mobile Ad-hoc networks (MANETs) involved in many applications, whether commercial or military because of their characteristics that do not depend on the infrastructure as well as the freedom movement of their elements, b...
A GLOBAL AFRICAN BUFFALO OPTIMIZATION
In this paper, a modified version of the African Buffalo Optimization algorithm with emphasis on global search is proposed. Two different equations with the values of their upper and lower boundaries are selected to be t...