METHOD OF TRANSFORMING POSITION-SIGN ARGUMENTS ±[n]f(+/-) INTO STRUCTURE OF ARGUMENTS ±[n]f(+/-) WITH MINIMISED NUMBER OF ACTIVE ARGUMENTS AND FUNCTIONAL STRUCTURE FOR IMPLEMENTING SAID METHOD (RUSSIAN LOGIC VERSIONS) Russian patent published in 2011 - IPC G06G7/18

Abstract RU 2417432 C1

FIELD: information technology.

SUBSTANCE: in one version, the functional structure is implemented using elements which execute logic functions AND, OR and NOT. Each j-th order of the functional structure is in form of a positive and conditionally negative channel for converting input arguments n_j of the j-th order, n_j-1 of the (j-1)-th; in the positive channel, the resultant arguments are created through logic functions AND1, AND2, AND3, logic function NOT1 and logic function OR1; in the conditionally negative channel, the resultant arguments are created through logic functions AND4, AND5, AND6, logic function NOT2 and logic function OR2.

EFFECT: faster execution of arithmetic operations.

5 cl

Similar patents RU2417432C1

Title	Year	Author	Number
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 PROCEDURE OF LOGICAL DIFFERENTIATION OF d/dn POSITIONAL ARGUMENTS [m]f(2) WITH ACCOUNT OF THEIR SIGN m(±) TO FORM POSITIONAL-SIGN STRUCTURE ±[m]f(+/-) WITH MINIMISED NUMBER OF ACTIVE ARGUMENTS (VERSIONS)	2009	Petrenko Lev Petrovich	RU2428738C2
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
FUNCTIONAL STRUCTURE OF SELECTIVE LOGICAL DIFFERENTIATION OF ARGUMENTS OF BINARY SYSTEM FORMAT f(2)	2008	Petrenko Lev Petrovich	RU2373640C1
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
METHOD OF GENERATING IN "k" "MINIMISATION ZONE" RESULTANT ARGUMENT m OF END-TO-END ACTIVATION f( 00) → m FOR CONVERSION IN ACCORDANCE WITH ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) STRUCTURES OF ARGUMENTS OF ANALOGUE SIGNALS "«-/+»[m]f(+/-) - -"COMPLEMENTARY CODE" INTO STRUCTURE OF CONDITIONALLY MINIMISED POSITION-SIGN ARGUMENTS OF ANALOGUE SIGNALS [m]f(+/-) AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)	2012	Petrenko Lev Petrovich	RU2503124C1
METHOD FOR END-TO-END ACTIVATION OF f( 11)min → m INACTIVE ARGUMENTS "±0" → "+1/-1" OF ANALOGUE SIGNALS IN "MINIMISATION ZONES" OF "-/+" [m]f(+/-) - "COMPLEMENTARY CODE" STRUCTURE ACCORDING TO ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) WHEN GENERATING ARGUMENTS OF ANALOGUE SIGNALS IN POSITION-SIGN CONDITIONALLY MINIMISED STRUCTURE THEREOF [m]f(+/-) (VERSIONS OF RUSSIAN LOGIC)	2012	Petrenko Lev Petrovich	RU2507682C2
METHOD OF ACTIVATING ARGUMENT (0→) OF ANALOGUE SIGNAL OF CONDITIONAL «j+1» BIT AND ARGUMENT (0→) OF ANALOGUE SIGNAL OF CONDITIONAL «j» BIT OF SERIAL RIPPLE CARRY f(←←) FOR CONVERTING STRUCTURE OF POSITIONAL-SIGN ARGUMENTS [n]f(+/-) OF ANALOGUE SIGNALS IN CONDITIONAL «i» «MINIMISATION ZONE» INTO MINIMISED POSITIONAL SIGN STRUCTURE [n]f(+/-) OF ANALOGUE SIGNALS AND FUNCTIONAL STRUCTURE FOR IMPLEMENTATION THEREOF (VERSIONS OF RUSSIAN LOGIC)	2009	Petrenko Lev Petrovich	RU2425441C2
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 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 417 432 C1

Authors

Petrenko Lev Petrovich

Dates

2011-04-27—Published

2009-08-24—Filed