A binary encoder encodes codewords from $2"$ inputs into an n$-$bit output code. Only one of the input bits can have a value of logical$-1,$ and the outputs identifies which bit of an input is equal to $1.$ In case of n$=3$ and D$7$ has the highest priority and D$0$ has the lowest priority,

a$)$

Fill in the truth table given in Table $2.$

b$)$ Use Karnaugh map in order to find the optimum sum of product $($arp$$mlar toplam$)$ representation of the Boolean functions of the outputs that are defined by the truth table found in $($a$).$

c$)$

Draw the optimized circuit for the Q$2$ output.

INPUTS

D$7$ D$6$ D$5$ D$4$ D$3$

OUTPUTS

D$2$ DI