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

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

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

Full description

Saved in:

Bibliographic Details
Main Authors:	Cao, Bin, Chang, Chip Hong, Srikanthan, Thambipillai
Other Authors:	School of Electrical and Electronic Engineering
Format:	Article
Language:	English
Published:	2009
Subjects:	DRNTU::Engineering::Electrical and electronic engineering
Online Access:	https://hdl.handle.net/10356/91437 http://hdl.handle.net/10220/6010
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	Nanyang Technological University
Language:	English

id	sg-ntu-dr.10356-91437
record_format	dspace
spelling	sg-ntu-dr.10356-914372020-03-07T14:02:40Z 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 Cao, Bin Chang, Chip Hong Srikanthan, Thambipillai School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering 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. Published version 2009-08-03T04:51:03Z 2019-12-06T18:05:41Z 2009-08-03T04:51:03Z 2019-12-06T18:05:41Z 2003 2003 Journal Article Cao, B., Chang, C. H., & Srikanthan, T. (2003). 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. IEEE Transactions on Circuits And Systems-I: Fundamental Theory and Applications, 50(10), 1296-1303. 1057-7122 https://hdl.handle.net/10356/91437 http://hdl.handle.net/10220/6010 10.1109/TCSI.2003.817789 en IEEE transactions on circuits and systems-I : fundamental theory and applications 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. 8 p. application/pdf
institution	Nanyang Technological University
building	NTU Library
country	Singapore
collection	DR-NTU
language	English
topic	DRNTU::Engineering::Electrical and electronic engineering
spellingShingle	DRNTU::Engineering::Electrical and electronic engineering Cao, Bin Chang, Chip Hong Srikanthan, Thambipillai 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
description	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.
author2	School of Electrical and Electronic Engineering
author_facet	School of Electrical and Electronic Engineering Cao, Bin Chang, Chip Hong Srikanthan, Thambipillai
format	Article
author	Cao, Bin Chang, Chip Hong Srikanthan, Thambipillai
author_sort	Cao, Bin
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
title_short	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
title_full	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
title_fullStr	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
title_full_unstemmed	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
title_sort	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
publishDate	2009
url	https://hdl.handle.net/10356/91437 http://hdl.handle.net/10220/6010
_version_	1681038286195261440

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

Similar Items