首页> 外文会议>2013 International Joint Conference on Awareness Science and Technology and Ubi-Media Computing >A residue to binary converter for a balanced moduli set {22n#x002B;1 #x2212; 1, 22n, 22n #x2212; 1}
【24h】

A residue to binary converter for a balanced moduli set {22n#x002B;1 #x2212; 1, 22n, 22n #x2212; 1}

机译:用于平衡模数集{2 2n + 1 − 1,2 2n ,2 2n − 1 }的残差二进制转换器

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose a new moduli set {22n+1 − 1, 22n;22n − l} with its associated reverse converter. The proposed reverse converter is based on Mixed Radix Conversion (MRC). In addition to parallelizing and optimizing the MRC algorithm, the resulting architecture is further simplified in order to obtain a reverse converter that utilizes only 2 levels of Carry Save Adders and three Carry Propagate Adders. The proposed converter is purely adder based and memoryless. Our proposal has a delay of (10n + 4)tfa + 2tmUx with an area cost of (12n + 2)FAs and {2n)H As, which when expressed in terms of HA is (22n + 4), where FA, HA, and tfa represent Full Adder, Half Adder, and delay of a Full Adder, respectively. The proposed scheme is compared with state of the art similar dynamic range converters. Theoretically speaking, our proposal achieves about 62.3% hardware reduction and about 2.13% speed improvement when compared with the reverse converter for {2n + 1,2n 1, 22n+1 − 3, 22n − 2}. Also, in comaprison with the converter for {2n − 1, 2n − 1, 22n+1 − l}, the results indicate that, our proposal is about 17.05% faster, but requires about 7.83% more hardware resources. Further, the area time square (ΔT2) metric indicates that our proposed converter is 62.3% and 24.77% better than the state of the art reverse converters for {2n + 1,2n − 1, 22n+1 − 3, 22n − 2} and {2n − 1, 2n + 1, 22n, 22n+1 − l} respectively.
机译:在本文中,我们提出了一个新的模集{2 2n + 1 − 1,2 2n ; 2 2n − l }及其相关的反向转换器。提出的反向转换器基于混合基数转换(MRC)。除了并行化和优化MRC算法外,进一步简化了所得架构,以获得仅使用2级进位保存加法器和3个进位传播加法器的反向转换器。提出的转换器是纯粹基于加法器的,并且没有存储器。我们的建议有(10n + 4)tfa + 2tmUx的延迟,面积成本为(12n + 2)FAs和{2n)H As,用HA表示为(22n + 4),其中FA,HA ,和tfa分别代表Full Adder,Half Adder和Full Adder的延迟。将所提出的方案与现有技术的类似动态范围转换器进行比较。从理论上讲,与{2 n + 1,2 n 1,2 <的反向转换器相比,我们的建议可实现约62.3%的硬件减少和约2.13%的速度提高。 sup> 2n + 1 − 3,2 2n − 2}。另外,与{2 n -1,2 n -1,1,2 2n + 1 -l}的转换器相比较,结果表示,我们的建议速度提高了约17.05%,但所需硬件资源却增加了约7.83%。此外,面积时间平方(ΔT 2 )度量标准表明,对于{2 n +,我们提出的转换器要比现有技术的逆向转换器好62.3%和24.77%。 1,2 n − 1,2 2n + 1 − 3,2 2n − 2}和{2 n − 1,2 n + 1,2 2n ,2 2n + 1 − l}。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号