OPTIMIZATION OF MOORE FINITE STATE MACHINE IMPLEMENTED ON THE PROGRAMMABLE LOGIC

Authors

  • A.A. Barkalov University of Zelena Gora, Poland, Poland
  • R.V. Malcheva Donetsk National Technical University, Ukraine
  • K.A. Soldatov Donetsk National Technical University, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2012-1-8

Keywords:

Moore FSM, Programmable Logic, GSA, pseudoequivalent states, replacement of logic conditions.

Abstract

This article is proposed a method which is designed to reduce the number of input variables and intermediate terms of Boolean functions. The method is based on the extended codes of states and replacement of logic conditions. Application of the proposed method allows up to 20% reduction in the total count of macrocells in blocks BLC and BFM.

Published

2012-07-10

How to Cite

Barkalov, A., Malcheva, R., & Soldatov, K. (2012). OPTIMIZATION OF MOORE FINITE STATE MACHINE IMPLEMENTED ON THE PROGRAMMABLE LOGIC. Radio Electronics, Computer Science, Control, (1). https://doi.org/10.15588/1607-3274-2012-1-8

Issue

Section

Mathematical and computer modelling