FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF PARALLEL-SERIAL END-TO-END ACTIVATION OF f(←«+1/-1») INACTIVE ARGUMENTS "0" OF SECOND INTERMEDIATE SUM [S ]f(2) IN PROCEDURE FOR SUMMATION OF POSITIONAL ARGUMENTS OF TERMS [n]f(2) AND [m]f(2) (VERSIONS) Russian patent published in 2012 - IPC G06F7/50 

Abstract RU 2450326 C2

FIELD: information technology.

SUBSTANCE: invention can be used when designing arithmetic units and performing arithmetic procedures of summation of positional arguments of analogue signals of terms [ni]f(2n) and [mi]f(2n) using the arithmetic axioms of the ternary number system f(+1,0,-1). In one version, the functional structure is realised using OR logic elements.

EFFECT: faster summation.

6 cl

Similar patents RU2450326C2

Title Year Author Number
FUNCTIONAL STRUCTURE OF ADDER f(Σ) OF ARBITRARY "i" BIT FOR LOGIC-DYNAMIC PROCESS OF SUMMATION OF POSITIONAL ARGUMENTS OF TERMS [n]f(2) and [m]f(2) USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS OF RUSSIAN LOGIC) 2010
  • Petrenko Lev Petrovich
RU2429522C1
FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF SERIAL END-TO-END ACTIVATION OF INACTIVE ARGUMENTS "0" OF SECOND INTERMEDIATE SUM +[S ]f(&) -AND IN ADDER f(Σ) WITH TRANSFORMATION OF POSITIONAL ARGUMENTS OF TERMS [n]f(2) AND [m]f(2) (VERSIONS) 2010
  • Petrenko Lev Petrovich
RU2450325C2
METHOD OF GENERATING LOGIC-DYNAMIC PROCESS OF CONVERTING CONDITIONALLY MINIMISED STRUCTURES OF ARGUMENTS OF ANALOGUE SIGNALS OF TERMS [n]f(+/-) AND [m]f(+/-) IN FUNCTIONAL ADDER STRUCTURE f(Σ) WITHOUT RIPPLE CARRY f(←←) AND PROCESS CYCLE ∆t → 5∙f(&)-AND FIVE CONDITIONAL LOGIC FUNCTIONS f(&)-AND, REALISED USING PROCEDURE FOR SIMULTANEOUS CONVERSION OF ARGUMENTS OF TERMS THROUGH ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND FUNCTIONAL STRUCTURES FOR REALISATION THEREOF (VERSION OF RUSSIAN LOGIC) 2013
  • Petrenko Lev Petrovich
RU2523876C1
FUNCTIONAL STRUCTURE OF A TRANSFORMER OF PRELIMINARY FA f [n]&[m](2) OF PARALLEL-SERIAL MULTIPLICATOR f (Σ) CONDITIONALLY, OF "i" DIGIT TO SUM UP OF POSITIONAL ADDITIVE OF SUMS [n]f(2) AND [m]f(2) OF PARTIAL PRODUCTS USING ARITHMETICAL AXIOMS OF TERNARY NOTATION f(+1, 0, -1) WITH THE FORMATION OF A RESULTING SUM [S]f(2) IN A POSITIONAL FORMAT 2010
  • Petrenko Lev Petrovich
RU2443008C1
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 OF ADDER f(Σ) OF CONDITIONAL "k" BIT OF PARALLEL-SERIAL MULTIPLIER f(Σ), IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF INPUT STRUCTURES OF ARGUMENTS OF TERMS [S ]f(2) AND [S ]f(2) OF "COMPLEMENTARY CODE RU" POSITIONAL FORMAT BY APPLYING ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND LOGIC DIFFERENTIATION d/dn → f(←↓) OF ARGUMENTS IN COMBINED STRUCTURE THEREOF (VERSIONS OF RUSSIAN LOGIC) 2011
  • Petrenko Lev Petrovich
RU2480817C1
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
FUNCTIONAL DESIGN OF PARALLEL POSITION-SIGN ADDER OF ARGUMENTS OF TERMS OF TWO FORMATS OF BINARY NUMBER SYSTEM f(2) AND POSITION-SIGN NUMBER SYSTEM f(+/-) (VERSIONS) 2008
  • Petrenko Lev Petrovich
RU2390050C2
METHOD OF PARALLEL-SERIAL MULTIPLICATION OF POSITIONAL ARGUMENTS OF ANALOGUE SIGNALS OF MULTIPLICAND [m]f(2) AND MULTIPLIER [n]f(2) 2010
  • Petrenko Lev Petrovich
RU2437142C2
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) 2012
  • Petrenko Lev Petrovich
RU2484518C1

RU 2 450 326 C2

Authors

Petrenko Lev Nikolaevich

Dates

2012-05-10Published

2010-05-25Filed