An efficient algorithm, which converts residue numbers, module (2/sup n/+1, 2/sup n/, 2/sup n/-1), into an equivalent binary number, is proposed; the algorithm improves on a previously published technique. A novel hardware implementation is also discussed. In comparison with two previously published converters, the proposed converter provides at least a 40% hardware saving and a 45% reduction in the delay.
No takes yet. Share an insight, caveat, or question.
Miller et al. (2000) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: