赵英旭, 李磊. 基于余数基{2n-1,2n,2n+1}的高效RNS缩放结构[J]. 微电子学与计算机, 2014, 31(5): 71-73,78.
引用本文: 赵英旭, 李磊. 基于余数基{2n-1,2n,2n+1}的高效RNS缩放结构[J]. 微电子学与计算机, 2014, 31(5): 71-73,78.
shu
ZHAO Ying-xu, LI Lei. An Efficient RNS Saler for {2n-1,2n,2n+1}[J]. Microelectronics & Computer, 2014, 31(5): 71-73,78.
Citation: ZHAO Ying-xu, LI Lei. An Efficient RNS Saler for {2n-1,2n,2n+1}[J]. Microelectronics & Computer, 2014, 31(5): 71-73,78.
shu

基于余数基2n-1,2n,2n+1的高效RNS缩放结构

An Efficient RNS Saler for 2n-1,2n,2n+1

    摘要
  • 摘要: 针对三模余数基2n-1，2n，2n+1提出了一种高效的余数系统（RNS）缩放算法和缩放结构，本设计运用中国剩余定理（CRT）选择2n（2n+1）作为缩放因子实现了基于全加器（FA）的缩放结构，从而使三个余数通道的余数和缩放后的二进制整数相同，因此可以节约一个面积和延迟都很大的余数到二进制（R/B）转换模块.在特定条件下本设计会出现缩放误差，但是这个误差值统一都为1.本设计实现了简单高速的特性，且在很大的动态范围内面积时延（AT）积比目前最简单最快的基于全加器的缩放结构小一倍.

     

    Abstract: This paper presents an efficient Residue Number System (RNS) scaling algorithm and architecture for the balanced special moduli set2n-1,2n,2n+1.Based on Chinese Remainder Theorem (CRT),the scaling constant has been chosen as 2n (2n+1) such that all residues of the scaled integer are identical and equal to the scaled integer output.This is particularly useful as no expensive and slow residue-to-binary converter is required for interfacing with conventional number system after the digital signal processing and scaling in RNS domain.The scaling error occurs only conditionally and is proven to be at most unity.The proposed architecture can be implemented entirely based on full adders with complexity commensurate with a multi-operand modulo adder.Its area-time complexity is about 2times smaller than one of the fastest based on full adders scaler architecture for the same moduli set over a wide dynamic range.

     

    • HTML全文
    • 参考文献(0)
    • 相关文章
    • 施引文献
  • 资源附件(0)

/

返回文章
返回