﻿ BOOLEAN ALGEBRA Postulates and Theorems. (Huntington Postulates) Fundamentals for digital logic design
Custom Search
Chip Designing for ASIC/ FPGA Design engineers and Students
FULLCHIPDESIGN
Digital-logic Design...  Dream for many students… start learning front-end…
@TYH :- 4G LTE Long Term Evolution Tutorial, CloudComputing
Get Noticed:- Submit your own content to be published on fullchipdesign.com

Send it to fullchip@gmail.com

Boolean Algebra

Duality Principle:

This property of Boolean algebra state that all binary expressions remain valid when following two steps are performed:

Step 1: Interchange OR and AND operators.

Step 2: Replace all 1’s by 0’s and 0’s by 1’s.

Huntington Postulates

P1. Postulate:- x + 0 = x

From duality of P1

P2. Postulate:- x * 1 = x

Sum of a number and its complement from a Set is ‘1’.

P3. Postulate:- x + x’= 1

From duality of P3

P4. Postulate:- x * x’ = 0

From commutative property of binary numbers we have:-

P5. Postulate:- x + y = y + x

From duality of P5

P6. Postulate:- x * y = y * x

From distributive property of binary numbers we have:-

P7. Postulate:- x(y + z) = xy + xz

From duality of P7

P8. Postulate:x + y = (x + y) (x + z)

Theorems of Boolean Algebra derived from Huntington postulates

T1. Theorem:- x + x = x

x + x = (x + x)*1= (x + x)(x + x’)

From P8, x + xx’ = x

From duality of T1

T2. Theorem:- x*x = x

T3. Theorem:- x + 1 = 1

x + 1= (x + 1).1= (x +1)*(x + x’)

From P8, (x + 1*x’)= (x + x’)= 1

From duality of T3

T4. Theorem:- x.0 = 0

T5. x + (y + z) = (x + y) + z

From duality of T5

T6. Theorem:- x(yz) = (xy)z

T7. Theorem:- (x’)’ = x

From duality of T10

T11. Theorem:- x(x+y) = x

T8. Theorem:- (x + y)’ = x’y’

T9. Theorem:- (xy)’ = x’ + y’

T10. Theorem:- x + xy = x

Binary Numbers 1s_complement 2s_complement Binary Subtraction Binary Sub. Ex's Sign_magnitude SignM EX Gray Coding BCD coding Digital gates NAND NOR & XNOR Theorems Boolean Functions BFunc Examples Minterm Maxterm Sum of Minterms Prdt of Maxterms 2 var K-map 3 var K-map 4 var K-map 5 var K-map Prime Implicant PI example K-map Ex's KMap minimization 2 var EX
Resources
Verilog RTL code examples for front-end chip design.
Digital Design Topics
Stack Organization - LIFO, RPN
RTL coding guidelines. ICG cell, Assertions, , levelsChandle
Pipeline vs. Parallel processing.
LTE - Long Term Evolution topics1 here.
Interview Questions. Main, FPGA, Digital Fundamentals