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

Abstract RU 2524562 C2

FIELD: physics, computer engineering.

SUBSTANCE: invention relates to computer engineering and can be used in designing arithmetic devices and performing arithmetic procedures for summation of positional arguments of terms ^±[^1,2n_j]f(2ⁿ) and ^±[^1,2m_j]f(2ⁿ). In one version, the adder is based on logic elements executing logic functions NOT and NAND.

EFFECT: reduced hardware costs.

5 cl

Similar patents RU2524562C2

Title	Year	Author	Number
FUNCTIONAL STRUCTURE FOR DIGITAL-TO-ANALOGUE CONVERSION OF POSITION-SIGN STRUCTURES OF ARGUMENTS OF ANALOGUE SIGNALS m&[m]f(2) OF "COMPLEMENTARY CODE RU" FORMAT TO ANALOGUE CONTROL SIGNAL Uf([m]) (VERSION OF RUSSIAN LOGIC)	2012	Petrenko Lev Petrovich	RU2480903C1
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
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 FOR CONVERSION OF POSITION-SYMBOLIC STRUCTURES OF [n]f(2) AND[n]f(2) ANALOG SIGNAL ARGUMENTS INTO [n]f(2) ANALOG SIGNAL ARGUMENTS STRUCTURE OF "ADDITIONAL CODE" USING ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1, 0,-1) (VERSIONS OF RUSSIAN LOGIC)	2010	Petrenko Lev Petrovich	RU2455760C2
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 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
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 GENERATING END-TO-END SUCCESSIVE SHIFT DURING LOGIC DIFFERENTIATION d/dn OF POSITIONAL ARGUMENTS [m]f(2) TAKING INTO ACCOUNT SIGN THEREOF IN ORDER TO CREATE POSITION-SIGN STRUCTURE -±[m]f(+/-) WITH MINIMUM NUMBER OF ARGUMENTS ACTIVE THEREIN (VERSIONS)	2009	Petrenko Lev Petrovich	RU2420869C1
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

RU 2 524 562 C2

Authors

Petrenko Lev Petrovich

Dates

2014-07-27—Published

2012-05-21—Filed