FUNCTIONAL INPUT STRUCTURE WITH LOGIC DIFFERENTIATION PROCEDURE d/dn OF FIRST INTERMEDIATE SUM OF MINIMISED ARGUMENTS OF TERMS ±[n]f(+/-) AND ±[m]f(+/-) (VERSIONS OF RUSSIAN LOGIC) Russian patent published in 2011 - IPC G06F7/505

Abstract RU 2427028 C2

FIELD: information technology.

SUBSTANCE: in one version of the invention, the i-th bit of the functional structure of the adder is in form of positive and conditionally negative summation channels. Each channel has elements which execute logic functions AND, OR, NOR, NAND and NOT.

EFFECT: faster process of converting arguments.

4 cl

Similar patents RU2427028C2

Title	Year	Author	Number
FUNCTIONAL INPUT STRUCTURE OF ADDER WITH SELECTIVE LOGIC DIFFERENTIATION d*/dn OF FIRST INTERMEDIATE SUM ±[S ] OF MINIMISED ARGUMENTS OF TERMS ±[n]f(+/-) and ±[m]f(+/-) (VERSIONS)	2009	Petrenko Lev Petrovich	RU2424548C1
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
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 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 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
METHOD OF CONVERTING «-/+»[m]f(+/-) → [m]f(+/-) STRUCTURE OF ARGUMENTS OF ANALOGUE LOGIC SIGNALS «-/+»[m]f(+/-) - COMPLEMENTARY CODE" INTO CONDITIONALLY MINIMISED POSITION-SIGN STRUCTURE OF ARGUMENTS -[m]f(+/-) OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)	2012	Petrenko Lev Petrovich	RU2503123C1
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 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
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 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 427 028 C2

Authors

Petrenko Lev Petrovich

Dates

2011-08-20—Published

2009-11-10—Filed