Given
Out =
(A+B+C+D')(A+B+C'+D)(A+B'+C+D')(A+B'+C'+D)(A'+B'+C'+D)(A'+B+C+D')(A'+B+C'+D)
M1 = 0001 = (A+B+C+D')
M2 = 0010 = (A+B+C'+D)
M5 = 0101 = (A+B'+C+D')
M6 = 0110 = (A+B'+C'+D)
M14 = 1110 = (A'+B'+C'+D)
M9 = 1001 = (A'+B+C+D')
M10 = 1010 = (A'+B+C'+D)
The Simplified POS form of F (A, B, C, D) = = (B+C+D’)(C’+D)(A+C+D’)
From the above the minterms of F (A, B, C, D) = m (0, 3, 4, 7, 8, 11, 12, 13, 15)
The SOP form of F (A, B, C, D) = = ABC’+C’D’+CD
Computer Engineering 3. (3 points) Simplify the following POS expression, giving the result in SOP form....
1. Use K-maps to reduce each of the following to a minimized SOP form: (a) A + BC + CD (b) ABCD + ABCD + ABCD + ABCD (c) ABCD + CD) + ABCD + CD) + ABCD (d) (AB + ABXCD + CD) (e) AB + AB + CD + CD 2. Use K-maps to find the minimum SOP expression for the logic function shown in the table to the right. Implement the circuit using NAND gates only. Inputs...
4. Please convert the SOP Boolean Expression to Cannoncial Standard POS form and its shorthand form by hand and by using a truth table. (A*~B * C) + ("A *~B) + (A * B * C * D)
Construct the Karnaugh maps and find the minimum SOP, and minimum POS expression for each of these logic functions: a.) ? = ?̅ ?̅?̅ + ?̅ ??̅ + ??̅? + ??? b.) ? = ?̅?̅?̅+ ??̅?̅+ ?̅?̅? + ??̅? + ?̅?? c.) ? = ?̅???̅ + ???̅?̅ + ???̅? + ???
Problem 1 Simplify the following expression in SOP form and implement it with only Equivalents: AND
Question 2 1. Formulate the minimized SOP and POS Boolean expression for the following truth table using Karnaugh map techniques. Out of the SOP and POS implementations, which is cheaper in terms of number of transistors? You can assume two transistors per input for a gate. (10 points) A B C Output 0 0 0 1 1 0 0 1 0 1 0 0 0 1 0 1 1
7) Design truth table, POS/SOP, circuit and simplify form. (only do the highlighted one) oloa 1 Sum Term ST D + C + B +A D + C + B + A D + C + B'+ A D + C + B' + A' D + C' + B + A D + C' + B + A' D + C + B'+ A D + C + B' + A D' + C + B + A D'...
Obtain the simplest SOP and POS for the following logical expression using K-MAP. 8. F(A,B,C,D) = ABD + ABCD
5) Design truth table, POS/SOP, circuit and simplify form. (only do the highlighted one) 5 Sum Term е ST D+C+ B+ A 1 0 D +C+B+ A D+C+B'+ A D+C+B'+ A 1 0 0 D+C+ B+A 0 D+ C'+ B + A D+C'+B'+A 1 D+C+B'+ A D' +C+B+A 0 1 D'+ C+ B A 7 Sum Terms 3 Product Terms
Express the following SOP expression a a POS expression using a Karnaugh map and DeMorgan's theorems A middot B middot C middot D + A middot B middot C middot D + A middot B middot C middot D + A middot B middot C middot D + A middot B middot C middot D + A middot B middot C middot D + A middot B middot C middot D + A middot B middot C middot D.
1) Design truth table, POS/SOP, circuit and simplify form. (only do the highlighted one) 1 Sum Term ST a D + C+ B + A D +C+ B+ A 1 1 D +C+ B' + A D + C+ B'+ A' D + C'+ B A D+C' B+A' 1 0 1 D +C'B'A 1 D+C'+B'+ A' 1 D'+C+ B+A 1 1 D'C+B+A' 2 Sum Terms 8 Product Terms