RU2429565C1 - 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) - Google Patents

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) Download PDF

Info

Publication number
RU2429565C1
RU2429565C1 RU2010122390/08A RU2010122390A RU2429565C1 RU 2429565 C1 RU2429565 C1 RU 2429565C1 RU 2010122390/08 A RU2010122390/08 A RU 2010122390/08A RU 2010122390 A RU2010122390 A RU 2010122390A RU 2429565 C1 RU2429565 C1 RU 2429565C1
Authority
RU
Russia
Prior art keywords
arguments
logical
logical function
functional
dynamic process
Prior art date
Application number
RU2010122390/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 RU2010122390/08A priority Critical patent/RU2429565C1/en
Application granted granted Critical
Publication of RU2429565C1 publication Critical patent/RU2429565C1/en

Links

Abstract

FIELD: information technology.
SUBSTANCE: invention can be used when designing arithmetic units and performing arithmetic procedures for summation of position arguments "-"[ni]f(2n) and "+"[mj]f(2n) with different signs. In one version, the functional structure is implemented using elements which execute logic functions AND, OR, NOR and NOT.
EFFECT: faster conversion process.
3 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
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

Claims (3)

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

Figure 00000041
логическая функция f1(})-ИЛИ;
Figure 00000042
- логическая функция f1(&)-И;
Figure 00000043
- логическая функция f1(} & )-ИЛИ-НЕ;
«= & 1=» - логическая функция f1( & )-НЕ изменения активности входного аналогового сигнала.1. The functional structure of the logical-dynamic process of converting positionally conditionally 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 2 (}) - OR, f 1 (} & ) - OR NOT and the logical function f 1 ( & ) - NOT, the functional output of which is functional input connection of the logical function f 1 (&) - And, characterized in that an additional logical function is introduced I f 2 (} & ) -OR-NOT, and the functional relationships in the structure are made in accordance with a mathematical model of the form
Figure 00000040

Figure 00000041
logical function f 1 (}) - OR;
Figure 00000042
- logical function f 1 (&) - And;
Figure 00000043
- logical function f 1 (} & ) -OR-NOT;
"= & 1 =" - a logical function f 1 ( & ) -NOT change the activity of the input analog signal. 2. Функциональная структура логико-динамического процесса преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логические функции f1(})-ИЛИ, f2(})-ИЛИ, f3(})-ИЛИ, f1( & )-НЕ и f1(&)-И-НЕ, отличающаяся тем, что введена дополнительная логическая функция f2(&)-И-НЕ, а функциональные связи в структуре выполнены в соответствии с математической моделью вида
Figure 00000044

где
Figure 00000045
- логическая функция f1(&)-И-НЕ.2. The functional structure of the logical-dynamic process of converting positionally conditionally 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 2 (}) - OR, f 3 (}) - OR, f 1 ( & ) -НЕ and f 1 ( & ) -AND-NOT, characterized in that an additional logical function f 2 ( & ) -I-NOT is introduced, and the functional relationships in the structure are made in accordance with a mathematical model of the form
Figure 00000044

Where
Figure 00000045
- logical function f 1 ( & ) -AND-NOT. 3. Функциональная структура логико-динамического процесса преобразования позиционных условно отрицательных аргументов «-»[ni]f(2n) в структуру аргументов «дополнительный код» позиционно-знакового формата с применением арифметических аксиом троичной системы счисления f(+1,0,-1), которая включает логические функции f1(})-ИЛИ, f2(} & )-ИЛИ-НЕ, f1( & )-НЕ, f1(&)-И и f2(&)-И, отличающаяся тем, что введена дополнительная логическая функция f1(} & )-ИЛИ-НЕ, а функциональные связи в структуре выполнены в соответствии с математической моделью вида
Figure 00000046
3. The functional structure of the logical-dynamic process of converting positionally conditionally 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 NOT, f 1 ( & ) - NOT, f 1 (&) - AND, and f 2 (&) - AND , characterized in that an additional logical function f 1 (} & ) -OR-NOT is introduced, and the functional relationships in the structure are made in accordance with a mathematical model of the form
Figure 00000046
RU2010122390/08A 2010-06-01 2010-06-01 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) RU2429565C1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
RU2010122390/08A RU2429565C1 (en) 2010-06-01 2010-06-01 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)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
RU2010122390/08A RU2429565C1 (en) 2010-06-01 2010-06-01 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)

