FUNCTIONAL DESIGN OF ADDER f(Σ) OF "k" CONDITIONALLY MOST SIGNIFICANT BITS OF PARALLEL-SERIAL MULTIPLIER f(Σ), IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF ARGUMENTS OF TERMS [S ] AND [S ] "COMPLEMENTARY CODE RU" BY ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND LOGIC DIFFERENTIATION d/dn → f(←↓) (VERSIONS OF RUSSIAN LOGIC) Russian patent published in 2013 - IPC G06F7/505 

Abstract RU 2476922 C1

FIELD: information technology.

SUBSTANCE: one version, the functional design is realised using logic elements AND, OR.

EFFECT: faster operation.

2 cl

Similar patents RU2476922C1

Title Year Author Number
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
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
METHOD TO GENERATE ARGUMENTS OF ANALOG SIGNALS OF PARTIAL PRODUCTS [n]&[m]f(h) ARGUMENTS OF MULTIPLICAND [m]f(2) AND ARGUMENTS OF MULTIPLIER [n]f(2) - "ADDITIONAL CODE" IN PYRAMIDAL MULTIPLIER f(↓Σ) FOR SUBSEQUENT LOGICAL DECODING f(CD↓) AND GENERATION OF RESULTING SUM IN FORMAT [S]f(2) -"ADDITIONAL CODE" AND FUNCTIONAL STRUCTURE FOR ITS REALISATION (VERSIONS OF RUSSIAN LOGICS) 2011
  • Petrenko Lev Petrovich
RU2481614C2
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
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 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
FUNCTIONAL STRUCTURE OF PRE-ADDER f([m]&[m,0]) OF PARALLEL-SERIES MULTIPLIER f(Σ) WITH PROCEDURE FOR LOGIC DIFFERENTIATION d/dn OF FIRST INTERMEDIATE SUM [S ]f(})- OR STRUCTURE OF ACTIVE ARGUMENTS OF MULTIPLICAND [0,m]f(2) and [m,0]f(2) (VERSIONS) 2010
  • Petrenko Lev Petrovich
RU2424549C1
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 STRUCTURE OF SELECTIVE LOGICAL DIFFERENTIATION OF ARGUMENTS OF BINARY SYSTEM FORMAT f(2) 2008
  • Petrenko Lev Petrovich
RU2373640C1
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

RU 2 476 922 C1

Authors

Petrenko Lev Petrovich

Dates

2013-02-27Published

2012-02-13Filed