70 likes | 167 Views
HARDWARE AND BIT opERATIONS M. Antczak, S. Wąsik. 7. Karnaugh table. how many bits are needed?. 3. Binary Grey Code. f(1) = c. f(0) = c. a b c. y. _ f(1) = bcd. _ __ f(1) = bcd v acd. _ __ __ f(1) = bcd v acd v bc.
E N D
HARDWARE AND BIT opERATIONS M. Antczak, S. Wąsik
7 Karnaughtable how many bits are needed? 3 Binary Grey Code f(1) = c f(0) = c a b c y
_ f(1) = bcd _ __ f(1) = bcd v acd _ __ __ f(1) = bcd v acd v bc
Leftshift Rightshift