In this paper, residue-to-binary number converters for the special moduli s
ets (2n,2n+1. 2n+2) and (2n-1, 2n, 2n+1) are studied. Errors in a previous
publication are pointed out. New and more efficient converters for both the
special moduli sets are proposed. Larger multipliers in previous methods a
re replaced by smaller multipliers and adders. The new converters use about
one-half of the hardware required by the previous methods.