RU2517245C9 - f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC) - Google Patents

f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC) Download PDF

Info

Publication number
RU2517245C9
RU2517245C9 RU2011151806/08A RU2011151806A RU2517245C9 RU 2517245 C9 RU2517245 C9 RU 2517245C9 RU 2011151806/08 A RU2011151806/08 A RU 2011151806/08A RU 2011151806 A RU2011151806 A RU 2011151806A RU 2517245 C9 RU2517245 C9 RU 2517245C9
Authority
RU
Russia
Prior art keywords
logical
level
functional
arguments
active
Prior art date
Application number
RU2011151806/08A
Other languages
Russian (ru)
Other versions
RU2011151806A (en
RU2517245C2 (en
Inventor
Лев Петрович Петренко
Original Assignee
Лев Петрович Петренко
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Лев Петрович Петренко filed Critical Лев Петрович Петренко
Priority to RU2011151806/08A priority Critical patent/RU2517245C9/en
Publication of RU2011151806A publication Critical patent/RU2011151806A/en
Application granted granted Critical
Publication of RU2517245C2 publication Critical patent/RU2517245C2/en
Publication of RU2517245C9 publication Critical patent/RU2517245C9/en

Links

Landscapes

  • Organic Low-Molecular-Weight Compounds And Preparation Thereof (AREA)
  • Character Discrimination (AREA)
  • Devices For Executing Special Programs (AREA)

Abstract

FIELD: physics, computation hardware.
SUBSTANCE: set of inventions relates to computers and can be used for construction of arithmetic devices and execution of arithmetic procedures of adding of position arguments of analogue signals added with application of arithmetic axioms of ternary notation f(+1,0,-1). In compliance with one of versions, functional structure is constructed with application of logical elements AND, OR, NO.
EFFECT: higher speed.
4 cl

Description

Текст описания приведен в факсимильном виде.

Figure 00000001
Figure 00000002
Figure 00000003
Figure 00000004
Figure 00000005
Figure 00000006
Figure 00000007
Figure 00000008
Figure 00000009
Figure 00000010
Figure 00000011
Figure 00000012
Figure 00000013
Figure 00000014
Figure 00000015
Figure 00000016
Figure 00000017
Figure 00000018
Figure 00000019
Figure 00000020
Figure 00000021
Figure 00000022
Figure 00000023
Figure 00000024
Figure 00000025
Figure 00000026
Figure 00000027
Figure 00000028
Figure 00000029
Figure 00000030
Figure 00000031
Figure 00000032
Figure 00000033
Figure 00000034
Figure 00000035
Figure 00000036
Figure 00000037
Figure 00000038
Figure 00000039
Figure 00000040
Figure 00000041
Figure 00000042
Figure 00000043
Figure 00000044
Figure 00000045
Figure 00000046
Figure 00000047
Figure 00000048
Figure 00000049
Figure 00000050
Figure 00000051
Figure 00000052
Figure 00000053
Figure 00000054
Figure 00000055
Figure 00000056
Figure 00000057
Figure 00000058
Figure 00000059
Figure 00000060
Figure 00000061
Figure 00000062
Figure 00000063
Figure 00000064
Figure 00000065
Figure 00000066
Figure 00000067
Figure 00000068
Figure 00000069
Figure 00000070
Figure 00000071
Figure 00000072
Figure 00000073
Figure 00000074
Figure 00000075
Figure 00000076
Figure 00000077
Figure 00000078
Figure 00000079
Figure 00000080
Figure 00000081
Figure 00000082
Figure 00000083
Figure 00000084
Figure 00000085
Figure 00000086
Figure 00000087
Figure 00000088
Figure 00000089
Figure 00000090
Figure 00000091
Figure 00000092
Figure 00000093
Figure 00000094
Figure 00000095
Figure 00000096
Figure 00000097
Figure 00000098
Figure 00000099
Figure 00000100
Figure 00000101
Figure 00000102
Figure 00000103
Figure 00000104
Figure 00000105
Figure 00000106
Figure 00000107
Figure 00000108
Figure 00000109
Figure 00000110
Figure 00000111
Figure 00000112
Figure 00000113
Figure 00000114
Figure 00000115
Figure 00000116
Figure 00000117
Figure 00000118
Figure 00000119
Figure 00000120
Figure 00000121
Figure 00000122
Figure 00000123
Figure 00000124
Figure 00000125
Figure 00000126
Figure 00000127
Figure 00000128
Figure 00000129
Figure 00000130
Figure 00000131
Figure 00000132
Figure 00000133
Figure 00000134
Figure 00000135
Figure 00000136
Figure 00000137
Figure 00000138
Figure 00000139
Figure 00000140
Figure 00000141
Figure 00000142
Figure 00000143
Figure 00000144
Figure 00000145
Figure 00000146
Figure 00000147
Figure 00000148
Figure 00000149
Figure 00000150
Figure 00000151
Figure 00000152
Figure 00000153
Figure 00000154
Figure 00000155
Figure 00000156
Figure 00000157
Figure 00000158
Figure 00000159
Figure 00000160
Figure 00000161
Figure 00000162
Figure 00000163
Figure 00000164
Figure 00000165
Figure 00000166
Figure 00000167
Figure 00000168
Figure 00000169
Figure 00000170
Figure 00000171
Figure 00000172
Figure 00000173
Figure 00000174
Figure 00000175
Figure 00000176
Figure 00000177
Figure 00000178
Figure 00000179
Figure 00000180
Figure 00000181
Figure 00000182
Figure 00000183
Figure 00000184
Figure 00000185
Figure 00000186
Figure 00000187
Figure 00000188
Figure 00000189
Figure 00000190
Figure 00000191
Figure 00000192
Figure 00000193
Figure 00000194
Figure 00000195
Figure 00000196
Figure 00000197
Figure 00000198
Figure 00000199
Figure 00000200
Figure 00000201
Figure 00000202
Figure 00000203
Figure 00000204
Figure 00000205
Figure 00000206
Figure 00000207
Figure 00000208
Figure 00000209
Figure 00000210
Figure 00000211
Figure 00000212
Figure 00000213
Figure 00000214
Figure 00000215
Figure 00000216
Figure 00000217
Figure 00000218
Figure 00000219
Figure 00000220
Figure 00000221
Figure 00000222
Figure 00000223
Figure 00000224
Figure 00000225
Figure 00000226
Figure 00000227
Figure 00000228
Figure 00000229
Figure 00000230
Figure 00000231
Figure 00000232
The description text is given in facsimile form.
Figure 00000001
Figure 00000002
Figure 00000003
Figure 00000004
Figure 00000005
Figure 00000006
Figure 00000007
Figure 00000008
Figure 00000009
Figure 00000010
Figure 00000011
Figure 00000012
Figure 00000013
Figure 00000014
Figure 00000015
Figure 00000016
Figure 00000017
Figure 00000018
Figure 00000019
Figure 00000020
Figure 00000021
Figure 00000022
Figure 00000023
Figure 00000024
Figure 00000025
Figure 00000026
Figure 00000027
Figure 00000028
Figure 00000029
Figure 00000030
Figure 00000031
Figure 00000032
Figure 00000033
Figure 00000034
Figure 00000035
Figure 00000036
Figure 00000037
Figure 00000038
Figure 00000039
Figure 00000040
Figure 00000041
Figure 00000042
Figure 00000043
Figure 00000044
Figure 00000045
Figure 00000046
Figure 00000047
Figure 00000048
Figure 00000049
Figure 00000050
Figure 00000051
Figure 00000052
Figure 00000053
Figure 00000054
Figure 00000055
Figure 00000056
Figure 00000057
Figure 00000058
Figure 00000059
Figure 00000060
Figure 00000061
Figure 00000062
Figure 00000063
Figure 00000064
Figure 00000065
Figure 00000066
Figure 00000067
Figure 00000068
Figure 00000069
Figure 00000070
Figure 00000071
Figure 00000072
Figure 00000073
Figure 00000074
Figure 00000075
Figure 00000076
Figure 00000077
Figure 00000078
Figure 00000079
Figure 00000080
Figure 00000081
Figure 00000082
Figure 00000083
Figure 00000084
Figure 00000085
Figure 00000086
Figure 00000087
Figure 00000088
Figure 00000089
Figure 00000090
Figure 00000091
Figure 00000092
Figure 00000093
Figure 00000094
Figure 00000095
Figure 00000096
Figure 00000097
Figure 00000098
Figure 00000099
Figure 00000100
Figure 00000101
Figure 00000102
Figure 00000103
Figure 00000104
Figure 00000105
Figure 00000106
Figure 00000107
Figure 00000108
Figure 00000109
Figure 00000110
Figure 00000111
Figure 00000112
Figure 00000113
Figure 00000114
Figure 00000115
Figure 00000116
Figure 00000117
Figure 00000118
Figure 00000119
Figure 00000120
Figure 00000121
Figure 00000122
Figure 00000123
Figure 00000124
Figure 00000125
Figure 00000126
Figure 00000127
Figure 00000128
Figure 00000129
Figure 00000130
Figure 00000131
Figure 00000132
Figure 00000133
Figure 00000134
Figure 00000135
Figure 00000136
Figure 00000137
Figure 00000138
Figure 00000139
Figure 00000140
Figure 00000141
Figure 00000142
Figure 00000143
Figure 00000144
Figure 00000145
Figure 00000146
Figure 00000147
Figure 00000148
Figure 00000149
Figure 00000150
Figure 00000151
Figure 00000152
Figure 00000153
Figure 00000154
Figure 00000155
Figure 00000156
Figure 00000157
Figure 00000158
Figure 00000159
Figure 00000160
Figure 00000161
Figure 00000162
Figure 00000163
Figure 00000164
Figure 00000165
Figure 00000166
Figure 00000167
Figure 00000168
Figure 00000169
Figure 00000170
Figure 00000171
Figure 00000172
Figure 00000173
Figure 00000174
Figure 00000175
Figure 00000176
Figure 00000177
Figure 00000178
Figure 00000179
Figure 00000180
Figure 00000181
Figure 00000182
Figure 00000183
Figure 00000184
Figure 00000185
Figure 00000186
Figure 00000187
Figure 00000188
Figure 00000189
Figure 00000190
Figure 00000191
Figure 00000192
Figure 00000193
Figure 00000194
Figure 00000195
Figure 00000196
Figure 00000197
Figure 00000198
Figure 00000199
Figure 00000200
Figure 00000201
Figure 00000202
Figure 00000203
Figure 00000204
Figure 00000205
Figure 00000206
Figure 00000207
Figure 00000208
Figure 00000209
Figure 00000210
Figure 00000211
Figure 00000212
Figure 00000213
Figure 00000214
Figure 00000215
Figure 00000216
Figure 00000217
Figure 00000218
Figure 00000219
Figure 00000220
Figure 00000221
Figure 00000222
Figure 00000223
Figure 00000224
Figure 00000225
Figure 00000226
Figure 00000227
Figure 00000228
Figure 00000229
Figure 00000230
Figure 00000231
Figure 00000232

Claims (4)

1. Функциональная структура сумматора f3(Σ CD) условно «g» разряда, реализующая процедуру «дешифрирования» аргументов слагаемых [1,2 S g h1]f(2n) и [1,2 S g h2]f(2n) позиционного формата «Дополнительный код RU» посредством арифметических аксиом троичной системы счисления f(+1,0,-1) и двойного логического дифференцирования d1,2/dn → f1,2(+←↓-)d/dn активных аргументов «Уровня 2» и удаления активных логических нулей «+1»«-1» → «0» в «Уровне 1», включающая логическую функцию f1(})-ИЛИ, в которой функциональные входные связи являются функциональными входными связями структуры, а функциональная выходная связь является функциональной входной связью логической функции f1(&)-И, а также включает логическую функцию f7(&)-И, в которой функциональные входные связи являются функциональными входными связями структуры, а функциональная выходная связь является функциональной входной связью логической функции f2( & )-НЕ, отличающаяся тем, что в структуру условно «g» разряда для активизации результирующего аргумента (1 S g)CD «Уровня 1» введены логические функции f1( & )-НЕ, f3( & )-НЕ, f2(})-ИЛИ, f3(})-ИЛИ → (f3.1(})-ИЛИ и f3.2(})-ИЛИ), f4(})-ИЛИ и f5(})-ИЛИ, а также логические функции f2(&)-И, f3(&)-И, f4(&)-И, f5(&)-И, f6(&)-И, f8(&)-И, f9(&)-И, f10(&)-И, f11(&)-И и f12(&)-И, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000233

а для активизации результирующего аргумента (2 S g)CD «Уровня 2» «Дополнительного кода RU» в условно «g» разряд введены логические функции f4( & )-НЕ, f6(})-ИЛИ, f7(})-ИЛИ, f8(})-ИЛИ, f9(})-ИЛИ → (f9.1(})-ИЛИ и f9.2(})-ИЛИ), f10(})-ИЛИ, f11(})-ИЛИ и f12(})-ИЛИ, а также введены логические функции f13(&)-И, f14(&)-И, f15(&)-И, f16(&)-И, f17(&)-И и f18(&)-И, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000234

где
Figure 00000235
- логическая функция f1(&)-И;
Figure 00000236
- логическая функция f1(})-ИЛИ;
= & 1 = - логическая функция f1( & )-НЕ.1. The functional structure of the adder f3(Σ CD) conditionally "G" category, implementing the procedure of "decoding" the arguments of the terms [1,2 S g h1] f (2n) and [1,2 S g h2] f (2n) positional format “Additional codeRU" through arithmetic axioms of the ternary number system f (+ 1,0, -1) and double logical differentiation d1,2/ dn → f1,2(+← ↓-)d / dn active arguments "Level 2" and the removal of active logical zeros “+1” “- 1” → “0” in “Level 1”, including the logical function fone(}) -OR, in which the functional input links are the functional input links of the structure, and the functional output link is the functional input link of the logical function fone(&) - And, and also includes the logical function f7(&) - And, in which the functional input links are the functional input links of the structure, and the functional output link is the functional input link of the logical function f2( & ) -NE, characterized in that the structure of the conditionally "g" discharge to activate the resulting argument (one S g)CD “Level 1” introduced logical functions fone( & ) -NOT f3( & ) -NOT f2(}) -OR, f3(}) -OR → (f3.1(}) -OR and f3.2(}) -OR), ffour(}) -OR and f5(}) -OR, as well as logical functions f2(&) - And, f3(&) - And, ffour(&) - And, f5(&) - And, f6(&) - And, f8(&) - And, f9(&) - And, f10(&) - And, feleven(&) - And and f12(&) - And, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000233

