Design 2-to-1 Multiplexer Circuit from Truth Table for f

  • Thread starter Thread starter shamieh
  • Start date Start date
  • Tags Tags
    Multiplexer
Click For Summary
SUMMARY

The discussion focuses on designing a 2-to-1 multiplexer circuit based on the Boolean function f = w1w2' + w1w3 + w1'w2 + w1'w3'. The participants emphasize the importance of correctly evaluating the truth table to derive the circuit. The main challenge highlighted is understanding how to plug in the inputs to evaluate the function f accurately using the multiplexer. A clear representation of the truth table and the 2-to-1 multiplexer is requested for better comprehension.

PREREQUISITES
  • Understanding of Boolean algebra and logic functions
  • Familiarity with truth tables and their construction
  • Knowledge of 2-to-1 multiplexer operation and configuration
  • Basic circuit design principles
NEXT STEPS
  • Study the construction and evaluation of truth tables for multiple inputs
  • Learn how to implement Boolean functions using multiplexers
  • Explore advanced topics in digital logic design, such as Karnaugh maps
  • Review practical applications of 2-to-1 multiplexers in circuit design
USEFUL FOR

Electronics students, digital circuit designers, and engineers interested in logic design and multiplexer applications.

shamieh
Messages
538
Reaction score
0
Consider f = w1w2! + w1w3 + w1!w2 +w1!w3! Use the truth table to derive a circuit for f that uses a 2-to-1 multiplexer
I have the truth table, that part is easy. The problem I'm having is what exactly are they EVALUATING to get the f?
Like I said I have the truth table of 3 input, but I don't know how to evaluate for the f. I know it's like a 0 and a 1. But where do I plug in each etc.
 
Last edited by a moderator:
Physics news on Phys.org
shamieh said:
Consider f = w1w2! + w1w3 + w1!w2 +w1!w3! Use the truth table to derive a circuit for f that uses a 2-to-1 multiplexer



I have the truth table, that part is easy. The problem I'm having is what exactly are they EVALUATING to get the f?



Like I said I have the truth table of 3 input, but I don't know how to evaluate for the f. I know it's like a 0 and a 1. But where do I plug in each etc.

Can you please post your work? Show us the truth table, and show what a 2:1 MUX looks like...
 

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
Circuit design using switches puzzle
  • · Replies 13 ·
Replies
13
Views
3K
Implementing f(w3, w2, w1) using 74LS138 and NAND gate(s)
  • · Replies 1 ·
Replies
1
Views
2K
Engineering Design a Multiplexer Circuit for A and B Outputs Based on C Input
  • · Replies 4 ·
Replies
4
Views
2K
Engineering 2-bit Bin Full Adder Truth Table Derivation
  • · Replies 4 ·
Replies
4
Views
5K
VHDL coding -- Design a component that uses a 4-to-1 multiplexer
  • · Replies 2 ·
Replies
2
Views
3K
Digital Design - decoders and multiplexer help
  • · Replies 3 ·
Replies
3
Views
2K
Construct a Moore Circuit for Binary String '01' Detection: Step-by-Step Guide"
  • · Replies 5 ·
Replies
5
Views
4K
Engineering Building a logic circuit from a truth table
  • · Replies 10 ·
Replies
10
Views
3K
Building a 128-to-1 Multiplexer with 8-to-1s and 2-to-1s
  • · Replies 3 ·
Replies
3
Views
6K