RU2429564C1 - FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS) - Google Patents

FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS) Download PDF

Info

Publication number
RU2429564C1
RU2429564C1 RU2010120992/08A RU2010120992A RU2429564C1 RU 2429564 C1 RU2429564 C1 RU 2429564C1 RU 2010120992/08 A RU2010120992/08 A RU 2010120992/08A RU 2010120992 A RU2010120992 A RU 2010120992A RU 2429564 C1 RU2429564 C1 RU 2429564C1
Authority
RU
Russia
Prior art keywords
functional
logical
arguments
procedure
number system
Prior art date
Application number
RU2010120992/08A
Other languages
Russian (ru)
Inventor
Лев Петрович Петренко (UA)
Лев Петрович Петренко
Original Assignee
Лев Петрович Петренко
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Лев Петрович Петренко filed Critical Лев Петрович Петренко
Priority to RU2010120992/08A priority Critical patent/RU2429564C1/en
Application granted granted Critical
Publication of RU2429564C1 publication Critical patent/RU2429564C1/en

Links

Abstract

FIELD: information technology. ^ SUBSTANCE: invention can be used when designing arithmetic units for performing arithmetic procedures for summation of position arguments [nj]f(2n) and [mi]f(2n). In one version, the functional structure is implemented using elements which execute logic functions AND, OR, NAND and NOT. ^ EFFECT: faster operation. ^ 5 cl

Description

Текст описания приведен в факсимильном виде.

Figure 00000001
Figure 00000002
Figure 00000003
Figure 00000004
Figure 00000005
Figure 00000006
Figure 00000007
Figure 00000008
Figure 00000009
Figure 00000010
Figure 00000011
Figure 00000012
Figure 00000013
Figure 00000014
Figure 00000015
Figure 00000016
Figure 00000017
Figure 00000018
Figure 00000019
Figure 00000020
Figure 00000021
Figure 00000022
Figure 00000023
Figure 00000024
Figure 00000025
Figure 00000026
Figure 00000027
Figure 00000028
Figure 00000029
Figure 00000030
Figure 00000031
Figure 00000032
Figure 00000033
Figure 00000034
Figure 00000035
Figure 00000036
Figure 00000037
Figure 00000038
Figure 00000039
Figure 00000040
Figure 00000041
Figure 00000042
Figure 00000043
Figure 00000044
Figure 00000045
Figure 00000046
Figure 00000047
Figure 00000048
Figure 00000049
Figure 00000050
Figure 00000051
Figure 00000052
The text of the description is given in facsimile form.
Figure 00000001
Figure 00000002
Figure 00000003
Figure 00000004
Figure 00000005
Figure 00000006
Figure 00000007
Figure 00000008
Figure 00000009
Figure 00000010
Figure 00000011
Figure 00000012
Figure 00000013
Figure 00000014
Figure 00000015
Figure 00000016
Figure 00000017
Figure 00000018
Figure 00000019
Figure 00000020
Figure 00000021
Figure 00000022
Figure 00000023
Figure 00000024
Figure 00000025
Figure 00000026
Figure 00000027
Figure 00000028
Figure 00000029
Figure 00000030
Figure 00000031
Figure 00000032
Figure 00000033
Figure 00000034
Figure 00000035
Figure 00000036
Figure 00000037
Figure 00000038
Figure 00000039
Figure 00000040
Figure 00000041
Figure 00000042
Figure 00000043
Figure 00000044
Figure 00000045
Figure 00000046
Figure 00000047
Figure 00000048
Figure 00000049
Figure 00000050
Figure 00000051
Figure 00000052

Claims (5)

1. Функциональная структура процедуры преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логическую функцию f2(})-ИЛИ и логические функции f1(})-ИЛИ и f1(&)-HE, функциональные выходные связи которых являются функциональными входными связями логических функций f1(&)-И, a функциональная выходная связь логической функции f1(&)-И-HE является функциональной входной связью логической функции f2(&)-И, отличающаяся тем, что введена дополнительная логическая функция f2(&)-И-НЕ, а функциональные связи логических функций в структуре преобразователя выполнены в соответствии с математической моделью вида
Figure 00000053

