Stack Exchange Network

Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.

Visit Stack Exchange

Questions tagged [boolean-algebra]

The tag has no usage guidance.

-3
votes
0answers
59 views

Help: circuito combinatorio [on hold]

How can i build a 6 inputs gate that will have output = 0 only when a one input is 0. I can use and, nand and or gates for the solution
1
vote
1answer
69 views

What is the name of this logic circuit?

Sorry for dumb question, I'm really newbie in electronic. As I wrote in topic, What's the name of this circuit? Dose the circuit has any specific name at all ?
0
votes
0answers
41 views

How to logically solve logic gates

Reading the Digital Multiplexers article on Wikipedia following is written: A 2-to-1 multiplexer has a boolean equation where A and B are the two inputs, S is the selector input, and Z is the ...
0
votes
2answers
87 views

How would I finish out this mini project (emitting 1 whenever 101 is read)?

Design a Moore finite state machine that detects 1 0 1 in consecutive digits in the input stream of 0's and 1's received every clock cycle. The circuit should output a 1 when it detects 1 0 1 ...
0
votes
2answers
39 views

Converting expression to only use NAND gates

How would I go about converting this Boolean expression so that it would only use NAND gates in its circuit? A ⋅ ¬B ⋅ ¬D + ¬A ⋅ B ⋅ ¬C ⋅ D
0
votes
1answer
65 views

There's Conflicts in the Definitions of XNOR? [duplicate]

XNOR has two definitions: \$1^{st}:XNOR=NOT(XOR)\$ \$2^{nd}: XNOR(A,B)=\overline{A}\cdot\overline{B}+A\cdot B\$ The problem is that these definitions are not equal in Odd inputs, the second ...
1
vote
1answer
56 views

How can i make f(a,b,c) = \$A \cdot B \cdot \overline C + A \cdot \overline B\cdot C\$ using only XORs and NANDs?

i have this problem where i need to make the Logical Function represented by : f(A,B,C)= \$A \cdot B \cdot \overline C + A \cdot \overline B\cdot C\ \$ using only XORs and NANDs The function was as ...
-1
votes
2answers
53 views

How to transform a 3 variables Boolean Function into a K-map when some variables are not specified in the expression? [closed]

I looked at the already answered questions and used google, but I didn't found anything that explains the thing clearly. My problem is that I don't know how to solve function like ...
0
votes
1answer
47 views

How to choose which function to use depending on the parameter value? (MUX and Gates implementation)

Let's say we have A,B,C , which are all representation of decimal numbers. A and C are 4bit, B is 2bit. if A is any of those numbers (eg: 0,5,6,11 ), the function is F(A,B,C) = AB+C If A is the ...
0
votes
1answer
26 views

Creating DNF with variable in output column

I am trying to model an Arbiter in VHDL. For this I've created a Moore automaton and am currently mapping the output. The output should be when mapping from the state: ...
0
votes
1answer
89 views

How do I make a double dabble circuit with logic gates

Im attempting to make a 8 bit binary calculator that displays on multiple seven segment displays. Can double dabble be done with logic gates. If so, how?
1
vote
1answer
56 views

Make a circuit that indicates an odd number of ones using a 3-8 Demux and two logic gates

Using 3-8 Demux and two logic gates, make a circuit that received 4 bits and returns 1 if the number of 1's is odd and else returns 0. My try: Using truth table, we get that the desired function is: ...
1
vote
1answer
68 views

Karnaugh Maps in POS instead of SOP

From my understanding, to use karnaugh maps to simplify an expression, you would have an SOP expression that does not have to be canonical and then group the 1s in the table. So that got me wondering....
0
votes
1answer
74 views

J K Flip Flop and Boolean Algebra

Y=K'J'Q+K'J+KJQ' The output Y should be that of a JK flip-flop. That is: Y=JQ'+K'Q I tried to solve the following way: 1. Y=K'J'Q+K'J+KJQ' 2. =K'(J'Q+J)+KJQ' 3. =JK'+K'Q+JKQ' 4. =J(K'+KQ')+...
0
votes
1answer
26 views

WolframAlpha results for logic statement input

I was trying to simplify the following Boolean logic equation using wolframalpha.com. (not (A) and B and C) or (A and (not(B)) and C) or (A and B and not (C)) or (A and B and C) When I entered it ...
-1
votes
1answer
72 views

XOR complement simplification

