High Speed Comparator for the Moduli {2n, 2n-1, 2n+1}

被引:1
|
作者
Li, Lei [1 ]
Li, Guodong [1 ]
Zhao, Yingxu [1 ]
Yin, Pengsheng [1 ]
Zhou, Wanting [1 ]
机构
[1] Univ Elect Sci & Technol China, Res Inst Elect Sci & Technol, Chengdu 611731, Sichuan, Peoples R China
来源
IEICE ELECTRONICS EXPRESS | 2013年 / 10卷 / 21期
基金
中国国家自然科学基金;
关键词
Residue number systems (RNS); comparator; NUMBER SYSTEM; RESIDUE;
D O I
10.1587/elex.10.20130628
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
{2(n), 2(n) - 1, 2(n) + 1} is one of the most commonly used moduli in residue number systems. In this express, we propose a novel comparator for the moduli {2(n), 2(n) - 1, 2(n) + 1}. Based on the proposed architecture, we can design high speed comparator for the moduli {2(n), 2(n) - 1, 2(n) + 1}, which is the fastest among all known comparators for the moduli {2(n), 2(n) - 1, 2(n) + 1}. The performance of the proposed comparator is evaluated and compared with the earlier fast comparators for the moduli {2(n), 2n - 1, 2n + 1}, based on a simple gate-count and gate-delay model. The proposed comparator can improve the state-of-art by 8% on the average in terms of area and 6% on the average in terms of performance delay.
引用
收藏
页数:6
相关论文
共 50 条