Figure 00000054
- логическая функция f1(&)-И;
Figure 00000055
- логическая функция f1(})-
ИЛИ;
Figure 00000056
- логическая функция f1(&)-И-HE;
«=&1=» - логическая функция f1(&)-HE изменения активности входных аналоговых сигналов.1. Functional structure of the procedure for converting conditionally negative negative arguments “-” [n i ] f (2 n ) into the argument structure “additional code” of position-sign format using arithmetic axioms of the ternary number system f (+ 1,0, -1) , which includes the logical function f 2 (}) - OR and the logical functions f 1 (}) - OR and f 1 (&) - HE, the functional output links of which are the functional input links of the logical functions f 1 (&) - AND, a functional output connection logic function f 1 (k) - and-HE is a functional input communication bond logical function f 2 (k) - and characterized in that the introduced additional logic function f 2 (k) - AND-NO, and the functional connections of logic functions in the inverter structure made in accordance with the mathematical model of the form
Figure 00000053

Figure 00000054
- logical function f 1 (&) - And;
Figure 00000055
- logical function f 1 (}) -
OR;
Figure 00000056
- logical function f 1 (&) - AND-HE;
“= & 1 =” - the logical function f 1 (&) - HE changes the activity of the input analog signals. 2. Функциональная структура процедуры преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логические функции f2(})-ИЛИ, f2(&)-И и f1(}&)-ИЛИ-НЕ и логические функции f1(})-ИЛИ и f1(&)-HE, функциональные выходные связи которых являются функциональными входными связями логических f1(}&)-И, отличающаяся тем, что введена дополнительная логическая функция f3(&)-И, а функциональные связи логических функций в структуре преобразователя выполнены в соответствии с математической моделью вида
Figure 00000057

где
Figure 00000058
- логическая функция f1(}&)-ИЛИ-НЕ.2. Functional structure of the procedure for converting conditionally negative negative arguments “-” [n i ] f (2 n ) into the argument structure “additional code” of position-sign format using arithmetic axioms of the ternary number system f (+ 1,0, -1) , which includes the logical functions f 2 (}) - OR, f 2 (&) - AND and f 1 (} &) - OR NOT and the logical functions f 1 (}) - OR and f 1 (&) - HE, functional output links of which are functional input logical links f 1 (} &) - And, characterized in that an additional logical function f 3 (&) - И is introduced, and the functional The logical connections in the converter structure are made in accordance with a mathematical model of the form
Figure 00000057

Where
Figure 00000058
- logical function f 1 (} &) - OR NOT. 3. Функциональная структура процедуры преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логические функции f1(})-ИЛИ, f2(})-ИЛИ, f1(&)-И, f2(&)-И, f1(&)-HE и f1(&)-И-HE, отличающаяся тем, что введена дополнительная логическая функция f2(&)-И-НЕ, а функциональные связи логических функций в структуре преобразователя выполнены в соответствии с математической моделью вида
Figure 00000059
3. The functional structure of the procedure for converting conditionally negative negative arguments “-” [n i ] f (2 n ) into the argument structure “additional code” of a position-sign format using arithmetic axioms of the ternary number system f (+ 1,0, -1) , which includes the logical functions f 1 (}) - OR, f 2 (}) - OR, f 1 (&) - AND, f 2 (&) - AND, f 1 (&) - HE and f 1 (&) -I-HE, characterized in that an additional logical function f 2 (&) is introduced - AND-NOT, and the functional relationships of the logical functions in the structure of the converter are made in accordance with a mathematical model of the form
Figure 00000059
 4. Функциональная структура процедуры преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логические функции f1(})-ИЛИ, f1(&)-HE и f3(&)-И-НЕ, отличающаяся тем, что введены дополнительные логические функции f1(&)-И-HE, f2(&)-И-НЕ, f4(&)-И-НЕ и f5(&)-И-НЕ, а функциональные связи логических функций в структуре преобразователя выполнены в соответствии с математической моделью вида
Figure 00000060
4. Functional structure of the procedure for converting positionally negative negative arguments “-” [n i ] f (2 n ) into the argument structure “additional code” of position-sign format using arithmetic axioms of the ternary number system f (+ 1,0, -1) , which includes the logical functions f 1 (}) - OR, f 1 (&) - HE and f 3 (&) - NAND, characterized in that additional logical functions f 1 (&) - AND-HE, f 2 (k) - aND-NO, f 4 (k) - aND-5 and f (k) - aND-NO, and the functional connections of logic functions performed in the transducer structure in accordance with the mathematical model species
Figure 00000060
 5. Функциональная структура процедуры преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логические функции f1(})-ИЛИ, f2(})-ИЛИ, f3(})-ИЛИ, f1(&)-HE, f1(&)-И и f2(&)-И и f1(&)-И-НЕ, отличающаяся тем, что функциональные связи логических функций в структуре преобразователя выполнены в соответствии с математической моделью вида
