Booth encoding modulo (2n-2p-1) multipliers

被引：0

作者：

Li, Lei ^{[1
]}

Li, Saiye ^{[1
]}

Yang, Peng ^{[1
]}

Zhang, Qingyu ^{[1
]}

机构：

[1] Univ Elect Sci & Technol China, Res Inst Elect Sci & Technol, Chengdu 611731, Sichuan, Peoples R China

来源：

IEICE ELECTRONICS EXPRESS | 2014年 / 11卷 / 15期

关键词：

residue number systems (RNS); multiplier; 2(N)-1; MULTIPLIERS;

D O I：

10.1587/elex.11.20140588

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

In this express, we propose Booth encoding high-speed modulo (2(n) - 2(p) - 1) multipliers on the condition length of (Cout) <= min(2(n) - p, n + p), where Cout is the carry-out output of the carry save adder tree that is used to compress the partial products and the correction term after splitting, shifting and resetting. Synthesized results demonstrate that the proposed Booth encoding modulo (2(n) - 2(p) - 1) multipliers have a good delay performance.

引用

页数：6

共 50 条

[41] Modulo (2p ± 1) multipliers using a three-operand modular signed-digit addition algorithm
Wei, SG
Shimizu, K
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2006, 15 (01) : 129 - 144
[42] Invariants of the linear group modulo pi = p(1)(lambda 1)p(2)(lambda 2)center dot center dot center dot p(n)(lambda n)
Gouwens, Cornelius
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1924, 26 (1-4) : 435 - 440
[43] Modulo deflation in (2n+1,2n, 2n-1) converters
Bi, S
Wang, W
Al-Khalili, A
2004 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS, 2004, : 429 - 432
[44] A New Redundant Binary Booth Encoding for Fast 2n-Bit Multiplier Design
He, Yajuan
Chang, Chip-Hong
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2009, 56 (06) : 1192 - 1201
[45] Efficient modulo 2n+1 adder architectures
Vergos, H. T.
Efstathiou, C.
INTEGRATION-THE VLSI JOURNAL, 2009, 42 (02) : 149 - 157
[46] On the Design of Modulo 2n±1 Residue Generators
Tsoumanis, Kostas
Efstathiou, Constantinos
Moschopoulos, Nikos
Pekmestzi, Kiamal
2013 IFIP/IEEE 21ST INTERNATIONAL CONFERENCE ON VERY LARGE SCALE INTEGRATION (VLSI-SOC), 2013, : 33 - 38
[47] Linear Approximations of Addition Modulo 2n-1
Zhou, Chunfang
Feng, Xiutao
Wu, Chuankun
FAST SOFTWARE ENCRYPTION (FSE 2011), 2011, 6733 : 359 - 377
[48] Simplified architecture for modulo (2n+1) multiplication
Chinese Acad of Sciences, Beijing, China
IEEE Trans Comput, 3 (333-337):
[49] THE DISTRIBUTION OF ALPHA-P2 MODULO-1
GHOSH, A
PROCEEDINGS OF THE LONDON MATHEMATICAL SOCIETY, 1981, 42 (MAR) : 252 - 269
[50] EFFICIENT ARCHITECTURES FOR MODULO 2n-1 SQUARERS
Spyrou, A.
Bakalis, D.
Vergos, H. T.
2009 16TH INTERNATIONAL CONFERENCE ON DIGITAL SIGNAL PROCESSING, VOLS 1 AND 2, 2009, : 687 - +

← 1 2 3 4 5 →