XOR logic gate

In digital electronics there are special gates. One of them is the XOR logic gate or exclusive OR gate. Equivalent XOR Logic Gate using common logic gates

Sequential Circuits Using Logic Gates

The main difference between combinational circuits and sequential circuits is that in sequential circuits there is one or more output signals fed back to one or more inputs to obtain a new output.

Combinational Circuit Using Logic Gates

A combinational circuit is a circuit where the output depends only on the combination of the inputs at the time we are testing the output

What is a Truth Table?

The Truth Table is used to simplify boolean equations obtained from digital circuits. The truth tables can have many columns, but all tables operate in the same way.

JK Flip-Flop – PRESET & CLEAR Inputs – Truth Table

The JK Flip-Flop is a sequential device with 3 inputs (J, K, CLK (clock signal)) and 2 outputs (Q and Q’). J and K are control inputs.

NOR logic gate

A NOR logic gate can be implemented with the concatenation of an OR gate and a NOT gate. NOT gate using a NOR gate

Binary to Gray Code Conversion and Gray code to Binary Conversion.

Two Methods. One method to convert from binary to gray code and another to convert from gray to binary code

NAND Gate – Truth table.

Truth tables for the NAND gate.

NOT gate made of a NAND gate

The Gray code is a special type of binary code that is unweighted (the digits that make up the code does not have an assigned weight).

Its characteristic is that between a combination of digits and the next, whether upstream or downstream, there is only a difference of one digit.

Aiken code – Excess 3 code

Aiken BCD code is similar to the natural BCD code, but with “weights” or “values” distributed differently.

The Excess 3 Code is obtained by adding “3” to each combination of the natural BCD code.

The binary number system

The binary number system. unlike the Decimal number System, where they are allowed 10 digits (0 to 9), you only need two (2) digits: “0” and “1”.

Boolean Algebra – Introduction and Rules.

Boolean Algebra is a tool to reduce logical expressions. It is the mathematics of logical expressions, which was presented by George Boole in 1854.