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 5 2010 6:1:8
Click here to add notes.
Date tag: February 5 2010 6:0:46
Then eliminate labels of intermediate signals.
Date tag: February 5 2010 5:52:25
Cauchys procedure: Label all gate outputs and write and equation for each gate.
Date tag: February 5 2010 5:45:35
Combinational circuits.
Date tag: February 5 2010 5:43:0
XNOR on variables is true iff an even number of these variables is true. Kmaps are like those for XOR with 0s and 1s interchanged.
Date tag: February 5 2010 5:41:5
Parity checking
Date tag: February 5 2010 5:37:58
Exclusive or XOR is true iff an odd number of the variables are true.
Date tag: February 3 2010 6:23:22
Click here to add notes.
Date tag: February 3 2010 6:23:11
The generalized version of the exclusive or function is true iff an odd number of variables is true. The XOR function is associative. So parenthesis can be omitted.
Date tag: February 3 2010 6:19:44
n plus 1 bit adder
Date tag: February 3 2010 6:14:4
Click here to add notes.
Date tag: February 3 2010 6:8:45
The exclusive OR, XOR, function of x and y is true when exactly one of the variables is true.
Date tag: February 3 2010 6:8:38
Exclusive OR function
Date tag: February 3 2010 5:58:11
or and invert
Date tag: February 3 2010 5:55:1
Click here to add notes.
Date tag: February 3 2010 5:54:48
Click here to add notes.
Date tag: February 3 2010 5:48:34
Mistake in this image, see next image.
Date tag: February 3 2010 5:44:11
Click here to add notes.
Date tag: February 3 2010 5:43:58
8 of the possible 2 level implementations degenerate into 1 level circuits.
Date tag: February 1 2010 6:19:25
Click here to add notes
Date tag: February 1 2010 6:17:43
Click here to add notes.
Date tag: February 1 2010 6:11:16
Click here to add notes.
Date tag: February 1 2010 6:8:58
Click here to add notes.
Date tag: February 1 2010 6:8:36
NAND and NOR implementations. We can implement any functions using only NAND gates.
Date tag: February 1 2010 6:2:51
Click here to add notes.
Date tag: February 1 2010 5:59:15
Click here to add notes.
Date tag: February 1 2010 5:51:50
Dont care conditions.
Date tag: February 1 2010 5:44:48
1s correspond to minterms in sum of minterms expressions for F. 0s correspond to maxterms in products of maxterms expressions for F.
Date tag: February 1 2010 5:42:11
Click here to add notes.
Date tag: February 1 2010 5:37:56
Simplified product of sums: We get a product of maxterms expression for F by first writing a sum of minterms expression for F prime, then applying demorgans law. To find a simplified product of sums expression write a simplfied sum of products expression for f prime by grouping 0s.
Date tag: January 29 2010 6:19:19
5 variable k maps
Date tag: January 29 2010 6:11:11
Click here to add notes.
Date tag: January 29 2010 6:10:59
To get maximally simplified sum of products, use only prime implicants. If a prime implicant covers a 1 cell that is not connected by any other prime implicant, it is an essential prime implicant. So the maximally simplified expressions need not be unique.
Date tag: January 29 2010 6:7:2
Each valid grouping is called an implicant. Truth of corresponding implies truth of the function. A valid grouping that is not considered in any other is a prime implicant. This means that the corresponding product has no factors that correspond to implicants.
Date tag: January 29 2010 6:2:7
Each valid grouping of 1 cells in a 4 variable kmap represents a product. Each 1 cell represents 4 literal products a minterm. Each pair of adjacent cells represents a 3 literal product. Each valid grouping of four 1 cells represents a product of 2 literals. Each valid grouping of 8 represents a single literal.
Date tag: January 29 2010 5:58:54
Click here to add notes.
Date tag: January 29 2010 5:55:46
Click here to add notes.
Date tag: January 29 2010 5:55:35
Gray code introduces a wrinkle in minterm pattern
Date tag: January 29 2010 5:46:27
Click here to add notes.
Date tag: January 29 2010 5:40:26
3 variable k map
Date tag: January 27 2010 6:22:35
Click here to add notes.
Date tag: January 27 2010 6:19:4
Click here to add notes.
Date tag: January 27 2010 6:16:53
karnaught maps or kmaps k maps
Date tag: January 27 2010 6:13:46
Click here to add notes.
Date tag: January 27 2010 6:5:7
Click here to add notes.
Date tag: January 27 2010 6:3:57
Click here to add notes.
Date tag: January 27 2010 6:0:11
So, we just define NAND and NOR gates to give the complement of the output of an AND, or OR gate with the same input would produce.
Date tag: January 27 2010 5:59:30
Click here to add notes.
Date tag: January 27 2010 5:54:25
Click here to add notes.
Date tag: January 27 2010 5:51:16
Click here to add notes.
0 1 2 3 4 5 6 7 8