Reducing the Use of Resources in the FPGA Circuit of a Moore FSM

  • Authors:
  • A. A. Barkalov;L. A. Tytarenko;R. V. Malcheva;K. A. Soldatov

  • Affiliations:
  • University of Zielona Góra, Zielona Góra, Poland;University of Zielona Góra, Zielona Góra, Poland;Donetsk National Technical University, Donetsk, Ukraine;Donetsk National Technical University, Donetsk, Ukraine

  • Venue:
  • Cybernetics and Systems Analysis
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

Two modifications of coding states of a Moore finite-state machine (FSM) are proposed. The modifications are based on pseudoequivalent states of the machine with a view to reducing the number of rows in the transition table of the machine and also on the use of free embedded memory blocks in implementing a system of microoperations. Synthesis methods for Moore FSMs are proposed. Research results are presented and appropriate application areas of the proposed methods are specified.