1 / 11

Combinational Circuits

Combinational Circuits. Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009. +. HALF-ADDER. x. y. C. S. • Half-adder : Performs the most basic digital arithmetic operation, that is, the addition of two binary numbers .

tevy
Download Presentation

Combinational Circuits

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Combinational Circuits Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009

  2. + HALF-ADDER x y C S • • Half-adder: Performs the most basic digital arithmetic operation, that is, the addition of two binary numbers. • The half-adder requires two outputs because the sum 1 + 1 is binary 10. The two inputs are: • called S (for sum) and C (for carry out).

  3. From the truth table write the Boolean function outputs for the sum S and the carry out C: S=x`y +xy` (Exclusive OR) C=xy (AND) (Logic diagram) (Truth table for half-adder) x y C S 0 0 0 0 0 1 0 1 1 0 0 1 1 1 1 0

  4. Here is a proof of the Exclusive OR identity using truth table.

  5. FULL-ADDER • To implement an arithmetic adder for multiple-bit inputs, we need to treat the carry out from the lower bit as a third input ( it becomes carry in for the current bit) in addition to the two input bits at the current bit position. X1 Y1 Z1 S 1 C1 X0 Y0 Z0 S0 C0 +

  6. x y z c s 0 0 0 0 0 0 0 1 0 1 0 1 0 0 1 0 1 1 1 0 1 0 0 0 1 1 0 1 1 0 1 1 0 1 0 1 1 1 1 1 Full- Adder It adds 3-bits, it has 3-inputs and 2-outputs We will use x, y and z for inputs and s for sum and c for carry are the two outputs. The truth table

  7. 00 01 11 10 0 0 1 0 1 1 1 0 1 0 Full Adder S = x`y`z + x`yz` + xy`z` + xyz k-map for s y z x

  8. Full Adder

  9. 00 01 11 10 0 0 0 1 0 1 0 1 1 1 K-map on C y z x C=yz+xz+xy But we would like to use the previous logic gate XOR

  10. K-map on C We can write C = x`yz + xy`z + xyz + xyz` = z(x`y + xy`) + xy(z+z`) = z (x  y) + xy (x  y) is already used for the sum S

  11. Full Adder Putting them together we get: S= x  y  z C= z (x  y) + xy The logic diagram for the full adder

More Related