WO2016042348A1 - Multilayer universal logic circuits - Google Patents
Multilayer universal logic circuits Download PDFInfo
- Publication number
- WO2016042348A1 WO2016042348A1 PCT/HR2015/000015 HR2015000015W WO2016042348A1 WO 2016042348 A1 WO2016042348 A1 WO 2016042348A1 HR 2015000015 W HR2015000015 W HR 2015000015W WO 2016042348 A1 WO2016042348 A1 WO 2016042348A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- logic
- power lines
- logic circuits
- circuits
- universal
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03K—PULSE TECHNIQUE
- H03K19/00—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits
- H03K19/20—Logic circuits, i.e. having at least two inputs acting on one output; Inverting circuits characterised by logic function, e.g. AND, OR, NOR, NOT circuits
Definitions
- the invention relates to a new way of writing down un iversal binary numbers, used as a useful numeric system and making base to perform universal logic calculus, from which come universal logic functions, in the International Patent Classification (IPC) classified as H03 1 9/20 and H03 1 9/21 - logic functions.
- IPC International Patent Classification
- Universal logic functions make fundamentals on which the procedure of technical material isation of new universal logic circuits is based, and in the IPC classified as H03K 19/00 and 19/ 1 73 - logic circuits.
- Logic algebra is a system of theorems describing sets of elements and their mutual relationships by means of symbolic logic.
- the fundamental element of logic algebra is a proposition, judgement or statement that may be true or false.
- Propositions can be mutual ly combined in logic operations.
- the basic logic proposition functions of negation, conjunction and disjunction correspond to the basic logic circuits NO, AND and OR that, as electronic circuits, perform certain operations with pulses, thus enabling the performance of arithmetic and logic operations in a computer.
- Such circuits are controlled by electricity, power, wherefore they react to the powered status and the unpowered status.
- the functions of such circuits can be presented by electrical switches.
- Switch operations can be described with an electricity circuit where a switch A, a switch B and a l ight bulb are connected in series or in paral lel.
- a switch A a switch B and a l ight bulb are connected in series or in paral lel.
- NO basic logic circuits
- AN D the logic circuits XOR, NAND and NOR are also used often.
- the essence of the invention is also used often.
- the primary goal of the invention is putting together logic procedures, based on the new binary system, and the physical elements of the invention into the single unit of the invention. This is aimed to achieving an improved theoretical and practical application of universal logic circuits in the integrated technology of complex electronic logic circuits.
- the secondary goal of the invention is to provide a simpler, more rel iable and more efficient design, and thereby also production, of basic elements of universal logic circuits.
- wi ll be shown in the following description, and partly wi ll be revealed in its appl ication.
- the very act of revolution ising the ru les of uti l isation of the binary number system relates to introduction of a logical and fluent writing of the digits.
- the new way of writing and uti l ising binary d igits simply fol lows the binary system's inner logic, where the position of a d igit in a binary number presents the value of 2 raised to a certain power.
- the exponent value depends on the position of the d igit in the sequence.
- the revolution is in writing d igit values in a different way when calculating with binary numbers, i.e. from left to right, from lesser to greater number, by adding the digits 0 or 1 , where the number value depends on ly on the position of the digit I in the numeric writing, independent of the amount of the digits 0.
- n n n n n n n n n n n n n 12 n 1 3 n 14 n 1 5 n " 2. 147.483.648
- the basic propositions make elements of complex propositions. From complex propositions, by logic operations, may be created new complex propositions made of these. Universal propositional calculi are performed by symbols of the 16 basic, equal propositions, all of them having the same basic structure. Relations between the basic proposition truth values make foundations of the propositional calculus logic operations.
- a logic operation is creating a logic proposition by certain logic calculus rules.
- Operands are propositions marked with symbols that are subjected to a logic operation by means of operators.
- An operator is a proposition marked with a symbol that is in logic operations linked to the logic calculus operands, this producing the result of the operation.
- the operator as the truth value of the basic proposition in the propositional calculus, has the role of the propositional function, i.e., of the connecting proposition in which the truth value becomes a truth function related to the calculative value of the operand in creating the new proposition that makes the result of the operation.
- the universal propositional calculus also requires a universal use of symbols that create a universal ideographic language.
- Every proposition can be presented by a certain symbol that in itself contains the proposition's ordinal number and truth value, i.e., the given proposition's logic function.
- the operator proposition is the basic proposition placed in brackets (x). It can be any one of the basic propositions 0th - 1 th. By placing any basic proposition 0th - 15th in brackets (x), that proposition is marked as the operator proposition, and its truth value becomes the truth function of the mathematical operation, marked with the symbol ":" before decimal numbers and dash below or after decimal numbers, the place of the line depending on the position of the digit 0 in the operator's four-digit binary number.
- Operand propositions are two binary numerical values, two basic propositions, connected by propositional synthesis into a common decimal numerical value, after which the symbol ";" is placed. Combining two numeric values of two propositions results in the propositions' computational value.
- the computational value of two connected propositions unlike propositions that are true or false, has no value of its own, wherefore it can be neither true nor false, however, each computational value has its own code, or mark, which is combined with the operator's truth function in the mathematical operation.
- any one of the basic propositions' 16 binary numeric values can be combined with any one of the basic propositions 16 binary numeric values, this resulting in 256 computational value combinations.
- Each one of the 256 computational value combinations has a unique four-digit mark, a code of four decade digits followed by the symbol ";" in them containing the number digits of the propositions combined by synthesis, wherefore they can be divided into the basic propositions' binary numbers. All 256 combinations of computational values of two operands:
- Propositional calculus is the term for the logic procedure whereby in a logic operation a logic operator as the truth function of a proposition is connected and placed into a certain relationship with operands as computational values of two propositions, this producing a result that is the logic function of the resulting proposition.
- Any truth function of the operators 0th - 15th can be connected with any one of the 256 possible operand computational value combinations into the logic operation's propositional function, creating thereby 4096 different operations in the propositional calculus.
- Electronic logic circuits are controlled by electricity, where they react to powered and not powered statuses. Operating certain logic circuits can be described with an electric circuit where various operations with pulses are performed by electric switches.
- Logic gates are names for basic logic circuits having at their inputs one or two pulse logic values, and at their outputs just one pulse logic value.
- the logic gate NO and the logic gate YES are names of logic circuits that have one pulse logic value each at input and output.
- the logic gates NO, as the logic pulse exchangers, at the input have electric pulse values of one of the 16 basic logic proposition, whereas at the output they have pulse values opposite to the input ones.
- the logic gates YES, as the logic pulse amplifiers, both at the inputs and the outputs have the same electric pulse values of one of the 16 basic logic propositions.
- Logic gates with two inputs correspond to the logic functions of the 16 basic logic propositions, wherefore at two inputs they have electric pulses of values of two logic values, two operands, subjected to the operation of electric pulses of one logic value, one operator; at the output they have electric pulses resulting from the logic operation and representing the circuit's logic functions.
- Basic logic circuits are technically obtained with the help of the pulses of the 16 logic values, 16 basic logic propositions. This means that at the universal logic circuit's two inputs there may be combinations of 16 pulse values of the first input and 16 pulse values of the second input, that is, 256 possible input combinations. When 256 input pulse combinations of two operands are subjected to acting of 16 different pulse combinations of one operator, obtained are 4096 performances of 16 universal logic circuits having two inputs and one output. If these logic circuits are further added 32 logic circuits having one input and one output, obtained are 4128 variations of 16 basic universal logic circuits, as components of complex integrated circuits.
- Universal logic circuits unlike logic circuits presented by electric switches connected in an electric circuit in series: logic function AND, or in parallel: logic function OR, have a different electric switches structure, that in the electric circuit, by means of pulses, can produce each of the 16 logic function pulse values.
- universal logic circuits comprise the construction of electric switches with four power lines, designed so that the first, lower, part of the switch, marked X, to which the power source is connected, acts as the operator, and the second, upper, independent part of the switch, marked Y, has at its front part the computational value of the operand, and at the back, output part has the pulse result.
- FIG. 1 Perspective view of the multilayer universal logic circuit, designed in line with the described invention.
- Fig.2 Perspective view of the lower part of the universal logic circuit, making the electric switch marked X.
- FIG.3 Perspective view of the upper part of the universal logic circuit, making the electric switch marked Y.
- Fig.6 Electric diagram of the logic circuit exchanger AND.
- Fig.7 Electric diagram of the logic circuit amplifier OR.
- the basic logic operations are simple and consisting of one or two incoming propositions, the operands, subjected to a logic operation by means of logic function of one proposition, the operator, and at the output having a single proposition logic function as the logic operation result.
- universal logic functions can be made and multilayer universal logic circuits 20 can be constructed.
- the multilayer universal logic circuit 20, as an electronic circuit, enables performing logic operations by electric pulses.
- the Figures I, 2 and 3 show that the universal logic circuit 20, consists of the lower electric switch, marked X, 22, and the upper electric switch, marked Y, 36, thus being a multilayer unit.
- the lower independent part of the multilayer universal logic circuit 20, which makes the electric switch X 22, consists of the front input part 24, the back output part 26, and four power lines, numerically presented as the power line 0 - 28, the power line 1 - 30, the power line 2-32 and the power line 3 - 34.
- the front input part 24 of the electric switch marked X 22, consists of four power lines 28, 30, 32 and 34, to which the power source is connected. Each of inputs of the power lines 28, 30, 32 and 34, can be open or closed for electric current flow, which provides 16 different combinations of constructions of the front input parts 24 of the electric switches marked X 22, functioning as operator in the multilayer universal logic circuit 20.
- the back output part 26, of the electric switch marked X 22, consists of outputs of the power lines 28, 30, 32 and 34, each power line output being divided into four fields that can be of one of two statuses: either all four powered or all four not powered. This way fields of the power lines 28, 30, 32 and 34 in the multilayer logic circuit 20 provide power to four positions of the power lines 42, 44, 46 and 48 of the front input part 38 of the electric switch marked Y 36.
- the upper independent part of the multilayer logic circuit 20, that is the electric switch marked Y 36 consists of the front input part 38, the back output part 40 and the power lines 42, 44, 46 and 48.
- the front input part 38 of the electric switch marked Y 36 consists of four positions, 0, 1, 2, 3, on each of the power lines 42, 44, 46 and 48. Only one of the positions, either 0 or 1 or 2 or 3, in each of the four power lines 42, 44, 46 and 48 corresponds to the sum of the two operands' given binary numeric values, this resulting in 256 combinations at the four positions, where the positions are connected to the fields.
- the multilayer universal logic circuits 20 By closing the electric circuit, by means of the electric pulses the multilayer universal logic circuits 20 perform their functions as this is presented in the Figures 4 and 5.
- the invention enables practical, permanent and useful constructions of basic logic circuits that can be produced economically, and include essential improvements relative to the previously known logic circuit products of this type.
- 52 - Amplifier universal logic circuit having one input and one output, made with four power lines.
Abstract
Multilayer universal logic circuits (20) with two inputs and one output, made with four power lines, and consisting of electric switches marked X (22) and electric switches marked Y (36), and universal logic circuits (50) and (52) with one input and one output, made with four power lines, by means of electric pulses performing logic operations, corresponding to universal logic functions. By connecting different basic universal logic circuits (20), (50) and (52) into a unique functional unit, are constructed complex electronic circuits with four power lines, normally made in the integrated technology.
Description
MULTILAYER UNIVERSAL LOGIC CIRCUITS
INVENTION DESCRIPTION
The field to which the invention relates
The invention relates to a new way of writing down un iversal binary numbers, used as a useful numeric system and making base to perform universal logic calculus, from which come universal logic functions, in the International Patent Classification (IPC) classified as H03 1 9/20 and H03 1 9/21 - logic functions. Universal logic functions make fundamentals on which the procedure of technical material isation of new universal logic circuits is based, and in the IPC classified as H03K 19/00 and 19/ 1 73 - logic circuits.
Technical problem
(for the solution of which patent protection is sought)
In attempting to write the basic, universal logic propositions by means of binary numbers, as ideographic symbols, the problem appears in the impossibi lity to write each of the sixteen basic logic propositions, that in their numerical values are to contain the four binary number recordings, by means of the presently used ordinal binary numbers. The problem appears in the impossibil ity of modern symbol ic logic to find a way of producing symbols for a universal logic procedure that would facilitate and improve util isation of logic functions, in creating new and better un iversal logic circuits. Here also appears the large problem of how technically to implement material, universal logic circuits made of electric switches as integrated circuits components, that will perform all universal logic calculus operations fully and in the simplest physical way - by pulses. This requires a new and different construction of logic circuits.
State of the art
(description and analysis of known sol utions to the techn ical problem concerned) The traditional, present ways of recording binary number digits
0. = 0 4. = 1 00 8. = 1 000 12. = 1 1 00 1 6. = 1 0000
1 . = 1 5. = 1 01 9. = 1001 13. = 1 101 1 7. = 10001
2. = 10 6. = 1 1 0 1 0. = 101 0 14. = 1 1 10 1 8. = 1 001 0
3. = 1 1 7. = 1 1 1 1 1 . = 1 01 1 1 5. = 1 1 1 1 1 9. = 1 001 1
Logic algebra is a system of theorems describing sets of elements and their mutual relationships by means of symbolic logic. The fundamental element of logic algebra is a proposition, judgement or statement that may be true or false. Propositions can be mutual ly combined in logic operations. The basic logic proposition functions of negation, conjunction and disjunction, correspond to the basic logic circuits NO, AND and OR that, as electronic circuits, perform certain operations with pulses, thus enabling the performance of arithmetic and logic operations in a computer. Such circuits are controlled by electricity, power, wherefore they react to the powered status and the unpowered status. The functions of such circuits can be presented by electrical switches. Switch operations can be described with an electricity circuit where a switch A, a switch B and a l ight bulb are connected in series or in paral lel. Besides the basic logic circuits: NO, AN D and OR, the logic circuits XOR, NAND and NOR are also used often.
The essence of the invention
(in such terms that the techn ical problem and its solution can be understood and state the technical novelty of the invention with reference to the prior state of the art)
The primary goal of the invention is putting together logic procedures, based on the new binary system, and the physical elements of the invention into the single unit of the invention. This is aimed to achieving an improved theoretical and practical application of universal logic circuits in the integrated technology of complex electronic logic circuits.
The secondary goal of the invention is to provide a simpler, more rel iable and more efficient design, and thereby also production, of basic elements of universal logic circuits.
Additional goals and advantages of the invention wi ll be shown in the following description, and partly wi ll be revealed in its appl ication.
Un iversal binary number system
Al l mathematical operations that are possible in the decade number system, are also possible in the binary number system. The binary number system, because of its sim i larity with the two possible electric statuses, is practical and comprehensible for electronic, digital computi ng use, but is impractical and incomprehensible for a wider personal and scienti fic practice.
These setbacks are easily noticed in the very basic arithmetic operations. The problems of writing backward, and of the relation between machine and symbol ic languages, besides the standsti l l in developing the artificial intel l igence, show that the ru les of uti l isation of binary numbers have been stretched to their lim its, and that some solutions are forced.
Questions appear of what the causes of this are and how to overcome the current situation, how to improve the binary system in order to enable its better and simpler appl ication in computing and other theoretical and practical activities. A l l the above together ind icates that a rad ical turn is required, and that the existing binary number system rules are to be revolution ised, in order to respond to the requirements of the time.
Fol lowing a thorough study of the issue on hand, the opinion occurred that the cause of the lack of harmony and fluency of a binary un it is not in the very system but in the ru les of its appl ication, i.e., not respecting the binary system's inner logic, wh ich generates the anomal ies.
The very act of revolution ising the ru les of uti l isation of the binary number system relates to introduction of a logical and fluent writing of the digits. The new way of writing and uti l ising binary d igits simply fol lows the binary system's inner logic, where the position of a d igit in a binary number presents the value of 2 raised to a certain power. The exponent value depends on the position of the d igit in the sequence. The revolution is in writing d igit values in a different way when calculating with binary numbers, i.e. from left to right, from lesser to greater number, by adding the digits 0 or 1 , where the number value depends on ly on the position of the digit I in the numeric writing, independent of the amount of the digits 0.
0 1 3 4 5 6 7 8 9 1 0
n n n n n n n n n n n n n 12 n 1 3 n 14 n 1 5 n " = 2. 147.483.648
2 4 3 6 2 5 I 2 4 3
2 4 5 1 0 0 0 2
6 2 2 4 9 9 7
4 8 6 2 6
8
0 0 0 1 I 1 1 1506 2
I J" J' >L I 32
4 8 1 3 6 1 2 1 64
6 2 4 2 5 0 128
2 256
4 1024
1506
Comparison of the first 16 numbers in the traditional and the new ways of writing:
Traditional writing New writing by 4 digits by 7 digits
0. 0 0 0 0 0 0 0 0 0 0 0 0 = 0
I. 1 1 0 0 0 1 0 0 0 0 0 = 1
2. 0 1 0 1 0 0 0 1 0 0 0 0 = 34
3. 1 1 1 1 0 0 1 1 0 0 1 1 = 115
4. 0 0 0 I 0 0 1 0 0 0 1 0 0 0 = 36
5. 1 1 0 1 1 0 1 0 1 0 1 0 0 1 = 69
6. 0 0 1 1 0 I 1 0 0 1 1 0 1 0 = 54
7. 1 1 1 1 1 1 1 0 1 0 0 0 0 1 = 97
8. 0 0 0 0 1 0 0 0 0 0 0 1 0→ 0 0 =
9. 0 1 0 0 1 1 0 0 0 0 0 1 0 1 0 = 40
10. 0 0 1 0 1 0 1 0 0 1 0 0 0 1 = 74
11. 0 1 1 0 1 1 1 0 1 1 0 1 1 0 = 59
1.2. 0 0 0 0 1 1 0 0 1 0 0 1 1 0 1 = 92
13. 0 I 1 0 1 1 1 0 1 I 0 0 1 = 65
14. 1 1 0 0 1 1 1 0 I I 0 1 1 0 = 46
15. I 1 1 1 1 1 1 1 1 1 1 1 =127
i i J" J" "t "L J, J, J, J, i I
4 S 1 2 4 1 2 4 8 1 2 4 3 6
2 4
In the traditional and presently practiced way of writing binary numbers down, all ordinal numbers are determined by the given amount and distribution of the binary digits 0 and 1. Thus: 0.=0, l.= l, 2 =10, 4 =100, 8 =1000, 16 =10000, 32 =100000, 64 =1000000, etc.
In the new way of writing binary numbers down by the digits I and 0, writing the numbers 1, 10, 100, 1000, 10000, 100000, 1000000, always make binary writing of the ordinal number 1st, meaning that in the new way a binary number is determined by the position of the digit I within the given number, not depending on the amount of the digits 0.
This enables writing all the binary system numbers in a certain subsystem by means of the same quantity of the digits 1 and 0. If the first digit is a 0, the number is an even one, and if the first digit is a 1 , the number is an odd one.
Universal logic functions
If we start from the fact that the universal propositional calculus consists of basic propositions, as propositions by which something is either claimed or denied, and that every claim is to be either true or false, consequentially a proposition can be said to be an idea that has a truth value: it is
either false or true, wherefore the propositional calculus depends on the relationship between the given propositions.
The basic propositions make elements of complex propositions. From complex propositions, by logic operations, may be created new complex propositions made of these. Universal propositional calculi are performed by symbols of the 16 basic, equal propositions, all of them having the same basic structure. Relations between the basic proposition truth values make foundations of the propositional calculus logic operations.
A logic operation is creating a logic proposition by certain logic calculus rules.
Operands are propositions marked with symbols that are subjected to a logic operation by means of operators.
An operator is a proposition marked with a symbol that is in logic operations linked to the logic calculus operands, this producing the result of the operation.
n the propositional calculus, operands make two ordinal numbers of the basic propositions that are combined into a computational value by propositional synthesis.
The operator, as the truth value of the basic proposition in the propositional calculus, has the role of the propositional function, i.e., of the connecting proposition in which the truth value becomes a truth function related to the calculative value of the operand in creating the new proposition that makes the result of the operation.
The universal propositional calculus also requires a universal use of symbols that create a universal ideographic language.
Every proposition can be presented by a certain symbol that in itself contains the proposition's ordinal number and truth value, i.e., the given proposition's logic function.
Table presentation of writing of universal symbols-propositions as propositional values of the new binary number system.
0. = 0000 CONTRADICTION C read: (not C) untrue
1. = 1000 JOINT DENIAL AVB (neither A, nor B) nor
2. = 0100 NONIMPLICATION A→B (not: if A, then B) unconditional
3. = I 100 NEGATION OF B B (not B) ; (-q = o) some are not
4. = 0010 CONVERSE NONIMPLICATION A^B (not: A if B) irreplaceable
5. = 1010 NEGATION OF A A (not A) ; (-p = e) none are
6. =0110 ALTERNATIVE Av/ B (either A, or B) exclusive or
7. = 1110 INCOMPATIBILITY ΑΛΒ (not: A and B) incompatible
8. = 0001 CONJUNCTION ΑΛΒ (A i B) coincidence
9. = 1001 EQUIVALENCE A≡B (if A, then B and if B, thenA) equality
10 = 0101 BASIC PROPOSITION A A (A) ; (p = a) all are
11 = 1101 CONVERSE IMPLICATION A<-B (A ifB) substitution
12 = 0011 BASIC PROPOSITION B B (B) ; (q = i) some are
13 = 1011 IMPLICATION A— >B (if A, then B) hypothetical
14 = 0111 DISJUNCTION AVB (A or B) inclusive or
15 = 1111 TAUTOLOGY C (Q true
In the above table, propositions and their truth values are sorted to correspond to their ordinal numbers in the binary writing. The universal logic system of propositions is based on the 16 basic propositions, of the same value in logic operations and of the same basic structure, which means that all basic propositions have their forms after the ordinal number, and their contents after the truth values.
A negation always has its truth value contrary to that of the given proposition.
Negation NO, X_ : 0.→ 15 4,<→ 11 8^ 7. YL 3.
L «→ 14 5 <→ 10 L «→ 2.
2, 13 6, <→9. JJL → 5 JA *-* l.
3. <→ 12 7. <→ 8. 1 I . <→ 4 15. <→ 0.
An example of deriving a negation:
From the simple relationship between two simple, theoretical propositions also result two basic propositions, A = 0101 and B = 0011, showing their propositional values, ordinal numbers and truth values.
The propositional value marked A = 0101 means that the basic proposition A has the ordinal number 10th.
The propositional value marked B = 0011 means that the basic proposition B has the ordinal number 12th.
When the propositional values of the basic propositions A and B are subjected to the logic process of negation, where the numbers A = 0101 and B = 0011 are replaced their zeros - 0 with ones - 1, and their ones - 1 with zeros - 0, obtained are propositions not-A and not-B, written as: A = 1010 and B = I 100.
The propositional value marked A =1010 means that the negation of the basic proposition A has the ordinal number 5th. The propositional value marked B = 1100 means that the negation of the basic proposition B has the ordinal number 3rd.
Operators
The operator proposition is the basic proposition placed in brackets (x). It can be any one of the basic propositions 0th - 1 th. By placing any basic proposition 0th - 15th in brackets (x), that proposition is marked as the operator proposition, and its truth value becomes the truth function of the mathematical operation, marked with the symbol ":" before decimal numbers and dash below or after decimal numbers, the place of the line depending on the position of the digit 0 in the operator's four-digit binary number.
(0) = 0 0 0 0 (1)= 1 0 0 0 (2) = 0 1 0 0 (3)= 1 1 0 0
:0_:]_:2_:3 :0 :J_:2 :3 :0 :1 :2 :3 :0 :1 :2 :3
:0l:ll:2l:3l :0 : 11:21:31 :0I:1 :2I:3I :0 :1 :2I:3I
(4) = 0 0 1 0 (5)= 1 0 I 0 (6) = 0 1 1 0 (7) = 1 1 I 0
:0 A :2 :3 :0 A :2 :3 :0 :1 :2 :3 :0 :1 :2 :3
:0I:1I:2 :3I :0 :ll:2 :3I : 01 : 1 :2 :3I :0 :1 :2 :3I
0 0 0 1 (9) = 1 0 0 1 (10)=0 1 0 1 (l l)=l 1 0
0 A :2 :3 :0 :1 :2 :3 :0 :l :2 :3 :0 :1 :2
01:11 :2I:3 :0 :1I:2I:3 :0I:1 :2I:3 :0 :1 :2I
(12)=0 0 1 (13)=1 0 1 1 (14)=0 1 1 (15)=1 1 1 1
:0 :1 :2 :0 A :2 :3 :0 :1 :2 :0 :1 :2 :3
:0I:II:2 :0 :ll:2 :3 :0l:l :2 :0 :1 :2 :3
Operands
Operand propositions are two binary numerical values, two basic propositions, connected by propositional synthesis into a common decimal numerical value, after which the symbol ";" is placed. Combining two numeric values of two propositions results in the propositions' computational value. The computational value of two connected propositions, unlike propositions that are true or false, has no value of its own, wherefore it can be neither true nor false, however, each computational value has its own code, or mark, which is combined with the operator's truth function in the mathematical operation.
With a propositional synthesis any one of the basic propositions' 16 binary numeric values can be combined with any one of the basic propositions 16 binary numeric values, this resulting in 256 computational value combinations.
Examples of combining two digits into a computational value: 00 = 0; I 0 = 1 ; 01 = 2; 1 1 =3; Propositions ordinal and cardinal numbers: 2. = 0100 7. = 1110 8. = 0001 13. = 1011 Vertical presentation of combining binary digits of two propositions into a computational value:
2.7 = 2.8 = 8.7 = 2.13 = 7.13 = 8.13 =
01 = 2; 00 = 0; 01 = 2; 0 1 =2; 1 1 =3; 0 1 =
1 1 =3; 10= 1; 01 =2; 1 0 = 1; 1 0 = 1; 0 0 =
01 = 2; 00 = 0; 01 = 2; 0 1 =2; 1 1 =3; 0 1 =
00 = 0; 01 = 2; 10= 1; 0 1 =2; 0 1 =2; 1 1 =
Horizontal presentation of combining binary digits of two propositions into a computational value:
00 01 00 8. = 0001 2. = 01 00 7. = I 1 0 8 000 1
I 0 0001 7. = 1 I 1 0 13.= 1 01 1 13.= 1 0 1 1 01 1
2;3;2;0; 0;1;0;2; 2;2;2;l; 2· I ·2·2· 3;1;3;2; 2;0;2;3;
Each one of the 256 computational value combinations has a unique four-digit mark, a code of four decade digits followed by the symbol ";" in them containing the number digits of the propositions combined by synthesis, wherefore they can be divided into the basic propositions' binary numbers. All 256 combinations of computational values of two operands:
0.0.=0;0;0;0; 0.1 =2;0;0;0 0.2.=0;2;0;0; 0.3.=2;2;0;0;
0.4 =0;0;2;0; 0.5.=2;0:2;0 0.6.=0;2;2;0; 0.7.=2;2;2;0;
0.8.=0;0;0;2; 0.9.=2;0;0;2 0.10.=0;2;0;2; 0.1 l.=2;2;0;2;
0.12.=0;0;2;2; 0.13 =2;0;2;2 0.14.=0;2;2;2; 0.15.=2;2;2;2;
1.0 = 1 0;0;0; 1.1 =3;0;0;0; 1.2 = 1;2;0;0; 1.3 =3;2;0;0;
1.4 = 1 0;2;0; 1.5 =3;0;2;0; 1.6 = 1;2;2;0; 1.7 =3;2;2;0;
1.8 = 1 0;0;2; 1.9 =3;0;0;2; 1.10 = 1;2;0;2; 1.11 =3;2;0;2;12 = 1 0;2;2; 1.13 =3;0,2;2; 1.14. = 1;2;2;2; 1.15 =3;2;2;2; .0 =0;1;0;0; 2.1 =2;1;0;0; 2.2 =0;3;0;0; 2.3 =2;3;0;0; .4 =0;1;2;0; 2.5 =2;1;2;0; 2.6 =0;3;2;0; 2.7 =2;3;2;0; .8 =0;1;0;2; 2.9 =2;1;0;2; 2.10. =0;3;0;2; 2.11 =2;3;0;2;12. =0;1;2;2; 2.13 =2;l;2;2; 2.14. =0;3;2;2; 2.15 =2;3;2;2; .0 = 1 1;0;0; 3.1 =3;1;0;0; 3.2. = l;3;0;0 3.3 =3;3;0;0; .4 = 1 1;2;0; 3.5 =3;1;2;0; 3.6. = 1;3;2;0 3.7 =3;3;2;0; .8 = 1 1;0;2; 3.9 =3;1;0;2; 3.10. = 1;3;0;2 3.11 =3;3;0;2;12 = 1 1;2;2; 3.1.3 =3;1;2;2; 3.14. = 1;3;2;2 3.15 =3;3;2;2; .0 =0;0;1 0; 4.1 =2;0;1;0; 4.2. =0;2;l;0 4.3 =2;2 1 0; .4 =0;0;3 0; 4.5 =2;0;3;0: 4.6. =0;2;3;0 4.7 =2;2 3 0; .8 =0;0;1 2; 4.9 =2;0;1;2; 4.10. =0;2;1;2 4.11 =2;2 1 2;12 =0;0;3 2; 4.13 =2:0:3:2; 4.14. =0;2;3;2 4.15 =2;2 3 2; .0 = 1 0;1;0; 5.1 =3;0;1 0; 5.2. = 1;2;1;0 5.3 =3;2 1 0; .4 = 1 0;3:0; 5.5 =3;0;3 0; 5.6. = 1 ;2;3;0 5.7 =3;2 3 0; .8 = 1 0;1 5.9 =3;0;1 2; 5.10. = 1;2;1;2 5.11 =3;2 1 2;12 = 1 0;3;2; 5.13 =3;0;3 2; 5.14, = 1;2;3;2 5.15 =3;2 3 2; .0 =0 i;i 0; 6.1 =2;l;l 0; 6.2. =0;3;l;0 6.3 =2;3 1 0; .4 =0 1,3 0; 6.5 =2;l;3 0; 6.6. =0;3;3;0 6.7 =2;3 3 0; .8 =0 i;i 2; 6.9 =2;1;1 2; 6.10. =0;3;l;2 6.11 =2;3 1 2;12 =0 i;3 2; 6.13 =2;l;3 2; 6.14. =0;3;3;2 6.15 =2;3 3 2; .0 = 1 i;i 0; 7.1.=3;1;1;0 7.2. = 1;3;1;0 7.3 =3;3 1 0; .4 = 1 1;3 0; 7.5.=3;1;3;0 7.6. = 1;3;3;0 7.7 =3;3 3 0; .8 = 1 i;i 2; 7.9.=3;1;1;2 7.10. = 1;3;1;2 7.11 =3;3 1 2;12 = 1 i;3 2; 7.13 =3:1:3:2 7.14. = l;3;3;2 7.15 =3;3 3 2; .0 =0;0;0 1; 8.1 =2;0;0;1; 8.2. =0;2;0;1 8.3 =2;2;0;1; .4 =0;0;2 1; 8.5 =2;0;2;1; 8.6. =0;2;2;1 8.7 =2;2;2;1; .8 =0;0;0 3; 8.9 =2;0;0;3; 8.10. =0;2;0;3 8.11 =2;2;0;3;12 =0;0;2 3; 8.13 =2;0;2;3; 8.14. =0;2;2;3 8.15 =2;2;2;3; .0 = 1 0;0;1; 9.1 =3;0;0;1. 9.2 = 1;2;0;1 9.3 =3;2;0 i; .4 = 1 0;2;1; 9.5 =3;0;2;1; 9.6. = 1;2;2;I 9.7 =3;2;2 1; .8 = 1 0;0;3; 9.9 =3;0;0;3; 9.10. = 1;2;0;3 9.11 =3;2;0 3;12 = 1 0;2;3; 9.13 =3;0;2;3; 9.14. = 1;2;2;3 9.15 =3;2;2 3; .0 =0 1;0 1; 10.1 =2;l;0;l; 10.2 =0;3;0;1; 10.3 =2;3;0 1; .4 =0 i;2 1; 10.5 =2;l;2;l; 10.6 =0;3;2;1; 10.7 =2;3;2 1; .8 =0 1;0 3; 10.9 =2;1;0;3; 10.10 =0;3;0;3; 10.11 =2;3;0 3;12 =0 i;2 3; 10.13 =2;l;2;3; 10.14. =0;3;2;3; 10.15 =2;3;2 3; l.0.= l;l;0;l; 11.1 =3;1;0;1; 11.2 = 1;3;0;1; 11.3 =3;3;0;1;
11.4 = 1;1;2 1 11.5 =3;1;2;1 11.6 = 1;3;2;1 11.7 =3;3;2;1
11.8 = 1;1;0 3 11.9 =3;l;0;3 11.10 = 1;3;0;3 11.11 =3;3;0;3
11.12 = l;l:2 3 11.13 =3;l;2;3 11.14 = l;3;2;3 11.15 =3;3;2;3
12.0 =0;0;1 1 12.1 =2;0;l;l 12.2 =0;2;1;1 12.3 =2;2;1;1
12.4 =0;0;3 1 12.5 =2;0;3;1 12.6 =0;2,3;1, 12.7 =2;2;3;1
12.8 =0;0;1 3 12.9 =2;0;1;3 12.10 =0;2;1;3; 12.11 =2;2;1;3
12.12 =0;0;3 3 12.13 =2;0;3;3 12.14 =0;2;3;3; 12.15 =2;2;3;3
13.0 = I;0;1 1 13.1 =3,0; l;l 13.2 = 1;2;1;1 13.3 =3;2;1;1
13.4 = 1;0;3 1 13.5 =3;0;3;1 13.6 = 1;2;3;1 13.7 =3;2;3;1
13.8 = 1;0;1 3 13.9 =3;0;l;3 13.10 = l;2;l;3 13.11 =3;2;1;3
13.12 = 1;0;3 3 13.13 =3;0;3;3 13.14 = 1;2;3;3 13.15 =3;2;3;3
14.0 =0;1;1 1 14.1 =2;1;1;1 1.4.2 =0;3;l;l 14.3 =2;3;l;l
14.4 =0;l;3 1 14.5 =2;1;3;1 14,6 =0;3;3;1 14.7 =2;3;3;l
14.8 =0;1;I 3 14.9 =2;1;1;3; 14.10 =0;3;1;3 14.11 =2;3;1;3
14,12 =0; 1 ;3 3 14.13 =2;1;3;3; 14.14 =0;3;3;3 14.15 =2;3;3;3
15.0 = l;l;l 1 15.1 =3;1;1;1 15.2 = l;3;l;l 15.3 =3;3;1;1
15.4 = 1;1;3 1 15.5 =3;1;3;1 15.6 = 1;3;3;1 15.7 =3;3;3;1
15.8 = 1-1-1 3 15.9 =3;1;1;3 15.10. =1;3;l;3 15.11 =3;3;1;3
15.12 = 1;1:3 3 15.13 =3;l;3;3 15.14. = l;3;3;3. 15.15 =3;3;3;3
By using the table of all 16 truth functions of the operator and the table showing all 256 computational values of the operand, produced can be combinations of all 4096 logic operations in the universal propositional calculus.
Universal prepositional calculus
Propositional calculus is the term for the logic procedure whereby in a logic operation a logic operator as the truth function of a proposition is connected and placed into a certain relationship with operands as computational values of two propositions, this producing a result that is the logic function of the resulting proposition.
Example of performing a universal propositional calculus:
Operator: (6) = :0: 1:2:3 Operands: 2.8. = 0:1 ;0;2; Result: 10. = 010 1
(6) = :0:l:2:3 :0: 1:2:3 :0: 1:2:3
2.8. = 0;1;0;2; 0;1;0;2; 0; 1 ;0;2;
10. = 01 01
Firstly entered are values of the operator (6) = 0: 1 :2:3, whereafter below these written are values of the operands 2.8. = 0;1;1;2. After this, the operand digits corresponding to the operator digits with lines are also added lines 2,8. = 0;1;0;2;. Finally, below the operand digits written are the digits 1, and if the operand digits have a line, written under these are the digits 0. Thus obtained four-digit binary number 10 = 0101 is the result of the mathematical operation presenting logic function of the obtained proposition.
Examples of performing universal computational calculi of propositions by writing under in the horizontal and the vertical ways:
( 9 ) = :0:J_:2:3 ( 10 ) = :0: 1:2:3 ( 3 ) = :0:1 :2:3 :0: 1:2:3 3.10.= J_;3;0;2; 3.10. = 1;3;0;2; 3.10. = 1;3;0;2; 1;3;0;2;
6. = 0 1 1 0 3. = 1 1 00 5. = 1 0 1 0 1 00 1
(9)13.1 =3. (10)13.1 13. (3)13.1 14. (6)13.1.
:0 3; 1 01 3; 1 :0 3 0 :0I 3;l
:ll 0; 1 1 0;l 0 :1 0 1 :l 0;l
:2I l;l 0 21 1; 1 :2I 1 1 :2 1;
:3 1:1 0 3 1; 1 :3I 1 1 :3I 1:
Any truth function of the operators 0th - 15th can be connected with any one of the 256 possible operand computational value combinations into the logic operation's propositional function, creating thereby 4096 different operations in the propositional calculus.
Achieving the universal computational harmony enables unlimited combining of all logic propositions and creating complex logic computational operations. In order to be in agreement with modern symbolic logic calculi, writing of the universal symbolic logic symbols is to be adjusted to writing of the logic algebra:
(14)10.12.→ 10.(14)12. (8)12.10. -→ 12.(8)10. (7)10.12.→ 10.(7)12. (14)5.3.→ 5.(14)3.
Examples of obtaining some Boolean algebra theorems in the new universal symbolic logic writing:
Commutativity: AvB = BvA 10.(14)12. = 12.(14)10.
14. 14.
Commutativity: ΑΛΒ = ΒΛΑ 10.(8)12. = 12.(8)10.
De Morgan law: AAB = AvB 10.(7)12. = 5.(14)3.
7. 7.
Associativity: ((AAB)AQ = (AA(BAQ) [( 10.(8) 12.)(8) 15.] = [ 10.(8)( 12.(8) 15.)]
8. (8)15. = 10.(8) 12.
8. 8.
Where in a logic expression there are several logic operators, they are performed in the following order: 1. NO, 2. AND, 3. OR, and where in the expression there are brackets, expressions in the brackets are dealt with first.
Universal logic circuits
Electronic logic circuits are controlled by electricity, where they react to powered and not powered statuses. Operating certain logic circuits can be described with an electric circuit where various operations with pulses are performed by electric switches.
Logic gates are names for basic logic circuits having at their inputs one or two pulse logic values, and at their outputs just one pulse logic value.
The logic gate NO and the logic gate YES are names of logic circuits that have one pulse logic value each at input and output. The logic gates NO, as the logic pulse exchangers, at the input have electric pulse values of one of the 16 basic logic proposition, whereas at the output they have pulse values opposite to the input ones. The logic gates YES, as the logic pulse amplifiers, both at the inputs and the outputs have the same electric pulse values of one of the 16 basic logic propositions.
Logic gates with two inputs correspond to the logic functions of the 16 basic logic propositions, wherefore at two inputs they have electric pulses of values of two logic values, two operands, subjected to the operation of electric pulses of one logic value, one operator; at the output they have electric pulses resulting from the logic operation and representing the circuit's logic functions.
Basic logic circuits are technically obtained with the help of the pulses of the 16 logic values, 16 basic logic propositions. This means that at the universal logic circuit's two inputs there may be combinations of 16 pulse values of the first input and 16 pulse values of the second input, that is, 256 possible input combinations. When 256 input pulse combinations of two operands are subjected to acting of 16 different pulse combinations of one operator, obtained are 4096 performances of 16 universal logic circuits having two inputs and one output. If these logic circuits are further added 32 logic circuits having one input and one output, obtained are 4128 variations of 16 basic universal logic circuits, as components of complex integrated circuits.
Universal logic circuits, unlike logic circuits presented by electric switches connected in an electric circuit in series: logic function AND, or in parallel: logic function OR, have a different electric switches structure, that in the electric circuit, by means of pulses, can produce each of the 16 logic function pulse values.
In this invention, universal logic circuits comprise the construction of electric switches with four power lines, designed so that the first, lower, part of the switch, marked X, to which the power source is connected, acts as the operator, and the second, upper, independent part of the switch, marked Y, has at its front part the computational value of the operand, and at the back, output part has the pulse result. By connecting the electric switches X and Y into a unique multilayer unit, the electric circuit is closed and obtained are multilayer universal circuits with four power lines, corresponding to certain logic functions, applicable as connectors in the complex integrated electronic technology.
Brief list of illustrations
The illustrations included in this description and making part of the invention illustrate the above described best embodiment of the invention, helping in explaining the invention's basic principles.
Fig. 1 Perspective view of the multilayer universal logic circuit, designed in line with the described invention.
Fig.2 Perspective view of the lower part of the universal logic circuit, making the electric switch marked X.
Fig.3 Perspective view of the upper part of the universal logic circuit, making the electric switch marked Y.
Fig.4 Electric diagram of the universal logic circuit AND.
Fig.5 Electric diagram of the universal logic circuit OR.
Fig.6 Electric diagram of the logic circuit exchanger AND.
Fig.7 Electric diagram of the logic circuit amplifier OR. Detailed description of an invention embodiment
Here follow details of the assumed invention embodiment, an example of which is illustrated by the attached illustrations.
Knowledge of the new way of writing down universal binary number digits, in the new binary numeric system, where a binary number is determined by the position of the digits one, 1, and does not depend on the amount of the digits zero, 0, makes fundamentals for understanding and performing of universal logic functions.
The basic logic operations are simple and consisting of one or two incoming propositions, the operands, subjected to a logic operation by means of logic function of one proposition, the operator, and at the output having a single proposition logic function as the logic operation result. By engaging basic logic operations and using the new, universal symbolic language, universal logic functions can be made and multilayer universal logic circuits 20 can be constructed.
The multilayer universal logic circuit 20, as an electronic circuit, enables performing logic operations by electric pulses. The Figures I, 2 and 3 show that the universal logic circuit 20, consists of the lower electric switch, marked X, 22, and the upper electric switch, marked Y, 36, thus being a multilayer unit.
As presented in the Figure 2, the lower independent part of the multilayer universal logic circuit 20, which makes the electric switch X 22, consists of the front input part 24, the back output part 26, and four power lines, numerically presented as the power line 0 - 28, the power line 1 - 30, the power line 2-32 and the power line 3 - 34. The front input part 24 of the electric switch marked X 22, consists of four power lines 28, 30, 32 and 34, to which the power source is connected. Each of inputs of the power lines 28, 30, 32 and 34, can be open or closed for electric current flow, which provides 16 different combinations of constructions of the front input parts 24 of the electric switches marked X 22, functioning as operator in the multilayer universal logic circuit 20.
0 = , 1.= + ---, 2.= - + --, 3.= + + --, 4.= -- + -, 5.= + - + -,
6 = - + + -, 7 = + + + -, 8.= - - - +, 9 = + - - +, 10.= - + -+, 11.= + + - +, 12.= -- + +, 13.= + - + +, 14.= - + + +, 15.= + + + +.
The back output part 26, of the electric switch marked X 22, consists of outputs of the power lines 28, 30, 32 and 34, each power line output being divided into four fields that can be of one of two statuses: either all four powered or all four not powered. This way fields of the power lines 28, 30, 32 and 34 in the multilayer logic circuit 20 provide power to four positions of the power lines 42, 44, 46 and 48 of the front input part 38 of the electric switch marked Y 36.
As presented in the Figure 3, the upper independent part of the multilayer logic circuit 20, that is the electric switch marked Y 36, consists of the front input part 38, the back output part 40 and the power lines 42, 44, 46 and 48. The front input part 38 of the electric switch marked Y 36 consists of four positions, 0, 1, 2, 3, on each of the power lines 42, 44, 46 and 48. Only one of the positions, either 0 or 1 or 2 or 3, in each of the four power lines 42, 44, 46 and 48 corresponds to the sum of
the two operands' given binary numeric values, this resulting in 256 combinations at the four positions, where the positions are connected to the fields. This is possible since all the power lines 42, 44, 46 and 48 at their positions 0, 1, 2 and 3, cross all the power lines 28, 30, 32 and 34 with all their fields 0, 1 , 2 and 3, so that all the power lines 42, 44, 46 and 48 can be connected to the same power line, either 28 or 30 or 32 or 34, but each of them can also be connected to another power line.
Connecting the front input part 38 of the electric switch marked Y 36, through the four positions into 256 combinations, at four fields of 16 different electric switches marked X 22, enables electric pulses flow to the back output part 40 of the electric switch marked Y 36, in various combinations. This means that each of the four power lines, 42, 44, 46 and 48, in this way can be powered or not powered, this resulting in 16 possible pulse combinations that, as the operation result, make universal logic functions of the multilayer universal logic circuits 20.
By closing the electric circuit, by means of the electric pulses the multilayer universal logic circuits 20 perform their functions as this is presented in the Figures 4 and 5.
When the 4096 combinations of the computing logic operations to perform the 16 basic universal logic functions, is added the 16 logic operation combinations to perform the exchanger universal logic functions, Figure 6, and 16 logic operation combinations to perform the amplifier universal logic functions, Figure 7, achieved are 4128 possible logic operation combinations to perform 16 universal logic functions that correspond to the universal logic gates 20, 50 and 52, that make elements for in series and layered connecting at building of complex integrated electronic circuits that perform complex mathematic logic operations.
Invention application
This way, the invention enables practical, permanent and useful constructions of basic logic circuits that can be produced economically, and include essential improvements relative to the previously known logic circuit products of this type.
Connecting basic universal logic circuits into a functional unit enables building of complex multilayer integrated electronic circuits.
Professionals will find it obvious that numerous modifications and changes in the logic circuits after this invention are possible, without leaving the scope and the spirit of the invention.
List of the references used
20 - Multilayer universal logic circuits with two inputs and one output, made with four power lines.
22 - Lower independent part of the logic circuit, that makes the electric switch marked X, made with four power lines.
24 - Front, input part of the electric switch X, with four power lines.
26 - Back, output part of the electric switch X, with four power lines.
28 - Power line of the electric switch X, numerically presented as zero, with four fields 0 at the output.
30 - Power line of the electric switch X, numerically presented as one, with four fields 1 at the output.
32 - Power line of the electric switch X, numerically presented as two, with four fields 2 at the output.
34 - Power line of the electric switch X, numerically presented as three, with four fields 3 at the output.
36 - Upper independent part of the logic circuit, that makes the electric switch marked Y, made with four power lines.
38 - Front, input part of the electric switch Y, with four power lines.
40 - Back, output part of the electric switch Y, with four power lines.
42 - Power line of the electric switch Y, with four positions, 0, 1, 2, 3, at the input.
44 - Power line of the electric switch Y, with four positions, 0, 1,2, 3, at the input.
46 - Power line of the electric switch Y, with four positions, 0, 1,2, 3, at the input.
48 - Power line of the electric switch Y, with four positions, 0, 1, 2, 3, at the input.
50 - Exchanger universal logic circuit, having one input and one output, made with four power lines.
52 - Amplifier universal logic circuit, having one input and one output, made with four power lines.
Claims
1. Multilayer universal logic circuits (20) corresponding to universal logic functions, wherein they are made with four power lines; and the multilayer universal logic circuits (20) consist of electric switches marked X (22) and electric switches marked Y (36).
2. Circuits as claimed in Claim 1, wherein the said electric switches marked X (22) are made with four power lines, corresponding to lower parts of the multilayer logic circuits (20), and consist of front input part (24), back output part (26) and power lines (28), (30), (32), (34); where the said electric switches marked X (22) through their power lines (28), (30), (32), (34), each line having four fields at its output part, are connected to four positions of the power lines of the electric switches marked Y (36).
3. Circuits as claimed in Claim 1, wherein the said electric switches marked Y (36) are made with four power lines corresponding to upper parts of the multilayer universal logic circuits (20), and consist of front input part (38), back output part (40), and power lines (42), (44), (46), (48); where the said electric switches marked Y (36), through their power lines (42), (44), (46), (48), each line at its input part having four numeric positions 0, 1, 2, 3, are connected in various combinations to four fields of the power lines of the electric switches marked X (22).
4. Circuits as claimed in Claim 1, wherein universal logic circuits (50) correspond to functions of pulse value exchanger of the universal logic circuits (20); they are made with four power lines, and consist of one input part and one output part; where at the said four-power input part they have a certain pulse value, and at the output four-power part they have a modified pulse value that has the pulse value opposite to the input pulse values; normally they are made in integrated technology.
5. Circuits as claimed in Claim 1, wherein universal logic circuits (52) correspond to functions of pulse value amplifier of the universal logic circuits (20); wherein they are made with four power lines, and consist of one input part and one output part; where the said four-power input part and the said four-power output part have the same pulse value, and serve as pulse amplifiers; normally they are made in the integrated technology.
6. Circuits as claimed in Claims 1, 4 and 5, wherein complex multilayer logic circuits correspond to functions of complex mathematic logic operations, they are made with four power lines, and where the basic universal logic circuits (20), (50) and (52) make elements for building functional electronic units of complex logic circuits; normally they are made in the integrated technology.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| HRP20140883A HRP20140883A2 (en) | 2014-09-16 | 2014-09-16 | Multilayer universal logic circuits |
| HRP20140883A | 2014-09-16 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| WO2016042348A1 true WO2016042348A1 (en) | 2016-03-24 |
Family
ID=54345533
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| PCT/HR2015/000015 WO2016042348A1 (en) | 2014-09-16 | 2015-09-10 | Multilayer universal logic circuits |
Country Status (2)
| Country | Link |
|---|---|
| HR (1) | HRP20140883A2 (en) |
| WO (1) | WO2016042348A1 (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5157618A (en) * | 1988-03-10 | 1992-10-20 | Cirrus Logic, Inc. | Programmable tiles |
| EP0748052A1 (en) * | 1995-06-07 | 1996-12-11 | International Business Machines Corporation | Continuous address structure with folding |
| US7394287B1 (en) * | 2007-05-21 | 2008-07-01 | Altera Corporation | Programmable logic device having complex logic blocks with improved logic cell functionality |
| US20110085662A1 (en) * | 2009-10-14 | 2011-04-14 | Chaologix, Inc. | High utilization universal logic array with variable circuit topology and logistic map circuit to realize a variety of logic gates with constant power signatures |
-
2014
- 2014-09-16 HR HRP20140883A patent/HRP20140883A2/en not_active Application Discontinuation
-
2015
- 2015-09-10 WO PCT/HR2015/000015 patent/WO2016042348A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5157618A (en) * | 1988-03-10 | 1992-10-20 | Cirrus Logic, Inc. | Programmable tiles |
| EP0748052A1 (en) * | 1995-06-07 | 1996-12-11 | International Business Machines Corporation | Continuous address structure with folding |
| US7394287B1 (en) * | 2007-05-21 | 2008-07-01 | Altera Corporation | Programmable logic device having complex logic blocks with improved logic cell functionality |
| US20110085662A1 (en) * | 2009-10-14 | 2011-04-14 | Chaologix, Inc. | High utilization universal logic array with variable circuit topology and logistic map circuit to realize a variety of logic gates with constant power signatures |
Also Published As
| Publication number | Publication date |
|---|---|
| HRP20140883A2 (en) | 2016-03-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bowen et al. | Safety-critical systems, formal methods and standards | |
| Brown et al. | Fundamentals of digital logic with Verilog design | |
| LEWIN | Design of logic systems | |
| Kilhamn et al. | Algebraic thinking in the shadow of programming | |
| Cavanagh | Verilog HDL: digital design and modeling | |
| Page | A practical introduction to computer architecture | |
| Cavanagh | Sequential logic: analysis and synthesis | |
| De Mol et al. | Haskell before Haskell: an alternative lesson in practical logics of the ENIAC | |
| Pereira et al. | A basic processor for teaching digital circuits and systems design with FPGA | |
| Szpyrka et al. | Tools and methods for RTCP-nets modeling and verification | |
| WO2016042348A1 (en) | Multilayer universal logic circuits | |
| Maruoka | Concise guide to computation theory | |
| Rizvi | Microcontroller programming: an introduction | |
| Cavanagh | Verilog HDL design examples | |
| Harrison et al. | Verifiable security templates for hardware | |
| Ivanova et al. | An Approach to Introduce the Concept of Lexical Analysis through FPGA Based Finite State Machines | |
| Cavanagh | Sequential Logic and Verilog HDL Fundamentals | |
| Yousef | ECE 251-DIGITAL DESIGN | |
| Borodzhieva et al. | FPGA Implementation of Boolean Functions Using Decoders and Logic Gates | |
| Borodzhieva et al. | Synthesis, Analysis and Implementation of Partial Counters Using Integrated Circuits | |
| Takagi et al. | Computational power of nondeterministic ordered binary decision diagrams and their subclasses | |
| Savolainen | Digital logic simulator comparison in educational purpose | |
| Liu et al. | MIPS CPU development with analogous teaching method for experimental teaching of digital logic and computer organization | |
| George et al. | Interactive Learning Tool for Static-1 Hazard Identification in Digital Electronic Circuits | |
| Moller et al. | Boolean Algebras and Circuits |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| 121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 15784452 Country of ref document: EP Kind code of ref document: A1 |
|
| NENP | Non-entry into the national phase |
Ref country code: DE |
|
| 122 | Ep: pct application non-entry in european phase |
Ref document number: 15784452 Country of ref document: EP Kind code of ref document: A1 |