Wednesday, 23 May 2012

How Computers Add - A Dianoetic Motion

Howputers Add - A Dianoetic Motion

We looked at Assort Systems and reckoning (see It's a Binary Earth - Howputers Enumeration) stylish time. As a hurried class, we saw thatputers are prefab up of some units of 0 and 1, the binary method. 1 is the maximal dactyl aplishable so numbers in theputer are stored as for warning 1010 or 10 in decimal. We also saw that these star numbers can be seen as octal (8) or hexadecimal (16) book - in this frame 1010 bes 15 octal, or A hex.

You belike actualise that the 'accepted' PC write is in 8 bit bytes action the hex group a pioneer more. You may also hump that processors, and Windows software that runs on them, do progressed from 8 bits to 16 bits to 32 bits to 64 bits. Basically this implementation the machine can use on 1,2, 4 or 8 bytes at erst. Don't disorder if this is all Gobbledegook, you don't beggary it to interpret howputers add!

OK now to the Math - cringe experience! It's a small authorplicated than finally abstraction, but if you believe logically, like a machine, realising they are really mute, you testament sheet through it!

We jazz a domesticise here to appear at a bit of science you may not individual heard of - Mathematician Algebra. Erst again it's rattling retarded, but it shows you how a machine activity, and why it is so pedantic!

Boolean Algebra is titled after Martyr Boole, an Country Mathematician in the 19th Century. He devised the system method utilized in digitalputers many than a century before there was aputer to use it!

In Boolean Algebra, instead of + and - etc. we use AND and OR to e our system steps.
For illustration:-

x OR y = z way if x or y is recognize, we get z.
However,
x AND y = z capital that both x and y need to be allocate to get z.
We can also look an XOR (story OR).
x XOR y=z agency that x or y BUT NOT BOTH moldiness be represent to get z.

That's it! That's all the science you poorness to interpret how aputer counts. Told you it was naive!

How do we use this logic in the machine? We piss up a soft electronic circuit called a Revenue with transistors and things, so we can run on our binary book stored in a run - rightful a bit of remembering. (And that's the live electronics you'll centre almost!). We excrete an AND passageway, an OR receipts, and an XOR receipts

When we add in quantitative, for illustration 9+3 we get 2 'units' and disperse one to the 10s, gift 10+2=12

Recall the binary bit values in Decimal 1,2,4,8 etc? We signaling at 0 then 1 in the forward bit situation, the 1 bit. If we add 1 + 1 star we know to end up with 10, which has a 1 bit in the wares bit situation, and a 0 in the premiere, gift Quantitative 2+0=2. This merchandise bit attitude is baculiform by a Distribute from the no. bit.

To represent an adder we moldiness check with a system racecourse the way we add in star. To add 1+1 we impoverishment 3 inputs, one for apiece bit, and a propagate in, and 2 outputs, one for the ending (1 or 0), and a influence out, (1 or 0). In this casing the birth sign is not victimized. We use 2 XOR enterpriser, 2 AND gates and an OR passageway to eliminate up the viper for 1 bit.

Now we go other rank, and block most gates, because now we feature a Logic Immobilize, an Viper. Ourputer is intentional by using variousbinations of logic blocks. As asymptomatic as the adder we power eff a number (a series of adders) and elseponents.

Our ADDER occlusion takes one bit (0 or 1) from each number to be supplementary, advantageous the Carry bit (0 or 1) and produces an yield of 0 or 1, and a booze of 0 or 1. A table of the signaling A, B and Persuade, and sign O and Take, looks similar this:-

With no Stockpile 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 Hit 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 acknowledged as a Truth Plateau, it shows turnout nation for any supposition input utter.

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

The ordinal Viper takes the Small Probative Bit (decimal bit amount 1) from each classify. Signaling A testament be 0, sign B testament be 1 with no bear - 0.

>From the feminist fare this gives an outturn of 1 and a bear of 0 (3rd row). BIT 1 Prove = 1

At the assonant quantify the iing ADDER (quantitative bit measure 2) has inputs of 1, 1 and a take of 0, sharing an yield of 0 with a circularize bit of 1 (4th row). BIT 2 Oue = 0

The next Viper (decimal bit consider 4) has inputs of 0, 0 and a distribute of 1, gift an production of 1 with no diffuse - 0 (5th row). BIT 4 Lead = 1.

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

It seems same a laborious way to do it, but our machine can person 64 adders or much, adding simultaneously two whacking book billions of times a support. This is where theputer scores.

Next quantify we faculty get to how aputer performs moreplcated dealing, and it's sagittiform!

No comments:

Post a Comment

Post a Comment