Improving Hardware in LUT-Based Mealy FSMs

• Published in: Applied sciences Vol. 12; no. 16; p. 8065
• Main Authors: Barkalov, Alexander, Titarenko, Larysa, Krzywicki, Kazimierz
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.08.2022
• Subjects: Boolean; Carbon monoxide; Circuits; collection of outputs; Embedded systems; Finite state machines; FPGA; Logic; LUT count; Mealy FSM; Methods; Optimization; Power consumption; synthesis; Variables
• ISSN: 2076-3417; 2076-3417
• DOI: 10.3390/app12168065

The main contribution of this paper is a novel design method reducing the number of look-up table (LUT) elements in the circuits of three-block Mealy finite-state machines (FSMs). The proposed method is based on using codes of collections of outputs (COs) for representing both FSM state variables and outputs. The interstate transitions are represented by output collections generated during two adjacent cycles of FSM operation. To avoid doubling the number of variables encoding of COs, two registers are used. The first register keeps a code of CO produced in the current cycle of operation; the code of a CO produced in the previous cycle is kept in the second register. There is given a synthesis example with applying the proposed method. The results of the research are shown. The research is conducted using the CAD tool Vivado by Xilinx. The experiments prove that the proposed approach allows reducing the hardware compared with such known methods as auto and one-hot of Vivado, and JEDI. Additionally, the proposed approach gives better results than a method based on the simultaneous replacement of inputs and encoding of COs. Compared to circuits of the three-block FSMs, the LUT counts are reduced by an average of 7.21% without significant reduction in the performance. Our approach loses in terms of power consumption (on average 9.62%) and power–time products (on average 10.44%). The gain in LUT counts and area–time products increases with the increase in the numbers of FSM states and inputs.