How does one form an equation for adder/subtractor?

  • Thread starter Thread starter AilingLore21
  • Start date Start date
  • Tags Tags
    Form
Click For Summary
SUMMARY

The discussion focuses on forming equations for adder and subtractor circuits, specifically for a 2-bit and 3-bit binary integer addition. Participants emphasize the importance of creating truth tables for each output based on inputs and utilizing Karnaugh maps (K-maps) to derive logic diagrams. Key resources mentioned include slides on half-adders and full-adders, as well as various online tutorials that explain the construction of truth tables and the logical gate combinations necessary for multi-bit operations.

PREREQUISITES
  • Understanding of K-maps for simplifying Boolean expressions
  • Familiarity with truth tables for binary operations
  • Knowledge of half-adders and full-adders in digital logic design
  • Basic concepts of carry and borrow in addition and subtraction
NEXT STEPS
  • Study the construction of truth tables for multi-bit binary addition and subtraction
  • Learn how to apply K-maps for optimizing logic circuits
  • Explore the design and implementation of half-adders and full-adders
  • Research the logical gate combinations used in binary arithmetic circuits
USEFUL FOR

Students and professionals in electrical engineering, digital circuit designers, and anyone interested in understanding binary arithmetic operations and logic circuit design.

AilingLore21
Messages
26
Reaction score
0
I understand the concept of Kmaps, Quine method and forming a logic diagram but I'm lost at forming an equation from an addition and subtraction equation

For example: a 2 bit plus a 3 bit binary integer. I would have a 4 bit sum and 3 carries. However, how does one form the appropriate equation in order to convert it to a proper logic circuit?
 
Engineering news on Phys.org
AilingLore21 said:
I understand the concept of Kmaps, Quine method and forming a logic diagram but I'm lost at forming an equation from an addition and subtraction equation

For example: a 2 bit plus a 3 bit binary integer. I would have a 4 bit sum and 3 carries. However, how does one form the appropriate equation in order to convert it to a proper logic circuit?
Write a truth table for each output based on the inputs. Then do a K-map for each of the outputs and design the logic from the minterms... Can you show us what you have been reading about how to do this? :smile:
 
berkeman said:
Write a truth table for each output based on the inputs. Then do a K-map for each of the outputs and design the logic from the minterms... Can you show us what you have been reading about how to do this? :smile:

So these sites currently

:http://orimath.blogspot.com/2008/01/half-adder-full-adder-and-multiple-bit.html
http://www.electronics-tutorials.ws/combination/comb_7.html
http://www.allaboutcircuits.com/textbook/digital/chpt-9/full-adder/

Nobody explains how the truth table for multiple bits work. I assume they're half adders and full adders clumped together but how to form an equation from it? Like where did the AND gate come from? And why put the AND gate for the carries separately instead of putting it in one 3 input AND gate for the 3 bit addition?
 
Last edited:
AilingLore21 said:
Doesn't explain how subtraction works. What I don't get is why does three inputs of 1 yields an output of 1 carry and 1 sum?
The answer to both questions: Write up the addition and subtraction tables completely with carry and borrow. Then deduce the logical gate combination.
AilingLore21 said:
Nobody explains how the truth table for multiple bits work.
Oh, yes they do. Start with https://en.wikipedia.org/wiki/Truth_table
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
27K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
4K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 1 ·
Replies
1
Views
8K
  • · Replies 2 ·
Replies
2
Views
13K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
Replies
7
Views
35K
  • · Replies 14 ·
Replies
14
Views
5K