Simple, fast, and exact RNS scaler for the three-moduli set {2n - 1, 2n, 2n + 1}
Scaling in RNS has always been conceived as a performance bottleneck similar to the residue-to-binary conversion problem due to the inefficient intermodulo operation. In this paper, a simple and fast scaling algorithm for the three-moduli set {2n - 1, 2n, 2n + 1} RNS is proposed. The complexity of i...
Saved in:
Main Authors: | 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/79409 http://hdl.handle.net/10220/25604 |
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) -
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) -
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) -
VLSI efficient RNS scalers and arbitrary modulus residue generators
by: Low, Jeremy Yung Shern
Published: (2014)