
- Digital Electronics - Home
- Digital Electronics Basics
- Types of Digital Systems
- Types of Signals
- Logic Levels And Pulse Waveforms
- Digital System Components
- Digital Logic Operations
- Digital Systems Advantages
- Number Systems
- Number Systems
- Binary Numbers Representation
- Binary Arithmetic
- Signed Binary Arithmetic
- Octal Arithmetic
- Hexadecimal Arithmetic
- Complement Arithmetic
- Base Conversions
- Base Conversions
- Binary to Decimal Conversion
- Decimal to Binary Conversion
- Binary to Octal Conversion
- Octal to Binary Conversion
- Octal to Decimal Conversion
- Decimal to Octal Conversion
- Hexadecimal to Binary Conversion
- Binary to Hexadecimal Conversion
- Hexadecimal to Decimal Conversion
- Decimal to Hexadecimal Conversion
- Octal to Hexadecimal Conversion
- Hexadecimal to Octal Conversion
- Binary Codes
- Binary Codes
- 8421 BCD Code
- Excess-3 Code
- Gray Code
- ASCII Codes
- EBCDIC Code
- Code Conversion
- Error Detection & Correction Codes
- Logic Gates
- Logic Gates
- AND Gate
- OR Gate
- NOT Gate
- Universal Gates
- XOR Gate
- XNOR Gate
- CMOS Logic Gate
- OR Gate Using Diode Resistor Logic
- AND Gate vs OR Gate
- Two Level Logic Realization
- Threshold Logic
- Boolean Algebra
- Boolean Algebra
- Laws of Boolean Algebra
- Boolean Functions
- DeMorgan's Theorem
- SOP and POS Form
- POS to Standard POS Form
- Minimization Techniques
- K-Map Minimization
- Three Variable K-Map
- Four Variable K-Map
- Five Variable K-Map
- Six Variable K-Map
- Don't Care Condition
- Quine-McCluskey Method
- Min Terms and Max Terms
- Canonical and Standard Form
- Max Term Representation
- Simplification using Boolean Algebra
- Combinational Logic Circuits
- Digital Combinational Circuits
- Digital Arithmetic Circuits
- Multiplexers
- Multiplexer Design Procedure
- Mux Universal Gate
- 2-Variable Function Using 4:1 Mux
- 3-Variable Function Using 8:1 Mux
- Demultiplexers
- Mux vs Demux
- Parity Bit Generator and Checker
- Comparators
- Encoders
- Keyboard Encoders
- Priority Encoders
- Decoders
- Arithmetic Logic Unit
- 7-Segment LED Display
- Code Converters
- Code Converters
- Binary to Decimal Converter
- Decimal to BCD Converter
- BCD to Decimal Converter
- Binary to Gray Code Converter
- Gray Code to Binary Converter
- BCD to Excess-3 Converter
- Excess-3 to BCD Converter
- Adders
- Half Adders
- Full Adders
- Serial Adders
- Parallel Adders
- Full Adder using Half Adder
- Half Adder vs Full Adder
- Full Adder with NAND Gates
- Half Adder with NAND Gates
- Binary Adder-Subtractor
- Subtractors
- Half Subtractors
- Full Subtractors
- Parallel Subtractors
- Full Subtractor using 2 Half Subtractors
- Half Subtractor using NAND Gates
- Sequential Logic Circuits
- Digital Sequential Circuits
- Clock Signal and Triggering
- Latches
- Shift Registers
- Shift Register Applications
- Binary Registers
- Bidirectional Shift Register
- Counters
- Binary Counters
- Non-binary Counter
- Design of Synchronous Counter
- Synchronous vs Asynchronous Counter
- Finite State Machines
- Algorithmic State Machines
- Flip Flops
- Flip-Flops
- Conversion of Flip-Flops
- D Flip-Flops
- JK Flip-Flops
- T Flip-Flops
- SR Flip-Flops
- Clocked SR Flip-Flop
- Unclocked SR Flip-Flop
- Clocked JK Flip-Flop
- JK to T Flip-Flop
- SR to JK Flip-Flop
- Triggering Methods:Flip-Flop
- Edge-Triggered Flip-Flop
- Master-Slave JK Flip-Flop
- Race-around Condition
- A/D and D/A Converters
- Analog-to-Digital Converter
- Digital-to-Analog Converter
- DAC and ADC ICs
- Realization of Logic Gates
- NOT Gate from NAND Gate
- OR Gate from NAND Gate
- AND Gate from NAND Gate
- NOR Gate from NAND Gate
- XOR Gate from NAND Gate
- XNOR Gate from NAND Gate
- NOT Gate from NOR Gate
- OR Gate from NOR Gate
- AND Gate from NOR Gate
- NAND Gate from NOR Gate
- XOR Gate from NOR Gate
- XNOR Gate from NOR Gate
- NAND/NOR Gate using CMOS
- Full Subtractor using NAND Gate
- AND Gate Using 2:1 MUX
- OR Gate Using 2:1 MUX
- NOT Gate Using 2:1 MUX
- Memory Devices
- Memory Devices
- RAM and ROM
- Cache Memory Design
- Programmable Logic Devices
- Programmable Logic Devices
- Programmable Logic Array
- Programmable Array Logic
- Field Programmable Gate Arrays
- Digital Electronics Families
- Digital Electronics Families
- CPU Architecture
- CPU Architecture
Convert POS to Standard POS Form
When a Boolean expression is represented as a product of sum terms, it is called POS (Product of Sums) form. In POS form, each sum term of the expression may not contain all the variables.
On the other hand, when the Boolean expression is represented as a product of sum terms, where each sum term contains all the variables of the function, it is called Standard Product of Sums (SPOS) form. In the Standard POS form, each sum term of the Boolean expression is called a maxterm.
Now, let us discuss the expansion of a Boolean expression in POS form to Standard POS form.
Conversion of a Boolean Expression in POS Form to Standard POS Form
A Boolean expression in POS form can be converted into the standard POS form as follows
- Write down all the sum terms of the given Boolean expression.
- If one or more variables are missing in any sum term, then add the products of each of the missing variables and its complement to that term.
- Expand the terms according to the rules of Boolean algebra.
- Finally, drop out the redundant terms from the expression.
Let us understand the conversion of a Boolean expression in POS form to Standard POS form with the help of examples.
Example 1
Convert the following 3-variable Boolean expression in POS form to its Standard POS form.
$$\mathrm{\mathit{f}\lgroup A,B,C\rgroup=\lgroup A+\overline{B}\rgroup.\lgroup \overline{B}+C\rgroup.\lgroup A+\overline{C}\rgroup}$$
Solution
The given Boolean function is,
$$\mathrm{\mathit{f}\lgroup A,B,C\rgroup=\lgroup A+\overline{B}\rgroup.\lgroup \overline{B}+C\rgroup.\lgroup A+\overline{C}\rgroup}$$
The given Boolean expression is in its POS form. In this, the variable C is missing from the first term, variable A is missing from the second term, and variable B is missing from the third term.
Therefore, to convert this given function into its SPOS form, we will add the product of missing variable and its compliment to each term of the function, i.e.
$$\mathrm{\mathit{f}\lgroup A,B,C\rgroup=\lgroup A+\overline{B}+C\overline{C} \rgroup.\lgroup \overline{B}+C+A\overline{A}\rgroup.\lgroup A+\overline{C}+B\overline{B} \rgroup}$$
$$\mathrm{\Rightarrow \mathit{f}\lgroup A,B,C\rgroup=\lgroup A+\overline{B}+C\rgroup\lgroup A+\overline{B}+\overline{C} \rgroup\lgroup A+\overline{B}+C\rgroup\lgroup \overline{A}+\overline{B}+C\rgroup\lgroup A+B+\overline{C} \rgroup\lgroup A+\overline{B}+\overline{C} \rgroup}$$
On dropping out the redundant terms, we get,
$$\mathrm{\Rightarrow \mathit{f}\lgroup A,B,C\rgroup=\lgroup A+\overline{B}+C\rgroup\lgroup \overline{A}+\overline{B}+C\rgroup\lgroup A+B+\overline{C}\rgroup\lgroup A+\overline{B}+\overline{C}\rgroup}$$
This is the standard POS form of the given Boolean function.
Example 2
Convert the following 4 variable Boolean function into its standard POS form.
$$\mathrm{\mathit{f}\lgroup A,B,C,D\rgroup=\lgroup A+C+D\rgroup.\lgroup A+\overline{B}+\overline{D} \rgroup.\lgroup A+\overline{C}+D\rgroup}$$
Solution
The given function is in the POS form,
$$\mathrm{\mathit{f}\lgroup A,B,C,D\rgroup=\lgroup A+C+D\rgroup.\lgroup A+\overline{B}+\overline{D} \rgroup.\lgroup A+\overline{C}+D\rgroup}$$
Here, the variable B is missing from first and third terms, and the variable C is missing from the second term of the function. Therefore, in order to get standard POS form of the function, we will add the product of the missing variable and its complement as follows,
$$\mathrm{\mathit{f}\lgroup A,B,C,D\rgroup=\lgroup A+C+D+B\overline{B} \rgroup.\lgroup A+\overline{B}+\overline{D}+C\overline{C} \rgroup.\lgroup A+\overline{C}+D+B\overline{B} \rgroup}$$
$$\mathrm{\Rightarrow \mathit{f}\lgroup A,B,C,D\rgroup=\lgroup A+B+C+D\rgroup.\lgroup A+\overline{B}+C+D\rgroup.\lgroup A+\overline{B}+C+\overline{D} \rgroup.\lgroup A+\overline{B}+\overline{C}+\overline{D}\rgroup.\lgroup A+B+\overline{C}+D\rgroup.\lgroup A+\overline{B}+\overline{C}+D\rgroup}$$
Since, there is no redundant term in the expression. Thus, this is the standard POS form of the given Boolean function.
Example 3
Convert the following 2 variable Boolean function into Standard POS form.
$$\mathrm{\mathit{f}\lgroup A,B\rgroup=\overline{A}.\lgroup A+\overline{B}\rgroup.B}$$
Solution
The given Boolean function is,
$$\mathrm{\mathit{f}\lgroup A,B\rgroup=\overline{A}.\lgroup A+\overline{B}\rgroup.B}$$
This function is in its POS form having three sum terms, where the variable B is missing from the first term and variable A is missing from the third term. So, to convert it into standard POS form, we will add the product of variable and its complement to the term as follows,
$$\mathrm{\mathit{f}\lgroup A,B\rgroup=\lgroup \overline{A}+B\overline{B}\rgroup.\lgroup A+\overline{B} \rgroup.\lgroup A\overline{A}+B\rgroup}$$
$$\mathrm{\Rightarrow \mathit{f}\lgroup A,B\rgroup=\lgroup \overline{A}+B\rgroup\lgroup\overline{A}+\overline{B} \rgroup\lgroup A+\overline{B}\rgroup\lgroup A+B\rgroup\lgroup \overline{A}+B\rgroup}$$
Removing the redundant terms from the expression, we get,
$$\mathrm{\Rightarrow \mathit{f}\lgroup A,B\rgroup=\lgroup \overline{A}+B\rgroup\lgroup\overline{A}+\overline{B} \rgroup\lgroup A+\overline{B}\rgroup\lgroup A+B\rgroup}$$
This is the standard POS form of the given Boolean expression.
Numerical Problems
Q 1. − Convert the following 3 variable Boolean expression in POS form to its Standard POS form.
$$\mathrm{\mathit{f}\lgroup A,B,C\rgroup=\lgroup A+B\rgroup\lgroup A+\overline{B}\rgroup\lgroup \overline{B}+C\rgroup\lgroup A+C\rgroup}$$
Q 2. − Convert the following 4 variable Boolean expression in POS from to its standard POS form.
$$\mathrm{\mathit{f}\lgroup A,B,C,D \rgroup=\lgroup A+B+\overline{C} \rgroup\lgroup A+\overline{B}+\overline{D} \rgroup\lgroup \overline{A}+\overline{B}+D \rgroup\lgroup A+C+\overline{D} \rgroup}$$
Q 3. − Convert the following 2 variable Boolean function into standard POS form.
$$\mathrm{\mathit{f}\lgroup A,B \rgroup=\lgroup A+B \rgroup.A}$$
Conclusion
This is all about the conversion of a Boolean expression in POS (Product of Sums) form to SPOS (Standard Product of Sums) form.