Fundamentals of Computer Science Part i2. Lecture 3 Digital Logic. Topics for this lecture. Gates and Boolean logic AND , OR , NOT , NAND , … Integrated circuits SSI,MSI,LSI,VLSI Memory Flip-Flop Arithmetic Half-adder, Full-adder. Microprocessor core layout.
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
AMULET3, being designed at the University of Manchester.
Low power, high performance, asynchronous, ARM compatible.
Size 3mm x 1mm.
Note signal is inverted, hence a NOT gate
A, B inputs X output
X = f(A,B)
NOTinvert (negate) single input.
AND 1 only if both inputs 1
OR 1 if at least one input 1
0 only if both inputs 1 (inverted AND)
0 if at least one input 1
Simpler - 2 instead of 3 transistors...
M = f (A,B,C)
AB for A AND B
A+B for A OR B
for NOT A
M = BC + A C + AB + ABC (majority vote)
A + BC = (A+B)(A+C) A = 0
Simpler - one type of gate…
NAND is complete (any circuit can be created from it)
Question: Can you do NOT?
XOR is eXclusive OR
1 only if exactlyone input is 1
5mm x 5mm
Classification based on number of gates:
from Small Scale Integrated (SSI), 1-10 gates,
to Very Large Scale Integrated (VLSI), > 100,000 gates
0 + 0 = 0
0 + 1 = 1
1 + 0 = 1
1 + 1 = 0 carry 1
Built from twohalf-adders