SlideShare a Scribd company logo
3
Most read
4
Most read
7
Most read
Boolean Function
Dr. (Mrs.) Gargi Khanna
Associate Professor
Electronics & Communication Engineering Department
National Institute of Technology, Hamirpur
Boolean function
• A Boolean function has:
• At least one Boolean variable,
• At least one Boolean operator, and
• At least one input from the set {0,1}.
• It produces an output that is also a member of the
set {0,1}.
Truth Table
• Addition of 2 bits:
A B Sum Carry
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
Sum= 𝐴′
𝐵 + 𝐴𝐵′ 𝐶𝑎𝑟𝑟𝑦 = 𝐴𝐵
Sum= 𝐴 + 𝐵 . (𝐴′
+ 𝐵′) 𝐶𝑎𝑟𝑟𝑦 = 𝐴 + 𝐵 . 𝐴 + 𝐵′
. (𝐴′
+ 𝐵)
Truth Table
• Subtraction of 2 bits:
A B Difference Borrow
0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0
Difference= 𝐴′
𝐵 + 𝐴𝐵′ 𝐵𝑜𝑟𝑟𝑜𝑤 = 𝐴′𝐵
Difference = 𝐴 + 𝐵 . (𝐴′ + 𝐵′) 𝐵𝑜𝑟𝑟𝑜𝑤 = 𝐴 + 𝐵 . 𝐴′ + 𝐵 . (A’ +B’)
Truth Table
• Addition of 3 bits:
A B C Sum Carry
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
Sum= 𝐴′ 𝐵′ 𝐶 + 𝐴′ 𝐵𝐶′ + 𝐴𝐵′ 𝐶′ + 𝐴𝐵𝐶
𝐶𝑎𝑟𝑟𝑦 = 𝐴′
𝐵𝐶 + 𝐴𝐵′
𝐶 + 𝐴𝐵𝐶′
+ABC
Sum= (𝐴 + 𝐵 + 𝐶). (𝐴 + 𝐵′+𝐶′)(𝐴′ + 𝐵 + 𝐶′)(𝐴′ + 𝐵′ + 𝐶)
Two-Level Implementations
• Boolean functions in either SOP or POS forms
can be implemented using 2-Level
implementations.
• For SOP forms AND gates will be in the first level
and a single OR gate will be in the second level.
• For POS forms OR gates will be in the first level
and a single AND gate will be in the second
level.
• SOP forms can be implemented using only
NAND gates, while POS forms can be
implemented using only NOR gates.
Boolean Function SOP &  POS
F = XZ + Y’Z + X’YZ
XZ
Y’Z
X’YZ
XZ . Y’Z . X’YZ = XZ + Y’Z + X’YZ
F = XZ + Y’Z + X’YZ
Implement the following POS function
F = (X+Z) (Y’+Z) (X’+Y+Z)
Standard SOP
• Write minterms of BC + A.
Solution : BC + A Write terms
• XBC + AXX Add Xs where letters are missing
• A’BC, ABC Vary Xs in XBC
• AB’C’, AB’C, ABC’, ABC Vary Xs in AXX
• Thus BC + A = A’ BC +ABC+ AB’C’ + AB’C + A B
C’ + A B C
• or BC + A = A’BC + ABC + AB’C’ + AB’C + ABC’
Standard SOP
F(A.B,C) = Σm(3, 7, 4, 5, 6)
Complementary Nature of Min & Max terms
F=Σm( 15, 11, 14, 13, 12)
F=П M (0,1,2,3,4,5,6,7,8,9,10)
Standard POS
Write full form of the expression Y(A,B,C) = П M (0, 1, 3, 4)
Standard SOP & POS
• F= B’+A’C
• X0X, 0X1
• (000, 001,100,101), (001,011)
• F= Ʃm(0,1,4,5,3,8)
F(A,B,C)=(A+B)(A’+C)
• (0+0+X)
(1+X+0)=(0+0+0),(0+0+1),(1+0+0),(1+1+0)
• F=ПM(1,0,4,6)
Happy Learning

More Related Content

PPTX
NAND and NOR implementation and Other two level implementation
PPT
Multiplexers & Demultiplexers
PDF
Sequential circuits in Digital Electronics
PPT
encoder and decoder in digital electronics
PPTX
Decoders
PDF
Error detection & correction codes
PPTX
Ring Counter.pptx
PPTX
Finite state machines
NAND and NOR implementation and Other two level implementation
Multiplexers & Demultiplexers
Sequential circuits in Digital Electronics
encoder and decoder in digital electronics
Decoders
Error detection & correction codes
Ring Counter.pptx
Finite state machines

What's hot (20)

