arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0901.1123cs.ARcs.DC
收藏

一种高动态范围的高效三模逆变换器

A High Dynamic Range 3-Moduli-Set with Efficient Reverse Converter

Arash Hariri, K. Navi, Reza Rastegar

摘要:

RNS是一个非常有价值的快速并行运算工具。它在数字信号处理、容错系统等方面有着广泛的应用。本文引入了3-模集{2 ^n,2^{2n}-1,2 ^{2n}+1},并利用中国剩余定理提出了它的剩余到二进制的转换器。本文给出了其简单的硬件实现,主要包括一个进位保存加法器(CSA)和一个模加法器(MA)。我们将我们的反向转换器的性能和面积利用率与模集{2^n-1,2^n,2^n+1,2^{2n}+1}和{2^n-1,2^n,2^n+1,2^n-2^{(n+1)/2}+1的反向转换器进行比较,2^n+2^{(n+1)/2}+1}具有相同的动态范围,我们证明了我们的架构在性能和面积利用率方面更好。此外,我们表明,我们的反向转换器比{2^n-1,2^n,2^n+1}的反向转换器更快的动态范围,如8位,16位,32位和64位,但它需要更多的面积。

英文摘要:

-Residue Number System (RNS) is a valuable tool for fast and parallel arithmetic. It has a wide application in digital signal processing, fault tolerant systems, etc. In this work, we introduce the 3-moduli set {2^n, 2^{2n}-1, 2^{2n}+1} and propose its residue to binary converter using the Chinese Remainder Theorem. We present its simple hardware implementation that mainly includes one Carry Save Adder (CSA) and a Modular Adder (MA). We compare the performance and area utilization of our reverse converter to the reverse converters of the moduli sets {2^n-1, 2^n, 2^n+1, 2^{2n}+1} and {2^n-1, 2^n, 2^n+1, 2^n-2^{(n+1)/2}+1, 2^n+2^{(n+1)/2}+1} that have the same dynamic range and we demonstrate that our architecture is better in terms of performance and area utilization. Also, we show that our reverse converter is faster than the reverse converter of {2^n-1, 2^n, 2^n+1} for dynamic ranges like 8-bit, 16-bit, 32-bit and 64-bit however it requires more area.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