What is Product of Sum (POS) Form?

Last Updated : 15 Jul, 2026

A Product of Sums (POS) is a Boolean algebra method where multiple sum terms (OR variables) are multiplied together using the AND (·) operation.

  • Preferred when the truth table contains more 0s than 1s.
  • Can be simplified using Boolean algebra and K-Maps before implementation.
frame_3296
POS Form

Types of POS Forms

Non-Canonical POS Form

In a Non-Canonical POS form, one or more sum terms may not contain all the variables of the Boolean function.

Example

F(A, B, C) = (A + C)(B + C)

In this expression:

  • The sum term (A + C) does not contain B.
  • The sum term (B + C) does not contain A.

Therefore, this is a Non-Canonical POS expression.

Canonical POS Form

In a Canonical POS form, every sum term contains all the variables of the Boolean function, either in true or complemented form.

Example:

F(A, B) = (A + B)(A' + B')

In this expression:

  • The sum term (A + B) contains both variables A and B.
  • The sum term (A' + B') also contains both variables A and B.

Therefore, this is a Canonical POS expression.

Advantages

  • Easy to Derive: POS expressions can be directly obtained from a truth table by considering the rows where the output is 0.
  • Simple Implementation: POS circuits can be implemented easily using OR and AND gates.
  • Uniform Representation: POS provides a consistent and standardized way to represent Boolean functions.
  • Suitable for Digital Design: POS expressions are widely used in designing and analyzing combinational logic circuits.

Disadvantages

  • Larger Circuits: Without simplification, POS expressions may require more logic gates, increasing circuit size.
  • Not Suitable for Large Functions: As the number of variables increases, the number of sum terms also grows, making the expression more complex.
  • May Not Be Fully Optimized: A POS expression is not always the simplest representation and may require Boolean simplification.
  • Higher Hardware Cost: More gates can increase hardware requirements, power consumption, and overall implementation cost.

Applications

  • Digital Circuit Design: Used for implementing combinational circuits such as multiplexers, decoders, and control logic.
  • Logic Minimization: Used with simplification techniques like Karnaugh Maps (K-Maps) and the Quine–McCluskey method.
  • Programmable Logic Arrays (PLAs): POS expressions are used to implement and optimize logic functions in programmable devices.
  • Control and Switching Circuits: Commonly used in digital control systems where logic functions are naturally expressed in POS form.
Comment

Explore