Implementation of level-index arithmetic using partial table look-up

This paper is concerned with finding fast efficient algorithms for performing level-index arithmetic. The approach used combines the advantages of parallel processing with the use of table look-up. The latter is used only for short words and the result is a potential implementation with ℓi operation times comparable with floating-point long multiplications.