and to activate the resulting argument (2 S g)CD “Level 2” of the “Additional CodeRU"In the conditionally" g "category introduced logical functions ffour( & ) -NOT f6(}) -OR, f7(}) -OR, f8(}) -OR, f9(}) -OR → (f9.1(}) -OR and f9.2(}) -OR), f10(}) -OR, feleven(}) -OR and f12(}) -OR, and also introduced the logical functions f13(&) - And, ffourteen(&) - And, ffifteen(&) - And, f16(&) - And, f17(&) - And and feighteen(&) - And, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000234

Where
Figure 00000235
 is a logical function fone(&)-AND;
Figure 00000236
 is a logical function fone(})-OR;
= & one = - logical function fone( & )-NOT. 2. Функциональная структура сумматора f3(Σ CD) условно «g» разряда, реализующая процедуру «дешифрирования» аргументов слагаемых [1,2 S g h1]f(2n) и [1,2 S g h2]f(2n) позиционного формата «Дополнительный код RU» посредством арифметических аксиом троичной системы счисления f(+1,0,-1) и двойного логического дифференцирования d1,2/dn → f1,2(+←↓-)d/dn активных аргументов «Уровня 2» и удаления активных логических нулей «+1»«-1» → «0» в «Уровне 1», включающая логическую функцию f1(})-ИЛИ, в которой функциональные входные связи являются функциональными входными связями структуры, а также включает логическую функцию f1(&)-И и логическую функцию f2(&)-И, в которой функциональные входные связи являются функциональными входными связями структуры, а функциональная выходная связь является функциональной входной связью логической функции f3( & )-НЕ, отличающаяся тем, что в структуру условно «g» разряда для активизации результирующего аргумента (1 S g)CD «Уровня 1» введены логические функции f1( & )-НЕ, f2( & )-НЕ, f4( & )-НЕ, f1(&)-И-НЕ, f2(&)-И-НЕ, f3(&)-И-НЕ, f4(&)-И-НЕ, f5(&)-И-НЕ, f6(&)-И-НЕ, f7(&)-И-НЕ, f8(&)-И-НЕ → (f8.1(&)-И-НЕ и f8.2(&)-И-НЕ), f9(&)-И-НЕ, f10(&)-И-НЕ, f11(&)-И-НЕ, f12(&)-И-НЕ, f13(&)-И-НЕ и f14(&)-И-НЕ, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000237

