A 2-D look up table should consist of:
2 vectors, one "n"*8 bytes, another "m"*8 bytes (8 bytes assuming double format numbers) 1 array of n * m * 8 bytes.
The smallest 2-D lookup table, woiuld therefore take 24 bytes, for a 1x1 lookup table. The smallest useful lookup table would be 64 bytes (2x2)
A more realistic LUT would be 100 x 100, which would take 81,600 bytes. (plus small overheads)
