Can You Simplify a Parallel Adder SOP Expression Using Karnaugh Maps?

Click For Summary

Discussion Overview

The discussion revolves around simplifying a parallel adder Sum of Products (SOP) expression using Karnaugh Maps. Participants explore the relationship between inputs and outputs in the context of binary addition, particularly focusing on the logic behind the function F derived from the inputs ABCD.

Discussion Character

  • Technical explanation, Conceptual clarification, Homework-related

Main Points Raised

  • One participant presents an initial expression for F based on specific minterms and attempts to simplify it using a Karnaugh Map.
  • Another participant questions the correctness of the initial result by providing a specific input scenario (ABCD = 1111) to test the output.
  • A participant reflects on a previously incorrect formula for Si, indicating confusion and seeking further clarification.
  • One participant suggests focusing on the relationship between the output F and the inputs ABCD, treating it as a black box.
  • Another participant discusses the concept of "Excess-3" and clarifies its application, emphasizing the need to add 3 to the input for comparison.
  • A later reply expresses satisfaction with the resolution of the problem, indicating a shift in understanding.

Areas of Agreement / Disagreement

The discussion contains multiple viewpoints and approaches to the problem, with no clear consensus on the correctness of the initial expression or the best method for simplification.

Contextual Notes

Participants express uncertainty regarding the application of specific concepts like Excess-3 and the relationship between inputs and outputs, indicating potential limitations in their understanding of the problem.

Who May Find This Useful

Students and practitioners interested in digital logic design, particularly those working with binary addition and Karnaugh Map simplifications.

kukumaluboy
Messages
61
Reaction score
1
1zgerub.jpg


My working:
S3 = A
S2 = B
S1 = C'
S0 = D'

F = Sum-Minterm(0, 1, 2, 4, 5, 8) (Basically i find when is X smaller then Y)
Used Kmap to arrive at
A'C' + B'C'D' + A'B'D'

Am i correct?
 
Physics news on Phys.org
Did you check your result? If ABCD = 1111, what should F be?
 
Ok my formula was Si = Xi XOR Yi XOR C

That was wrong. Should be Ci. hmmmm

I need clue bro lol
 
Focus on the relationship between the output F and the inputs ABCD. In other words: treat the whole thing as a black box with inputs ABCD and output F.
 
So must i like do the excess-3 table and compare ab < cd values
 
"Excess-3", strictly speaking, operates on BCD (binary coded decimal) values. Since the input is not constrained to BCD, it's better to say "So must I like just add 3 to the input..."

Not making fun, just trying to make a fine point. And yes, then do the comparison.
 
yeayea! thank you man solved it lol. I was thinking it too complicatedly.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
2
Views
41K
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
Replies
3
Views
16K
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
3K