RU2424549C1 - 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) - Google Patents
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) Download PDFInfo
- Publication number
- RU2424549C1 RU2424549C1 RU2010110851/08A RU2010110851A RU2424549C1 RU 2424549 C1 RU2424549 C1 RU 2424549C1 RU 2010110851/08 A RU2010110851/08 A RU 2010110851/08A RU 2010110851 A RU2010110851 A RU 2010110851A RU 2424549 C1 RU2424549 C1 RU 2424549C1
- Authority
- RU
- Russia
- Prior art keywords
- channel
- conditionally
- functional
- logical
- discharge
- Prior art date
Links
Landscapes
- Logic Circuits (AREA)
Abstract
FIELD: information technology. ^ SUBSTANCE: in one version of the invention, the functional structure in each bit contains elements executing logic functions OR, AND, NAND and NOR, wherein each bit is in form of two summation channels for generating a positive sum and a conditionally negative sum. ^ EFFECT: faster pre-summation process of a multiplicand in parallel-serial multiplier. ^ 4 cl
Description
Claims (4)
где - логическая функция f1(&)-И; - логическая функция f1(})-ИЛИ;
- логическая функция f1(&)-И-НЕ; - логическая функция f1(}&)-ИЛИ-НЕ;
«=&1=» - логическая функция f1(&)-НЕ изменения активности входных аналоговых сигналов.1. The functional structure of the preliminary adder f Σ ([m j ] & [m j , 0]) parallel-series multiplier f Σ (Σ) with the procedure of logical differentiation d / dn of the first intermediate sum [S 1 Σ ] f (}) - OR the structure of the active arguments of the multiplied [0, m j ] f (2 n ) and [m j , 0] f (2 n ), which is made in the form of a positive channel conditionally “j” discharge to form a positive resulting sum + S 3 j and conditionally negative channel "j" of the discharge for the formation of the conditionally negative resulting sum -S 3 j through the logical function f 4 (&) - And, in which A functional output link is a functional output link of a conditionally negative channel, while the positive channel includes the logical functions f 1 (}) - OR, f 2 (}) - OR, f 3 (}) - OR, and the logical function f 1 (&) -And in which the first functional input link is the functional output link of the logical function f 4 (}) - OR, in which the first functional input link is the functional input link of the channel for receiving the argument m j conditionally “j” discharge of the structure of the arguments of the multiplicable, characterized in that in positive anal conditionally «j» discharge logic functions additionally introduced f 1 (k) -and-NO, f 1 (} &) -or-NO, f 2 (k) - and 3 and f (k) - And, the functional communications of logical functions in the structure of the preliminary adder are made in accordance with a mathematical model of the form
Where - logical function f 1 (&) - And; - logical function f 1 (}) - OR;
- logical function f 1 ( & ) -AND-NOT; - logical function f 1 (} & ) -OR-NOT;
“= & 1 =” - a logical function f 1 (&) - NOT changes in the activity of input analog signals.
2. The functional structure of the preliminary adder f Σ ([m j ] & [m j , 0]) parallel-series multiplier f Σ (Σ) with the logical differentiation procedure d / dn of the first intermediate sum [S 1 Σ ] f (}) - OR the structure of the active arguments of the multiplied [0, m j ] f (2 n ) and [m j , 0] f (2 n ), which is made in the form of a positive channel conditionally “j” discharge to form a positive resulting sum + S 3 j and conditionally negative channel "j" of the discharge for the formation of the conditionally negative resulting sum -S 3 j through the logical function f 1 (&) - And, in which A swift functional output link is a functional output link of a conditionally negative channel, while a positive channel includes logical functions f 1 (}) - OR, f 2 (}) - OR and a logical function f 3 (}) - OR, in which the first functional input the link is a functional input link of the channel for receiving the argument m j conditionally “j” of the discharge of the structure of the arguments of the multiplicable, characterized in that the logical channel f 1 ( & ) -I-NOT, f 1 (} is additionally introduced into the positive channel of the conditionally “j” discharge & ) -OR-NOT, f 2 ( & ) -AND NOT, f 3 ( & ) -AND NOT, f 4 (&) - NOT AND f 5 (&) - AND NOT, while the functional relationships of logical functions in the structure of the preliminary adder are made in accordance with a mathematical model of the form
3. The functional structure of the preliminary adder f Σ ([m j ] & [m j , 0]) parallel-series multiplier f Σ (Σ) with the logical differentiation procedure d / dn of the first intermediate sum [S 1 Σ ] f (}) - OR the structure of the active arguments of the multiplied [0, m j ] f (2 n ) and [m j , 0] f (2 n ), which is made in the form of a positive channel conditionally “j” discharge to form a positive resulting sum + S 3 j and conditionally negative channel «j» discharge for forming negative conventionally resultant sum -S 3 j, wherein the channel includes a positive logs RP G function f 1 (k) - and, f 2 (}) - OR, f 3 (}) - OR, f 4 (}) - OR and logical functions f 1 (}) - OR and f 1 (k) - NOT, in which the functional input link is the functional input link of the channel for receiving the argument m j conditionally “j” of the discharge of the structure of the arguments of the multiplicable, characterized in that the logical channel f 1 (} & ) OR is additionally introduced into the positive channel of the conditionally “j” discharge -NOT, f 2 (} & ) -OR-NOT, f 3 (} & ) -OR-NOT and f 1 ( & ) -AND NOT, and the logical function f 4 (} & ) is introduced into the conditionally negative channel - OR NOT, while the functional relationships of logical functions in the structure of pre two-adder are made in accordance with a mathematical model of the form
4. The functional structure of the preliminary adder f Σ ([m j ] & [m j , 0]) parallel-series multiplier f Σ (Σ) with the logical differentiation procedure d / dn of the first intermediate sum [S 1 Σ ] f (}) - OR the structure of the active arguments of the multiplied [0, m j ] f (2 n ) and [m j , 0] f (2 n ), which is made in the form of a positive channel conditionally “j” discharge to form a positive resulting sum + S 3 j and conditionally negative channel «j» discharge for forming negative conventionally resultant sum -S 3 j, wherein the channel includes a positive logs RP G function f 1 (k) - and, f 2 (}) - OR and logical function f 1 (}) - OR 1, and f (k) is not wherein the functional relationship is the functional input channel input coupled for receiving an argument m j conditionally “j” discharge of the structure of arguments of the multiplicable, characterized in that the logical channel f 1 (} & ) -OR-NOT, f 2 (} & ) -OR- NOT, f 3 are additionally introduced into the positive channel of the conditionally “j” discharge (} & ) -OR- NOT, f 4 (} & ) -OR- NOT, f 5 (} & ) -OR- NOT and f 6 (} & ) -OR- NOT, but a logical function is introduced into the conditionally negative channel f 7 (} & ) -OR-NOT, while the functional relationships of logical functions in st The structure of the preliminary adder is made in accordance with the mathematical model of the form
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
RU2010110851/08A RU2424549C1 (en) | 2010-03-22 | 2010-03-22 | 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) |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
RU2010110851/08A RU2424549C1 (en) | 2010-03-22 | 2010-03-22 | 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) |
Publications (1)
Publication Number | Publication Date |
---|---|
RU2424549C1 true RU2424549C1 (en) | 2011-07-20 |
Family
ID=44752655
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
RU2010110851/08A RU2424549C1 (en) | 2010-03-22 | 2010-03-22 | 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) |
Country Status (1)
Country | Link |
---|---|
RU (1) | RU2424549C1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
RU2586565C2 (en) * | 2011-12-20 | 2016-06-10 | Лев Петрович Петренко | FUNCTIONAL STRUCTURE OF PRE-ADDER f1(ΣCD) OF CONDITIONAL "j" BIT OF PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF ARGUMENTS OF PARTIAL PRODUCTS WITH STRUCTURES OF ARGUMENTS OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) IN POSITION FORMAT OF "ADDITIONAL CODE" AND FORMATION OF INTERMEDIATE SUM [1,2Sjh1]f(2n) IN POSITION FORMAT OF "ADDITIONAL CODE RU" (RUSSIAN LOGIC VERSIONS) |
-
2010
- 2010-03-22 RU RU2010110851/08A patent/RU2424549C1/en active
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
RU2586565C2 (en) * | 2011-12-20 | 2016-06-10 | Лев Петрович Петренко | FUNCTIONAL STRUCTURE OF PRE-ADDER f1(ΣCD) OF CONDITIONAL "j" BIT OF PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF ARGUMENTS OF PARTIAL PRODUCTS WITH STRUCTURES OF ARGUMENTS OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) IN POSITION FORMAT OF "ADDITIONAL CODE" AND FORMATION OF INTERMEDIATE SUM [1,2Sjh1]f(2n) IN POSITION FORMAT OF "ADDITIONAL CODE RU" (RUSSIAN LOGIC VERSIONS) |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1806652A3 (en) | Normalization and rounding of an arithmetic operation result | |
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) | |
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) | |
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) | |
RU2378682C2 (en) | INPUT STRUCTURE FOR PARALLEL ADDER IN POSITION-SIGN CODES f(+/-)(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) | |
RU2422881C1 (en) | FUNCTIONAL OUTPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) (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) | |
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) | |
RU2378681C2 (en) | FUNCTIONAL STRUCTURE FOR CORRECTING INTERMEDIATE SUM ±[S3i] ARGUMENTS FOR PARALLEL ADDER IN POSITION-SIGN CODES f(+/-) | |
RU2363978C2 (en) | Device for parallel boolean summation of analogue signals of terms equivalent to binary number system | |
RU2424550C1 (en) | FUNCTIONAL STRUCTURE OF SERIAL RIPPLE CARRIES fj+1(←←)+ and fj(←←)+ OF CONDITIONAL "I" 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) | |
RU2431886C1 (en) | FUNCTIONAL STRUCTURES FOR PARALLEL-SERIAL RIPPLE CARRY fj+1(←←)+ и fj(←←)+ IN CONDITIONAL "i" "FORMATION ZONE" 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) | |
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) | |
RU2445680C1 (en) | FUNCTIONAL STRUCTURE OF THROUGH CARRY f1(←←)i+1 AND f2(←←)i OF CONVENTIONALLY "i+1" AND CONVENTIONALLY "i" DIGITS OF "k" GROUP OF ARGUMENTS OF MULTIPLICAND [ni]f(2n) OF PRELIMINARY SUMMATOR fΣ([ni]&[ni,0]) OF PARALLEL SERIES MULTIPLIER 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) | |
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 | |
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) | |
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(+/-) | |
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) | |
RU2437142C2 (en) | METHOD OF PARALLEL-SERIAL MULTIPLICATION OF POSITIONAL ARGUMENTS OF ANALOGUE SIGNALS OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) | |
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) | |
RU2480815C1 (en) | FUNCTIONAL FIRST INPUT STRUCTURE OF CONDITIONAL "j" BIT OF ADDER fCD(Σ)RU WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆tΣ FOR ARGUMENTS OF TERMS ±[1,2nj]f(2n) AND ±[1,2mj]f(2n) OF "COMPLEMENTARY CODE RU" FORMAT WITH GENERATION OF INTERMEDIATE SUM (2Sj)1 d1/dn "LEVEL 2" AND (1Sj)1 d1/dn "LEVEL 1" OF FIRST TERM IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC) |