mirage

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

DSpace/Manakin Repository

 

Search DR-NTU


Advanced Search Subject Search

Browse

My Account

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

Show full item record

Title: 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
Author: Cao, Bin; Chang, Chip Hong; Srikanthan, Thambipillai
Copyright year: 2003
Abstract: The inherent properties of carry-free operations, parallelism and fault-tolerance have made the residue number system a promising candidate for high-speed arithmetic and specialized high-precision digital signal-processing applications. However, the reverse conversion from the residues to the weighted binary number has long been the performance bottleneck, particularly when the number of moduli set increases beyond 3. In this paper, we present an elegant residue-to-binary conversion algorithm for a new 4-moduli set 2^n- 1, 2^n, 2^n +1, 2^2n +1. The new Chinese remainder theorem introduced recently has been employed to exploit the special properties of the proposed moduli set where modulo corrections are done without resorting to the costly and time consuming modulo operations. The resulting architecture is notably simple and can be realized in hardware with only bit reorientation and one multioperand modular adder. The new reverse converter has superior area-time complexity in comparison with the reverse converters for several other 4-moduli sets.
Subject: DRNTU::Engineering::Electrical and electronic engineering
Type: Journal Article
Series/ Journal Title: IEEE transactions on circuits and systems-I : fundamental theory and applications
School: School of Electrical and Electronic Engineering
Rights: IEEE Transactions on Circuits And Systems-I: Fundamental Theory and Applications © 2003 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. http://www.ieee.org/portal/site.
Version: Published version

Files in this item

Files Size Format View Description
rse converter f ... nese Remainder Theorem.pdf 589.9Kb PDF View/Open Published
   

DOI Query

- Get published version (via Digital Object Identifier)
   

This item appears in the following Collection(s)

Show full item record

Statistics

Total views

All Items Views
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 313

Total downloads

All Bitstreams Views
rse converter for the 4-moduli set ((2^n)-1, 2^n, (2^n)+1, (2^2n)+1) based on the New Chinese Remainder Theorem.pdf 407

Top country downloads

Country Code Views
China 120
United States of America 116
Iran 34
Singapore 19
Ghana 16

Top city downloads

city Views
Mountain View 74
Beijing 37
Tehran 23
Shenzhen 20
Singapore 18