What is (A⊕B)' simplification? i know that : > (A⊕B)=A'B+AB' but what is the complement of that expression?
0
votes
1answer
149 views

How many logic gates are realistically feasible? [closed]

I'm actually more of a software developer and don't really know much about electrical engineering. But I do have a basic understanding of Boolean diagrams. So I had an idea for a Boolean circuit, the ...
1
vote
1answer
78 views

Implement a circuit for (a+b+c)x+(a+b+c)'x' using only OR and XNOR gates

I know XNOR is AB + A'B' so I thought the equation somehow expands to ax+bx+cx+a'x'+b'x'+c'x', but that doesn't seem right because (a+b+c)' is not the same as (a'+b'+c').
1
vote
0answers
197 views

Is it possible to build memoryless logic gates? [duplicate]

I would like to build a memoryless (possibly cyclic) logic circuit. Perhaps this is not the best name, so let me illustrate what I would like to have with an example. Consider a state machine with ...
1
vote
0answers
72 views

Boolean Algebra Equivalent

I am having a little trouble knowing what theorem to use to solve the following problem. Express the given equation without using OR gates. Hint: the expression two NANDed literals looks like this: (...
0
votes
1answer
71 views

K map minimization need confirmation

So I have to solve this f= ∑m(0,4,10,17,21,26,27,31)+ ∑d(1,5,7,8,11,16,19,20,23,24,25) Please tell me if this is correct:
-1
votes
2answers
82 views

Boolean Algebra - Minimization

I have a problem with this assignment: The 26th one: I am supposed to minimize this, and I get to " XY + ZY + ( Z*(inverted X) )" But solution to this problem is I don't know how to minimize ...
0
votes
0answers
77 views

Trick/insight to I implement given boolean function with minimum numbers of given gate

I solved bunch of questions which give some function and then ask to implement it with minimum number of gates of specific type, each having specific number inputs. I was making mistakes in all those ...
0
votes
1answer
103 views

Converting boolean function (dnf) to only 2-input NANDs

I'm currently preparing for an exam and was doing some exercices regarding boolean logic. Commonly asked question is to build a function from a truth table and simplify it with a karnaugh map. After ...
0
votes
0answers
115 views

Help with Espresso optimization options

I need to minimize some boolean functions. I found in some posts here that Espresso is a great open source tool to do this. I found this link where the different optimizations options for Espresso ...
0
votes
4answers
187 views

AND Logic on 24 Volt Signals

What kind of chip and/or plug and play device could handle multi-input boolean logic with 24 volt signals? I have three sets of 20 reed Hall effect, three-wire switches that each output a 24 Volt ...
0
votes
0answers
79 views

boolean simplification

I'v got some problem with simplification of this expression. ae+ad'f+a'bce+bcd'f+g= here I'm using the simplification of ae+a'bce. e(a+a'bc)=e(a(a+a')+a'bc)=e(aa+aa'+a'bc)=e(a+0+a'bc)=e(a+a'bc). So I ...
3
votes
1answer
279 views

how is this conversion possible?

I was reading Morris Mano's - Computer System Architechture and My problem is the simplification of F = AB + A'C which was: simulate this circuit – ...
2
votes
5answers
1k views

What heuristics are there (if any) to know how close a circuit is to a function?

I'm working on an AI project for circuit minimization. I'm trying to think of a heuristic to tell me how close a certain circuit is to representing a certain function. For example, if I need to ...
0
votes
1answer
112 views

Boolean law simplification

I made this exercise but I'm not sure if I made it well. q=(a+b'c)c'+a'b+ac q=ac'+b'c*c'+a'b+ac q=ac'+a'b+ac q=a(c'+c) +a'b q=a+a'b q=1 Is there someone who can ...
1
vote
1answer
195 views

De Morgan minimization

De Morgan $$y=\overline{a+\overline{b(\overline{c+d})}}+\bar{b}$$ $$y=\bar{a}(\overline{\overline{b(\overline{c+d})}})+\bar{b}$$ $$y=\bar{a}(b(\overline{c+d}))+\bar{b}$$ $$y=\bar{a}(b\overline{cd})+\...
0
votes
0answers
80 views

Is this logic gate circuit equivalent to the Simulink model?

Is this Simulink model equivalent to this circuit? Although the circuit simulated in Multisim works exactly the same as the Simulink model, switching (S1) between 5v and 0V causes an error. I guess ...
1
vote
1answer
213 views

Formulas for Carry out in a Full Adder

Given a full adder with inputs $$A, B \text{ and } C_{in}$$ The formulas for the outputs are $$S = A \oplus B \oplus C_{in} \text{ , Where } \oplus \text{means XOR}$$ and $$C_{out} = AB + AC_{in} + ...
6
votes
2answers
714 views

Build circuit from a formula

I've this formula: y = AB + AB'C + A'C I've to build a circuit with only a 2:1 mux and a OR port. I've done the truth table and k.map, but i've not idea how proced. EDIT: @jonk Thanks for your ...
0
votes
1answer
16 views

Calculating the smallest control function (conjuntive normal form)

i am trying to calculate the smallest possible control function. The function from the function table is: A = NOT(S3) & S2 & S1 v S3 & NOT(S2) & S1 v S3 & S2 & NOT(S1) v S3 &...
0
votes
1answer
207 views

Implementing a Boolean function using NOR gates with maximum 4 ports

I need to implement a Boolean function using NOR gates only. The minimized function written as PoS is: f(a, b, c, d) = (a+b)(a+c+d)(b+c+d')(a+c'+d')(a'+c'+d) I used double negation and DeMorgan's ...
0
votes
1answer
49 views

How can i simulate this circuit to match with the truth table?

How can I simulate this NAND logic circuit to match the truth table?]2
0
votes
0answers
29 views

Easiest way to get minterms from a SOP Boolean expression?

So far, I've come across problems were I need to get the list of the minterms in a truthtable from a SOP Boolean expression. For example; They way I've tackled these problems was to convert the ...
0
votes
2answers
32 views

Defined Operation Question

On my previous exam I was given 2 multiple choice questions. ...
1
vote
2answers
76 views

Karnaugh Graph Simplification

I have following truth Table : F(w,x,y,z) = Σ(0,2,5,7,8,10,12,13,14); ...
0
votes
1answer
206 views

K-maps, do they completely simplify?

I've been told that K-maps produce a completely simplified boolean equation, and they can't or shouldnt be simplified anymore after that. However, on allaboutcircuits.com they were able to simplify an ...
-2
votes
3answers
511 views

How do I build a multiplexer for this boolean function?

I have a boolean function: $$F = \bar A·\bar B·\bar C + A·\bar C·\bar D + B·C·\bar D + \bar B·C·D$$ Where the dot means and and the bar means complement. I plot ...
0
votes
3answers
313 views

Can we derive all boolean functions using a 2x1 Multiplexer?

It is possible to implement all boolean functions using a 4x1, 8x1 or a 16x1 Multiplexer. But is it possible to implement all boolean functions with a 2x1 Multiplexer? I think it is not, because how ...
1
vote
1answer
215 views

Truth Table for the Following Multiplexer Circuit

Is the truth table (shown below) accurate for the decoder/multiplexer circuit (shown farther below)? ...
0
votes
0answers
93 views

Binary Multiplication

I was tasked with creating a binary multiplier that can multiply two digit numbers together. The logic table that resulted is as follows: ...
0
votes
2answers
48 views

Creating a Decoder

Let's say I want to create this active low decoder: ...
-1
votes
1answer
203 views

And gate in a demultiplexer

I have a question regarding the use of an AND gate in a demultiplexer 1x4 circuit such as A demultiplexer truth table shows you can output a 1 signal on the zero line, if your input is 1, and both ...
0
votes
0answers
29 views

how to convert circuits to minimized SOP boolean equations?

Is the answer for a) simply "W = A"? How would b) be solved though? It's very confusing. I guess "Y = ABC" for starters.
0
votes
1answer
702 views

4 variable boolean algebra: Converting sum of maxterms to product of minterms

I am struggling to convert the sum of maxterms: ((¬b ∧ ¬d) ∨ ((b ∧ (¬c ∧ d)) ∨ (¬a ∧ (b ∧ d)))) into a product of minterms. I use Morgan and get this: ((¬b ∨ ¬d) ∧ ((b ∨ (¬c ∨ d)) ∧ (¬a ∨ (b ∨ d)))...
0
votes
0answers
57 views

Implementing SOP using Mat in ReRam

In ReRam in logic mode, one mat can be configured to implement multiple arbitrary combinational logic functions (e.g. AND, NOR). More complex logic functions can be realized in the Sum-Of-Product form ...