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

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

Info

Publication number
RU2422880C1
RU2422880C1 RU2010110852/08A RU2010110852A RU2422880C1 RU 2422880 C1 RU2422880 C1 RU 2422880C1 RU 2010110852/08 A RU2010110852/08 A RU 2010110852/08A RU 2010110852 A RU2010110852 A RU 2010110852A RU 2422880 C1 RU2422880 C1 RU 2422880C1
Authority
RU
Russia
Prior art keywords
functional
logical functions
level
multiplier
partial products
Prior art date
Application number
RU2010110852/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 RU2010110852/08A priority Critical patent/RU2422880C1/en
Application granted granted Critical
Publication of RU2422880C1 publication Critical patent/RU2422880C1/en

Links

Abstract

FIELD: information technology. ^ SUBSTANCE: in the first version, the multiplier design has four adders, linear logic functions AND, as well as three linear logic functions OR for generating intermediate sums of partial products of the first level of summation, wherein functional structure of the adders is adapted to receive position-sign arguments of intermediate sums of partial products. ^ EFFECT: simple functional structure of a parallel-serial multiplier and high speed of operation of the multiplier. ^ 4 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
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

Claims (4)

1. Функциональная структура параллельно-последовательного умножителя fΣ(Σ) в позиционном формате множимого [m j]f(2n) и множителя [n i]f(2n) с минимизированной процедурой формирования первого уровня промежуточных сумм f1..k[S j+2] частичных произведений, где «k» - число промежуточных сумм первого уровня, которая содержит линейные логические функции fk[&j,0]-И и fk[0,&j]-И, в которых функциональные входные связи являются функциональной входной связью структуры умножителя для приема соответствующих аргументов множимого [m j]f(2n), а вторые функциональные связи является функциональной входной связью функциональной структуры умножителя для приема одного из аргументов n 1 - n 2k множителя [n i]f(2n), структура умножителя также содержит сумматоры fΣ([m j]&[m j,0]), f2(±Σ) и сумматор f1(±Σ), в котором функциональные выходные связи являются первыми функциональными входными связями сумматора f3(±Σ), отличающаяся тем, что дополнительно введены логические функции f1[ & ]-НЕ и f2[ & ]-НЕ, линейные логические функции f[&j+2]-И и f[&j]-И, а также логические функции f1(})-ИЛИ, f2(})-ИЛИ и линейные логические функции f[} j]-ИЛИ для формирования промежуточных сумм f1..k[S j+2] частичных произведений первого уровня суммирования, а функциональные структуры сумматоров f1(±Σ) - f3(±Σ) выполнены с возможностью приема позиционно-знаковых аргументов промежуточных сумм частичных произведений, при этом функциональные связи в функциональной структуре, например, восьмиразрядного умножителя fΣ(Σ) выполнены в соответствии с математической моделью вида
Figure 00000035

где n 1 k и n 2 k - первый и второй аргументы множителя [n i]f(2n); & 1 и & 2 - логические функции f1( & )-НЕ и f2( & )-НЕ;
Figure 00000036
,
Figure 00000037
и
Figure 00000038
- линейные последовательности f[0,&j]-И, f[&j,0]-
И и f[&j]-И из «j» логических функций f[&]-И;
Figure 00000039
,
Figure 00000040
- логические функции f1(})-ИЛИ и f2(})-ИЛИ;
Figure 00000041
- линейная последовательность f[} j]-ИЛИ из «j» логических функций f[}]-ИЛИ.1. Functional structure of a parallel-serial multiplier f Σ ( Σ ) in the positional format of the multiplicative [ m j ] f (2 n ) and the factor [ n i ] f (2 n ) with a minimized procedure for generating the first level of intermediate sums f 1..k [ S j + 2 ] partial products, where "k" is the number of intermediate sums of the first level, which contains linear logical functions f k [& j , 0] -I and f k [0, & j ] -I, in which the functional input links are the functional input link of the structure of the multiplier for receiving the corresponding arguments of the multiplicable [ m j ] f (2 n ), and the second functions interconnection is a functional input link of the functional structure of the multiplier for receiving one of the arguments n 1 - n 2k of the factor [ n i ] f (2 n ), the structure of the multiplier also contains adders f Σ ([ m j ] & [ m j , 0]) , f 2 (± Σ ) and the adder f 1 (± Σ ), in which the functional output connections are the first functional input connections of the adder f 3 (± Σ ), characterized in that the logical functions f 1 [ & ] -НЕ and f 2 [ & ] -HE, linear logical functions f [& j + 2 ] -I and f [& j ] -I, as well as logical functions f 1 ( } ) -OR, f 2 ( } ) -OR and linear logical fun f [ } j ] -OR fractions to form intermediate sums f 1..k [ S j + 2 ] partial products of the first summation level, and the functional structures of adders f 1 (± Σ ) - f 3 (± Σ ) are adapted to receive positional-sign arguments of intermediate sums of partial products, while the functional relationships in the functional structure, for example, an eight-digit multiplier f Σ ( Σ ) are made in accordance with a mathematical model of the form
Figure 00000035

