<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Larysa Martynovych1 , Yurii Gunchenko2, Yurii Shugailo 3, Yurii Bercov 4 Dmytro Slutskyi5, Kostiantyn Smirnov 6</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>I.I.Mechnykov Odesa National University</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dvoryanska str</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Odesa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ukraine</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Odesa</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ukraine</string-name>
        </contrib>
      </contrib-group>
      <abstract>
        <p>The analysis of advantages of ternary logic on an example of construction of ternary RS-trigger is considered. Based on the multi-threshold element of multi-valued logic (MTEML), the structures of the different variants of single-input decoders with the different active levels are proposed. The structures of the obtained elements and their schemes for the selection of the simplest variants are analyzed. The future directions of work and expediency of development of subjects of construction of ternary elements and systems on their basis are outlined.</p>
      </abstract>
      <kwd-group>
        <kwd>1 Ternary logic</kwd>
        <kwd>multi-threshold element of multi-valued logic</kwd>
        <kwd>methods of constructing ternary elements</kwd>
        <kwd>decoder</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>The relevance of the topic is due to the fact that
modern computer technology needs new ways to
increase computing power and speed. Binary
logic is now the most common, but it has a
number of disadvantages that can be eliminated
through the use of ternary logic, including
increasing the range of numbers, speeding up
operations, reducing the amount of equipment.</p>
      <p>The purpose of the work is the design and
synthesis of logical elements for ternary computer
systems.</p>
      <p>
        Three-valued logic is more convenient and
familiar to people than two-valued logic [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ].
Consider some examples that prove this.
      </p>
      <p>
        The first example is the weight of the levers
(Fig. 1). They are a characteristic ternary device,
the three states of which correspond to three
possible relations: A&gt; B, A = B, A &lt;B. For
comparison, consider also the executive scales,
which can take only two states, corresponding, for
example, the ratio A&gt; B, A≤B (Fig. 2). It is clear
that binary scales are less convenient than ternary.
Only in the case of A&gt; B the result of weighing on
them is determined immediately, and in the other
two cases it is necessary to re-weigh by swapping
A and B [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        The next example is branching by the sign of
the variable x (Fig. 3). This example demonstrates
the fundamental difference between three-digit
logic and two-digit logic. It is that one and the
same can be represented in a more compact form
in ternary logic than in binary. In this example, the
ternary branching by the sign x is described by
specifying a single three-digit operation sign (x)
and is performed in one step, while the same
branching, which is carried out by means of
twodigit logic, associated with the need for two
operations and is performed by two steps. Such
branching algorithms are often used in
decisionmaking systems, in "Smart Homes" to process
signals from sensors and the corresponding
response to them. Ternary logic in this case will
significantly accelerate this reaction [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
      </p>
      <p>a) b)
Figure 3: Branch operation by sign: a) ternary
scheme; b) binary scheme</p>
      <p>
        These examples show that ternary logic allows
