Given that the variables A[2:0] form a three bit grey code to represent numerical values:
i) Write down all binary combinations for A[2:0], in ascending order of numerical value
ii) A three bit grey code to decimal decoder is to be designed, where the outputs X[0:7] are active low. Write down the boolean functions of each output terminal.
The Attempt at a Solution
I think the first part is easy enough, it's just grey code (only change one bit at a time)
The second part is confusing me though, and it's to do with the "active low part". Initially I got what's below but how is it any different to if the outputs weren't active low ?!
X0 = A2'A1'A0'
X1 = A2'A1'A0
X2 = A2'A1A0
X3 = A2'A1A0'
X4 = A2A1A0'
X5 = A2A1A0
X6 = A2A1'A0
X7 = A2A1'A0'