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

Full description

Saved in:

Bibliographic Details
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:	DRNTU::Engineering::Electrical and electronic engineering::Electronic circuits
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

id	sg-ntu-dr.10356-105041
record_format	dspace
spelling	sg-ntu-dr.10356-1050412019-12-06T21:44:57Z New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1} Tay, Thian Fatt Chang, Chip-Hong School of Electrical and Electronic Engineering 2014 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) DRNTU::Engineering::Electrical and electronic engineering::Electronic circuits 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-1} with even n, is proposed. The dynamic range is quantized into equal subranges to facilitate fast sign detection and magnitude comparison simultaneously without the need for full magnitude recovery by Chinese Remainder Theorem (CRT) or sequential Mixed Radix Conversion (MRC). The proposed algorithm can be implemented by using adders only and the operations are less complex than those used in existing RNS magnitude comparators of comparable dynamic range. Accepted version 2015-03-03T09:13:31Z 2019-12-06T21:44:56Z 2015-03-03T09:13:31Z 2019-12-06T21:44:56Z 2014 2014 Conference Paper Tay, T. F., & Chang, C.-H. (2014). New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}. 2014 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), 519-522. https://hdl.handle.net/10356/105041 http://hdl.handle.net/10220/25166 http://dx.doi.org/10.1109/APCCAS.2014.7032833 183021 en © 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/APCCAS.2014.7032833]. 4 p. application/pdf
institution	Nanyang Technological University
building	NTU Library
country	Singapore
collection	DR-NTU
language	English
topic	DRNTU::Engineering::Electrical and electronic engineering::Electronic circuits
spellingShingle	DRNTU::Engineering::Electrical and electronic engineering::Electronic circuits Tay, Thian Fatt Chang, Chip-Hong New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
description	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-1} with even n, is proposed. The dynamic range is quantized into equal subranges to facilitate fast sign detection and magnitude comparison simultaneously without the need for full magnitude recovery by Chinese Remainder Theorem (CRT) or sequential Mixed Radix Conversion (MRC). The proposed algorithm can be implemented by using adders only and the operations are less complex than those used in existing RNS magnitude comparators of comparable dynamic range.
author2	School of Electrical and Electronic Engineering
author_facet	School of Electrical and Electronic Engineering Tay, Thian Fatt Chang, Chip-Hong
format	Conference or Workshop Item
author	Tay, Thian Fatt Chang, Chip-Hong
author_sort	Tay, Thian Fatt
title	New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
title_short	New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
title_full	New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
title_fullStr	New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
title_full_unstemmed	New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
title_sort	new algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}
publishDate	2015
url	https://hdl.handle.net/10356/105041 http://hdl.handle.net/10220/25166 http://dx.doi.org/10.1109/APCCAS.2014.7032833
_version_	1681039691481088000

New algorithm for signed integer comparison in four-moduli superset {2n, 2n −1, 2n +1, 2n+1−1}

Similar Items