где
Figure 00000238
- логическая функция f1(&)-И-НЕ,
а для активизации результирующего аргумента (2 S g)CD «Уровня 2» «Дополнительного кода RU» в условно «g» разряд введены логические функции f3(&)-И, f2(})-ИЛИ, f4( & )-НЕ, f15(&)-И-НЕ, f16(&)-И-НЕ, f17(&)-И-НЕ → (f17.1(&)-И-НЕ и f17.2(&)-И-НЕ), f18(&)-И-НЕ, f19(&)-И-НЕ, f20(&)-И-НЕ и f21(&)-И-НЕ, а также введены логические функции f1(}& )-ИЛИ-НЕ, f2(}& )-ИЛИ-НЕ, f3(}& )-ИЛИ-НЕ и f4(}& )-ИЛИ-НЕ, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000239

где
Figure 00000240
- логическая функция f1(}& )-ИЛИ-НЕ.2. The functional structure of the adder f3(Σ CD) conditionally "g" discharge, implementing the procedure of "decoding" the arguments of the terms [1,2 S g h1] f (2n) and [1,2 S g h2] f (2n) positional format “Additional codeRU" through arithmetic axioms of the ternary number system f (+ 1,0, -1) and double logical differentiation d1,2/ dn → f1,2(+← ↓-)d / dn active arguments “Level 2” and deleting active logical zeros “+1” “- 1” → “0” in “Level 1”, including the logical function fone(}) -OR, in which the functional input links are the functional input links of the structure, and also includes the logical function fone(&) - And and the logical function f2(&) - And, in which the functional input links are the functional input links of the structure, and the functional output link is the functional input link of the logical function f3( & ) -NE, characterized in that the structure of the conditionally "g" discharge to activate the resulting argument (one S g)CD “Level 1” introduced logical functions fone( & ) -NOT f2( & ) -NOT ffour( & ) -NOT fone(&) AND NOT, f2(&) AND NOT, f3(&) AND NOT, ffour(&) AND NOT, f5(&) AND NOT, f6(&) AND NOT, f7(&) AND NOT, f8(&) AND NOT → (f8.1(&) -AND NOT and f8.2(&) -AND NOT), f9(&) AND NOT, f10(&) AND NOT, feleven(&) AND NOT, f12(&) AND NOT, f13(&) -AND NOT and ffourteen(&) -I-NOT, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000237

Where
Figure 00000238
 is a logical function fone(&) -NO,
and to activate the resulting argument (2 S g)CD “Level 2” of the “Additional CodeRU"In the conditionally" g "category introduced logical functions f3(&) - And, f2(}) -OR, ffour( & ) -NOT ffifteen(&) AND NOT, f16(&) AND NOT, f17(&) AND NOT → (f17.1(&) -AND NOT and f17.2(&) -AND NOT), feighteen(&) AND NOT, f19(&) AND NOT, ftwenty(&) -AND NOT and f21(&) -AND-NOT, and also introduced the logical functions fone(} & ) -OR-NOT, f2(} & ) -OR-NOT, f3(} & ) -OR-NOT and ffour(} & ) -OR-NOT, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000239

Where
Figure 00000240
 is a logical function fone(} & )-OR NO. 3. Функциональная структура сумматора f3(Σ CD) условно «g» разряда, реализующая процедуру «дешифрирования» аргументов слагаемых [1,2 S g h1]f(2n) и [1,2 S g h2]f(2n) позиционного формата «Дополнительный код RU» посредством арифметических аксиом троичной системы счисления f(+1,0,-1) и двойного логического дифференцирования d1,2/dn → f1,2(+←↓-)d/dn активных аргументов «Уровня 2» и удаления активных логических нулей «+1»«-1» → «0» в «Уровне 1», включающая логическую функцию f1(})-ИЛИ, в которой функциональные входные связи являются функциональными входными связями структуры, а также включает логическую функцию f1(&)-И и логическую функцию f2(&)-И, в которой функциональные входные связи являются функциональными входными связями структуры, а функциональная выходная связь является функциональной входной связью логической функции f2( & )-НЕ, отличающаяся тем, что в структуру условно «g» разряда для активизации результирующего аргумента (1 S g)CD «Уровня 1» введены логические функции f1( & )-НЕ, f1(&)-И-НЕ → (f1.1(&)-И-НЕ и f1.2(&)-И-НЕ), f3(&)-И, f4(&)-И, f2(})-ИЛИ, f3(})-ИЛИ, f4(})-ИЛИ, f5(})-ИЛИ, f6(})-ИЛИ, f7(})-ИЛИ, f8(})-ИЛИ, f9(})-ИЛИ, f10(})-ИЛИ и f11(})-ИЛИ, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000241