where n 1 k and n 2 k are the first and second arguments of the factor [ n i ] f (2 n ); & 1 and & 2 are the logical functions f 1 ( & ) -НЕ and f 2 ( & ) -НЕ;
Figure 00000036
,
Figure 00000037
and
Figure 00000038
- linear sequences f [0, & j ] -I, f [& j , 0] -
And and f [& j ] -and of the "j" logical functions f [&] - And;
Figure 00000039
,
Figure 00000040
- logical functions f 1 ( } ) -OR and f 2 ( } ) -OR;
Figure 00000041
- a linear sequence f [ } j ] -OR from "j" logical functions f [ } ] -OR. 2. Функциональная структура параллельно-последовательного умножителя fΣ(Σ) в позиционном формате множимого [m j]f(2n) и множителя [n i]f(2n) с минимизированной процедурой формирования первого уровня промежуточных сумм f1..k[S j+2] частичных произведений, где «k» - число промежуточных сумм первого уровня, которая содержит линейные логические функции fk[&j,0]-И и сумматоры fΣ([m j]&[m j,0]), f2(±Σ) и сумматор f1(±Σ), в котором функциональные выходные связи являются первыми функциональными входными связями сумматора f3(±Σ), отличающаяся тем, что дополнительно введены логические функции f1[ & ]-НЕ и f2[ & ]-НЕ, линейные логические функции f[1,& j]-И-НЕ, f[& j,1]-И-НЕ и f[& j+2]-И-НЕ, а также логические функции f1(&)-И-НЕ, f2(&)-И-НЕ и линейные логические функции f[& j]-И-НЕ для формирования промежуточных сумм f1..k[S j+2] частичных произведений первого уровня суммирования, а функциональные структуры сумматоров f1(±Σ) - f3(±Σ) выполнены с возможностью приема позиционно-знаковых аргументов промежуточных сумм частичных произведений, при этом функциональные связи в функциональной структуре, например, восьмиразрядного умножителя fΣ(Σ) выполнены в соответствии с математической моделью вида
Figure 00000042

где
Figure 00000043
и
Figure 00000044
- логические функции f1(&)-И-НЕ и f2(&)-И-НЕ;
Figure 00000045
,
Figure 00000046
и
Figure 00000047
- линейные последовательности
f[1,& j]-И-НЕ, f[& j,1]-И-НЕ и f[& j]-И-НЕ из «j» логических функций f[&]-И-НЕ.2. Functional structure of a parallel-serial multiplier f Σ ( Σ ) in the positional format of the multiplicative [ m j ] f (2 n ) and the factor [ n i ] f (2 n ) with a minimized procedure for generating the first level of intermediate sums f 1..k [ S j + 2 ] partial products, where “k” is the number of intermediate sums of the first level, which contains linear logical functions f k [& j , 0] -I and adders f Σ ([ m j ] & [ m j , 0 ]), f 2 (± Σ ) and the adder f 1 (± Σ ), in which the functional output connections are the first functional input connections of the adder f 3 (± Σ ), characterized in that The logical functions f 1 [ & ] -НЕ and f 2 [ & ] -НЕ, the linear logical functions f [ 1 , & j ] -AND-AND, f [ & j , 1 ] -AND-AND and f [ & j + 2 ] -AND-AND, as well as logical functions f 1 ( & ) -AND-NOT, f 2 ( & ) -AND-NOT and linear logical functions f [ & j ] -AND NOT to form intermediate sums f 1..k [ S j + 2 ] partial products of the first summation level, and the functional structures of the adders f 1 (± Σ ) - f 3 (± Σ ) are made with the possibility of receiving position-sign arguments of intermediate sums of partial products, while the functional relationships in the functional structure, for example, eight mi bit digit f Σ ( Σ ) are made in accordance with a mathematical model of the form
Figure 00000042

