A table-lookup scheme for residue-to-binary conversion

Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers Pub Date : 1995-10-30 DOI:10.1109/ACSSC.1995.540543

C.C. Lamb, L. DeBrunner

引用次数: 2

Abstract

Residue number system (RNS) implementations can provide speedup for addition, subtraction, and multiplication. However, conversion from RNS to binary is a significant bottleneck. We present an efficient scheme to convert residue numbers to binary numbers using table-lookup. The overall goal is to minimize the hardware needed for implementation while maximizing the speed of the conversion. Our design decreases the table size by a factor of 2 and reduces the number of required lookups compared to an existing design.

查看原文本刊更多论文

残数到二进制转换的表查找方案

残数系统(RNS)实现可以为加法、减法和乘法提供加速。然而，从RNS到二进制的转换是一个重要的瓶颈。提出了一种利用表查找将剩余数转换为二进制数的有效方法。总体目标是尽量减少实现所需的硬件，同时最大限度地提高转换速度。与现有设计相比，我们的设计将表大小减少了1 / 2，并减少了所需的查找次数。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers

自引率

0.00%

发文量