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...
Main Authors: | Muralidharan, Ramya, Chang, Chip Hong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Journal Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/95967 http://hdl.handle.net/10220/11449 |
Similar Items
-
Hard multiple generator for higher radix modulo 2^n-1 multiplication
by: Muralidharan, Ramya, et al.
Published: (2010) -
A VLSI efficient programmable power-of-two scaler for 2n-1, 2n,2n+1 RNS
by: Low, Jeremy Yung Shern, et al.
Published: (2013) -
Efficient VLSI implementation of 2^n scaling of signed integer in RNS {2^n-1, 2^n, 2^n+1}
by: Tay, Thian Fatt, et al.
Published: (2015) -
A unified {2n−1, 2n, 2n+1} RNS scaler with dual scaling constants
by: Low, Jeremy Yung Shern, et al.
Published: (2013) -
Simple, fast, and exact RNS scaler for the three-moduli set {2n - 1, 2n, 2n + 1}
by: Chang, Chip-Hong, et al.
Published: (2015)