Efficient VLSI implementation of 2^n scaling of signed integer in RNS {2^n-1, 2^n, 2^n+1}
Scaling is a problematic operation in residue number system (RNS) but a necessary evil in implementing many digital signal processing algorithms for which RNS is particularly good. Existing signed integer RNS scalers entail a dedicated sign detection circuit, which is as complex as the magnitude sca...
Saved in:
Main Authors: | Tay, Thian Fatt, Chang, Chip-Hong, Low, Jeremy Yung Shern |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Article |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/105036 http://hdl.handle.net/10220/25187 http://dx.doi.org/10.1109/TVLSI.2012.2221752 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
A VLSI efficient programmable power-of-two scaler for 2n-1, 2n,2n+1 RNS
by: Low, Jeremy Yung Shern, et al.
Published: (2013) -
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) -
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) -
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)