Let's start this tutorial with some basics of SOP form and NOR gates before getting into the details of how to realize a logic function or Boolean expression in SOP form using NOR gates only. SOP Form SOP form stands for Sum of Products form. SOP form is one ... Read More

SOP Form SOP form stands for Sum of Products form. SOP form is one in which a Boolean expression is expressed as a sum of product terms. For example, $$\mathrm{\mathit{f}\lgroup A, B, C\rgroup=AB+ABC+B\overline{C}}$$ This is a Boolean function expressed in SOP (Sum of Products) form. NAND Gate The NAND Gate ... Read More

In positional number systems, the radix is the total number of unique digits that are used to represent numbers in that number system. Radix is also called Base. For example, in decimal number system, we use total ten digits from 0 to 9 (i.e. 0, 1, 2, 3, 4, 5, ... Read More

The K-Map or Karnaugh Map is a systematic method of simplifying a complex Boolean function or expression. The K-Map is basically a graph or a chart which consists of a certain number of adjacent cells. Each cell represents a particular combination of variables in either sum or product form. However, ... Read More

Any Boolean function or logical expression can be expressed in either canonical/standard sum of products form or canonical/standard product of sums form. The standard sum of products form of a logical expression contains different product terms which are added together, and each product term is referred to as a minterm. ... Read More

Before focusing on logical expression in SSOP (Standard Sum of Products) form and SPOS (Standard Product of Sum) form, let us have a brief introduction the "Sum of Products" and "Product of Sum" forms. SOP (Sum of Products) Form The SOP or Sum of Products form is a form of ... Read More

Electronic logic conventions are the sets of rules followed while designing a digital logic system or device. These conventions are adopted due to their different characteristics observed by several experiments. The use of electronic logic conventions, makes the implementation process of a digit system easy and smooth. Also, a standardization ... Read More

K-Map or Karnaugh Map is a graphical method of simplifying Boolean expression. A K-Map composed of an arrangement of adjacent squares or cells, where each cell represent a particular combination of variables in sum or product form. In the K-map method, there is a useful condition namely, Don’t Care Condition, ... Read More

In Boolean algebra, several rules are defined to perform operations in digital logic circuits. Boolean algebra is a tool to perform operation on binary digits, i.e. 0 and 1. These two binary digits 0 and 1 are used to denote FALSE and TRUE states of a digital circuit at input ... Read More

A Boolean function can be expressed into two forms namely, Sum of Products (SOP) Form Product of Sums (SOP) Form The SOP (Sum of Products) form is one in which the Boolean function is expressed as the sum of product terms, while in the POS (Product of Sums) ... Read More