Design a 1-bit full adder, Computer Engineering

Design a 1-bit full adder:

Verify your design

Use the 1-bit full adder to build a 4-bit adder with Ci=0

Verify: 1 + 4, and 9 + 9

Sram design:

Cell: p - 0.5/0.045; np - 1/0.1; nd - 2/0.05

Do: write "1" -> cell

Read à "1"

Write "0" -> cell

Read -> "0"

 Lab Report

1. Brief descriptions of your design method and circuits behavior, verification procedure.

2. simulations

4. Draw conclusion

Posted Date: 3/19/2013 6:23:43 AM | Location : United States

Related Discussions:- Design a 1-bit full adder, Assignment Help, Ask Question on Design a 1-bit full adder, Get Answer, Expert's Help, Design a 1-bit full adder Discussions

Write discussion on Design a 1-bit full adder
Your posts are moderated
Related Questions
How to use ActiveX Control in .Net ? ActiveX control is a special type of COM component that handles a User Interface. Using ActiveX Control in your .Net Project is even simple

What are the conditions that have to be met for a condition to be an invariant of the class? Ans) ? The condition should hold at the end of each constructor. ? The conditi

Explain 100 line exchange with two-motion line finders. Design: In such design, here are 24 line finders. When any of the 100 subscribers has to find access to any of the 24

Write a program which collects in data samples from a port at 1 ms interval. The upper 4 bits collected data same as mastered and stored in an array in successive locations. ; R

The objective of this practical assignment is to use the POSIX environment to write a program that simulates the supply and demand between three processes: warehouse, factory and r

Disadvantages of Address translation: Disadvantages are following: A program that is too large to be held in a part needs some special design, that called overlay

How can a function return a pointer to its calling routine? The general form of a function is: type_specifier function_name(parameter list) { body of function; }

Determine the block diagram of bcd adder To add 0110 to binary sum, we use a second 4-bit binary adder. The two decimal digits, together with input-carry, are first added in to

Explain pass-1 algorithm of passes used in two-pass assembler? Pass I: (i) Separate the symbol, operand fields and mnemonic opcode (ii) Make the symbol table (iii)