Hard multiple generator for higher radix modulo 2^n-1 multiplication
High-speed modulo multipliers are essential elements in RNS datapath. Booth recoding algorithm can be used to improve the performance of the multiplier by reducing the number of partial products. In radix-8 booth encoding, the number of partial products is reduced to one-third. However, the inevitab...
Saved in:
Main Authors: | Muralidharan, Ramya, Chang, Chip Hong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/90858 http://hdl.handle.net/10220/6374 http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=5403941 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Area-power efficient modulo 2n-1 and modulo 2n+1 multipliers for {2n-1, 2n, 2n+1} based RNS
by: Muralidharan, Ramya, et al.
Published: (2013) -
Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
by: Ramya Muralidharan
Published: (2012) -
Modulo adders, multipliers and shared-moduli architectures for moduli of type
by: Shibu, Menon
Published: (2008) -
New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
by: Tay, Thian Fatt, et al.
Published: (2015) -
Simple, fast, and exact RNS scaler for the three-moduli set {2n - 1, 2n, 2n + 1}
by: Chang, Chip-Hong, et al.
Published: (2015)