а для активизации результирующего аргумента (2 S g)CD «Уровня 2» «Дополнительного кода RU» в условно «g» разряд введены логические функции f3( & )-НЕ, f4( & )-НЕ, f12(})-ИЛИ, f13(})-ИЛИ, f14(})-ИЛИ, f15(})-ИЛИ, f16(})-ИЛИ и f17(})-ИЛИ, а также введены логические функции f5(&)-И, f6(&)-И, f7(&)-И, f8(&)-И, f9(&)-И, f10(&)-И, f11(&)-И и f2(&)-И-НЕ → (f2.1(&)-И-НЕ и f2.2(&)-И-НЕ), при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000242
3. The functional structure of the adder f3(Σ CD) conditionally "G" category, implementing the procedure of "decoding" the arguments of the terms [1,2 S g h1] f (2n) and [1,2 S g h2] f (2n) positional format “Additional codeRU" through arithmetic axioms of the ternary number system f (+ 1,0, -1) and double logical differentiation d1,2/ dn → f1,2(+← ↓-)d / dn active arguments "Level 2" and the removal of active logical zeros “+1” “- 1” → “0” in “Level 1”, including the logical function fone(}) -OR, in which the functional input links are the functional input links of the structure, and also includes the logical function fone(&) - And and the logical function f2(&) - And, in which the functional input links are the functional input links of the structure, and the functional output link is the functional input link of the logical function f2( & ) -NE, characterized in that the structure of the conditionally "g" discharge to activate the resulting argument (one S g)CD “Level 1” introduced logical functions fone( & ) -NOT fone(&) AND NOT → (f1.1(&) -AND NOT and f1.2(&) -AND NOT), f3(&) - And, ffour(&) - And, f2(}) -OR, f3(}) -OR, ffour(}) -OR, f5(}) -OR, f6(}) -OR, f7(}) -OR, f8(}) -OR, f9(}) -OR, f10(}) -OR and feleven(}) -OR, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000241

and to activate the resulting argument (2 S g)CD “Level 2” of the “Additional CodeRU"In the conditionally" g "category introduced logical functions f3( & ) -NOT ffour( & ) -NOT f12(}) -OR, f13(}) -OR, ffourteen(}) -OR, ffifteen(}) -OR, f16(}) -OR and f17(}) -OR, and also introduced the logical functions f5(&) - And, f6(&) - And, f7(&) - And, f8(&) - And, f9(&) - And, f10(&) - And, feleven(&) - And and f2(&) AND NOT → (f2.1(&) -AND NOT and f2.2(&) -AND-NOT), while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000242
 4. Функциональная структура сумматора f3(Σ CD) условно «g» разряда, реализующая процедуру «дешифрирования» аргументов слагаемых [1,2 S g h1]f(2n) и [1,2 S g h2]f(2n) позиционного формата «Дополнительный код RU» посредством арифметических аксиом троичной системы счисления f(+1,0,-1) и двойного логического дифференцирования d1,2/dn → f1,2(+←↓-)d/dn активных аргументов «Уровня 2» и удаления активных логических нулей «+1»«-1» → «0» в «Уровне 1», включающая логическую функцию f1(&)-И и логическую функцию f2(})-ИЛИ, в которой функциональные входные связи являются функциональными входными связями структуры, и включает логическую функцию f2(&)-И, в которой функциональные входные связи являются функциональными входными связями структуры, а функциональная выходная связь является функциональной входной связью логической функции f3( & )-НЕ, отличающаяся тем, что в структуру условно «g» разряда для активизации результирующего аргумента (1 S g)CD «Уровня 1» введены логические функции f1(}& )-ИЛИ-НЕ, f2(}& )-ИЛИ-НЕ, f3(}& )-ИЛИ-НЕ, f4(}& )-ИЛИ-НЕ, f5(}& )-ИЛИ-НЕ, f6(}& )-ИЛИ-НЕ, f7(}& )-ИЛИ-НЕ, f8(}& )-ИЛИ-НЕ, f9(}& )-ИЛИ-НЕ, f10(}& )-ИЛИ-НЕ, f11(}& )-ИЛИ-НЕ, f12(}& )-ИЛИ-НЕ, f13(}& )-ИЛИ-НЕ и f1(})-ИЛИ → (f1.1(})-ИЛИ и f1.2(})-ИЛИ), а также введена логическая функция f1( & )-НЕ, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000243

