FUNCTIONAL STRUCTURE OF SECOND LEAST SIGNIFICANT BIT ACTIVATING RESULTANT ARGUMENT (S)f(2) "LEVEL 2" AND (S)f(2) "LEVEL 1" OF ADDDER f(Σ) FOR ARGUMENTS OF TERMS [n]f(2) AND [m]f(2) OF "COMPLEMENTARY CODE RU" FORMAT (VERSIONS OF RUSSIAN LOGIC) Russian patent published in 2013 - IPC G06F7/50 

Abstract RU 2484518 C1

FIELD: information technology.

SUBSTANCE: invention can be used when designing arithmetic units and performing arithmetic procedures for summation of positional arguments of terms. In one version of the invention, the adder is constructed from logic elements NOT, OR, AND, NAND, NOR.

EFFECT: faster operation.

4 cl

Similar patents RU2484518C1

Title Year Author Number
FUNCTIONAL OUTPUT STRUCTURE OF CONDITIONAL BIT "j" OF ADDER f(Σ) WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆t FOR ARGUMENTS OF TERMS OF INTERMEDIATE ARGUMENTS (S)  "LEVEL 2" AND (S)  "LEVEL 1" OF SECOND TERM AND INTERMEDIATE ARGUMENTS (S)  "LEVEL 2" AND (S)  "LEVEL 1" OF FIRST TERM OF "COMPLENTARY CODE RU" FORMAT WITH GENERATION OF RESULTANT ARGUMENTS OF SUM (S)f(2) "LEVEL 2" AND (S)f(2) "LEVEL 1" IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC) 2012
  • Petrenko Lev Petrovich
RU2480814C1
FUNCTIONAL FIRST INPUT STRUCTURE OF CONDITIONAL "j" BIT OF ADDER f(Σ) WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆t FOR ARGUMENTS OF TERMS [n]f(2) AND [m]f(2) OF "COMPLEMENTARY CODE RU" FORMAT WITH GENERATION OF INTERMEDIATE SUM (S)  "LEVEL 2" AND (S)  "LEVEL 1" OF FIRST TERM IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC) 2012
  • Petrenko Lev Petrovich
RU2480815C1
FUNCTIONAL SECOND INPUT STRUCTURE OF CONDITIONAL "j" BIT OF ADDER f(Σ) WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆t FOR ARGUMENTS OF TERMS [n]f(2) И [m]f(2) OF "COMPLEMENTARY CODE RU" FORMAT WITH GENERATION OF INTERMEDIATE SUM [S]  OF SECOND TERM IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC) 2012
  • Petrenko Lev Petrovich
RU2480816C1
FUNCTIONAL STRUCTURE OF LEAST SIGNIFICANT BIT OF ADDER f(Σ) FOR ARGUMENTS OF TERMS [n]f(2) AND [m]f(2) OF "COMPLEMENTARY CODE RU" FORMAT (VERSIONS OF RUSSIAN LOGIC) 2012
  • Petrenko Lev Petrovich
RU2524562C2
f3 ADDER FUNCTIONAL STRUCTURE (Σ) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [S ]f(2) AND [S ]f(2) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d/dn → f(←↓) OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC) 2011
  • Petrenko Lev Petrovich
RU2517245C9
METHOD OF CONVERTING STRUCTURE OF ARGUMENTS OF ANALOGUE LOGIC VOLTAGES «-/+»[m]f(+/-) - "COMPLEMENTARY CODE" TO POSITION-SIGN STRUCTURE OF MINIMISED ARGUMENTS OF LOGIC VOLTAGES [m]f(+/-) AND FUNCTIONAL STRUCTURE FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC) 2012
  • Petrenko Lev Petrovich
RU2502184C1
METHOD OF GENERATING ARGUMENTS OF ANALOGUE SIGNALS OF PARTIAL PRODUCTS [n]&[m]f(h) OF ARGUMENTS OF MULTIPLIERS [m]f(2) И [n]f(2) - "COMPLEMENTARY CODE" IN PYRAMIDAL MULTIPLIER f(Σ) FOR SUCCESSIVE LOGIC DECRYPTION f(CD↓) AND GENERATING RESULTANT SUM IN FORMAT [S]f(2) - "COMPLEMENTARY CODE" AND FUNCTIONAL STRUCTURE FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC) 2011
  • Petrenko Lev Petrovich
RU2473955C1
FUNCTIONAL STRUCTURE OF PRE-ADDER f(Σ) OF CONDITIONAL "j" BIT OF PARALLEL-SERIAL MULTIPLIER f(Σ) IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF ARGUMENTS OF PARTIAL PRODUCTS WITH STRUCTURES OF ARGUMENTS OF MULTIPLICAND [m]f(2) AND MULTIPLIER [n]f(2) IN POSITION FORMAT OF "ADDITIONAL CODE" AND FORMATION OF INTERMEDIATE SUM [Sj]f(2) IN POSITION FORMAT OF "ADDITIONAL CODE RU" (RUSSIAN LOGIC VERSIONS) 2011
  • Petrenko Lev Petrovich
RU2586565C2
FUNCTIONAL STRUCTURE FOR PRE-ADDER OF PARALLEL-SERIAL MULTIPLIER f(Σ) WITH MULTIPLICAND ARGUMENTS [m]f(2) AND MULTIPLIER ARGUMENTS [n]f(2) IN POSITION FORMAT (VERSIONS) 2010
  • Petrenko Lev Petrovich
RU2422879C1
METHOD OF GENERATING ORDERED SEQUENCES OF ANALOGUE SIGNALS OF PARTIAL PRODUCTS [n]&[m]f(h) OF ARGUMENTS OF MULTIPLIERS [n]f(2) AND [m]f(2) - "COMPLEMENTARY CODE" IN PYRAMIDAL MULTIPLIER f(↓Σ) FOR SUCCESSIVE LOGIC DECRYPTION f(CD↓) AND GENERATING RESULTANT SUM IN FORMAT [S]f(2) - "COMPLEMENTARY CODE" AND FUNCTIONAL STRUCTURE FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC) 2011
  • Petrenko Lev Petrovich
RU2463645C1

RU 2 484 518 C1

Authors

Petrenko Lev Petrovich

Dates

2013-06-10Published

2012-05-21Filed