Where
Figure 00000043
and
Figure 00000044
- logical functions f 1 ( & ) -I-NOT and f 2 ( & ) -AND-NOT;
Figure 00000045
,
Figure 00000046
and
Figure 00000047
- linear sequences
f [ 1 , & j ] -AND-NOT, f [ & j , 1 ] -AND NOT and f [ & j ] -AND NOT from the "j" logical functions f [ & ] -AND NOT. 3. Функциональная структура параллельно-последовательного умножителя fΣ(Σ) в позиционном формате множимого [m j]f(2n) и множителя [n i]f(2n) с минимизированной процедурой формирования первого уровня промежуточных сумм f1..k[S j+2] частичных произведений, где «k» - число промежуточных сумм первого уровня, которая содержит сумматоры fΣ([m j]&[m j,0]), f2(±Σ) и сумматор f1(±Σ), в котором функциональные выходные связи являются первыми функциональными входными связями сумматора f3(±Σ), отличающаяся тем, что дополнительно введены логические функции f1[ & ]-НЕ и f2[ & ]-НЕ, линейные логические функции f[1,& j]-И-НЕ, f1[} j+1]-ИЛИ, f1[} j+1]-ИЛИ, f[} j+2]-ИЛИ и f[}& j]-ИЛИ-НЕ, а также логические функции f1(&)-И-НЕ, f2(&)-И-НЕ и линейные логические функции f[& j]-И-НЕ для формирования промежуточных сумм f1..k[S j+2] частичных произведений первого уровня суммирования, а функциональные структуры сумматоров f1(±Σ) - f3(±Σ) выполнены с возможностью приема позиционно-знаковых аргументов промежуточных сумм частичных произведений, при этом функциональные связи в функциональной структуре, например, восьмиразрядного умножителя fΣ(Σ) выполнены в соответствии с математической моделью вида
Figure 00000048

где
Figure 00000049
и
Figure 00000050
- линейная последовательность f1[} j]-ИЛИ и f2[} j]-ИЛИ
из «j+1» логических функций f[}]-ИЛИ;
Figure 00000051
- линейная последовательность f[}& j]-ИЛИ-НЕ из «j» логических
функций f(}&)-ИЛИ-НЕ.3. The functional structure of a parallel-serial multiplier f Σ ( Σ ) in the positional format of the multiplicative [ m j ] f (2 n ) and the multiplier [ n i ] f (2 n ) with a minimized procedure for generating the first level of intermediate sums f 1..k [ S j + 2 ] partial products, where “k” is the number of first-level intermediate sums that contains the adders f Σ ([ m j ] & [ m j , 0]), f 2 (± Σ ) and the adder f 1 ( ± Σ ), in which the functional output connections are the first functional input connections of the adder f 3 (± Σ ), characterized in that the logical functions f 1 [ & ] -HE and f 2 [ & ] -HE, linear logical functions f [ 1 , & j ] -AND-NOT, f 1 [ } j + 1 ] -OR, f 1 [ } j + 1 ] - OR, f [ } j + 2 ] -OR and f [ } & j ] -OR-NOT, as well as logical functions f 1 ( & ) -AND NOT, f 2 ( & ) -AND NOT and linear logic functions f [ & j ] -I-NOT for the formation of intermediate sums f 1..k [ S j + 2 ] partial products of the first summation level, and the functional structures of the adders f 1 (± Σ ) - f 3 (± Σ ) are made with the possibility receiving positional-sign arguments of intermediate sums of partial products, while the functional relationships in the functional structure, for example, eight-digit the factors f Σ ( Σ ) are made in accordance with a mathematical model of the form
Figure 00000048

