Using Memory to implement a Boolean Function
Need to use one address line for each boolean variable.
3 variables use 3 address lines, need 8 locations in memory. 4 variables use 4 address lines, need 16 locations in memory 5 variables use 5 address lines, need 32 locations in memory… etc.
For N variables, need 2N locations in memory.
For each FUNCTION to be implemented, need a bit at each location.
K x 1 Memory can implement 1 boolean function of log2(K) variables (16 x 1 memory can implement F(A,B,C,D). K x 2 Memory can implement 2 boolean functions of the same log2(K) variables (32 x 2 memory can implement F(A,B,C,D,E) and G(A,B,C,D,E). Etc..