Need help badlyabout full adder circuit

  • Context: Engineering 
  • Thread starter Thread starter marlboro73
  • Start date Start date
  • Tags Tags
    Adder Circuit
Click For Summary
SUMMARY

The discussion revolves around solving a full adder circuit problem, specifically focusing on deriving output expressions for sum and carry from a truth table. Participants are tasked with simplifying the sum using Boolean algebra to an XOR gate and deriving the carry expression. Additionally, the discussion emphasizes the importance of demonstrating attempts at solutions before seeking help, as outlined in the Physics Forums guidelines.

PREREQUISITES
  • Understanding of full adder circuits and their truth tables
  • Knowledge of Boolean algebra and simplification techniques
  • Familiarity with XOR gates and their properties
  • Basic understanding of De Morgan's laws in logic
NEXT STEPS
  • Research how to derive output expressions from truth tables for digital circuits
  • Learn Boolean algebra techniques for simplifying logical expressions
  • Study the properties and applications of XOR gates in digital logic design
  • Examine De Morgan's laws and their proofs for multiple input variables
USEFUL FOR

Students and educators in electrical engineering, particularly those studying digital logic design and circuit analysis, will benefit from this discussion.

marlboro73
Messages
1
Reaction score
0
hey guys.. can u pls help me solve this problem. i have some answers but I am just not really sure if they're right. pls help me. my exam starts in a few hours:frown:

here's the problem:


The truth table of a full adder circuit is given below, where A and B are two inputs and Cin is the carry from the previous bits.

http://img513.imageshack.us/img513/8765/truthtableeu5.th.jpg http://g.imageshack.us/thpix.php

i) Get the output expression for sum and carry from the truth table.

ii) use Boolean Algebra to simplify Sum only to an XOR gate

iii) Derive the expression for the carry and simplify it using Boolean algebra.
iv) Draw the full circuit showing the inputs, sum and the carry.

e) Using Boolean algebra and De- Morgan’s or otherwise prove the property
f) State and prove De- Morgan’s law for three input variables
 
Last edited by a moderator:
Physics news on Phys.org
Welcome to PF forums! You will find there are many fascinating useful discussions here on all kinds of topics (most of them science related).

That's an interesting question. It is good, that you have worked out some soln's to your problem. Before we can help you, you need to post your thoughts, a sequence of how you attempted a solution. Then ask questions regarding your attempt.. You probably want to reread this https://www.physicsforums.com/showthread.php?t=94388"to help guide you on posts. It is also listed at the top of this homework area under "why hasn't anybody answered my question".
 
Last edited by a moderator:

Similar threads

Engineering Selecting operation code for arithmetic circuit that uses the least amount of transistors and other inquiry
  • · Replies 4 ·
Replies
4
Views
2K
Engineering Help with my Karnaugh map circuit: it does not work
  • · Replies 4 ·
Replies
4
Views
2K
Engineering 2-bit Bin Full Adder Truth Table Derivation
  • · Replies 4 ·
Replies
4
Views
5K
Engineering Doubt about BCD Sum circuit using full adders
  • · Replies 1 ·
Replies
1
Views
3K
Engineering Arithmetic Circuits & Full Adders
  • · Replies 1 ·
Replies
1
Views
3K
Engineering How to Design a Circuit for Calculating Hamming Distance?
  • · Replies 1 ·
Replies
1
Views
3K
Engineering A question in building a circuit using 2 full adders
  • · Replies 20 ·
Replies
20
Views
5K
Engineering A question in building a circuit using 2 full adders
  • · Replies 1 ·
Replies
1
Views
2K
BCD to 7 segment display logic minimisation
  • · Replies 14 ·
Replies
14
Views
5K
Engineering Full adder circuit using NAND v NOT, AND, OR v PLA logic
  • · Replies 1 ·
Replies
1
Views
5K