<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE article  PUBLIC "-//NLM//DTD Journal Publishing DTD v3.0 20080202//EN" "http://dtd.nlm.nih.gov/publishing/3.0/journalpublishing3.dtd"><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" dtd-version="3.0" xml:lang="en" article-type="research article"><front><journal-meta><journal-id journal-id-type="publisher-id">CS</journal-id><journal-title-group><journal-title>Circuits and Systems</journal-title></journal-title-group><issn pub-type="epub">2153-1285</issn><publisher><publisher-name>Scientific Research Publishing</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.4236/cs.2014.512031</article-id><article-id pub-id-type="publisher-id">CS-51321</article-id><article-categories><subj-group subj-group-type="heading"><subject>Articles</subject></subj-group><subj-group subj-group-type="Discipline-v2"><subject>Computer Science&amp;Communications</subject><subject> Engineering</subject><subject> Physics&amp;Mathematics</subject></subj-group></article-categories><title-group><article-title>
 
 
  The Application and Adaptation of the Two Sources of Code and Natural Encoding Method for Designing a Model of Microprogram Control Unit with Base Structure
 
</article-title></title-group><contrib-group><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>ukasz</surname><given-names>Smoliński</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Alexander</surname><given-names>Barkalov</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1"><sup>*</sup></xref></contrib><contrib contrib-type="author" xlink:type="simple"><name name-style="western"><surname>Larysa</surname><given-names>Titarenko</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref></contrib></contrib-group><aff id="aff1"><addr-line>Institute of Computer Engineering and Electronics, University of Zielona Góra, Zielona Góra, Poland</addr-line></aff><author-notes><corresp id="cor1">* E-mail:<email>L.Smolinski@weit.uz.zgora.pl(US)</email>;<email>L.Smolinski@weit.uz.zgora.pl(AB)</email>;</corresp></author-notes><pub-date pub-type="epub"><day>12</day><month>11</month><year>2014</year></pub-date><volume>05</volume><issue>12</issue><fpage>301</fpage><lpage>308</lpage><history><date date-type="received"><day>27</day>	<month>September</month>	<year>2014</year></date><date date-type="rev-recd"><day>28</day>	<month>October</month>	<year>2014</year>	</date><date date-type="accepted"><day>6</day>	<month>November</month>	<year>2014</year></date></history><permissions><copyright-statement>&#169; Copyright  2014 by authors and Scientific Research Publishing Inc. </copyright-statement><copyright-year>2014</copyright-year><license><license-p>This work is licensed under the Creative Commons Attribution International License (CC BY). http://creativecommons.org/licenses/by/4.0/</license-p></license></permissions><abstract><p>
 
 
  The article presents a modification to the method which applies two sources of data. The modification is depicted on the example of a compositional microprogram control unit (CMCU) model with base structure implemented in the complex programmable logic devices (CPLD). First, the conditions needed to apply the method are presented, followed by the results of its implementation in real hardware.
 