Publications (1)

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

Family

ID=44758807

Family Applications (1)

Application Number Title Priority Date Filing Date
RU2010122390/08A RU2429565C1 (en) 2010-06-01 2010-06-01 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)

Country Status (1)

Country Link
RU (1) RU2429565C1 (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2502184C1 (en) * 2012-05-21 2013-12-20 Лев Петрович Петренко METHOD OF CONVERTING STRUCTURE OF ARGUMENTS OF ANALOGUE LOGIC VOLTAGES «-/+»[mj]f(+/-) - "COMPLEMENTARY CODE" TO POSITION-SIGN STRUCTURE OF MINIMISED ARGUMENTS OF LOGIC VOLTAGES ±[mj]f(+/-)min AND FUNCTIONAL STRUCTURE FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2503123C1 (en) * 2012-05-21 2013-12-27 Лев Петрович Петренко METHOD OF CONVERTING «-/+»[mj]f(+/-) → ±[mj]f(+/-)min STRUCTURE OF ARGUMENTS OF ANALOGUE LOGIC SIGNALS «-/+»[mj]f(+/-) - COMPLEMENTARY CODE" INTO CONDITIONALLY MINIMISED POSITION-SIGN STRUCTURE OF ARGUMENTS -±[mj]f(+/-)min OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2503124C1 (en) * 2012-05-21 2013-12-27 Лев Петрович Петренко METHOD OF GENERATING IN "k" "MINIMISATION ZONE" RESULTANT ARGUMENT +1mk OF END-TO-END ACTIVATION f1( 00)min → +1mk FOR CONVERSION IN ACCORDANCE WITH ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) STRUCTURES OF ARGUMENTS OF ANALOGUE SIGNALS "«-/+»[mj]f(+/-) - -"COMPLEMENTARY CODE" INTO STRUCTURE OF CONDITIONALLY MINIMISED POSITION-SIGN ARGUMENTS OF ANALOGUE SIGNALS ±[mj]fусл(+/-)min AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2507682C2 (en) * 2012-05-21 2014-02-20 Лев Петрович Петренко METHOD FOR END-TO-END ACTIVATION OF f1( 11)min → ±0mk INACTIVE ARGUMENTS "±0" → "+1/-1" OF ANALOGUE SIGNALS IN "MINIMISATION ZONES" OF "-/+" [mj]f(+/-) - "COMPLEMENTARY CODE" STRUCTURE ACCORDING TO ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) WHEN GENERATING ARGUMENTS OF ANALOGUE SIGNALS IN POSITION-SIGN CONDITIONALLY MINIMISED STRUCTURE THEREOF ±[mj]fусл(+/-)min (VERSIONS OF RUSSIAN LOGIC)

Non-Patent Citations (1)

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

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2502184C1 (en) * 2012-05-21 2013-12-20 Лев Петрович Петренко METHOD OF CONVERTING STRUCTURE OF ARGUMENTS OF ANALOGUE LOGIC VOLTAGES «-/+»[mj]f(+/-) - "COMPLEMENTARY CODE" TO POSITION-SIGN STRUCTURE OF MINIMISED ARGUMENTS OF LOGIC VOLTAGES ±[mj]f(+/-)min AND FUNCTIONAL STRUCTURE FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2503123C1 (en) * 2012-05-21 2013-12-27 Лев Петрович Петренко METHOD OF CONVERTING «-/+»[mj]f(+/-) → ±[mj]f(+/-)min STRUCTURE OF ARGUMENTS OF ANALOGUE LOGIC SIGNALS «-/+»[mj]f(+/-) - COMPLEMENTARY CODE" INTO CONDITIONALLY MINIMISED POSITION-SIGN STRUCTURE OF ARGUMENTS -±[mj]f(+/-)min OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2503124C1 (en) * 2012-05-21 2013-12-27 Лев Петрович Петренко METHOD OF GENERATING IN "k" "MINIMISATION ZONE" RESULTANT ARGUMENT +1mk OF END-TO-END ACTIVATION f1( 00)min → +1mk FOR CONVERSION IN ACCORDANCE WITH ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) STRUCTURES OF ARGUMENTS OF ANALOGUE SIGNALS "«-/+»[mj]f(+/-) - -"COMPLEMENTARY CODE" INTO STRUCTURE OF CONDITIONALLY MINIMISED POSITION-SIGN ARGUMENTS OF ANALOGUE SIGNALS ±[mj]fусл(+/-)min AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2507682C2 (en) * 2012-05-21 2014-02-20 Лев Петрович Петренко METHOD FOR END-TO-END ACTIVATION OF f1( 11)min → ±0mk INACTIVE ARGUMENTS "±0" → "+1/-1" OF ANALOGUE SIGNALS IN "MINIMISATION ZONES" OF "-/+" [mj]f(+/-) - "COMPLEMENTARY CODE" STRUCTURE ACCORDING TO ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) WHEN GENERATING ARGUMENTS OF ANALOGUE SIGNALS IN POSITION-SIGN CONDITIONALLY MINIMISED STRUCTURE THEREOF ±[mj]fусл(+/-)min (VERSIONS OF RUSSIAN LOGIC)

