Question: Create the binary encoders most efficient SOP and POS. You can assume that your circuit has a valid (V) bit. When V=0, you can assume
Create the binary encoders most efficient SOP and POS. You can assume that your circuit has a valid (V) bit. When V=0, you can assume that X1X0 are dont-cares. Calculate the cost of your designs using the list of formulas. Find and explain the worst-case delay paths.
Using any method you know, design your own version of the 8-input priority encoder gate. Your design will only have 8 inputs and can not be "parameterized" like the Digital gate.

Cost equations are below:
GATE \\ COST \\ DELAY ( x = # of Gates)
NOT \\ $0.02 \\ 1
tri-state inverter \\ $0.03 \\ 1.5
NANDx \\ $ {3 + (x 2)^2} \\ 2
NORx \\ $ {4 + (x 2)^2} \\ 2
ANDx \\ $ 3 + (x 1)^2 \\3
ORx \\ $4 + (x 1) ^2 \\3
XORx \\$ 7 + (x 2)^2 \\3
XNORx \\ $ 7 + (x 2)^2 \\3
A3 A2 A1 AO X1 Xo V V (opt.) 0 0 0 0 0 d d 0 0 0 0 1 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 1 1 1 - A3 A2 A1 AO X1 Xo V V (opt.) 0 0 0 0 0 d d 0 0 0 0 1 0 0 1 0 0 1 0 1 1 0 1 1 0 1 1 1 1 1
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