</p></abstract><kwd-group><kwd>CPLD</kwd><kwd> PAL</kwd><kwd> UFM</kwd><kwd> CLB</kwd><kwd> Two Sources of Code</kwd><kwd> One-Hot Encoding</kwd><kwd> Natural Encoding</kwd><kwd> CMCU</kwd></kwd-group></article-meta></front><body><sec id="s1"><title>1. Introduction</title><p>Control units are very important parts of digital systems [<xref ref-type="bibr" rid="scirp.51321-ref1">1</xref>] -[<xref ref-type="bibr" rid="scirp.51321-ref6">6</xref>] . Nowadays, complex programmable logic devices (CPLD) are widely used for implementing logic circuits of control units [<xref ref-type="bibr" rid="scirp.51321-ref7">7</xref>] [<xref ref-type="bibr" rid="scirp.51321-ref8">8</xref>] . However, the issue of reducing the size of a control unit is still a subject of current interest. Finding a solution to this issue will make it possible to improve such indicators as the speed of performance and the power consumption of the designed system [<xref ref-type="bibr" rid="scirp.51321-ref9">9</xref>] [<xref ref-type="bibr" rid="scirp.51321-ref10">10</xref>] . CPLDs include macrocells of programmable array logic (PAL) with a limited number of terms. To reduce the amount of hardware in the logic circuit of a control unit, the peculiarities of the CPLD and the features of a control algorithm to be implemented should be taken into account. If a control algorithm is represented by a linear graph-scheme of the algorithm (GSA), then a model of the compositional microprogram control unit (CMCU) can be used for its interpretation [<xref ref-type="bibr" rid="scirp.51321-ref11">11</xref>] . It is assumed by the authors that the control memory (CM) of the CMCU can be implemented as external PROM/ROM memory. Some of the CPLD family devices are equipped with integrated memory. For example, Altera CPLD devices are equipped with user flesh memory (UFM) [<xref ref-type="bibr" rid="scirp.51321-ref12">12</xref>] , whereas Cypress CPLD devices are equipped with cluster memory blocks (CMB) [<xref ref-type="bibr" rid="scirp.51321-ref13">13</xref>] . This article presents a mathematical model and a design algorithm with two sources of code and natural encoding which has been modified and adopted to CMCU model with base structure [<xref ref-type="bibr" rid="scirp.51321-ref14">14</xref>] [<xref ref-type="bibr" rid="scirp.51321-ref15">15</xref>] .</p></sec><sec id="s2"><title>2. Background of the CMCU with Base Structure and Two Sources of Code</title><p>It is assumed that the GSA is represented by sets of vertices <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x6.png" xlink:type="simple"/></inline-formula> where <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x7.png" xlink:type="simple"/></inline-formula> and a set of arcs <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x8.png" xlink:type="simple"/></inline-formula> where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x9.png" xlink:type="simple"/></inline-formula>. It is further assumed that <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x10.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x11.png" xlink:type="simple"/></inline-formula> is an initial vertex, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x12.png" xlink:type="simple"/></inline-formula>is a final vertex, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x13.png" xlink:type="simple"/></inline-formula>is a set of operator vertices, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x14.png" xlink:type="simple"/></inline-formula>is a set of conditional vertices. A vertex contains a microinstruction <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x15.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x16.png" xlink:type="simple"/></inline-formula> is a set of data-path microoperations <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x17.png" xlink:type="simple"/></inline-formula> [<xref ref-type="bibr" rid="scirp.51321-ref16">16</xref>] - [<xref ref-type="bibr" rid="scirp.51321-ref18">18</xref>] . Each vertex <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x18.png" xlink:type="simple"/></inline-formula> contains a single element <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x19.png" xlink:type="simple"/></inline-formula> of a set of logical conditions<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x20.png" xlink:type="simple"/></inline-formula>. A set<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x21.png" xlink:type="simple"/></inline-formula>of operational linear chains (OLC) for the GSA shall be formed, where each OLC is a sequence of operator vertices and each pair of its adjacent components corresponds to an arc of the GSA.</p><disp-formula id="scirp.51321-formula273"><label>. (1)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x22.png"  xlink:type="simple"/></disp-formula><p>Each OLC <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula> has only one output <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula> and an arbitrary number of inputs<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula>. The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula> elements are under- stood as a state of the system which is identified by <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x27.png" xlink:type="simple"/></inline-formula> elements. OLC outputs make up the collection<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x28.png" xlink:type="simple"/></inline-formula>. Formal definitions of OLC, its input and output can be found in [<xref ref-type="bibr" rid="scirp.51321-ref11">11</xref>] . Each vertex from <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x29.png" xlink:type="simple"/></inline-formula> corresponds to microinstruction <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x30.png" xlink:type="simple"/></inline-formula> stored in the control memory (CM) of CMCU and it has an address<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x31.png" xlink:type="simple"/></inline-formula>. The microinstructions can be addressed using <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x23.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x24.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x25.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x26.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x27.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x28.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x29.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x30.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x31.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x32.png" xlink:type="simple"/></inline-formula> bits, where</p><disp-formula id="scirp.51321-formula274"><label>(2)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x33.png"  xlink:type="simple"/></disp-formula><p>and the bits are represented by variables from the set<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x34.png" xlink:type="simple"/></inline-formula>:</p><disp-formula id="scirp.51321-formula275"><label>. (3)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x35.png"  xlink:type="simple"/></disp-formula><p>Assuming that the <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x36.png" xlink:type="simple"/></inline-formula> OLC includes <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x36.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x37.png" xlink:type="simple"/></inline-formula> components, the following condition takes place:</p><disp-formula id="scirp.51321-formula276"><label>. (4)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x38.png"  xlink:type="simple"/></disp-formula><p>In Equation (4) <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x39.png" xlink:type="simple"/></inline-formula>is the i-th component of OLC. The first source of information about the state of the system is the register RG. The Value of used filp-flops needed for the implementation RG is<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x39.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x40.png" xlink:type="simple"/></inline-formula>, where:</p><disp-formula id="scirp.51321-formula277"><label>. (5)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x41.png"  xlink:type="simple"/></disp-formula><p>The flip-flops outputs are represented by variables from the set<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x42.png" xlink:type="simple"/></inline-formula>:</p><disp-formula id="scirp.51321-formula278"><label>. (6)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x43.png"  xlink:type="simple"/></disp-formula><p>The second source of information about the state of the system is the unused space of the control memory (CM) [<xref ref-type="bibr" rid="scirp.51321-ref19">19</xref>] [<xref ref-type="bibr" rid="scirp.51321-ref20">20</xref>] . An external PROM chip or memory integrated with the CPLD may be applied to implement the CM. The memory has <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x44.png" xlink:type="simple"/></inline-formula> outputs, where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x45.png" xlink:type="simple"/></inline-formula>, 4, 8, 16 [<xref ref-type="bibr" rid="scirp.51321-ref21">21</xref>] . Some information can be implemented using free outputs of the CM. it is assumed that one-hot encoding of microoperations is used [<xref ref-type="bibr" rid="scirp.51321-ref22">22</xref>] - [<xref ref-type="bibr" rid="scirp.51321-ref26">26</xref>] . The CM word has <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x44.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x45.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x46.png" xlink:type="simple"/></inline-formula> bits, where</p><disp-formula id="scirp.51321-formula279"><label>. (7)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x47.png"  xlink:type="simple"/></disp-formula><p>Thus, the number of available unused flip-flops is:</p><disp-formula id="scirp.51321-formula280"><label>. (8)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x48.png"  xlink:type="simple"/></disp-formula><p>The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x49.png" xlink:type="simple"/></inline-formula> bits are represented by variables from the set<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x49.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x50.png" xlink:type="simple"/></inline-formula>:</p><disp-formula id="scirp.51321-formula281"><label>. (9)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x51.png"  xlink:type="simple"/></disp-formula><p>If the condition</p><disp-formula id="scirp.51321-formula282"><label>(10)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x52.png"  xlink:type="simple"/></disp-formula><p>takes place, the method can be used. The number of repetitions of each state occurring as the initial state is counted in the transitions of the algorithm. The states of the system are identified through the outputs <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x53.png" xlink:type="simple"/></inline-formula> of the operational linear chains. The outputs belong to the collection<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x54.png" xlink:type="simple"/></inline-formula>. The <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x55.png" xlink:type="simple"/></inline-formula> most used <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x56.png" xlink:type="simple"/></inline-formula> items shall be taken. Next, these items shall be moved to a new collection<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x53.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x54.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x55.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x56.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x57.png" xlink:type="simple"/></inline-formula>. Following the above assumptions, an equation</p><disp-formula id="scirp.51321-formula283"><label>(11)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x58.png"  xlink:type="simple"/></disp-formula><p>takes place. The collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula> has been divided into two collections <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula>, where<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula>. The control memory CM is a source of the variables <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula> applied to encode <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x64.png" xlink:type="simple"/></inline-formula> by the code<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x65.png" xlink:type="simple"/></inline-formula>. The register RG is a source of the variables <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x66.png" xlink:type="simple"/></inline-formula> applied to encode <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x67.png" xlink:type="simple"/></inline-formula> by the code<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x68.png" xlink:type="simple"/></inline-formula>. Provided that the assumption presented in equation (11) is fulfilled, it is possible to apply the one-hot encoding to the elements from the collection<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x59.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x60.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x61.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x62.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x63.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x64.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x65.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x66.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x67.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x68.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x69.png" xlink:type="simple"/></inline-formula>.</p><p>The combinational circuit (CC) generates data <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x70.png" xlink:type="simple"/></inline-formula> for the counter (CT) and data <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x70.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x71.png" xlink:type="simple"/></inline-formula> for the register (RG):</p><disp-formula id="scirp.51321-formula284"><label>, (12)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x72.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.51321-formula285"><label>. (13)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x73.png"  xlink:type="simple"/></disp-formula><p>The synthesis of the CMCU algorithm includes the following steps:</p><p>1) Forming the set of OLCs.</p><p>2) Forming the control memory content.</p><p>3) Forming the transition table of the CMCU.</p><p>4) Counting the occurrence of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x74.png" xlink:type="simple"/></inline-formula> on the basis of the transition.</p><p>5) Dividing the collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x75.png" xlink:type="simple"/></inline-formula> into two collections <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x76.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x75.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x76.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x77.png" xlink:type="simple"/></inline-formula>.</p><p>6) Updating the control memory content.</p><p>7) Forming the excitation functions for the CT and RG with using two sources of code.</p><p>8) Synthesis of the logic circuit of CMCU.</p><p><xref ref-type="fig" rid="fig1">Figure 1</xref> presents a structural diagram of the CMCU with two sources of code. The pulse Start causes loading of the first microinstruction address into a counter CT and set up of a fetch flip-flop TF. If<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula>, then microinstructions can be read out from the control memory CM. If a current microinstruction does not correspond to an OLC output, then a special variable <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x79.png" xlink:type="simple"/></inline-formula> is formed together with microoperations<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x80.png" xlink:type="simple"/></inline-formula>. If<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x81.png" xlink:type="simple"/></inline-formula>, then content of the CT is incremented according to the addressing mode. Otherwise, the block of combinational circuit logic (CC) generates functions <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x82.png" xlink:type="simple"/></inline-formula> and<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x83.png" xlink:type="simple"/></inline-formula>. If<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x78.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x79.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x80.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x81.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x82.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x83.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x84.png" xlink:type="simple"/></inline-formula>, then the CMCU stops and new data from CM is not loaded.</p></sec><sec id="s3"><title>3. Main Idea behind the Proposed Method</title><p>The excitation functions generating data for the counter CT and register RG in Equation (12) and Equation (13)</p><fig id="fig1"  position="float"><label><xref ref-type="fig" rid="fig1">Figure 1</xref></label><caption><title> Structural diagram of CMCU U<sub>1</sub></title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-7600359x85.png"/></fig><p>are built with the use of logical terms. Let <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x86.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x86.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x87.png" xlink:type="simple"/></inline-formula> be such collections of excitation functions required to realize Equation (12) and Equation (13), that:</p><disp-formula id="scirp.51321-formula286"><label>, (14)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x88.png"  xlink:type="simple"/></disp-formula><disp-formula id="scirp.51321-formula287"><label>. (15)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x89.png"  xlink:type="simple"/></disp-formula><p>Functions from the collections <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x90.png" xlink:type="simple"/></inline-formula> and <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x91.png" xlink:type="simple"/></inline-formula> generate data represented by the variables depicted in Equation (3) and Equation (4). The terms which are used for building the excitation functions are created by joining two parts: the conjunction of conditions <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x92.png" xlink:type="simple"/></inline-formula> and the code <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x93.png" xlink:type="simple"/></inline-formula> or<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x93.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x94.png" xlink:type="simple"/></inline-formula>. The length of the terms has a direct influence on the number of logical gates used in implementing the CMCU model, and the number of the gates used has, in turn, a direct influence on the size of the realized system. For the base method the maximum length of a term built with the use of the information from the collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x90.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x91.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x92.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x93.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x94.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x95.png" xlink:type="simple"/></inline-formula> equals:</p><disp-formula id="scirp.51321-formula288"><label>. (16)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x96.png"  xlink:type="simple"/></disp-formula><p>The maximum length of a term built with the use of information from the collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x97.png" xlink:type="simple"/></inline-formula> equals:</p><disp-formula id="scirp.51321-formula289"><label>. (17)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x98.png"  xlink:type="simple"/></disp-formula><p>The second factor which has a direct influence on the size of the designed system is the possibility of minimizing the excitation functions for the counter CT and register RG. As far as the method with two sources of code is concerned, this possibility is degraded under negative conditions, compared to the method with one source of code. For example, having the OLC elements encoded as in <xref ref-type="table" rid="table1">Table 1</xref> and the function for the method with one source of code designed in the following way:</p><disp-formula id="scirp.51321-formula290"><graphic  xlink:href="http://html.scirp.org/file/2-7600359x99.png"  xlink:type="simple"/></disp-formula><p>The excitation function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x100.png" xlink:type="simple"/></inline-formula> requires 17 logic gates to be implemented. Let us assume that the system CM has <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x101.png" xlink:type="simple"/></inline-formula> of unused outputs. In the case of the method with two sources of code and one-hot encoding, as in <xref ref-type="table" rid="table2">Table 2</xref> the function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x102.png" xlink:type="simple"/></inline-formula> shall take the form of <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x100.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x101.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x102.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x103.png" xlink:type="simple"/></inline-formula> to realize the same task:</p><disp-formula id="scirp.51321-formula291"><graphic  xlink:href="http://html.scirp.org/file/2-7600359x104.png"  xlink:type="simple"/></disp-formula><p>For the analyzed example, the excitation function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x105.png" xlink:type="simple"/></inline-formula> requires 18 logic gates to be implemented. Provided that the length of the terms has been reduced according to Equation (17), the possibility of minimizing the excitation functions has been degraded. This results from the peculiarity of one-hot encoding. With such encoding, the terms which use elements from the collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x106.png" xlink:type="simple"/></inline-formula> do not undergo minimization. Additionally, minimizing two terms which are built on the basis of information from various sources is also impossible, which leads to an increase in the level of degradation of the possibility of minimizing excitation functions. In order to reduce the level of degradation of the possibility of minimization of excitation functions, the mathematical model and design algorithm with natural encoding has been adopted to the CMCU with base structure [<xref ref-type="bibr" rid="scirp.51321-ref14">14</xref>] [<xref ref-type="bibr" rid="scirp.51321-ref15">15</xref>] . First, natural encoding will be used for encoding information about the state from the CM. In such a case we can use <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x105.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x106.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x107.png" xlink:type="simple"/></inline-formula> information from CM, where</p><disp-formula id="scirp.51321-formula292"><label>. (18)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x108.png"  xlink:type="simple"/></disp-formula><p>In Equation (18), 1 is subtracted to take into account the case when microinstruction is not the source of code. This will be marked by code zero. This code will be not used in excitation functions. To encoding <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x109.png" xlink:type="simple"/></inline-formula></p><table-wrap id="table1" ><label><xref ref-type="table" rid="table1">Table 1</xref></label><caption><title> OLC items with base structure</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >OLC outputs</th><th align="center" valign="middle"  colspan="6"  >K<sub>C</sub>(O<sub>i</sub>)</th></tr></thead><tr><td align="center" valign="middle" >O<sub>i</sub></td><td align="center" valign="middle" >τ<sub>6</sub></td><td align="center" valign="middle" >τ<sub>5</sub></td><td align="center" valign="middle" >τ<sub>4</sub></td><td align="center" valign="middle" >τ<sub>3</sub></td><td align="center" valign="middle" >τ<sub>2</sub></td><td align="center" valign="middle" >τ<sub>1</sub></td></tr><tr><td align="center" valign="middle" >O<sub>1</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >O<sub>2</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >O<sub>3</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >O<sub>4</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >…</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >O<sub>11</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >O<sub>12</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >…</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >O<sub>33</sub></td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td></tr></tbody></table></table-wrap><table-wrap id="table2" ><label><xref ref-type="table" rid="table2">Table 2</xref></label><caption><title> OLC items with two sources of code and one-hot encoding</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >OLC outputs</th><th align="center" valign="middle"  colspan="9"  >K<sub>A</sub>(O<sub>i</sub>), K<sub>B</sub>(O<sub>i</sub>)</th></tr></thead><tr><td align="center" valign="middle" >O<sub>i</sub></td><td align="center" valign="middle" >τ<sub>6</sub></td><td align="center" valign="middle" >τ<sub>5</sub></td><td align="center" valign="middle" >τ<sub>4</sub></td><td align="center" valign="middle" >τ<sub>3</sub></td><td align="center" valign="middle" >τ<sub>2</sub></td><td align="center" valign="middle" >τ<sub>1</sub></td><td align="center" valign="middle" >p<sub>3</sub></td><td align="center" valign="middle" >p<sub>2</sub></td><td align="center" valign="middle" >p<sub>1</sub></td></tr><tr><td align="center" valign="middle" >O<sub>1</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr><tr><td align="center" valign="middle" >O<sub>2</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr><tr><td align="center" valign="middle" >O<sub>3</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >O<sub>4</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr><tr><td align="center" valign="middle" >…</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >O<sub>11</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >-</td></tr><tr><td align="center" valign="middle" >O<sub>12</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr><tr><td align="center" valign="middle" >…</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >O<sub>33</sub></td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr></tbody></table></table-wrap><p>elements is used natural encoding. In order to reduce the maximum length of the terms built on the basis of the collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x110.png" xlink:type="simple"/></inline-formula> the following limitation is introduced:</p><disp-formula id="scirp.51321-formula293"><label>. (19)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x111.png"  xlink:type="simple"/></disp-formula><p>In such a case, the maximum length of a term built with the use of information from the collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x112.png" xlink:type="simple"/></inline-formula> equals:</p><disp-formula id="scirp.51321-formula294"><label>. (20)</label><graphic position="anchor" xlink:href="http://html.scirp.org/file/2-7600359x113.png"  xlink:type="simple"/></disp-formula><p>In the analyzed example for the method with two sources of code and natural encoding, as in <xref ref-type="table" rid="table3">Table 3</xref>, the function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x114.png" xlink:type="simple"/></inline-formula> shall become <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x114.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x115.png" xlink:type="simple"/></inline-formula> in order to realize the same task:</p><disp-formula id="scirp.51321-formula295"><graphic  xlink:href="http://html.scirp.org/file/2-7600359x116.png"  xlink:type="simple"/></disp-formula><p>The excitation function <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x117.png" xlink:type="simple"/></inline-formula> requires 11 logic gates to be implemented. Applying natural encoding has made it possible to reduce the level of degradation of the possibility of minimizing of excitation functions. Natural encoding applied to the elements from collection <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x117.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x118.png" xlink:type="simple"/></inline-formula> makes it possible to minimize the terms built on the</p><table-wrap id="table3" ><label><xref ref-type="table" rid="table3">Table 3</xref></label><caption><title> OLC items two sources of code and natural encoding</title></caption><table><tbody><thead><tr><th align="center" valign="middle" >OLC outputs</th><th align="center" valign="middle"  colspan="9"  >K<sub>A</sub>(O<sub>i</sub>), K<sub>B</sub>(O<sub>i</sub>)</th></tr></thead><tr><td align="center" valign="middle" >O<sub>i</sub></td><td align="center" valign="middle" >τ<sub>6</sub></td><td align="center" valign="middle" >τ<sub>5</sub></td><td align="center" valign="middle" >τ<sub>4</sub></td><td align="center" valign="middle" >τ<sub>3</sub></td><td align="center" valign="middle" >τ<sub>2</sub></td><td align="center" valign="middle" >τ<sub>1</sub></td><td align="center" valign="middle" >p<sub>3</sub></td><td align="center" valign="middle" >p<sub>2</sub></td><td align="center" valign="middle" >p<sub>1</sub></td></tr><tr><td align="center" valign="middle" >O<sub>1</sub></td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr><tr><td align="center" valign="middle" >O<sub>2</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >O<sub>3</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >O<sub>4</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >…</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >O<sub>11</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td></tr><tr><td align="center" valign="middle" >O<sub>12</sub></td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >1</td></tr><tr><td align="center" valign="middle" >…</td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td><td align="center" valign="middle" ></td></tr><tr><td align="center" valign="middle" >O<sub>33</sub></td><td align="center" valign="middle" >1</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >0</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td><td align="center" valign="middle" >-</td></tr></tbody></table></table-wrap><fig id="fig2"  position="float"><label><xref ref-type="fig" rid="fig2">Figure 2</xref></label><caption><title> Reduction in the size of the system due to the participation of the source</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-7600359x119.png"/></fig><fig id="fig3"  position="float"><label><xref ref-type="fig" rid="fig3">Figure 3</xref></label><caption><title> Reduction in the size of the system by free bits of memory</title></caption><graphic mimetype="image"   position="float"  xlink:type="simple"  xlink:href="http://html.scirp.org/file/2-7600359x120.png"/></fig><p>basis of data from this collection. Furthermore, using natural encoding enables transferring a greater amount of information to the collection (source)<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x121.png" xlink:type="simple"/></inline-formula>. Fulfilling the criteria of Equation (19) ensures reduction in the maximum length of the terms, in accordance with Equation (20).</p></sec><sec id="s4"><title>4. Results and Conclusions</title><p><xref ref-type="fig" rid="fig2">Figure 2</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref> present the results of the implementation of the model in real hardware. The Altera family MAX II device EPM1270 F256C5 equipped with UFM has been used for tests. The results presented in <xref ref-type="fig" rid="fig2">Figure 2</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref> have been obtained from research conducted on 200 randomly generated CMCU models with the following properties:<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x128.png" xlink:type="simple"/></inline-formula>, <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x129.png" xlink:type="simple"/></inline-formula>,<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x130.png" xlink:type="simple"/></inline-formula>. Red points presented in <xref ref-type="fig" rid="fig2">Figure 2</xref> and <xref ref-type="fig" rid="fig3">Figure 3</xref> show the results obtained with the use of the natural method, whereas the blue points refer to the results obtained with the one-hot method. <xref ref-type="fig" rid="fig2">Figure 2</xref> depicts the relationship between the obtained reduction in the size of the system (in percentage) and the participation of the source of data <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x130.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x131.png" xlink:type="simple"/></inline-formula> in generating the excitation functions (in percentage). The application of natural encoding made it possible to avoid the effect of degradation of the possibility of minimizing the functions. A linear interrelation between the participation of the source <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x130.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x131.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x132.png" xlink:type="simple"/></inline-formula> and the obtained reduction in the size of the system has been observed. In the analyzed models with a small participation of the source<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x122.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x123.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x124.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x125.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x126.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x127.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x128.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x129.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x130.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x131.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x132.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x133.png" xlink:type="simple"/></inline-formula>―within the scope of up to 17%, deterioration of the possibility of minimizing the functions has been observed, which results in an increase in the size required for the realization of the designed system.</p><p><xref ref-type="fig" rid="fig3">Figure 3</xref> presents the relationship between the obtained reduction in the size of the system (in percentage) and the value of free bits used to representation information from the source<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x134.png" xlink:type="simple"/></inline-formula>. As can be seen in <xref ref-type="fig" rid="fig3">Figure 3</xref>, in the case of both the methods there occurs degradation of the possibility of minimizing the functions under negative conditions. The results of conducted experiments indicate that the ability to minimize logic terms and the ability to reduce the length of the terms, which follows from Equation (19) and is characteristic of the natural method, makes it possible to obtain better effects of reducing the system than the ability to reduce the length of logic terms following from Equation (17), yet without the possibility of minimizing the terms from the source <inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x134.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x135.png" xlink:type="simple"/></inline-formula> in the case of the one-hot method. The application of natural encoding improves the level of reduction of the system, compared to the one-hot method. The main factor which enables this improvement is the possibility of minimizing such encoded terms and the representation of a larger amount of data by means of the source<inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x134.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x135.png" xlink:type="simple"/></inline-formula><inline-formula><inline-graphic xlink:href="http://html.scirp.org/file/2-7600359x136.png" xlink:type="simple"/></inline-formula>, using the same free CM resources as in the case of the one-hot method.</p></sec><sec id="s5"><title>Information</title><p>Mr. Łukasz Smoliński is a scholar within Sub-measure 8.2.2 Regional Innovation Strategies, Measure 8.2 Transfer of knowledge, Priority VIII Regional human resources for the economy Human Capital Operational Programme co-financed by European Social Fund and state budget.</p><disp-formula id="scirp.51321-formula296"><graphic  xlink:href="http://html.scirp.org/file/2-7600359x137.png"  xlink:type="simple"/></disp-formula></sec><sec id="s6"><title>NOTES</title></sec></body><back><ref-list><title>References</title><ref id="scirp.51321-ref1"><label>1</label><mixed-citation publication-type="other" xlink:type="simple">Luba, T. (2004) Synteza Uklad&amp;#243;w Logicznych. Warsaw University of Technology Press, Warsaw.</mixed-citation></ref><ref id="scirp.51321-ref2"><label>2</label><mixed-citation publication-type="other" xlink:type="simple">Baranov, S. (1994) Logic Synthesis for Control Automata. Kluwer Academic Publishers, Israel.  
http://dx.doi.org/10.1007/978-1-4615-2692-6</mixed-citation></ref><ref id="scirp.51321-ref3"><label>3</label><mixed-citation publication-type="other" xlink:type="simple">DeMicheli, G. (1994) Synthesis and Optimization of Digital Circuits. McGraw-Hill, Boston.</mixed-citation></ref><ref id="scirp.51321-ref4"><label>4</label><mixed-citation publication-type="other" xlink:type="simple">Milik, A. and Hrynkiewicz, E. (2012) Synthesis and Implementation of Reconfigurable PLC on FPGA Platform. International Journal of Electronics and Telecommunications, 58, 85-94. http://dx.doi.org/10.2478/v10177-012-0012-8</mixed-citation></ref><ref id="scirp.51321-ref5"><label>5</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A. and Wegrzyn, M. (2006) Design of Control Units with Programmable Logic. University of Zielona G&amp;#243;ra Press, Zielona G&amp;#243;ra.</mixed-citation></ref><ref id="scirp.51321-ref6"><label>6</label><mixed-citation publication-type="other" xlink:type="simple">Klimowicz, A. and Salauyou, V. (2012) The Synthesis of Combined Mealy and Moore Machines Structural Model Using Values of Output Variables as Codes of States. 15th Euromicro Conference on Digital System Design (DCD), Izmir, 5-8 September 2012, 789-794. http://dx.doi.org/10.1109/DSD.2012.130</mixed-citation></ref><ref id="scirp.51321-ref7"><label>7</label><mixed-citation publication-type="other" xlink:type="simple">Kubica, M. and Kania, D. (2011) Synteza Logiczna Zespolu Funkcji Ukierunkowana na Minimalizacje Liczby Wykorzystywanych Blok&amp;#243;w Logicznych PAL w Oparciu o Zmodyfikowany Graf Wyjsc. Pomiary, Automatyka, Kontrola, 57, 737-740.</mixed-citation></ref><ref id="scirp.51321-ref8"><label>8</label><mixed-citation publication-type="other" xlink:type="simple">Altera (2009) Max II Device Handbook. http://www.altera.com/literature/hb/max2/max2_mii5v1.pdf</mixed-citation></ref><ref id="scirp.51321-ref9"><label>9</label><mixed-citation publication-type="other" xlink:type="simple">Czerwinski, R. and Kania, D. (2012) Area and Speed Oriented Synthesis of FSMs for PAL-based CPLDs. Microprocessors &amp; Microsystems, 36, 56-61. http://dx.doi.org/10.1016/j.micpro.2011.06.004</mixed-citation></ref><ref id="scirp.51321-ref10"><label>10</label><mixed-citation publication-type="other" xlink:type="simple">Salauyou, V. and Grzes, T. (2007) FSM State Assignment Methods for Low-Power Design. 6th International Conference on Computer Information Systems and Industrial Management Applications, Minneapolis, 28-30 June 2007, 345-350. http://dx.doi.org/10.1109/CISIM.2007.32</mixed-citation></ref><ref id="scirp.51321-ref11"><label>11</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A. and Titarenko, L. (2008) Logic Synthesis for Compositional Microprogram Control Units. Springer.  
http://dx.doi.org/10.1007/978-3-540-69285-0</mixed-citation></ref><ref id="scirp.51321-ref12"><label>12</label><mixed-citation publication-type="other" xlink:type="simple">Altera (2007) Using the UFM in MAX II Devices. www.altera.com/literature/an/an489.pdf</mixed-citation></ref><ref id="scirp.51321-ref13"><label>13</label><mixed-citation publication-type="other" xlink:type="simple">Cypress (2003) Delta39K ISR CPLD Family.  
http://pdf.datasheetcatalog.com/datasheet2/9/0pfaeyx4ushkk0zzjksaycgxhqky.pdf</mixed-citation></ref><ref id="scirp.51321-ref14"><label>14</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A., Titarenko, L. and Smoli&amp;#241;ski, L. (2013) Hardware Reduction for Compositional Microprogram Control Unit Dedicated for CPLD Systems. Proceedings of IEEE East-West Design and Test Symposium EWDTS’13, Rostovon-Don, 27-30 September 2013, 1-6. http://dx.doi.org/10.1109/EWDTS.2013.6673200</mixed-citation></ref><ref id="scirp.51321-ref15"><label>15</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A., Titarenko, L. and Smoli&amp;#241;ski, L. (2014) CMCU Model with Base Structure Dedicated for CPLD Systems. Przeglad Elektroniczny. (in Press)</mixed-citation></ref><ref id="scirp.51321-ref16"><label>16</label><mixed-citation publication-type="other" xlink:type="simple">Baranov, S. (2008) Logic and System Design of Digital Systems. TUT Press, TelAviv.</mixed-citation></ref><ref id="scirp.51321-ref17"><label>17</label><mixed-citation publication-type="other" xlink:type="simple">Adamski, M. and Barkalov, A. (2006) Architectural and Sequential Synthesis of Digital Devices. University of Zielona G&amp;#243;ra Press, Zielona G&amp;#243;ra.</mixed-citation></ref><ref id="scirp.51321-ref18"><label>18</label><mixed-citation publication-type="other" xlink:type="simple">Wisniewska, M., Wisniewski, R. and Adamski, M. (2009) Reduction of the Microinstruction Length in the Designing Process of Microprogrammed Controllers. Przeglad Elektroniczny, 11, 114-117.</mixed-citation></ref><ref id="scirp.51321-ref19"><label>19</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A., Titarenko, L. and Smoli&amp;#241;ski, L. (2012) Optimization of Control Unit based on Construction of CPLD. Pomiary, Automatyka, Kontrola, 58, 93-96.</mixed-citation></ref><ref id="scirp.51321-ref20"><label>20</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A., Titarenko, L. and Smoli&amp;#241;ski, L. (2011) Optimization of Microprogram Control Unit with Code Sharing. Proceedings of IEEE East-West Design and Test Symposium (EWDTS), Sevastopol, 9-12 September 2011, 55-59.  
http://dx.doi.org/10.1109/EWDTS.2011.6116573</mixed-citation></ref><ref id="scirp.51321-ref21"><label>21</label><mixed-citation publication-type="other" xlink:type="simple">Maxfield, C. (2004) The Design Warrior’s Guide to FPGAs: Devices, Tools and Flows. Elseveir.</mixed-citation></ref><ref id="scirp.51321-ref22"><label>22</label><mixed-citation publication-type="other" xlink:type="simple">Wisniewski, R. (2009) Synthesis of Compositional Microprogram Control Units for Programmable Devices. University of Zielona G&amp;#243;ra Press, Zielona G&amp;#243;ra.</mixed-citation></ref><ref id="scirp.51321-ref23"><label>23</label><mixed-citation publication-type="other" xlink:type="simple">Barkalov, A. and Titarenko, L. (2009) Logic Synthesis for FSM-Based Control Units. Springer, Zielona G&amp;#243;ra.  
http://dx.doi.org/10.1007/978-3-642-04309-3</mixed-citation></ref><ref id="scirp.51321-ref24"><label>24</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Kolopie&amp;#241;czyk</surname><given-names> M. </given-names></name>,<etal>et al</etal>. (<year>2008</year>)<article-title>Application of Address Converter for Decreasing Memory Size of Compositional Microprogram Control Unit with Code Sharing</article-title><source> Lecture Notes in Control and Computer Science</source><volume> 12</volume>,<fpage> 88</fpage>-<lpage>96</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.51321-ref25"><label>25</label><mixed-citation publication-type="journal" xlink:type="simple"><name name-style="western"><surname>Bieganowski</surname><given-names> J. </given-names></name>,<etal>et al</etal>. (<year>2011</year>)<article-title>Synthesis of Microprogram Control Units Oriented toward Decreasing the Number of Macrocells of Addressing Circuit</article-title><source> Lecture Notes in Control and Computer Science</source><volume> 17</volume>,<fpage> 103</fpage>-<lpage>109</lpage>.<pub-id pub-id-type="doi"></pub-id></mixed-citation></ref><ref id="scirp.51321-ref26"><label>26</label><mixed-citation publication-type="other" xlink:type="simple">Salauyou, V. and Klimowicz, A. (2010) Synteza logiczna uklad&amp;#243;w cyfrowych w strukturach programowalnych. Oficyna Wydawnicza Politechniki Bialostockiej, Bialystok.</mixed-citation></ref></ref-list></back></article>