Answer Happy

CD 1. PLA Implementation and Multiple Outputs (10%) a) Program the PLA to implement the logic defined by the K-maps shown. Use an "X" to show a connection. Write the expression for each AND over its input lead as indicated. Do not add any AND gates. D CD CD AB 00 01 11 10 AB 00 01 1110 AB 00 01 11 10 00 1 00 1 d1 00 1 12 011 01 1 1 01 1 1 B (11 11 А А A 101 1 1 (10 1 1 d1 10 111 Map of F E Map of G Map of H write each AND term here F G H ht b) Assume that now you want to implement the same circuit with regular login gates (not PLAY Revise
BHI b) Assume that now you want to implement the same circuit with regular logic gates (not PLA). Revise the looping of the K-maps for this purpose and obtain the corresponding Boolean equations for F, G, and H using the heuristic approach. Minimize the number of gates. D CD AB 00 01 11 10 001 01 1 B CD D AB 00 01 11 10 001 d1 01 1 1 (11 B A 10 11 d1 Map of G CD AB 00 01 11 10 00 1 1 d 01 1 1 (11 1 1 A 10 1 1 Map of H 11 1 B d 1 1 A 101 Map of F F= G= H= 5/13