Simple, fast, and exact RNS scaler for the three-moduli set {2n - 1, 2n, 2n + 1}

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...

Full description

Bibliographic Details
Main Authors: Chang, Chip-Hong, Low, Jeremy Yung Shern
Other Authors: School of Electrical and Electronic Engineering
Format: Journal Article
Language:English
Published: 2015
Subjects:
DRNTU::Engineering::Electrical and electronic engineering::Electronic circuits
Online Access:https://hdl.handle.net/10356/79409
http://hdl.handle.net/10220/25604

Internet

https://hdl.handle.net/10356/79409
http://hdl.handle.net/10220/25604

Similar Items