Beruflich Dokumente
Kultur Dokumente
Todays Agenda
Demorgans Law Combinational Circuit Examples
Adder
Half Adder Full Adder
Demorgans Law
Suppose we complement an input before applying it to a gate gate. For example, consider
A 0 0 1 1
B 0 1 0 1
A 1 1 0 0
B 1 0 1 0
A.B 1 0 0 0
(A.B) 0 1 1 1
Same as A+B
Saturday, January 30, 2010 Biju K Raveendran@BITS Pilani. 4
Demorgans Law g
Observation
(A.B) = A+B
DeMorgan's Law
First Law A.B.C.D. A B C D . = = A B C D . A+B+C+D+ Second Law A+B+C+D . = = A.B.C.D. . Here . represents Logic AND And + represents Logic OR
Logic Structures
2 kinds
Storage Structures
Permits the storage of information (as bits)
Decision Structures D i i St t
Does not include storage of information
Truth Table:
A 0 0 1 1 B 0 1 0 1 0 1 1 0
Requirement: Adds the two bits and a carry generated from the previous bit column
Saturday, January 30, 2010 Biju K Raveendran@BITS Pilani. 11
Full Adder
Performs the addition in column i 3 inputs: ai, bi and ci 2 outputs: si and ci+1 ci is the carry in from bit position i-1 ci+1 is the carry out to bit position i+1
ai 0 0 1 1
bi 0 1 0 1
ci+1 0 0 0 1
si 0 1 1 0
SOP for Sum S = A.B.C + A.B.C + A.B.C + A.B.C SOP for Carry C = A.B.C + A.B.C + A B C + A B C A B C A B C A.B.C A.B.C
Saturday, January 30, 2010 Biju K Raveendran@BITS Pilani. 13
14