An algorithm for the design of a residue-to-binary converter

This paper presents a new algorithm which converts moduli (2^k , 2^k-1, 2^k-1-1) residue numbers to their binary equivalents. A suitable hardware implementation which utilizes binary adders, and needing no memory, is proposed. If the system is pipelined, then the throughput rate is that of a single (3k-1) bits adder. Thus, hardware requirements and execution time are less, with corresponding larger dynamic range