Optimal time mixed radix conversion for residue number applications

A novel method is proposed for converting integers from a residue notation to a mixed radix (MR) weighted system. The method reconsiders the table look up approach introduced by Huang and is based upon a modified formulation of Chinese Remainder Theorem (CRT) allowing fast conventionallogic implementations. It is shown that the time required to perform MR conversion becomes O (log s), where s represents the total number of input bits, and coincides with the trivial lower bound ? (log s).