Similar Documents

Publication Publication Date Title
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)
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)
WO2015057785A3 (en) Adding/deleting digital notes from a group
Liu et al. Hardware-efficient delta sigma-based digital signal processing circuits for the internet-of-things
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)
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)
RU2373563C9 (en) FUNCTIONAL STRUCTURE OF MULTIPLIER, IN WHICH INPUT ARGUMENTS HAVE FORMAT OF BINARY NUMERATION SYSTEM f(2n), AND OUTPUT ARGUMENTS ARE FORMMED IN FORMAT OF POSITION-SIGN NUMERATION SYSTEM f(+/-)
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)
RU2422881C1 (en) FUNCTIONAL OUTPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) (VERSIONS)
RU2378682C2 (en) INPUT STRUCTURE FOR PARALLEL ADDER IN POSITION-SIGN CODES f(+/-)(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)
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)
RU2390050C2 (en) FUNCTIONAL DESIGN OF PARALLEL POSITION-SIGN ADDER OF ARGUMENTS OF TERMS OF TWO FORMATS OF BINARY NUMBER SYSTEM f(2n) AND POSITION-SIGN NUMBER SYSTEM f(+/-) (VERSIONS)
RU2363978C2 (en) Device for parallel boolean summation of analogue signals of terms equivalent to binary number system
RU2439659C1 (en) METHOD OF LOGIC-DYNAMIC PROCESS OF SUMMATION OF POSITIONAL ARGUMENTS OF ANALOGUE SIGNALS [ni]f(2n) AND [mi]f(2n) WITH APPLICATION OF ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND GENERATION OF RESULTING SUM OF ANALOGUE SIGNALS [Sj]f(2n) IN POSITIONAL FORMAT (RUSSIAN LOGIC)
RU2450326C2 (en) FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF PARALLEL-SERIAL END-TO-END ACTIVATION OF fi(←«+1/-1»)k INACTIVE ARGUMENTS "0" OF SECOND INTERMEDIATE SUM [S2 i]f(2n) IN PROCEDURE FOR SUMMATION 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)
RU2413988C1 (en) FUNCTIONAL STRUCTURE FOR LOGIC DIFFERENTIATION d/dn OF ANALOGUE SIGNALS ±[ni]f(2n) TAKING INTO ACCOUNT LOGIC SIGN n(±) THEREOF (VERSIONS)
Zhao et al. Unlimited Sampling Theorem Based on Fractional Fourier Transform
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)
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)
RU2380740C2 (en) FUNCTIONAL STRUCTURE OF POSITION-SIGN ACCUMULATOR f(+/-) FOR COMBINATORIAL MULTIPLIER WHERE SUBPRODUCT OUTPUT ARGUMENTS ARE REPRESENTED IN BINARY FORMAT f(2n) (VERSIONS)
RU2517245C9 (en) f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC)
RU2480817C1 (en) FUNCTIONAL STRUCTURE OF ADDER f2(ΣCD) OF CONDITIONAL "k" BIT OF PARALLEL-SERIAL MULTIPLIER fΣ(ΣCD), IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF INPUT STRUCTURES OF ARGUMENTS OF TERMS [1,2Sj h1]f(2n) AND [1,2Sj h2]f(2n) OF "COMPLEMENTARY CODE RU" POSITIONAL FORMAT BY APPLYING ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND LOGIC DIFFERENTIATION d1/dn → f1(+←↓-)d/dn OF ARGUMENTS IN COMBINED STRUCTURE THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2378684C1 (en) FUNCTIONAL INPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER OF POSITION-SIGN SYSTEM f(+/-) FORMAT