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) Russian patent published in 2013 - IPC G06F7/527 

Abstract RU 2481614 C2

FIELD: information technologies.

SUBSTANCE: invention may be used to build arithmetic devices for performance of arithmetic operations of multiplication of multiplicand arguments ±[mj]f(2n) and multiplier arguments ±[ni]f(2n) - "Additional code". In one of versions the structure is realised using logical elements CFU, OR-CFU.

EFFECT: increased efficiency of a process of transformation of arguments of partial products.

4 cl

Similar patents RU2481614C2

Title Year Author Number
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 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 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 OUTPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER f(Σ) IN POSITION FORMAT OF MULTIPLICAND [m]f(2) AND MULTIPLIER [n]f(2) (VERSIONS) 2010
  • Petrenko Lev Petrovich
RU2422881C1
METHOD FOR LOGIC-DYNAMIC PROCESS OF GENERATING ANALOGUE INFORMATION SIGNALS OF PARTIAL PRODUCTS OF ARGUMENTS OF MULTIPLIERS [n] AND [m] - "COMPLEMENTARY CODE" OF TRUNCATED PYRAMIDAL STRUCTURE OF MULTIPLIER f(Σ) FOR SUBSEQUENT ACCUMULATIVE SUMMATION IN ADDER f(Σ) AND FUNCTIONAL DESIGN FOR REALISATION THEREOF (VERSIONS OF RUSSIAN LOGIC) 2011
  • Petrenko Lev Petrovich
RU2475813C2
FUNCTIONAL STRUCTURE OF PARALLEL-SERIES MULTIPLIER f(Σ) IN POSITION FORMAT OF MULTIPLICAND [m]f(2) AND MULTIPLIER [n]f(2) 2010
  • Petrenko Lev Petrovich
RU2439660C2
METHOD OF CONVERTING [m]f(+/-)→Uf([m]) MINIMISED STRUCTURE OF POSITION-SIGN ARGUMENTS [m]f(+/-) TERNARY NUMBER SYSTEM f(+1,0,-1) INTO ANALOGUE VOLTAGE ARGUMENT Uf([m]) (VERSION OF RUSSIAN LOGIC) 2012
  • Petrenko Lev Petrovich
RU2501160C1
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
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

RU 2 481 614 C2

Authors

Petrenko Lev Petrovich

Dates

2013-05-10Published

2011-06-08Filed