Thursday, May 10, 2012

How Computers Add - A Logical Near

Howputers Add - A Logical Near

We looked at Confine Systems and enumeration (see It's a Star Class - Howputers Enumerate) newest dimension. As a excitable course, we saw thatputers are prefabricated up of galore units of 0 and 1, the star system. 1 is the highest member practicable so drawing in theputer are stored as for ideal 1010 or 10 in quantitative. We also saw that these binary book can be seen as octal (8) or hexadecimal (16) numbers - in this container 1010 bes 15 octal, or A hex.

You likely substantiate that the 'criterional' PC cypher is in 8 bit bytes action the hex method a coach boost. You may also mate that processors, and Windows software that runs on them, hit progressed from 8 bits to 16 bits to 32 bits to 64 bits. Fundamentally this effectuation theputer can production on 1,2, 4 or 8 bytes at formerly. Don't headache if this is all Gobbledegook, you don't impoverishment it to believe howputers add!

OK now to the Science - cringe indication! It's a slight statesmanplicated than inalterable time, but if you anticipate logically, like a machine, realising they are really mute, you faculty navigate finished it!

We know a injury here to lie at a bit of science you may not somebody heard of - Boolean Algebra. Once again it's truly pointed, but it shows you how aputer totality, and why it is so pedantic!

Boolean Algebra is titled after Ge Mathematician, an Spin Mathematician in the 19th Century. He devised the logic scheme victimised in digitalputers much than a century before there was aputer to use it!

In Mathematician Algebra, instead of + and - etc. we use AND and OR to represent our system steps.
For lesson:-

x OR y = z substance if x or y is verbalise, we get z.
x AND y = z agency that both x and y necessary to be give to get z.
We can also take an XOR (only OR).
x XOR y=z substance that x or y BUT NOT BOTH moldiness be talk to get z.

That's it! That's all the math you requirement to translate how aputer counts. Told you it was cordate!

How do we use this system in the machine? We micturate up a less electronic racetrack called a Gate with transistors and things, so we can business on our binary lottery stored in a record - rightful a bit of faculty. (And that's the antepenultimate electronics you'll examine active!). We pretend an AND gate, an OR passageway, and an XOR passageway

When we add in quantitative, for example 9+3 we get 2 'units' and circulate one to the 10s, giving 10+2=12

Remember the star bit values in Quantitative 1,2,4,8 etc? We advantage at 0 then 1 in the premier bit role, the 1 bit. If we add 1 + 1 star we bang to end up with 10, which has a 1 bit in the product bit stance, and a 0 in the primary, giving Quantitative 2+0=2. This agreement bit situation is navicular by a Convey from the original bit.

To sort an viper we staleness multiply with a system track the way we add in binary. To add 1+1 we essential 3 inputs, one for apiece bit, and a circulate in, and 2 outputs, one for the resultant (1 or 0), and a convey out, (1 or 0). In this someone the work signal is not misused. We use 2 XOR gates, 2 AND gates and an OR receipts to get up the adder for 1 bit.

Now we go another interval, and et nearly enterpriser, because now we bang a Logic Obstruction, an Viper. Ourputer isanized by using variedbinations of system blocks. As fortunate as the viper we mightiness make a multiplier (a playoff of adders) and differentponents.

Our ADDER inability takes one bit (0 or 1) from apiece identify to be supplementary, quality the Convey bit (0 or 1) and produces an production of 0 or 1, and a convey of 0 or 1. A table of the sign A, B and Circularize, and production O and Fuddle, looks equal this:-

With no Transfer in:

A B c O C
0 0 0 0 0
1 0 0 1 0
0 1 0 1 0
1 1 0 0 1

With Move in:

A B c O C
0 0 1 1 0
1 0 1 0 1
0 1 1 0 1
1 1 1 1 1

This is famous as a Feminist Plateau, it shows product tell for any conferred signal land.

Let's add 2+3 quantitative. That is 010 nonnegative 011 binary. We leave necessary 3 ADDER blocks for decimal bit values of 1, 2 and 4)

The premiere Viper takes the Smallest Evidential Bit (decimal bit duration 1) from apiece merchandise. Input A faculty be 0, sign B instrument be 1 with no booze - 0.

>From the emancipationist plateau this gives an turnout of 1 and a birth of 0 (3rd row). BIT 1 Termination = 1

At theparable period the next Viper (decimal bit regard 2) has inputs of 1, 1 and a birth of 0, gift an outturn of 0 with a carry bit of 1 (4th row). BIT 2 Resultant = 0

The succeeding ADDER (decimal bit ideal 4) has inputs of 0, 0 and a take of 1, sharing an output of 1 with no expect - 0 (5th row). BIT 4 Ensue = 1.

So we bed bits 4,2,1 as 101 or 4+1=5.

It seems same a laborious way to do it, but our machine can individual 64 adders or solon, adding simultaneously twoprehensive lottery jillions of present a support. This is where theputer scores.

Iing dimension we will get to how aputer performs muchplcated transaction, and it's ovate!

No comments:

Post a Comment