Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS

Residue Number System (RNS) is often adopted to implement long and repetitive multiplications of cryptographic and signal processing algorithms. To sustain the competitive advantages of RNS over two's complement system in pervasive computing platforms, the hardware cost of parallel modulo arith...

Full description

Saved in:
Bibliographic Details
Main Authors: Muralidharan, Ramya, Chang, Chip Hong
Other Authors: School of Electrical and Electronic Engineering
Format: Article
Language:English
Published: 2013
Subjects:
Online Access:https://hdl.handle.net/10356/95967
http://hdl.handle.net/10220/11449
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-95967
record_format dspace
spelling sg-ntu-dr.10356-959672020-03-07T14:02:45Z Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS Muralidharan, Ramya Chang, Chip Hong School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering Residue Number System (RNS) is often adopted to implement long and repetitive multiplications of cryptographic and signal processing algorithms. To sustain the competitive advantages of RNS over two's complement system in pervasive computing platforms, the hardware cost of parallel modulo arithmetic operations must be lowered. In this paper, new low power and low area modulo multipliers for the well-established {2n - 1, 2n, 2n + 1} based RNS are proposed. The proposed modulo 2n-1 and modulo 2n + 1 multipliers are based on the radix-8 Booth encoding technique. The requisite hard multiples in the critical path are generated by fast customized parallel-prefix adders. In the proposed modulo 2n - 1 multiplier, the number of partial products is lowered to ⌊n/3⌋ + 1, which is around 33% reduction over radix-4 Booth encoded multiplier for n = 32-64 . For modulo 2n + 1 multiplication, the aggregate bias due to the hard multiple and the modulo-reduced partial product generations is composed of multiplier-dependent dynamic bias and multiplier-independent static bias. Both biases have been reduced by properties of modulo 2n + 1 arithmetic and merged into only three n-bit words. Consequently, the total number of partial products in the proposed modulo 2n + 1 multiplier is given by ⌊n/3⌋ + 6, which is 11% and 35% reduction over radix-4 Booth encoded multiplier for n = 32 and 64, respectively. From synthesis results for {2n - 1, 2n, 2n + 1} based RNS multipliers constructed from different modulo 2n - 1 and modulo 2n + 1 multipliers, our proposed modulo multipliers save 4%-40% and 24%-34% area as well as 21%-40% and 7%-19% total power dissipation over radix-4 Booth encoded and non-encoded modulo multipliers, respectively. These results are well correlated with th- theoretical estimation based on the normalized area model. 2013-07-15T07:44:10Z 2019-12-06T19:23:49Z 2013-07-15T07:44:10Z 2019-12-06T19:23:49Z 2012 2012 Journal Article Muralidharan, R., & Chang, C. H. (2012). Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS. IEEE Transactions on Circuits and Systems I: Regular Papers, 59(10), 2263-2274. https://hdl.handle.net/10356/95967 http://hdl.handle.net/10220/11449 10.1109/TCSI.2012.2185334 en IEEE transactions on circuits and systems I : regular papers © 2012 IEEE.
institution Nanyang Technological University
building NTU Library
country Singapore
collection DR-NTU
language English
topic DRNTU::Engineering::Electrical and electronic engineering
spellingShingle DRNTU::Engineering::Electrical and electronic engineering
Muralidharan, Ramya
Chang, Chip Hong
Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
description Residue Number System (RNS) is often adopted to implement long and repetitive multiplications of cryptographic and signal processing algorithms. To sustain the competitive advantages of RNS over two's complement system in pervasive computing platforms, the hardware cost of parallel modulo arithmetic operations must be lowered. In this paper, new low power and low area modulo multipliers for the well-established {2n - 1, 2n, 2n + 1} based RNS are proposed. The proposed modulo 2n-1 and modulo 2n + 1 multipliers are based on the radix-8 Booth encoding technique. The requisite hard multiples in the critical path are generated by fast customized parallel-prefix adders. In the proposed modulo 2n - 1 multiplier, the number of partial products is lowered to ⌊n/3⌋ + 1, which is around 33% reduction over radix-4 Booth encoded multiplier for n = 32-64 . For modulo 2n + 1 multiplication, the aggregate bias due to the hard multiple and the modulo-reduced partial product generations is composed of multiplier-dependent dynamic bias and multiplier-independent static bias. Both biases have been reduced by properties of modulo 2n + 1 arithmetic and merged into only three n-bit words. Consequently, the total number of partial products in the proposed modulo 2n + 1 multiplier is given by ⌊n/3⌋ + 6, which is 11% and 35% reduction over radix-4 Booth encoded multiplier for n = 32 and 64, respectively. From synthesis results for {2n - 1, 2n, 2n + 1} based RNS multipliers constructed from different modulo 2n - 1 and modulo 2n + 1 multipliers, our proposed modulo multipliers save 4%-40% and 24%-34% area as well as 21%-40% and 7%-19% total power dissipation over radix-4 Booth encoded and non-encoded modulo multipliers, respectively. These results are well correlated with th- theoretical estimation based on the normalized area model.
author2 School of Electrical and Electronic Engineering
author_facet School of Electrical and Electronic Engineering
Muralidharan, Ramya
Chang, Chip Hong
format Article
author Muralidharan, Ramya
Chang, Chip Hong
author_sort Muralidharan, Ramya
title Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
title_short Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
title_full Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
title_fullStr Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
title_full_unstemmed Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
title_sort area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based rns
publishDate 2013
url https://hdl.handle.net/10356/95967
http://hdl.handle.net/10220/11449
_version_ 1681034591626854400