METHOD OF GENERATING TRANSFORMED ARGUMENTS OF ANALOGUE SIGNALS (0) AND (0); END-TO-END PARALLEL SHIFT f(←←) FOR TRANSFORMING POSITION-SIGN ARGUMENTS OF ANALOGUE SIGNALS ±[n]f(+/-) IN CONDITIONAL "i" MINIMISATION ZONE AND FUNCTIONAL STRUCTURE FOR IMPLEMENTING SAID METHOD (VERSIONS) Russian patent published in 2011 - IPC H03M7/04 G06F7/506 

Abstract RU 2420868 C1

FIELD: information technology.

SUBSTANCE: in one version, the functional structure is made from elements which execute AND, OR and NOT logic functions. The functional structure of the i-th minimisation zone is in form of two equivalent structures of logic functions - functional logic structure for parallel shift f1 (←←) for generating a transformed argument (0j)i and a functional logic structure f2(←←) for generating a transformed argument (0j+1→)i.

EFFECT: high speed process of transforming arguments when generating end-to-end parallel shift.

5 cl

Similar patents RU2420868C1

Title Year Author Number
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
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 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
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
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 «-/+»[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 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
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 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

RU 2 420 868 C1

Authors

Petrenko Lev Petrovich

Dates

2011-06-10Published

2009-10-02Filed