Written Assignment 3 - Shayan Rizvi Written Assignment 3...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Shayan Rizvi Written Assignment 3 11-29-11 1. 1-bit Half Adder 1-bit Full Adder 1-bit Carry look-ahead (CLA) Adder Where in the 1-bit CLA adder and The sum is represented the same for the one bit full adder and the one bit carry look- ahead adder. There are two XOR’s present and the three input variables are the same for each equation. The one bit half adder only differs in the sum by having only one XOR in the equation and the fact that there is no in the equation. The carry out is represented slightly different in all three of the equations. In the one bit half adder there is only one AND between and. For the one bit full adder there are three AND’s and two OR’s that bring together the three different input variables. Finally for the one bit CLA adder some minimizing is done and the variables and are used to represent an AND along with an OR operation respectively. The minimized one bit CLA adder equation is the same as the one bit full adder equation, just represented slightly different. 2.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2012 for the course CSE 2300 taught by Professor Stevechu during the Fall '11 term at Central Connecticut State University.

Page1 / 3

Written Assignment 3 - Shayan Rizvi Written Assignment 3...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online