Fast digit-set conversion for flexible interval representation system

Many researches in computer arithmetic domain concerns how computational time can be speeded up. They focused on introducing high speed computing techniques. However, the computation may not always produce the exact value. Flexible interval representation system was introduced for solving such problems. Our previous work showed that addition in parallel can be performed in this system by considering the addition of odd and even digits separately. In this paper, we focus on how to improve the algorithm by reducing the number of addition steps. We propose a novel parallel digit-set conversion algorithm which can be used for performing addition together with the proof of correctness for flexible interval representation system.