
doi: 10.1109/82.899659
Summary: A high-speed residue-to-binary converter for the moduli set \((2^k, 2^k- 1, 2^{k-1}- 1)\) is proposed. Compared to the previous converter based on this moduli set, the proposed one is 40\% faster. Also, the time-complexity product is improved by 20\%. Following the top-down very large scale integration design flow, the proposed converter is implemented in 0.5-micron CMOS technology. Based on this moduli set, layouts of the 8-, 16-, 32-, and 64-bit residue-to-binary converters, which can be used in further residual number system designs, are generated and simulation results obtained.
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), digital signal processing, VLSLI implementation, Mathematical problems of computer architecture
Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.), digital signal processing, VLSLI implementation, Mathematical problems of computer architecture
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 70 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
