New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
Sign detection and magnitude comparison are two difficult operations in Residue Number System (RNS). Existing residue comparators tackle only unsigned integer for magnitude comparison. In this paper, a new algorithm for signed integer comparison in the four-moduli supersets, {2n, 2n -1, 2n +1, 2n+1-...
Saved in:
Main Authors: | Tay, Thian Fatt, Chang, Chip-Hong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/105041 http://hdl.handle.net/10220/25166 http://dx.doi.org/10.1109/APCCAS.2014.7032833 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
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) -
Simple, fast, and exact RNS scaler for the three-moduli set {2n - 1, 2n, 2n + 1}
by: Chang, Chip-Hong, et al.
Published: (2015) -
An efficient reverse converter for the 4-moduli set {2^n -1, 2^n, 2^n + 1, 2^2n + 1} based on the new Chinese remainder theorem
by: Cao, Bin, et al.
Published: (2009) -
Novel modulo multipliers for moduli 2^n-1, 2^n and 2^n+1.
by: Ramya Muralidharan
Published: (2012) -
A unified {2n−1, 2n, 2n+1} RNS scaler with dual scaling constants
by: Low, Jeremy Yung Shern, et al.
Published: (2013)