OPTIMIZATION OF MOORE FINITE STATE MACHINE IMPLEMENTED ON THE PROGRAMMABLE LOGIC
DOI:
https://doi.org/10.15588/1607-3274-2012-1-8Keywords:
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.Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2014 A.A. Barkalov, R.V. Malcheva, K.A. Soldatov
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Creative Commons Licensing Notifications in the Copyright Notices
The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.
The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.
The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.
Authors who publish with this journal agree to the following terms:
-
Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
-
Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
-
Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.