Figure 00000061
5. Functional structure of the procedure for converting conditionally negative positional arguments “-” [n i ] f (2 n ) into the argument structure “additional code” of position-sign format using arithmetic axioms of the ternary number system f (+ 1,0, -1) , which includes the logical functions f 1 (}) - OR, f 2 (}) - OR, f 3 (}) - OR, f 1 (&) - HE, f 1 (&) - AND and f 2 (&) -I and f 1 (&) - AND NOT, characterized in that the functional relationships of logical functions in the structure of the converter are made in accordance with a mathematical model of the form
Figure 00000061
RU2010120992/08A 2010-05-24 2010-05-24 FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS) RU2429564C1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
RU2010120992/08A RU2429564C1 (en) 2010-05-24 2010-05-24 FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
RU2010120992/08A RU2429564C1 (en) 2010-05-24 2010-05-24 FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS)

Publications (1)

Publication Number Publication Date
RU2429564C1 true RU2429564C1 (en) 2011-09-20

Family

ID=44758806

Family Applications (1)

Application Number Title Priority Date Filing Date
RU2010120992/08A RU2429564C1 (en) 2010-05-24 2010-05-24 FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS)

Country Status (1)

Country Link
RU (1) RU2429564C1 (en)

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ЦИЛЬКЕР Б.Я. и др. Организация ЭВМ и систем. - С.-Пб.: ПИТЕР, 2004, с.339, рис.7.13. *

Similar Documents