а для активизации результирующего аргумента (2 S g)CD «Уровня 2» «Дополнительного кода RU» в условно «g» разряд введены логические функции f3(})-ИЛИ → (f3.1(})-ИЛИ и f3.2(})-ИЛИ), f3(&)-И, f4(})-ИЛИ, f2( & )-НЕ, f4( & )-НЕ, f3(&)-И-НЕ, f4(&)-И-НЕ, f5(&)-И-НЕ, f6(&)-И-НЕ, а также введены логические функции f14(}& )-ИЛИ-НЕ, f15(}& )-ИЛИ-НЕ, f16(}& )-ИЛИ-НЕ, f17(}& )-ИЛИ-НЕ, f18(}& )-ИЛИ-НЕ и f19(}& )-ИЛИ-НЕ, при этом функциональные связи логических функций в структуре сумматора выполнены в соответствии с математической моделью вида
Figure 00000244
4. The functional structure of the adder f3(Σ CD) conditionally "G" category, implementing the procedure of "decoding" the arguments of the terms [1,2 S g h1] f (2n) and [1,2 S g h2] f (2n) positional format “Additional codeRU" through arithmetic axioms of the ternary number system f (+ 1,0, -1) and double logical differentiation d1,2/ dn → f1,2(+← ↓-)d / dn active arguments "Level 2" and the removal of active logical zeros “+1” “- 1” → “0” in “Level 1”, including the logical function fone(&) - And and the logical function f2(}) -OR, in which the functional input links are the functional input links of the structure, and includes the logical function f2(&) - And, in which the functional input links are the functional input links of the structure, and the functional output link is the functional input link of the logical function f3( & ) -NE, characterized in that the structure of the conditionally "g" discharge to activate the resulting argument (one S g)CD “Level 1” introduced logical functions fone(} & ) -OR-NOT, f2(} & ) -OR-NOT, f3(} & ) -OR-NOT, ffour(} & ) -OR-NOT, f5(} & ) -OR-NOT, f6(} & ) -OR-NOT, f7(} & ) -OR-NOT, f8(} & ) -OR-NOT, f9(} & ) -OR-NOT, f10(} & ) -OR-NOT, feleven(} & ) -OR-NOT, f12(} & ) -OR-NOT, f13(} & ) -OR-NOT and fone(}) -OR → (f1.1(}) -OR and f1.2(}) -OR), and also introduced the logical function fone( & ) -HE, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000243

and to activate the resulting argument (2 S g)CD “Level 2” of the “Additional CodeRU"In the conditionally" g "category introduced logical functions f3(}) -OR → (f3.1(}) -OR and f3.2(}) -OR), f3(&) - And, ffour(}) -OR, f2( & ) -NOT ffour( & ) -NOT f3(&) AND NOT, ffour(&) AND NOT, f5(&) AND NOT, f6(&) -AND-NOT, and also introduced the logical functions ffourteen(} & ) -OR-NOT, ffifteen(} & ) -OR-NOT, f16(} & ) -OR-NOT, f17(} & ) -OR-NOT, feighteen(} & ) -OR-NOT and f19(} & ) -OR-NOT, while the functional relationships of logical functions in the adder structure are made in accordance with a mathematical model of the form
Figure 00000244
RU2011151806/08A 2011-12-20 2011-12-20 f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC) RU2517245C9 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
RU2011151806/08A RU2517245C9 (en) 2011-12-20 2011-12-20 f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
RU2011151806/08A RU2517245C9 (en) 2011-12-20 2011-12-20 f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC)

Publications (3)

Publication Number Publication Date
RU2011151806A RU2011151806A (en) 2013-06-27
RU2517245C2 RU2517245C2 (en) 2014-05-27
RU2517245C9 true RU2517245C9 (en) 2014-10-27

Family

ID=50779695

Family Applications (1)

Application Number Title Priority Date Filing Date
RU2011151806/08A RU2517245C9 (en) 2011-12-20 2011-12-20 f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC)

Country Status (1)

