Suppose we need a logic circuit with a logic output G that is high only if a certain hexadecimal digit is 1, 5, B, or F. The inputs to the logic circuit are the bits B 8 , B 4 , B 2 and B 1 of the binary equivalent for the hexadecimal digit. (The MSB is B 8 and the LSB is B 1 ) a. Fill in the Karnaugh map shown in Figure T7.6. b. Determine the minimized SOP expression for G. c. Determine the minimum POS expression for G.

Design a logic circuit that illustrates Rule 11 of Boolean algebra: A+ AB = A + B A pulse generator is used to represent the input A and a switch is used for the input B. Switch B is open for B = 1 and closed for B = 0. Draw the logic circuit. Also, draw the timing diagrams for the following scenarios: i. B = 0 ii. B = 1

Grey converters are often used in industrial circuits where the normal sequence of binary numbers may produce ambiguity during transition. This is elliminated with the Grey code, as only one bit changes, during a normal transition of sequential numbers.   Show the logic required to convert a 10-bit binary number to Gray code and use that logic to convert the following to Gray code: a)      1010101010   b)      1111100000  c)      0000001110  d)  1111111111

please help just answer as much as you can, no need to complete all. thank you

Draw a logic diagram for part a and simplify the Boolean expression in part (a) using a karnaugh map for part b. The picture contains more details of the question.