simplification of boolean function

Full Adder The half adder is used to add only two numbers. To overcome this problem, the full adder was developed. The…

Full Subtractor The Half Subtractor is used to subtract only two numbers. To overcome this problem, a full subtractor was designed. The…

Binary to Gray code conversion The Binary to Gray code converter is a logical circuit that is used to convert the binary…

Johnson Counter The Johnson counter is similar to the Ring counter. The only difference between the Johnson counter and the ring counter…

Latches A Latch is a special type of logical circuit. The latches have low and high two stable states. Due to these…

Binary to BCD code conversion BCD code plays an important role in digital circuits. The BCD stands for Binary Coded Decimal Number.…

Excess-3 Code The excess-3 code is also treated as XS-3 code. The excess-3 code is a non-weighted and self-complementary BCD code used…

Radix and Diminished Radix complement The mostly used complements are 1’s, 2’s, 9’s, and 10’s complement. Apart from these complements, there are…

Product of Sum (POS) A canonical product of sum is a boolean expression that entirely consists of maxterms. The Boolean function F…

Binary to Excess-3 code conversion The excess-3 code plays an important role in representing the decimal numbers. The Excess-3 code can also…