Where
Figure 00000049
and
Figure 00000050
- the linear sequence f 1 [ } j ] -OR and f 2 [ } j ] -OR
from "j + 1" logical functions f [ } ] -OR;
Figure 00000051
- a linear sequence f [ } & j ] - OR NOT from the "j" logical
functions f ( } &) - OR NOT. 4. Функциональная структура параллельно-последовательного умножителя fΣ(Σ) в позиционном формате множимого [m j]f(2n) и множителя [n i]f(2n) с минимизированной процедурой формирования первого уровня промежуточных сумм f1..k[S j+2] частичных произведений, где «k» - число промежуточных сумм первого уровня, которая содержит сумматоры fΣ([m j]&[m j,0]), f2(±Σ) и сумматор f1(±Σ), в котором функциональные выходные связи являются первыми функциональными входными связями сумматора f3(±Σ), отличающаяся тем, что дополнительно введены логические функции f1[ & ]-НЕ и f2[ & ]-НЕ, линейные логические функции f1[}, & j+1]-ИЛИ-НЕ, f2[}& j+1]-ИЛИ-НЕ, f[}& j+12]-ИЛИ и f[}& j]-ИЛИ-НЕ, а также логические функции f1(})-ИЛИ, f2(})-ИЛИ и линейные логические функции f[} j]-ИЛИ для формирования промежуточных сумм f1..k[S j+2] частичных произведений первого уровня суммирования, а функциональные структуры сумматоров f1(±Σ) - f3(±Σ) выполнены с возможностью приема позиционно-знаковых аргументов промежуточных сумм частичных произведений, при этом функциональные связи в функциональной структуре, например, восьмиразрядного умножителя fΣ(Σ) выполнены в соответствии с математической моделью вида
Figure 00000052
4. The functional structure of a parallel-serial multiplier f Σ ( Σ ) in the positional format of the multiplicative [ m j ] f (2 n ) and the factor [ n i ] f (2 n ) with a minimized procedure for generating the first level of intermediate sums f 1..k [ S j + 2 ] partial products, where “k” is the number of first-level intermediate sums that contains the adders f Σ ([ m j ] & [ m j , 0]), f 2 (± Σ ) and the adder f 1 ( ± Σ ), in which the functional output connections are the first functional input connections of the adder f 3 (± Σ ), characterized in that the logical functions f 1 [ & ] -HE and f 2 [ & ] -HE, linear logical functions f 1 [ } , & j + 1 ] -OR-NOT, f 2 [ } & j + 1 ] -OR-NOT, f [ } & j + 12 ] -OR and f [ } & j ] -OR NOT, as well as logical functions f 1 ( } ) -OR, f 2 ( } ) -OR and linear logic functions f [ } j ] -OR the formation of intermediate sums f 1..k [ S j + 2 ] partial products of the first summation level, and the functional structures of the adders f 1 (± Σ ) - f 3 (± Σ ) are made with the possibility of accepting position-sign arguments of intermediate sums of partial products, while functional relationships in the functional structure, for example, eight-bit smart inhabitants f Σ ( Σ ) are made in accordance with a mathematical model of the form
Figure 00000052
RU2010110852/08A 2010-03-22 2010-03-22 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) RU2422880C1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
RU2010110852/08A RU2422880C1 (en) 2010-03-22 2010-03-22 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)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
RU2010110852/08A RU2422880C1 (en) 2010-03-22 2010-03-22 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)

Publications (1)

Publication Number Publication Date
RU2422880C1 true RU2422880C1 (en) 2011-06-27

Family

ID=44739389

Family Applications (1)

Application Number Title Priority Date Filing Date
RU2010110852/08A RU2422880C1 (en) 2010-03-22 2010-03-22 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)

Country Status (1)

Country Link
RU (1) RU2422880C1 (en)

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ДЖ.УЭЙКЕРЛИ. Проектирование цифровых устройств. Т.1. - М.: Постмаркет, 2002, всего с.1018, см. с.519-521, рис.5.98 [найдено 04.03.2011]. Найдено в Интернете: <URL://lib.mexmat/ru/book/11698. *

Similar Documents

Publication Publication Date Title
RU2008119742A (en) LOGIC CONVERTER
RU2429522C1 (en) FUNCTIONAL STRUCTURE OF ADDER fi(Σ) OF ARBITRARY &#34;i&#34; 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)
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)
RU2422881C1 (en) FUNCTIONAL OUTPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) (VERSIONS)
RU2373563C1 (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(+/-)
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)
RU2424549C1 (en) FUNCTIONAL STRUCTURE OF PRE-ADDER fΣ([mj]&amp;[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)
RU2443008C1 (en) FUNCTIONAL STRUCTURE OF A TRANSFORMER OF PRELIMINARY FA fΣ [ni]&amp;[mi](2n) OF PARALLEL-SERIAL MULTIPLICATOR fΣ (Σ) CONDITIONALLY, OF &#34;i&#34; 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
RU2439660C2 (en) FUNCTIONAL STRUCTURE OF PARALLEL-SERIES MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n)
RU2439658C1 (en) FUNCTIONAL STRUCTURE OF PREVIOUS SUMMATOR fΣ([ni]&amp;[ni,0]), CONDITIONALLY &#34;i AND &#34;i+1&#34; DIGITS OF &#34;k&#34; GROUP OF PARALLEL-SERIES MULTIPLIER fΣ(Σ) FOR POSITIONAL ARGUMENTS OF MULTIPLICAND [ni]f(2n) WITH APPLICATION OF ARITHMETICAL AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS OF RUSSIAN LOGIC)
RU2480817C1 (en) FUNCTIONAL STRUCTURE OF ADDER f2(ΣCD) OF CONDITIONAL &#34;k&#34; BIT OF PARALLEL-SERIAL MULTIPLIER fΣ(ΣCD), IMPLEMENTING PROCEDURE FOR &#34;DECRYPTION&#34; OF INPUT STRUCTURES OF ARGUMENTS OF TERMS [1,2Sj h1]f(2n) AND [1,2Sj h2]f(2n) OF &#34;COMPLEMENTARY CODE RU&#34; 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
RU2450325C2 (en) FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF SERIAL END-TO-END ACTIVATION OF INACTIVE ARGUMENTS &#34;0&#34; OF SECOND INTERMEDIATE SUM +[S2 i]f(&amp;) -AND IN ADDER f(Σ) WITH TRANSFORMATION OF POSITIONAL ARGUMENTS OF TERMS [ni]f(2n) AND [mi]f(2n) (VERSIONS)
RU2450326C2 (en) FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF PARALLEL-SERIAL END-TO-END ACTIVATION OF fi(←«+1/-1»)k INACTIVE ARGUMENTS &#34;0&#34; 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)
RU2424550C1 (en) FUNCTIONAL STRUCTURE OF SERIAL RIPPLE CARRIES fj+1(←←)+ and fj(←←)+ OF CONDITIONAL &#34;I&#34; FORMATION ZONE FOR CORRECTING RESULTANT SUM OF PRESUMMATION OF ACTIVE ARGUMENTS OF MULTIPLICANT [mj]f(2n) OF POSITIONAL FORMAT IN PARALLEL-SERIAL MULTIPLIER fΣ(Σ) (VERSIONS)
RU2480814C1 (en) FUNCTIONAL OUTPUT STRUCTURE OF CONDITIONAL BIT &#34;j&#34; OF ADDER fCD(Σ)RU WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆tΣ FOR ARGUMENTS OF TERMS OF INTERMEDIATE ARGUMENTS (2Sj)2 d1/dn &#34;LEVEL 2&#34; AND (1Sj)2 d1/dn &#34;LEVEL 1&#34; OF SECOND TERM AND INTERMEDIATE ARGUMENTS (2Sj)1 d1/dn &#34;LEVEL 2&#34; AND (1Sj)1 d1/dn &#34;LEVEL 1&#34; OF FIRST TERM OF &#34;COMPLENTARY CODE RU&#34; FORMAT WITH GENERATION OF RESULTANT ARGUMENTS OF SUM (2Sj)f(2n) &#34;LEVEL 2&#34; AND (1Sj)f(2n) &#34;LEVEL 1&#34; IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC)
RU2481614C2 (en) METHOD TO GENERATE ARGUMENTS OF ANALOG SIGNALS OF PARTIAL PRODUCTS [ni]&amp;[mj]f(h)↓CD ARGUMENTS OF MULTIPLICAND ±[mj]f(2n) AND ARGUMENTS OF MULTIPLIER ±[ni]f(2n) - &#34;ADDITIONAL CODE&#34; IN PYRAMIDAL MULTIPLIER fΣ(↓CDΣ) FOR SUBSEQUENT LOGICAL DECODING f1(CD↓) AND GENERATION OF RESULTING SUM IN FORMAT ±[SΣ]f(2n) -&#34;ADDITIONAL CODE&#34; AND FUNCTIONAL STRUCTURE FOR ITS REALISATION (VERSIONS OF RUSSIAN LOGICS)
Pandey et al. LVTTL based energy efficient watermark generator design and implementation on FPGA
RU2431886C1 (en) FUNCTIONAL STRUCTURES FOR PARALLEL-SERIAL RIPPLE CARRY fj+1(←←)+ и fj(←←)+ IN CONDITIONAL &#34;i&#34; &#34;FORMATION ZONE&#34; FOR CORRECTING RESULTANT PRELIMINARY FIRST LEVEL SUM OF ARGUMENTS OF PARTIAL PRODUCTS OF PARALLEL-SERIAL MULTIPLIER fΣ(Σ) OF POSITIONAL FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) (VERSIONS)
RU2473955C1 (en) METHOD OF GENERATING ARGUMENTS OF ANALOGUE SIGNALS OF PARTIAL PRODUCTS [ni]&amp;[mj]f(h)↓CD OF ARGUMENTS OF MULTIPLIERS ±[mj]f(2n) И ±[ni]f(2n) - &#34;COMPLEMENTARY CODE&#34; IN PYRAMIDAL MULTIPLIER fΣ(↓CDΣ) FOR SUCCESSIVE LOGIC DECRYPTION f1(CD↓) AND GENERATING RESULTANT SUM IN FORMAT ±[SΣ]f(2n) - &#34;COMPLEMENTARY CODE&#34; AND FUNCTIONAL STRUCTURE FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2476922C1 (en) FUNCTIONAL DESIGN OF ADDER f3(ΣCD)max OF &#34;k&#34; CONDITIONALLY MOST SIGNIFICANT BITS OF PARALLEL-SERIAL MULTIPLIER fΣ(ΣCD), IMPLEMENTING PROCEDURE FOR &#34;DECRYPTION&#34; OF ARGUMENTS OF TERMS [1,2Sg h1] AND [1,2Sg h2] &#34;COMPLEMENTARY CODE RU&#34; BY ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND LOGIC DIFFERENTIATION d1/dn → f1(+←↓-)d/dn (VERSIONS OF RUSSIAN LOGIC)
Petrov Kostov The disconnectedness of certain sets defined after uni-variate polynomials
RU2586565C2 (en) FUNCTIONAL STRUCTURE OF PRE-ADDER f1(ΣCD) OF CONDITIONAL &#34;j&#34; BIT OF PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IMPLEMENTING PROCEDURE FOR &#34;DECRYPTION&#34; OF ARGUMENTS OF PARTIAL PRODUCTS WITH STRUCTURES OF ARGUMENTS OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) IN POSITION FORMAT OF &#34;ADDITIONAL CODE&#34; AND FORMATION OF INTERMEDIATE SUM [1,2Sjh1]f(2n) IN POSITION FORMAT OF &#34;ADDITIONAL CODE RU&#34; (RUSSIAN LOGIC VERSIONS)
RU2484518C1 (en) FUNCTIONAL STRUCTURE OF SECOND LEAST SIGNIFICANT BIT ACTIVATING RESULTANT ARGUMENT (2Smin+1)f(2n) &#34;LEVEL 2&#34; AND (1Smin+1)f(2n) &#34;LEVEL 1&#34; OF ADDDER fCD(Σ)RU FOR ARGUMENTS OF TERMS ±[1,2nj]f(2n) AND ±[1,2mj]f(2n) OF &#34;COMPLEMENTARY CODE RU&#34; FORMAT (VERSIONS OF RUSSIAN LOGIC)
RU2517245C9 (en) f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY &#34;g&#34; DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT &#34;EXTRA CODE RU&#34; 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 &#34;LEVEL 2&#34; AND REMOVAL OF ACTIVE LOGICAL ZEROES &#34;+1&#34;&#34;-1&#34;→&#34;0&#34; IN &#34;LEVEL 1&#34; (VERSIONS OF RUSSIAN LOGIC)