Country Link
RU (1) RU2517245C9 (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002014804A (en) * 2000-06-29 2002-01-18 New Japan Radio Co Ltd Ternary digital circuit
JP2005326914A (en) * 2004-05-12 2005-11-24 New Japan Radio Co Ltd Cmos adder
US7274211B1 (en) * 2006-03-10 2007-09-25 Xilinx, Inc. Structures and methods for implementing ternary adders/subtractors in programmable logic devices
RU2386162C2 (en) * 2008-04-29 2010-04-10 Лев Петрович Петренко FUNCTIONAL STRUCTURE OF PARALLEL ADDER FOR MULTIPLICATION, WHEREIN ARGUMENTS OFTERMS OF PARTIAL PRODUCTS ARE ARGUMENTS OF TERNARY NUMBER SYSTEM f(+1,0,-1) IN POSITIONAL-SIGN FORMAT THEREOF f(+/-) (VERSIONS)

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2002014804A (en) * 2000-06-29 2002-01-18 New Japan Radio Co Ltd Ternary digital circuit
JP2005326914A (en) * 2004-05-12 2005-11-24 New Japan Radio Co Ltd Cmos adder
US7274211B1 (en) * 2006-03-10 2007-09-25 Xilinx, Inc. Structures and methods for implementing ternary adders/subtractors in programmable logic devices
RU2386162C2 (en) * 2008-04-29 2010-04-10 Лев Петрович Петренко FUNCTIONAL STRUCTURE OF PARALLEL ADDER FOR MULTIPLICATION, WHEREIN ARGUMENTS OFTERMS OF PARTIAL PRODUCTS ARE ARGUMENTS OF TERNARY NUMBER SYSTEM f(+1,0,-1) IN POSITIONAL-SIGN FORMAT THEREOF f(+/-) (VERSIONS)

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
ДЖ. УЭЙКЕРЛИ, ПРОЕКТИРОВАНИЕ ЦИФРОВЫХ УСТРОЙСТВ, Москва, ПОСТМАРКЕТ, 2002, с. 508. *

Also Published As

Publication number Publication date
RU2517245C2 (en) 2014-05-27

Similar Documents

Publication Publication Date Title
RU2012117468A (en) PROGRAMMABLE LOGIC DEVICE
RU2429522C1 (en) FUNCTIONAL STRUCTURE OF ADDER fi(Σ) OF ARBITRARY "i" BIT FOR LOGIC-DYNAMIC PROCESS OF SUMMATION OF POSITIONAL ARGUMENTS OF TERMS [ni]f(2n) and [mi]f(2n) USING ARITHMETIC AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS OF RUSSIAN LOGIC)
RU2517245C9 (en) f3 ADDER FUNCTIONAL STRUCTURE (ΣCD) OF ARBITRARY "g" DIGIT IMPLEMENTING DECODING PROCEDURE FOR ARGUMENTS OF SUMMANDS [1,2Sg h1]f(2n) AND [1,2Sg h2]f(2n) OF POSITION FORMAT "EXTRA CODE RU" BY ARITHMETIC AXIOMS OF TERNARY NOTATION f(+1,0,-1) AND DOUBLE LOGICAL DIFFERENTIATION d1,2/dn → f1,2(+←↓-)d/dn OF ACTIVE ARGUMENTS OF "LEVEL 2" AND REMOVAL OF ACTIVE LOGICAL ZEROES "+1""-1"→"0" IN "LEVEL 1" (VERSIONS OF RUSSIAN LOGIC)
RU2386162C2 (en) FUNCTIONAL STRUCTURE OF PARALLEL ADDER FOR MULTIPLICATION, WHEREIN ARGUMENTS OFTERMS OF PARTIAL PRODUCTS ARE ARGUMENTS OF TERNARY NUMBER SYSTEM f(+1,0,-1) IN POSITIONAL-SIGN FORMAT THEREOF f(+/-) (VERSIONS)
RU2378682C2 (en) INPUT STRUCTURE FOR PARALLEL ADDER IN POSITION-SIGN CODES f(+/-)(VERSIONS)
Hrubeš On the Real $\tau $-Conjecture and the Distribution of Complex Roots
RU2480817C1 (en) FUNCTIONAL STRUCTURE OF ADDER f2(ΣCD) OF CONDITIONAL "k" BIT OF PARALLEL-SERIAL MULTIPLIER fΣ(ΣCD), IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF INPUT STRUCTURES OF ARGUMENTS OF TERMS [1,2Sj h1]f(2n) AND [1,2Sj h2]f(2n) OF "COMPLEMENTARY CODE RU" POSITIONAL FORMAT BY APPLYING ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND LOGIC DIFFERENTIATION d1/dn → f1(+←↓-)d/dn OF ARGUMENTS IN COMBINED STRUCTURE THEREOF (VERSIONS OF RUSSIAN LOGIC)
RU2424549C1 (en) FUNCTIONAL STRUCTURE OF PRE-ADDER fΣ([mj]&[mj,0]) OF PARALLEL-SERIES MULTIPLIER fΣ(Σ) WITH PROCEDURE FOR LOGIC DIFFERENTIATION d/dn OF FIRST INTERMEDIATE SUM [S1 Σ]f(})- OR STRUCTURE OF ACTIVE ARGUMENTS OF MULTIPLICAND [0,mj]f(2n) and [mj,0]f(2n) (VERSIONS)
RU2439658C1 (en) FUNCTIONAL STRUCTURE OF PREVIOUS SUMMATOR fΣ([ni]&[ni,0]), CONDITIONALLY "i AND "i+1" DIGITS OF "k" GROUP OF PARALLEL-SERIES MULTIPLIER fΣ(Σ) FOR POSITIONAL ARGUMENTS OF MULTIPLICAND [ni]f(2n) WITH APPLICATION OF ARITHMETICAL AXIOMS OF TERNARY NUMBER SYSTEM f(+1,0,-1) (VERSIONS OF RUSSIAN LOGIC)
RU2484518C1 (en) FUNCTIONAL STRUCTURE OF SECOND LEAST SIGNIFICANT BIT ACTIVATING RESULTANT ARGUMENT (2Smin+1)f(2n) "LEVEL 2" AND (1Smin+1)f(2n) "LEVEL 1" OF ADDDER fCD(Σ)RU FOR ARGUMENTS OF TERMS ±[1,2nj]f(2n) AND ±[1,2mj]f(2n) OF "COMPLEMENTARY CODE RU" FORMAT (VERSIONS OF RUSSIAN LOGIC)
RU2363978C2 (en) Device for parallel boolean summation of analogue signals of terms equivalent to binary number system
RU2390050C2 (en) FUNCTIONAL DESIGN OF PARALLEL POSITION-SIGN ADDER OF ARGUMENTS OF TERMS OF TWO FORMATS OF BINARY NUMBER SYSTEM f(2n) AND POSITION-SIGN NUMBER SYSTEM f(+/-) (VERSIONS)
RU2422879C1 (en) FUNCTIONAL STRUCTURE FOR PRE-ADDER OF PARALLEL-SERIAL MULTIPLIER fΣ(Σ) WITH MULTIPLICAND ARGUMENTS [mj]f(2n) AND MULTIPLIER ARGUMENTS [ni]f(2n) IN POSITION FORMAT (VERSIONS)
RU2380740C2 (en) FUNCTIONAL STRUCTURE OF POSITION-SIGN ACCUMULATOR f(+/-) FOR COMBINATORIAL MULTIPLIER WHERE SUBPRODUCT OUTPUT ARGUMENTS ARE REPRESENTED IN BINARY FORMAT f(2n) (VERSIONS)
RU2011151806A (en) FUNCTIONAL STRUCTURE OF THE SUMMATOR f3 (ΣCD) CONDITIONALLY "g" DISCHARGE REALIZING THE PROCEDURE FOR "DECIPTING" THE ARGUMENTS OF THE TERMS [1,2Sg h1] f (2N) AND [1,2Sg h2] f (2N) POSITIVE-POSITIVE AXIOM OF THE TRINITION CALCULATION SYSTEM f (+ 1,0, -1) AND DOUBLE LOGIC DIFFERENTIATION d1,2 / dn → f1,2 (+ ← ↓ -) d / dn ACTIVE ARGUMENTS "LEVEL 2" AND REMOVAL OF ACTIVE "LOGICHI" "" -1 "→" 0 "AT" LEVEL 1 "(OPTIONS OF RUSSIAN LOGIC)
RU2361269C9 (en) Method of logical differentiation of analogue signals equivalent to binary code and device to this end
RU2480814C1 (en) FUNCTIONAL OUTPUT STRUCTURE OF CONDITIONAL BIT "j" OF ADDER fCD(Σ)RU WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆tΣ FOR ARGUMENTS OF TERMS OF INTERMEDIATE ARGUMENTS (2Sj)2 d1/dn "LEVEL 2" AND (1Sj)2 d1/dn "LEVEL 1" OF SECOND TERM AND INTERMEDIATE ARGUMENTS (2Sj)1 d1/dn "LEVEL 2" AND (1Sj)1 d1/dn "LEVEL 1" OF FIRST TERM OF "COMPLENTARY CODE RU" FORMAT WITH GENERATION OF RESULTANT ARGUMENTS OF SUM (2Sj)f(2n) "LEVEL 2" AND (1Sj)f(2n) "LEVEL 1" IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC)
RU2445680C1 (en) FUNCTIONAL STRUCTURE OF THROUGH CARRY f1(←←)i+1 AND f2(←←)i OF CONVENTIONALLY "i+1" AND CONVENTIONALLY "i" DIGITS OF "k" GROUP OF ARGUMENTS OF MULTIPLICAND [ni]f(2n) OF PRELIMINARY SUMMATOR fΣ([ni]&[ni,0]) OF PARALLEL SERIES MULTIPLIER fΣ(Σ) (VERSIONS)
RU2422881C1 (en) FUNCTIONAL OUTPUT STRUCTURE FOR PARALLEL-SERIAL MULTIPLIER fΣ(Σ) IN POSITION FORMAT OF MULTIPLICAND [mj]f(2n) AND MULTIPLIER [ni]f(2n) (VERSIONS)
Broedel et al. Elliptic polylogarithms and two-loop Feynman integrals
RU2476922C1 (en) FUNCTIONAL DESIGN OF ADDER f3(ΣCD)max OF "k" CONDITIONALLY MOST SIGNIFICANT BITS OF PARALLEL-SERIAL MULTIPLIER fΣ(ΣCD), IMPLEMENTING PROCEDURE FOR "DECRYPTION" OF ARGUMENTS OF TERMS [1,2Sg h1] AND [1,2Sg h2] "COMPLEMENTARY CODE RU" BY ARITHMETIC AXIOM OF TERNARY NUMBER SYSTEM f(+1,0,-1) AND LOGIC DIFFERENTIATION d1/dn → f1(+←↓-)d/dn (VERSIONS OF RUSSIAN LOGIC)
RU2450325C2 (en) FUNCTIONAL STRUCTURE FOR LOGIC-DYNAMIC PROCESS OF SERIAL END-TO-END ACTIVATION OF INACTIVE ARGUMENTS "0" OF SECOND INTERMEDIATE SUM +[S2 i]f(&) -AND IN ADDER f(Σ) WITH TRANSFORMATION OF POSITIONAL ARGUMENTS OF TERMS [ni]f(2n) AND [mi]f(2n) (VERSIONS)
RU2480815C1 (en) FUNCTIONAL FIRST INPUT STRUCTURE OF CONDITIONAL "j" BIT OF ADDER fCD(Σ)RU WITH MAXIMALLY MINIMISED PROCESS CYCLE ∆tΣ FOR ARGUMENTS OF TERMS ±[1,2nj]f(2n) AND ±[1,2mj]f(2n) OF "COMPLEMENTARY CODE RU" FORMAT WITH GENERATION OF INTERMEDIATE SUM (2Sj)1 d1/dn "LEVEL 2" AND (1Sj)1 d1/dn "LEVEL 1" OF FIRST TERM IN SAME FORMAT (VERSIONS OF RUSSIAN LOGIC)
RU2378681C2 (en) FUNCTIONAL STRUCTURE FOR CORRECTING INTERMEDIATE SUM ±[S3i] ARGUMENTS FOR PARALLEL ADDER IN POSITION-SIGN CODES f(+/-)
RU2362205C2 (en) Method parallel boolean summation of analogue signals of components equivalent to binary number system and device to this end

Legal Events

Date Code Title Description
TH4A Reissue of patent specification
TK4A Correction to the publication in the bulletin (patent)

Free format text: AMENDMENT TO CHAPTER -FG4A- IN JOURNAL: 15-2014 FOR TAG: (54)

TK4A Correction to the publication in the bulletin (patent)

Free format text: AMENDMENT TO CHAPTER -TK4A- IN JOURNAL: 30-2014 FOR TAG: (54)