Post by Eugene 2.0 on Sept 9, 2020 23:09:39 GMT
Representations of logical elements in a certain order to show working components of a computer or the other calculation mechanisms.
The adder can be represented as having three in's and two out's: two as current signals, plus an extra signal; S - as a sum of currents, and P as an extra value. For example, two "1's" being summed give "2", in Boolean is "10". The first digit shows a signal, and the other that it lacks.
Realisation of such the adder is to construct A, B, and C the truth table with all the values, and then accomodate it to the work, like this:
A+B = S, ABC = P, etc.
All the truth meaning lines in the table must response to the realisation of the signal sequences.
The adder can be represented as having three in's and two out's: two as current signals, plus an extra signal; S - as a sum of currents, and P as an extra value. For example, two "1's" being summed give "2", in Boolean is "10". The first digit shows a signal, and the other that it lacks.
Realisation of such the adder is to construct A, B, and C the truth table with all the values, and then accomodate it to the work, like this:
A+B = S, ABC = P, etc.
All the truth meaning lines in the table must response to the realisation of the signal sequences.