IST4_lec14

IST4_lec14 - IST 4 Information and Logic IST 4 Planned...

Info iconThis preview shows pages 1–29. Sign up to view the full content.

View Full Document Right Arrow Icon
IST 4 Information and Logic
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
1 M1 31 6 2 6 5 26 19 M2 5 4 12 4 5 3 M2 28 3 2 21 2 1 14 M1 7 fri thr wed tue mon IST 4: Planned Schedule – Spring 2008 x= hw#x out x= hw#x due = today T Mx= MQx out Mx= MQx due Old/Odd Machines that Compute Please send a pdf file named yourname-mq2.pdf to [email protected] T
Background image of page 2
Symmetric Functions Definition: A Boolean function f is symmetric if for an arbitrary permutation Theorem: A Boolean function f(X) is symmetric if and only if it is a function of the number of 1’s in X, namely |X|
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Number of Symmetric Functions Theorem: The number of symmetric functions of n variables is: Proof: f symmetric f a function of |X| can be 0 or 1 * functions Q 0 1 2 n * * * * Symmetric function table We know that
Background image of page 4
Implementing a 2-bit Adder 2 symbol adder digit 1 digit 2 carry sum carry
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 0 1 1 0 2 0 1 2 3 XOR 0 = 1 =
Background image of page 6
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 0 1 1 0 2 0 1 2 3 XOR 0 = 1 =
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 0 1 1 0 2 0 1 2 3 XOR 0 = 1 = XOR
Background image of page 8
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 0 1 1 0 2 0 1 2 3 XOR 0 = 1 = XOR
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 0 1 1 0 2 1 3 XOR 0 = 1 = XOR This two node are equivalent
Background image of page 10
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 0 1 1 0 2 1 3 XOR 0 = 1 = XOR
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
0 1 2 Implementing a 2-bit Adder 3 1 1 0 0 0 = 1 = XOR
Background image of page 12
Implementing a 2-bit Adder 0 1 2 3 0 1 0 1 0 0 0 1 2 3 MAJ 0 = 1 = 0 1 1 2
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Implementing a 2-bit Adder 0 1 2 3 0 1 0 1 0 0 0 1 2 3 MAJ 0 = 1 = 0 1 1 2
Background image of page 14
Implementing a 2-bit Adder 0 1 2 3 0 1 0 1 0 0 2 3 MAJ 0 = 1 = 1 1 >1 There is no reason to check c
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Implementing a 2-bit Adder 0 1 2 3 0 1 0 1 0 0 2 3 MAJ 0 = 1 = 1 1 >1 There is no reason to check c
Background image of page 16
Implementing a 2-bit Adder 0 1 2 3 0 1 0 1 0 0 MAJ 0 = 1 = 1 1 >1 2
Background image of page 17

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Implementing a 2-bit Adder 0 1 2 3 0 1 0 1 MAJ 0 = 1 =
Background image of page 18
Implementing a 2-bit Adder Summary 0 = 1 = XOR 8 relays 6 relays MAJ Combination of the two functions?
Background image of page 19

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Implementing a 2-bit Adder Summary 0 = 1 = XOR 8 relays 6 relays MAJ Combination of the two functions?
Background image of page 20
Relay Circuits for the Sum and the Carry Functions 1 MAJ XOR sum: carry: 2 symbol adder c s d 1 d 2 c How many relays for a 2 symbol adder? 10
Background image of page 21

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Analysis vs. Synthesis
Background image of page 22
Key to this Progress Abstractions in Information Systems Physics = relay circuits Syntax = Boolean algebra reasoning
Background image of page 23

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Abstractions in Biological Information Systems ???? Biology = ????? Syntax = ????? reasoning
Background image of page 24
A G E G D F F E D D C B C B A k k k k k ⎯→ + + ⎯→ ⎯→ + ⎯→ + ⎯→ + 5 4 3 2 1 Chemical Reactions Networks 1 2 5 4 3
Background image of page 25

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A G E G D F F E D D C B C B A k k k k k ⎯→ + + ⎯→ ⎯→ + ⎯→ + ⎯→ + 5 4 3 2 1 Chemical Reactions Networks 1 2 5 4 3
Background image of page 26
A G E G D F F E D D C B C B A k k k k k ⎯→ + + ⎯→ ⎯→ + ⎯→ + ⎯→ + 5 4 3 2 1 1 2 5 4 3 Chemical Reactions Networks
Background image of page 27

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Abstractions in Biological Information Systems ???? Biology =
Background image of page 28
Image of page 29
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/12/2009 for the course IST 4 taught by Professor Shuki during the Spring '09 term at Caltech.

Page1 / 83

IST4_lec14 - IST 4 Information and Logic IST 4 Planned...

This preview shows document pages 1 - 29. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online