you to reason more simply and more quickly than
reasoning in terms of ambiguous logic [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. In
practice, people probably use mostly ternary logic
[
        <xref ref-type="bibr" rid="ref5 ref6">5,6</xref>
        ].
      </p>
      <p>
        Some properties of ternary logic determine its
effectiveness and practical value:
 the branching command by sign takes
twice less time than in binary;
 the ternary adder subtracts when inverting
one of the terms, from which it follows that the
ternary counter is automatically reversible;
 in the three-input ternary adder the
transfer to the next category occurs in 8
situations out of 27, and in the binary adder
in 4 out of 8;
 the three-level signal is more resistant to
interference in transmission lines. This means
that special methods of redundant coding of
ternary information are simpler than binary
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Ternary RS-trigger</title>
      <p>In addition to combinational circuits, the
output state of which at each time depends on the
set of input signals, in computer systems are
widely used circuits and nodes in which the output
state depends not only on the input signals but also
on their previous state, ie digital automata. As you
know, the simplest device with two stable states
at the output - the trigger is often used to store
information.</p>
      <p>Consider binary and ternary RS-flip-flops in
comparison.</p>
      <p>Figure 4 shows the designation of the binary
RS-flip-flop.</p>
      <p>The trigger has 2 states Q = 0 and Q = 1, which
are displayed on its outputs. The next state of the
trigger depends on the current state and the
combination of input signals at its two inputs.</p>
      <p>It is known that it has a forbidden combination
of input signals. If there are active signals S = 1,
R = 1 on both inputs at the same time, this mode
is considered forbidden, because the state of the
trigger will not be determined.</p>
      <p>
        In ternary logic, three allowed modes can be
provided with only one input [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. In this case, in
addition to reducing the number of pins, such a
device in principle cannot be the fourth, forbidden
mode. Based on MTEML the ternary RS -trigger
which scheme is shown in fig. 5.
      </p>
      <p>Feedback from the + R, -R outputs provides
support for the current state of the trigger in the
absence or zero value of the input signal. The
input signal "+" leads to the transition of the
trigger to the state "+", the signal "-" to the
transition to the corresponding state "-". The
ternary RS-flip-flop has another state "0", but it is
unstable and is possible only when the system is
initially turned on (Table 1).</p>
      <p>When applied to the input x = 0 - the trigger is
in storage mode, its state does not change. When
applied to the input x = - 1 (minus) the trigger goes
into reset mode, ie the output will also be minus
1, when x = + 1 the trigger goes into installation
mode and the output is also +1. The state of the
trigger, when the signal at its output is zero, and
the input is a non-zero value (either "+" or "-") is
unstable, and immediately changes depending on
the signal sign. Table 1 shows the previous and
subsequent states of the trigger.</p>
      <p>In principle, a ternary RS-flip-flop can have
three different states of input and three different
states of output signals, i.e. nine combinations,
which are represented by terms in the table. The
input signal is denoted by X, the signals of the
current state and their sum - the current state are
denoted by lowercase letters -r, + r, q,
respectively. The signal that is directly generated
at the input of the trigger is equal to the sum of
these signals and is indicated in the table by
column X; -r; + r, this signal determines the next
combination of output signals -R, + R and the next
state Q = -R; + R, which trigger will go.</p>
    </sec>
    <sec id="sec-3">
      <title>3. Ternary single-input decoders</title>
      <p>Decoders are a must-have for any computer
system. They are more commonly used to identify
address space and are used to select specific
devices or memory cells when addressing them
(setting the address on the appropriate bus).</p>
      <p>In fact, decoders convert the input code of a
given number system to unary, in which the
output active signal is present only on one of the
outputs, the number of which corresponds to the
input combination. The maximum number of
outputs for a ternary decoder is m = 3n, where n is
the number of inputs. Consider the construction of
one- and two-input ternary decoders.</p>
      <p>For a single-input decoder, the number of
outputs is three. Depending on what value of
output signals we will consider active, and what
passive - there can be six different combinations
and, accordingly, schemes of construction of
onebit ternary decoders. To build decoders we use
MTEML. The table 2 shows the values of the
outputs of the element depending on the signal at
the input X.</p>
      <p>Consider a decoder whose active value is "-",
passive value "0". The truth table for each of the
three outputs is presented in the table 3.</p>
      <p>The following truth table (Table 4) shows the
case of the active signal "+", passive "0".</p>
      <p>It is easy to conclude that to obtain three output
signals you need to combine the following outputs
of MTEML:</p>
      <p>Y0= -R, +R, -L = -1, +R
Y1= -R, +L
Y2=-L</p>
      <p>To simplify the implementation of the outputs
-R, -L, which are equal to "-1", regardless of the
input signal, replace the corresponding current
source. We obtain the scheme shown in Fig. 6.</p>
      <p>The following are expressions for constructing
outputs by combining and simplifying the
corresponding signals. In fig. 7 shows a diagram
that implements this.</p>
      <p>Y0= +L
Y1= +R, -L
Y2= +R, -R, +L = +1, -R</p>
      <p>Tables 5 - 8 show the output signals for the
cases of active "0", passive "-" (Table 5), active
"0", passive "+" (Table 6), active "-", passive "+"
( Table 7) and active “+”, passive “-” (Table 8).</p>
      <p>Figures 8 - 11 show the implementation
schemes for all these cases.</p>
      <p>Y0= -L, -R, +L = -1, +L
Y1= -L, -R, +R, -L = -1, +R, -L</p>
      <p>Y2= -R</p>
    </sec>
    <sec id="sec-4">
      <title>4. Conclusions</title>
      <p>The analysis of the construction of multivalued
logic and its elemental base allowed us to draw the
following conclusions.</p>
      <p>The vast majority of the implementation of
ternary elements has significant disadvantages.</p>
      <p>These solutions either do not allow the full
implementation of ternary logic, or do not have a
general approach to its implementation, or
complicate the implementation of ternary devices
and their structure.</p>
      <p>One of the obstacles hindering the
development of ternary technology is the lack of
element base and a common approach to the
implementation of components and elements of
non-binary computers.</p>
      <p>The implementation of ternary devices based
on threshold logic is a way to create ternary
devices that can compete with binary in terms of
equipment.</p>
      <p>An urgent scientific and practical task is to
create a general approach to the implementation
of ternary nodes and methods of synthesis of
ternary logical and arithmetic elements, as there
are still no standards in the development and
implementation of ternary elements and a single
methodological approach.</p>
      <p>Thus, for the first time, the structures of
several variants of one-input decoder with active
signals "-", "+" and "0" based on MTEML, which
can be used in the construction of elements of
ternary computer systems, were obtained.</p>
      <p>The built devices have a much simpler
architecture compared to their counterparts.</p>
      <p>Analysis of the obtained structures of
singleinput decoders showed that the simpler options
are when the active signal is "-" or "+", and
passive is "0".</p>
      <p>To build ternary computing and intelligent
systems, it is necessary, first of all, to develop the
principles of a systematic approach to the
synthesis of ternary elements and software for
their interaction with each other and with existing
modern devices.</p>
      <p>Therefore, in further research it is expedient to
consider methods of construction and synthesis of
nodes of ternary computer systems, their
optimization, and development of principles of
mathematical modeling and software of such
systems and their elements.</p>
    </sec>
    <sec id="sec-5">
      <title>5. References</title>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>[1] Multivalued logic // Philosophical encyclopedic dictionary / VI Shinkaruk (editor in chief) and others</article-title>
          . -
          <source>Kyiv: Hryhoriy Skovoroda Institute of Philosophy of the National Academy of Sciences of Ukraine: Abris</source>
          ,
          <year>2002</year>
          . - 742 p. -
          <volume>1000</volume>
          copies. - BBK 87я2.
          <article-title>-</article-title>
          <string-name>
            <surname>ISBN</surname>
          </string-name>
          966-531-128-X.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>Béziau</surname>
            <given-names>J.-Y.</given-names>
          </string-name>
          <year>1997</year>
          <article-title>What is many-valued logic ?</article-title>
          <source>Proceedings of the 27th International Symposium on Multiple-Valued Logic, IEEE Computer Society</source>
          , Los Alamitos, pp.
          <fpage>117</fpage>
          -
          <lpage>121</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <surname>Malinowski</surname>
          </string-name>
          , Gregorz,
          <year>2001</year>
          ,
          <string-name>
            <surname>Many-Valued</surname>
            <given-names>Logics</given-names>
          </string-name>
          , in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic. Blackwell.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Michael</surname>
          </string-name>
          Miller; Mitchell A.
          <string-name>
            <surname>Thornton</surname>
          </string-name>
          (
          <year>2008</year>
          ).
          <article-title>Multiple valued logic: concepts and representations</article-title>
          .
          <source>Synthesis lectures on digital circuits and systems 12</source>
          . Morgan &amp; Claypool Publishers. ISBN 9781598291902.
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <surname>RISC-V Processor Designs Emerge</surname>
          </string-name>
          ,
          <year>2021</year>
          , URL: https://www.eetimes.
          <article-title>com/risc-v-processordesigns-emerge/</article-title>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>S.</given-names>
            <surname>Gottwald</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          <article-title>Treatise on Many-Valued Logics</article-title>
          .
          <source>Studies in Logic and Computation</source>
          , vol.
          <volume>9</volume>
          , Research Studies Press: Baldock, Hertfordshire, England,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <surname>Yu. Gunchenko</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Martynovych</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          <string-name>
            <surname>Tikhonova</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Slutsky</surname>
          </string-name>
          ,
          <article-title>The concept of construction of devices for ternary logic - Proceedings of the V All-Ukrainian scientific-practical conference Perspective directions of modern electronics, information and computer systems (MEICS-2020) Dnipro</article-title>
          , November
          <volume>25</volume>
          -
          <issue>27</issue>
          ,
          <fpage>2020</fpage>
          - pp.
          <fpage>93</fpage>
          -
          <lpage>94</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Gunchenko</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Martynovych</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Mezhuyev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Shugailo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Bercov</surname>
          </string-name>
          ,
          <article-title>Design of a ternary RS-trigger</article-title>
          .
          <source>2021 7th International Conference on Computer Technology Applications (ICCTA</source>
          <year>2021</year>
          )
          <article-title>online</article-title>
          ,
          <source>held during July 13-15</source>
          , 2021 in Vienna, Austria. To appear.
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>