Describe about full adder, Computer Engineering

Assignment Help:

Q. Describe about full adder?

Let's take full adder. For this other variable carry from previous bit addition is added let'us call it 'p'. Truth table and K-Map for this is displayed in figure below.

1448_Describe about full adder.png

1500_Describe about full adder1.png

Figure: Full-adder implementation

Three adjacencies marked a,b,c in K-Map of 'C' are

a)

x  y¯  p  + x y p 

  =   x p ( y +  y¯ ) 

  =   x p 

b)

x y p  + x y  p¯ 

  =   x y

c)

  x¯ y p + x y p  

  =   y p

So C = x p + x y + y p

In case of K-Map for 'S' there are no adjacencies. So

       S =  x¯y¯ p +  x¯yp¯  + xy¯p¯ + x y p

Until now we have determined about addition of bit only however what will happen if we are in fact adding two numbers. A number in computer can be 4 byte it implies that 32 bit long or even more. Even for these cases fundamental unit is full adder. Let's see (e.g.) how can we create an adder that adds two 4 bit numbers. Let's presume the numbers are:  x3 x2 x1 x0 and y3 y2 y1 y0 here xi and yi (i = 0 to 3) express a bit. 4-bit adder is displayed in figure.

453_Describe about full adder2.png

Figure:  4-bit Adder

Overall sum is expressed by S3 S2 S1 S0 and over all carry is C3 from 4th bit adder. The main feature of this adder is that carry of every lower bit is fed to subsequent higher bit addition phase it means that addition of next higher bit has to wait for previous stage addition. This is known as ripple carry adder. Ripple carry becomes time consuming when we are going for addition of let's say 32 bit. Here most important bit it implies that 32nd bit has to wait until addition of first 31 bits is complete. 

Consequently a high-speed adder that produces input carry bit of any stage directly from input to previous stages was created. These are known as carry look ahead adders. In this adder carry for several stages can be produced directly by logic expressions for example:

C0   = x0 y0

C1   = x1 y1 + (x1 + y1) C0

Complexity of look ahead carry bit raises with higher bits. However in turn it generates the addition in a very small time. Carry look ahead becomes increasingly complex with increasing numbers of bits. So carry look ahead adders are generally implemented for adding chunks of 4 to 8 bits and carry is rippled to subsequent chunk of 4 to 8 bits carry look ahead circuit.


Related Discussions:- Describe about full adder

Various interconnection networks-fully connected, Various Interconnection N...

Various Interconnection Networks Fully connected: This is the most controlling interconnection topology.In this each node is directly linked to all other nodes. The shortcomi

Explain working of digital versatile disk, Q. Explain working of Digital Ve...

Q. Explain working of Digital Versatile Disk? With the capacious digital versatile disk (DVD) electronics industry has ultimately found an acceptable replacement for videotape

Routines which handle dynamic processes, Q. Routines which handle dynamic p...

Q. Routines which handle dynamic processes? number of routines which handle dynamic processes:  int pvm_joingroup( char *group ) Enrolls calling process in a na

What is closed system, Closed System: It's isolated from environment influ...

Closed System: It's isolated from environment influences. It operates on factors within System itself. It is also described as a System which involves a feedback loop, a control e

Illustrate the purchase consummation activity, Illustrate the Purchase Cons...

Illustrate the Purchase Consummation activity? Purchase Consummation: This model lists three activities in the purchase consummation phase: • Receipt of product. • Pl

What is middleware net dynamics, NetDynamics Application Server was the pri...

NetDynamics Application Server was the primary Java-based integrated software platform. The product was developed by NetDynamics Inc. As Java became the dominant development langua

Illustrate the advantages of register transfer, Register Transfer We as...

Register Transfer We assign computer registers by capital letters to denote function of the register. Such as, the register which holds an address for memory unit is usually

What are conversion routines, What are conversion routines? Non-standa...

What are conversion routines? Non-standard conversions from present format to sap internal format and vice-versa are executed with so known as conversion routines.

Properties of e-cash, Properties: 1.  Monetary Value: Monetary value mu...

Properties: 1.  Monetary Value: Monetary value must be backed by either cash, bank - authorized credit cards or bank certified cashier's cheque. 2.  Interoperability: E-cash

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd