k maps what is the minimal (sop and pos) using the given minterms in #2

looking for minimal sop and minimal pos for w, x, y, z,v

using this specific table m7 (1000)

find minimal sop and minimal pos of w, x, y, z, v

2.) Express V, W, X, Y, Z in minterm list form a. W = m(75.5) b. X = m( 4.5.6) Y = {m(2.3.6,9) d. Z = m( 3, 3.5,8) e V = m(1.2.3.4.5.6.7.8.9) 3.) Utilizing invalid codes as "don't care" conditions. Use the MAPS below to simplify the expression for each of the outputs. Simplify for both SOP and POS. K-map for W A 8 PA 00 01 11 10 U2U ollX - 7 DO r. Minimal SOP = A + BCD co 00 01 11 10 00 OOX 01 DO NO Minimal POS = 2B + BC + BCO EECE 2650 Logic Design Assignment 1 Due Monday 2/24/20 Objective: esigning a digital system that converts The objective of this assignment is to familiarize the student with all the tools necessary full combinational logic design. The student will be tasked with designing a digital system that com one binary code to another. The student will also be asked to convert their design to multiple implementations based on available technology The student is to design a digital logic system that converts Binary Coded Decimal (BCD) to a weighted 7-4-2-1 code. For a refresher on these codes, see Chapter 2 in the textbook. Part 1: Finding the Boolean Expressions for each output 1.) Fill in the truth table for this design A,B,C,D will be the input BCD code and W,X,Y,Z will be the output code. V is a validity bit that =1 when the input code is valid. Assume invalid codes can be treated as "don't care conditions for W,X,Y and Z. Decimal equivalent Outputs (7421) (MSB -> LSB) Y Z v 0 Inputs (BCD) (MSB -> LSB) ABCD OOOO 0 0 0 1 0 0 1 0 0 0 1 1 0 1 0 0 0 1 0 1 0 1 1 0 0 1 1 1 1 ooo 1 001 1 0 1 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1 1 0 1 1 1 1 xx8828---oololololo 00- N0-0-0-00-00 13 14 15 1