Home
Search For Notes
All Search Criteria Are Optional
After:Before:
In Course:
Contains String:
0 1 2 3 4 5 6 7 8
Date tag: February 12 2010 6:1:47
n bit adder
Date tag: February 12 2010 6:0:22
1 self complementing code for binary digits is Excess 3. We encode each decimal digit by adding 3 to its binary representation, taking the middle 9 of 4 bit codewords.
Date tag: February 12 2010 5:56:17
BCD is not self complementing because we cant get the 9s complement by interchanging 0s and 1s.
Date tag: February 12 2010 5:51:49
To find the negative of a number, take the 2s complement, treating the sign bit like any other. There will be overflow iff the addend and augend have the same sign, and the sum will have the other sign.
Date tag: February 12 2010 5:51:14
Adder subtractor circuit
Date tag: February 12 2010 5:48:0
When adding to A the 2s complement of B, if A is greater than or equal to B, we get the binary representation of A minus B. If A is less than B, we get the 2s complement of B minus A. For signed number we add a sign bit. 0 means nonnegative and 1 means negative.
Date tag: February 12 2010 5:41:36
1s complement: Just change 0s to 1s and vice versa in binary representation of x.
Date tag: February 12 2010 5:41:14
You can implement any boolean function using a set of logic gates. Formalized in terms of boolean algebra, boolean operations correspond to AND,OR, and NOT gates.
Date tag: February 12 2010 5:34:25
Click here to add notes.
Date tag: February 10 2010 6:21:26
Click here to add notes.
Date tag: February 10 2010 6:13:41
Click here to add notes.
Date tag: February 10 2010 6:13:29
Click here to add notes.
Date tag: February 10 2010 6:11:42
Click here to add notes.
Date tag: February 10 2010 6:10:15
Click here to add notes.
Date tag: February 10 2010 6:8:19
Click here to add notes.
Date tag: February 10 2010 6:8:14
Click here to add notes.
Date tag: February 10 2010 6:2:46
Click here to add notes.
Date tag: February 10 2010 6:2:32
Click here to add notes.
Date tag: February 10 2010 5:59:52
Click here to add notes.
Date tag: February 10 2010 5:59:42
Click here to add notes.
Date tag: February 10 2010 5:52:28
Click here to add notes.
Date tag: February 10 2010 5:52:18
Click here to add notes.
Date tag: February 10 2010 5:48:42
Click here to add notes.
Date tag: February 10 2010 5:44:41
Click here to add notes.
Date tag: February 10 2010 5:42:22
Click here to add notes.
Date tag: February 10 2010 5:38:16
Click here to add notes.
Date tag: February 10 2010 5:34:37
Click here to add notes.
Date tag: February 10 2010 5:33:47
Click here to add notes.
Date tag: February 8 2010 6:23:14
Click here to add notes.
Date tag: February 8 2010 6:21:44
in signed arithmetic there is overflow if and only if adding two number of the same sign gives a sum of the other sign.
Date tag: February 8 2010 6:18:44
Binary subtractor.
Date tag: February 8 2010 6:18:13
Click here to add notes.
Date tag: February 8 2010 6:12:50
4 bit carry lookahead adder
Date tag: February 8 2010 6:8:51
Click here to add notes.
Date tag: February 8 2010 6:6:3
Click here to add notes.
Date tag: February 8 2010 6:3:1
Carry generate, and carry propogate.
Date tag: February 8 2010 6:2:44
In an n bit ripple carry adder, carry bits must ripple through 2n levels of logic.
Date tag: February 8 2010 5:54:28
4 bit ripple carry adder
Date tag: February 8 2010 5:53:57
Click here to add notes.
Date tag: February 8 2010 5:50:3
Click here to add notes.
Date tag: February 8 2010 5:46:57
Click here to add notes.
Date tag: February 8 2010 5:45:5
Click here to add notes.
Date tag: February 8 2010 5:40:4
Click here to add notes.
Date tag: February 8 2010 5:39:57
Binary adder subtractor.
Date tag: February 5 2010 6:24:10
Click here to add notes.
Date tag: February 5 2010 6:21:55
Click here to add notes.
Date tag: February 5 2010 6:20:19
Click here to add notes.
Date tag: February 5 2010 6:13:2
BCD to Excess 3 conversion.
Date tag: February 5 2010 6:12:25
Draw the logic circuit and check by analysis or simulation.
Date tag: February 5 2010 6:3:51
Design procedure: For simple combinational circuits determine the number of inputs and outputs, and assign a symbol to each. Then write down a truth table and obtain simplified expressions for each output.
0 1 2 3 4 5 6 7 8