An arithmetic free parallel mixed-radix conversion algorithm

Abstract

A new, parallel mixed-radix (MR) conversion algorithm, based upon lookup tables, with no required arithmetic is presented. When pipelined, an effective conversion rate of one conversion per table lookup is achieved. The new algorithm is attractive for hardware implementation since it requires no arithmetic or logical units. The algorithm is shown to be faster than existing pipelined algorithms.