Boolean algebra in logic circuits · Circuit Simulator
George Boole is the mathematician who helped establish modern symbolic logic and whose algebra of logic, now called Boolean algebra, is basic to the design of digital computer circuits.
Unfortunately, he died before the significance of his work was recognised.
Claude Shannon (died 2001), of MIT fame recognised how Boolean algebra could be applied to on-and-off circuits, where all signals are characterised as either “high” (1) or “low” (0).
He was an American mathematician and electrical engineer who laid the theoretical foundations for digital circuits and information theory, a mathematical communication model.
- His 1938 thesis put Boole’s theoretical work to use in a way Boole could never have imagined, giving us a powerful mathematical tool for designing and analysing digital circuits.
Answer the following in relation to multiple-input logic gates
Reducing a Boolean expression to its simplest form means that the fewest gates will be needed to implement
If we translate a logic circuit’s function into Boolean form, and apply certain algebraic rules to the resulting equation to reduce the number of terms and/or arithmetic operations, the simplified equation may be translated back into circuit form for a logic circuit performing the same function with fewer components
Therefore, if there is a Boolean expression to be implemented as a circuit and the equivalent function may be achieved with fewer components, the result will be
The expression AB + BC(B + C) can be simplified by applying the Laws of Boolean Algebra as follows:
The final expression, B(A + C), is much simpler than the original, yet performs the same function.
1. Q = (A+B).(A+C)
2. (A'+B)(A+B)
3. AC'+ABC'
4. AB'D+AB'D'
PROBLEM STATEMENT: If it is dark and a motion sensor detects a person on the front porch, or if the switch is on, then turn on the porch light
POSSIBLE SOLUTION:
Here, there are 3 INPUT variables: INPUTS:
OUTPUT: A switch to turn on/off the porch light (L)
Logic circuit simulators can simulate electronic logic gates in an interactive environment on your computer. Such environments are often used to design circuits before implementing them with real electronic components
One such is Logic.ly where users can design circuits quickly and easily with a modern and intuitive user interface with drag-and-drop, copy/paste, zoom & more
NOT(B OR C) is the same as NOT(B) AND NOT(C)
Use the simulator to create a THREE inputs xor gate… - Is the output behaviour as you expect them to be?
The combinational logic circuits can be classified into various types based on the purpose of usage, such as - arithmetic & logical functions, - data transmission and - code converters.
In computers, arithmetic operations are performed inside the CPU by the ALU.
Arithmetic in binary is much like arithmetic in other numeral systems. Addition is completed using a component within the CPU called an adder
Function of an adder: add two binary numbers, output result
Recall the possibilities for adding two binary numbers:
0 + 0 = 0
1 + 0 = 1
1 + 1 = 2 which is 10 in binary which is 0 with a carry of 1
1 + 1 + 1 (carry) = decimal 3 which is 11 in binary. In your calculation, write down one 1 and a carry of 1
Remember: All of the more complex adder architectures are constructed from its basic building blocks such as Half Adder and Full Adder so it's important to understand the workings of these.
PROBLEM STATEMENT: If it is dark and a motion sensor detects a person on the front porch, or if the switch is on, then turn on the porch light
POSSIBLE SOLUTION: