Coe 0132: Logic Design

Who, what, where, why?

1. Why:
Why Are You Here?
Why Enrolled in CoE?
Why this class?
2. Where:
Lecture
Section (no lab): TA Yan Bonan
3. What:
Introduce formal Boolean Logic and number systems
Minimization methods for boolean equations
Introduction to gates
Combinational and sequential circuits
4. Who:
Mark Kahrs
Research in Audio and Music Engineering, Test equipment
design, CAD tools
Sparetime: Play squash and soccer, cooking travel, wining and
dining.
Course details:
Homeworks 30%
Midterm 2 30%
Final 40%
Total 100%
1
The social contract (Locke):
I promise to do the best I can - You promise to do the best you can
No (texting, email, phone calls) in class
2 exams (closed book) - no excuses
Do your own work - or else...
Design of material:
1. 0132 - logic and gates
2. 0142 - Computer architecture
3. 0501 - arithmetic from gates, lab, VHDL
4. 1501 - complete computer
2
1. Combinational logic: no memory
Specied by truth table or equation: output for each possible
input
Boolean Algebra (values 0,1 only; functions of , and
Logic gates implement boolean functions
Systematic methods for transforming truth tables into gates
2. Sequential logic: with memory
Latch/Flip-op: built from gates with feedback
Registers: built from Flip-ops
RAM: Completely dierent animal
Can use ip-ops to construction primitive machines
3
In the beginning...
The Digital Illusion (Kahrs): Continuous Voltages become discrete
values
We will assume that all signals are 0,1 and all switches are ideal
A gate is a boolean function from inputs to outputs
Elementary gates: (First switches, then as gates)
And (product)
Or (sum)
Not (inverter)
Xor (addition)
More elementary gates:
Nand (not product)
Nor (not sum)
Xnor (not addition)
Historical note: Cray-1 (circa 1975) Supercomputer: Three chip types
(200,000 gates):
1. dual 5-4 NOR gate (one 5-input, and one 4-input, each with
dierential output)
2. 16x4-bit high speed (6 ns) static RAM (SRAM)
3. 1,024x1-bit slow (50 ns) SRAM
4
Positional notation:
D = d
n1
d
n2
. . . d
1
d
0
In base 10: V (D) = d
n1
10
n1
+ d
n2
10
n2
+ . . . + d
1
10
1
+ d
0
10
0
B = b
n1
b
n2
. . . b
1
b
0
In base 2: V (B) = b
n1
10
n1
+ b
n2
10
n2
+ . . . + b
1
10
1
+ b
0
10
0
Least Signicant Bit (LSB): b
0
Most Signicant Bit (MSB): b
n1
Bytes [8 bits] (octets) and nibbles [4 bits]
Conversion from decimal to binary Octal (base 8) and Hexadecimal (base
16)
Hexi Decimal Octal Binary
Hexi X DecMult DecSplit Decode
Decimal Division X Division Division
Octal DecSplit DecMult X Decode
Binary Split Multiply Split X
Decode = Decode into binary
Split = Count o bits, then recode
Multiply = Multiply and sum powers of r
Division = repeated division until quotient == 0
DecMult = Decode, then multiply (ex: B = 11*16)
DecSplit = Decode, then convert binary (ex: B = 1011, split)
Simple arithmetic: Addition, subtraction (tricky!), shifting
Start Boolean Logic: Axioms and Theorems
5
Next Lecture
Things to do:
read Ch. 1, Ch. 2
6