PPTX
Multiplexer and DeMultiplexer
PPT
Counters
PPTX
Encoder and decoder
PPTX
Ripple Carry Adder
PDF
Encoder & Decoder
PPT
multiplexers and demultiplexers
PPT
Digital Logic Design
PDF
MOS logic family
PPTX
Subtractor (1)
PPTX
Dft (design for testability)
PPTX
SOP POS, Minterm and Maxterm
PPTX
Line coding presentation
PPT
decoder and encoder
PPT
Logic gates
PPTX
Combinational circuit
PPTX
Parity Generator and Parity Checker
PPT
Logic gates presentation
PPTX
Quick tutorial on IEEE 754 FLOATING POINT representation
PPTX
Addressing modes of 8086
PPTX
Bus aribration
Multiplexer and DeMultiplexer
Counters
Encoder and decoder
Ripple Carry Adder
Encoder & Decoder
multiplexers and demultiplexers
Digital Logic Design
MOS logic family
Subtractor (1)
Dft (design for testability)
SOP POS, Minterm and Maxterm
Line coding presentation
decoder and encoder
Logic gates
Combinational circuit
Parity Generator and Parity Checker
Logic gates presentation
Quick tutorial on IEEE 754 FLOATING POINT representation
Addressing modes of 8086
Bus aribration
Ad

Similar to Boolean Function SOP & POS (20)

PDF
K-map Digital Logic Design DLD Theory l
PPTX
Combinational Logic Circuit
PPT
boolean algebra and logic simplification
PDF
Unit-2 ppt.pdf introduction to it technology
PPTX
B sc cs i bo-de u-ii logic gates
PPTX
UNIT - II.pptx
PPTX
Lecture-5a - Half and Full Adxcccder.pptx
PDF
digital electronics PPT.pdfggjjnjjjjuuhhh
PPTX
Digital electronics basic overview .pptx
PPT
Minimizing boolean
PPT
Minimizing boolean
PPT
Minimization Technique .ppt
PPTX
Fundamentals of Digital Design_Class_12th April.pptx
PPTX
BOOLEAN ALGEBRA & LOGIC GATE
PPTX
2 Combinational Logic Circuit 01
PPTX
Moduleeyshgsnshneyehnhneyjhnynhneh3dgcfhhgg
PPTX
Logic Gates.pptx
PPT
combinational-circuit (1).ppt
PPT
Boolean Algebra
PPT
5. Combinational Circuits_P1 lecturee of dld
K-map Digital Logic Design DLD Theory l
Combinational Logic Circuit
boolean algebra and logic simplification
Unit-2 ppt.pdf introduction to it technology
B sc cs i bo-de u-ii logic gates
UNIT - II.pptx
Lecture-5a - Half and Full Adxcccder.pptx
digital electronics PPT.pdfggjjnjjjjuuhhh
Digital electronics basic overview .pptx
Minimizing boolean
Minimizing boolean
Minimization Technique .ppt
Fundamentals of Digital Design_Class_12th April.pptx
BOOLEAN ALGEBRA & LOGIC GATE
2 Combinational Logic Circuit 01
Moduleeyshgsnshneyehnhneyjhnynhneh3dgcfhhgg
Logic Gates.pptx
combinational-circuit (1).ppt
Boolean Algebra
5. Combinational Circuits_P1 lecturee of dld
Ad

More from GargiKhanna1 (16)

PPTX
Latch & Flip-Flop.pptx
PDF
Digital Counter Design
PPTX
Latch and flip flop
PPT
Multiplexers and Demultiplexers
PPTX
Karnaugh Map
PPT
Error detection and correction codes
PDF
Number system
PDF
Logic Level Techniques for Power Reduction
PDF
Architectural Level Techniques
PPTX
Probabilistic Power Analysis
PPTX
Monte carlo analysis
PPTX
Simulation power analysis low power vlsi
PPTX
Logic gate
PPTX
Logic Gates
PDF
Binary codes
PDF
Binary Arithmetic
Latch & Flip-Flop.pptx
Digital Counter Design
Latch and flip flop
Multiplexers and Demultiplexers
Karnaugh Map
Error detection and correction codes
Number system
Logic Level Techniques for Power Reduction
Architectural Level Techniques
Probabilistic Power Analysis
Monte carlo analysis
Simulation power analysis low power vlsi
Logic gate
Logic Gates
Binary codes
Binary Arithmetic

Recently uploaded (20)

PPTX
Welding lecture in detail for understanding
PPTX
Engineering Ethics, Safety and Environment [Autosaved] (1).pptx
PPTX
UNIT-1 - COAL BASED THERMAL POWER PLANTS
PDF
Operating System & Kernel Study Guide-1 - converted.pdf
PDF
Well-logging-methods_new................
DOCX
573137875-Attendance-Management-System-original
PDF
PPT on Performance Review to get promotions
PDF
July 2025 - Top 10 Read Articles in International Journal of Software Enginee...
PPTX
Internet of Things (IOT) - A guide to understanding
PPTX
CH1 Production IntroductoryConcepts.pptx
PPTX
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
PDF
R24 SURVEYING LAB MANUAL for civil enggi
PPTX
Foundation to blockchain - A guide to Blockchain Tech
PPTX
Lecture Notes Electrical Wiring System Components
PDF
keyrequirementskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
PPTX
UNIT 4 Total Quality Management .pptx
PDF
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
PPT
Mechanical Engineering MATERIALS Selection
PPTX
Sustainable Sites - Green Building Construction
PPTX
Geodesy 1.pptx...............................................
Welding lecture in detail for understanding
Engineering Ethics, Safety and Environment [Autosaved] (1).pptx
UNIT-1 - COAL BASED THERMAL POWER PLANTS
Operating System & Kernel Study Guide-1 - converted.pdf
Well-logging-methods_new................
573137875-Attendance-Management-System-original
PPT on Performance Review to get promotions
July 2025 - Top 10 Read Articles in International Journal of Software Enginee...
Internet of Things (IOT) - A guide to understanding
CH1 Production IntroductoryConcepts.pptx
FINAL REVIEW FOR COPD DIANOSIS FOR PULMONARY DISEASE.pptx
R24 SURVEYING LAB MANUAL for civil enggi
Foundation to blockchain - A guide to Blockchain Tech
Lecture Notes Electrical Wiring System Components
keyrequirementskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
UNIT 4 Total Quality Management .pptx
Mohammad Mahdi Farshadian CV - Prospective PhD Student 2026
Mechanical Engineering MATERIALS Selection
Sustainable Sites - Green Building Construction
Geodesy 1.pptx...............................................

