Previous Articles, “Computer History – How to Add Computers” and “Flip Flops – Basic Meter” We reviewed the add-ons and counters. We will now examine how to use these structural blocks to perform the multiplication.In the decimal system, we can multiply by 10 by adding 0 at the end of the number. For example, 4 with the addition of zero becomes 40, so 346 becomes 3460. We can extend it by adding 2 or 3 zeros to the multiplication by 100 or 1000.
In the binary system used in computers, one can multiply by 2 by adding a zero at the end of the number. Thus becoming 110 (2 + 4 = 6 decimals) 1100 (4 + 8 = 12 decimals). Similarly, we can add more zeros and multiply by 4,8,16 and so on (decimal). This is a form of multiplication, called the transformation process, in which each bit, 1 or 0, is moved to the next bit position, and zero is added to the position of the first bit.
Various techniques have been used to multiply the use of logical elements, as previously described in a logic scheme called a “black box” called a multiplier. In a more sophisticated logic graph, this will be combined with other “black boxes” such as additives, separators, square roots, and so on. to create the big “black box” (logical unit of calculation). The “activities” in this unit are not related to the general design of the computer. All the designer needs to know is that if he puts two numbers in the UMA and orders him to hit them, he will get a result.In the beginning, these boxes will actually consist of hollow tubes and, in a box, the size of your bedroom will be gradually improved, replaced and reduced, until all these days are suitable for a part. But the basic principles are the same.
If we analyze the concept of multiplication, we see it as a concept of repetition (we know that computers excel in this area). Take for example 2X4. It means taking 4 portions of 2 and adding them together, ie 2 + 2 + 2 + 2 = 8. Therefore, to use the computer multiplier, we can use our Viper method, as well as some counting methods, described in previous articles.
For example, we just watched 2X4, we would have a unique input multiplier of 2 (10 bits) going to a 4-bit snake. The output or the result of the ad will run around it to form the second entry of the advertiser.
The second number of digits to be multiplied, 4 (100 bits), sets the countdown from 4 to 1, with a number of pulses equal to one at each addition. Thus, the counter is “more than 1”, which is the condition by which the output of the adder is directed to its inputs. The initial addition will be 10 + 10 bits (2 + 2 decimals), or 100 bits.This result is returned to the input, the counters “more than 1” to add it to 10, give 110 bits. We are doing another 110 + 10 addition to get 1000 results.This time counts the counter at one and prevents the introduction of the snake. At the same time, it is permissible to output the result of the adder to become the result of the multiplier.
You can see how this simple example can be used in an upgraded version that can multiply multiple bits. All we need is more plugins, some logical gates to control them, and maybe throw it out in a little while, so do not mix them all! As we said before, when you talk in nanoseconds, you can do a lot of calculations very quickly.However, we will examine how negative numbers are represented in computers and how they handle very large numbers using something called Floating Point Arithmetic.