Publication Publication Date Title
RU2443052C1 (en) FUNCTIONAL STRUCTURE OF A TRANSFORMER OF POSITIONAL SYMBOLIC STRUCTURE OF ANALOG SIGNALS ARGUMENTS «±»[ni]f(-1\+1,0,…+1) "ADDITIONAL CODE" INTO FUNCTIONAL STRUCTURE OF CONDITIONALLY NEGATIVE ANALOG SINGALS ARGUMENTS «-»[ni]f(2n) USING ARITHMETICAL ACSIOMS OF TERNARY NOTATION f(+1,0,-1) (VARIANTS)
RU2429565C1 (en) FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS)
WO2012021330A3 (en) Integrated information technology service management for cloud resources
EP2088700A3 (en) System to process a plurality of audio sources
EP2977899A3 (en) Integrating execution of computing analytics within a mapreduce processing environment
RU2429522C1 (en) FUNCTIONAL STRUCTURE OF ADDER fi(Σ) OF ARBITRARY "i" BIT FOR LOGIC-DYNAMIC PROCESS OF SUMMATION OF POSITIONAL ARGUMENTS OF TERMS [ni]f(2n) and [mi]f(2n) USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS OF RUSSIAN LOGIC)
RU2429564C1 (en) FUNCTIONAL STRUCTURE OF PROCEDURE OF CONVERTING POSITION CONDITIONALLY NEGATIVE ARGUMENTS «-»[ni]f(2n) INTO STRUCTURE OF ARGUMENTS "COMPLEMENTARY CODE" OF POSITION-SIGN FORMAT USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS)
RU2386162C2 (en) FUNCTIONAL STRUCTURE OF PARALLEL ADDER FOR MULTIPLICATION, WHEREIN ARGUMENTS OFTERMS OF PARTIAL PRODUCTS ARE ARGUMENTS OF TERNARY NUMBER SYSTEM f(+1,0,-1) IN POSITIONAL-SIGN FORMAT THEREOF f(+/-) (VERSIONS)
RU2378682C2 (en) INPUT STRUCTURE FOR PARALLEL ADDER IN POSITION-SIGN CODES f(+/-)(VERSIONS)
RU2422881C1 (en) FUNCTIONAL OUTPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) (VERSIONS)
RU2450325C2 (en) FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF SERIAL END-TO-END ACTIVATION OF INACTIVE ARGUMENTS "0" OF SECOND INTERMEDIATE SUM +[S2 i]f(&) -AND IN ADDER f(Σ) WITH TRANSFORMATION OF POSITIONAL ARGUMENTS OF TERMS [ni]f(2n) AND [mi]f(2n) (VERSIONS)
RU2424549C1 (en) FUNCTIONAL STRUCTURE OF PRE-ADDER fΣ([mj]&[mj,0]) OF PARALLEL-SERIES MULTIPLIER fΣ(Σ) WITH PROCEDURE FOR LOGIC DIFFERENTIATION d/dn OF FIRST INTERMEDIATE SUM [S1 Σ]f(})- OR STRUCTURE OF ACTIVE ARGUMENTS OF MULTIPLICAND [0,mj]f(2n) and [mj,0]f(2n) (VERSIONS)
RU2363978C2 (en) Device for parallel boolean summation of analogue signals of terms equivalent to binary number system
RU2380741C1 (en) FUNCTIONAL STRUCTURE OF CONDITIONALLY "i" POSITION OF PARALLEL ADDER FOR TERNARY NUMBER SYSTEM f(+1,0,-1) IN ITS POSITION-SIGN FORMAT f(+/-)
RU2413988C1 (en) FUNCTIONAL STRUCTURE FOR LOGIC DIFFERENTIATION d/dn OF ANALOGUE SIGNALS ±[ni]f(2n) TAKING INTO ACCOUNT LOGIC SIGN n(±) THEREOF (VERSIONS)
RU2484518C1 (en) FUNCTIONAL STRUCTURE OF SECOND LEAST SIGNIFICANT BIT ACTIVATING RESULTANT ARGUMENT (2Smin+1)f(2n) "LEVEL 2" AND (1Smin+1)f(2n) "LEVEL 1" OF ADDDER fCD(Σ)RU FOR ARGUMENTS OF TERMS ±[1,2nj]f(2n) AND ±[1,2mj]f(2n) OF "COMPLEMENTARY CODE RU" FORMAT (VERSIONS OF RUSSIAN LOGIC)
RU2380740C2 (en) FUNCTIONAL STRUCTURE OF POSITION-SIGN ACCUMULATOR f(+/-) FOR COMBINATORIAL MULTIPLIER WHERE SUBPRODUCT OUTPUT ARGUMENTS ARE REPRESENTED IN BINARY FORMAT f(2n) (VERSIONS)
RU2361269C9 (en) Method of logical differentiation of analogue signals equivalent to binary code and device to this end
RU2378684C1 (en) FUNCTIONAL INPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER OF POSITION-SIGN SYSTEM f(+/-) FORMAT
RU2443008C1 (en) FUNCTIONAL STRUCTURE OF A TRANSFORMER OF PRELIMINARY FA fΣ [ni]&[mi](2n) OF PARALLEL-SERIAL MULTIPLICATOR fΣ (Σ) CONDITIONALLY, OF "i" DIGIT TO SUM UP OF POSITIONAL ADDITIVE OF SUMS [ni]f(2n) AND [mi]f(2n) OF PARTIAL PRODUCTS USING ARITHMETICAL AXIOMS OF TERNARY NOTATION f(+1, 0, -1) WITH THE FORMATION OF A RESULTING SUM [SΣ]f(2n) IN A POSITIONAL FORMAT
RU2417432C1 (en) METHOD OF TRANSFORMING POSITION-SIGN ARGUMENTS ±[nj]f(+/-) INTO STRUCTURE OF ARGUMENTS ±[nj]f(+/-)min WITH MINIMISED NUMBER OF ACTIVE ARGUMENTS AND FUNCTIONAL STRUCTURE FOR IMPLEMENTING SAID METHOD (RUSSIAN LOGIC VERSIONS)
RU2422880C1 (en) FUNCTIONAL STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICANT [mj]f(2n) AND MULTIPLIER [ni]f(2n) WITH MINIMISED PROCEDURE OF FORMING FIRST LEVEL INTERMEDIATE SUMS f1..k[Sj+2] OF PARTIAL PRODUCTS, WHERE k IS NUMBER OF FIRST LEVEL INTERMEDIAT SUMS (VERSIONS)
RU2422879C1 (en) FUNCTIONAL STRUCTURE FOR PRE-ADDER OF PARALLEL-SERIAL MULTIPLIER fΣ(Σ) WITH MULTIPLICAND ARGUMENTS [mj]f(2n) AND MULTIPLIER ARGUMENTS [ni]f(2n) IN POSITION FORMAT (VERSIONS)
RU2424548C1 (en) FUNCTIONAL INPUT STRUCTURE OF ADDER WITH SELECTIVE LOGIC DIFFERENTIATION d*/dn OF FIRST INTERMEDIATE SUM ±[S1 i] OF MINIMISED ARGUMENTS OF TERMS ±[ni]f(+/-)min and ±[mi]f(+/-)min (VERSIONS)
RU2417431C1 (en) METHOD FOR SELECTIVE LOGIC DIFFERENTIATION d*/dn OF POSITIONAL ANALOGUE SIGNALS ±[mj]f(2n) TAKING INTO ACCOUNT LOGICAL SIGN m(±) THEREOF AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (RUSSIAN LOGIC VERSIONS)