Boolean Function SOP & POS

  • 1. Boolean Function Dr. (Mrs.) Gargi Khanna Associate Professor Electronics & Communication Engineering Department National Institute of Technology, Hamirpur
  • 2. Boolean function • A Boolean function has: • At least one Boolean variable, • At least one Boolean operator, and • At least one input from the set {0,1}. • It produces an output that is also a member of the set {0,1}.
  • 3. Truth Table • Addition of 2 bits: A B Sum Carry 0 0 0 0 0 1 1 0 1 0 1 0 1 1 0 1 Sum= 𝐴′ 𝐵 + 𝐴𝐵′ 𝐶𝑎𝑟𝑟𝑦 = 𝐴𝐵 Sum= 𝐴 + 𝐵 . (𝐴′ + 𝐵′) 𝐶𝑎𝑟𝑟𝑦 = 𝐴 + 𝐵 . 𝐴 + 𝐵′ . (𝐴′ + 𝐵)
  • 4. Truth Table • Subtraction of 2 bits: A B Difference Borrow 0 0 0 0 0 1 1 1 1 0 1 0 1 1 0 0 Difference= 𝐴′ 𝐵 + 𝐴𝐵′ 𝐵𝑜𝑟𝑟𝑜𝑤 = 𝐴′𝐵 Difference = 𝐴 + 𝐵 . (𝐴′ + 𝐵′) 𝐵𝑜𝑟𝑟𝑜𝑤 = 𝐴 + 𝐵 . 𝐴′ + 𝐵 . (A’ +B’)
  • 5. Truth Table • Addition of 3 bits: A B C Sum Carry 0 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 0 1 1 1 1 1 1 Sum= 𝐴′ 𝐵′ 𝐶 + 𝐴′ 𝐵𝐶′ + 𝐴𝐵′ 𝐶′ + 𝐴𝐵𝐶 𝐶𝑎𝑟𝑟𝑦 = 𝐴′ 𝐵𝐶 + 𝐴𝐵′ 𝐶 + 𝐴𝐵𝐶′ +ABC Sum= (𝐴 + 𝐵 + 𝐶). (𝐴 + 𝐵′+𝐶′)(𝐴′ + 𝐵 + 𝐶′)(𝐴′ + 𝐵′ + 𝐶)
  • 6. Two-Level Implementations • Boolean functions in either SOP or POS forms can be implemented using 2-Level implementations. • For SOP forms AND gates will be in the first level and a single OR gate will be in the second level. • For POS forms OR gates will be in the first level and a single AND gate will be in the second level. • SOP forms can be implemented using only NAND gates, while POS forms can be implemented using only NOR gates.
  • 8. F = XZ + Y’Z + X’YZ XZ Y’Z X’YZ XZ . Y’Z . X’YZ = XZ + Y’Z + X’YZ F = XZ + Y’Z + X’YZ
  • 9. Implement the following POS function F = (X+Z) (Y’+Z) (X’+Y+Z)
  • 10. Standard SOP • Write minterms of BC + A. Solution : BC + A Write terms • XBC + AXX Add Xs where letters are missing • A’BC, ABC Vary Xs in XBC • AB’C’, AB’C, ABC’, ABC Vary Xs in AXX • Thus BC + A = A’ BC +ABC+ AB’C’ + AB’C + A B C’ + A B C • or BC + A = A’BC + ABC + AB’C’ + AB’C + ABC’
  • 11. Standard SOP F(A.B,C) = Σm(3, 7, 4, 5, 6)
  • 12. Complementary Nature of Min & Max terms
  • 13. F=Σm( 15, 11, 14, 13, 12) F=П M (0,1,2,3,4,5,6,7,8,9,10)
  • 14. Standard POS Write full form of the expression Y(A,B,C) = П M (0, 1, 3, 4)
  • 15. Standard SOP & POS • F= B’+A’C • X0X, 0X1 • (000, 001,100,101), (001,011) • F= Ʃm(0,1,4,5,3,8) F(A,B,C)=(A+B)(A’+C) • (0+0+X) (1+X+0)=(0+0+0),(0+0+1),(1+0+0),(1+1+0) • F=ПM(1,0,4,6)