Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114
Date tag: January 5 2010 5:15:53
Click here to add notes.
Date tag: January 5 2010 5:2:42
Click here to add notes.
Date tag: January 5 2010 5:2:33
Click here to add notes.
Date tag: January 5 2010 5:1:49
Click here to add notes.
Date tag: January 5 2010 4:56:24
CS 138
Date tag: January 4 2010 9:19:42
Click here to add notes.
Date tag: January 4 2010 9:16:21
Click here to add notes.
Date tag: January 4 2010 9:7:27
Click here to add notes.
Date tag: January 4 2010 9:2:3
Click here to add notes.
Date tag: January 4 2010 8:58:43
Click here to add notes.
Date tag: January 4 2010 8:53:10
Linear Approximation.
Date tag: January 4 2010 8:49:3
Intro to approximations
Date tag: January 4 2010 8:35:25
Click here to add notes.
Date tag: January 4 2010 8:35:17
Click here to add notes.
Date tag: January 4 2010 8:21:20
Click here to add notes.
Date tag: January 4 2010 8:21:15
Click here to add notes.
Date tag: January 4 2010 8:16:47
Click here to add notes.
Date tag: January 4 2010 8:13:35
Click here to add notes.
Date tag: January 4 2010 8:10:44
Click here to add notes.
Date tag: January 4 2010 8:10:29
a does not divide b
Date tag: January 4 2010 8:5:1
Click here to add notes.
Date tag: January 4 2010 8:4:9
Notation for a divides b
Date tag: January 4 2010 8:0:15
Integers
Date tag: January 4 2010 7:54:43
Click here to add notes.
Date tag: January 4 2010 7:48:29
Click here to add notes.
Date tag: January 4 2010 7:43:57
The test for divisibility by 4 works because 100 is divisible by 4. Why does the test for 9 work Because 10 equals 9 plus 1
Date tag: January 4 2010 7:38:41
N is not divisible by 4. We know this because the last two digits, 34 form an integer which is not divisible by 4. N is divisible by 9 because the sum of digits of N is 45 which is divisible by 9.
Date tag: January 4 2010 6:3:32
Speed, in the context of circuits, means reducing the number of levels of logic between inputs and outputs.
Date tag: January 4 2010 6:0:13
Key themes in this course include simplification which usually means reducing the number of gates. This reduces the area consumed on a chip and reduces power consumption.
Date tag: January 4 2010 5:59:44
The second type of circuit system is a sequential circuit system. These circuits incorporate memory, and have an output that is dependent on the sate of the system. They are implemented as gate circuits with feedback.
Date tag: January 4 2010 5:55:10
There are 2 main types of circuit systems: The first is combinational circuits, which have no memory are implemented as gate circuits without feedback. Combinational circuits are implementations of boolean functions. Examples include adders, multipliers, multiplexers.
Date tag: January 4 2010 5:51:32
Gates can be implemented in various technologies. electric relay circuits, electronics, microfluids.
Date tag: January 4 2010 5:49:29
Switching algebra is based on a few simple operations. Circuit elements that implement these basic operations are called gates.
Date tag: January 4 2010 5:47:6
Claude Shannon: Binary functions can be represented as expressions in Boolean algebra. More precisely as an expression in switching algebra, the 2 element Boolean algebra.
Date tag: January 4 2010 5:43:44
Claude Shannon
Date tag: January 4 2010 5:41:33
Digital system: Signals represent sequences of numerical digits. Binary functions take binary inputs and produce binary outputs.
Date tag: January 4 2010 5:29:42
Click here to add notes.
Date tag: January 4 2010 5:29:30
SE 141, Digital Circuits Systems Prof. J. G. Thistle
Date tag: December 27 2009 6:52:46
Click here to add notes.
Date tag: December 27 2009 6:52:45
Click here to add notes.
Date tag: December 27 2009 6:52:44
Click here to add notes.
Date tag: December 27 2009 6:52:43
Click here to add notes.
Date tag: December 27 2009 6:52:42
Click here to add notes.
Date tag: December 27 2009 6:52:41
Computational decision making
Date tag: December 27 2009 6:52:40
Click here to add notes.
Date tag: December 27 2009 6:52:39
Click here to add notes.
Date tag: December 27 2009 6:52:38
Click here to add notes.
Date tag: December 27 2009 6:52:37
Click here to add notes.
Date tag: December 27 2009 6:52:36
It is usually difficult, if not impossible to solve them. Computers can approximate solution.
Date tag: December 27 2009 6:52:35
Any spanning set of U can be cut down to a basis of U.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114