It is shown how, by augumenting a microprocessor or mincomputer with a relatively small amount of iteratively driven logic, the operation of table lookup using a binary search algorithm can be speeded up by 1½ to 2 orders of magnitude. The approach is very suitable for 1.s.i. implementation as a standard peripheral device for a microprocessor.