NDLI: Efficient Method for Magnitude Comparison in RNS Based on Two Pairs of Conjugate Moduli

Content Provider	IEEE Xplore Digital Library
Author	Sousa, L.
Copyright Year	2007
Description	Author affiliation: TULisbon, Lisbon (Sousa, L.)
Abstract	The non-positional nature of residue number systems (RNS) is very useful to achieve carry free arithmetic. However it makes the comparison of numbers more difficult than in the traditional weighted number systems: there is no any efficient general method for magnitude comparison in RNS. Moreover, magnitude comparison for RNS that rely on pairs of conjugate moduli, which are not relatively prime moduli sets recently proposed because of the large dynamic ranges and the simplicity of the arithmetic units, is a new unsolved problem. In this paper an efficient method and a VLSI architecture is proposed for magnitude comparison in RNS based on sets formed by two pairs of conjugate moduli. This proposed method is much more efficient than the other known ones and is the only one valid for moduli sets not formed by relatively prime integers. The method has been applied to design a very fast Sum-of-Absolute Differences (SAD) unit for motion estimation in video sequences that performs the function entirely within the RNS channels. Experimental results show that this new SAD unit, implemented in the internal memory blocks of the xc2vp50-7 FPGA, is capable of achieving the high throughput required to perform real-time motion estimation in high resolution images.
Starting Page	240
Ending Page	250
File Size	253060
Page Count	11
File Format	PDF
ISBN	0769528546
ISSN	10636889
DOI	10.1109/ARITH.2007.16
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2007-06-25
Publisher Place	France
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Very large scale integration Cathode ray tubes Motion estimation Image converters Computer architecture Digital arithmetic Dynamic range Video sequences Field programmable gate arrays Throughput
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Moduli selection in RNS for efficient VLSI implementation

Memoryless RNS-to-binary converters for the {${2^{n+1}}$ - 1, $2^{n},$ $2^{n}$ - 1} moduli set

An Efficient FPGA Design of Residue-to-Binary Converter for the Moduli Set ${2n+1,2n,2n-1}$

FPGA realization of RNS to binary signed conversion architecture

Efficient residue comparison algorithm for general moduli sets

Application of new Chinese remainder theorems to RNS with two pairs of conjugate moduli

Modulo deflation in (2/sup n/+1, 2/sup n/, 2/sup n/-1) converters

RNS-to-binary conversion for efficient VLSI implementation

New efficient RNS-to-weighted decoders for conjugate-pair-moduli residue number systems

Efficient Method for Magnitude Comparison in RNS Based on Two Pairs of Conjugate Moduli

Similar Documents

Moduli selection in RNS for efficient VLSI implementation

Memoryless RNS-to-binary converters for the {${2^{n+1}}$ - 1, $2^{n},$ $2^{n}$ - 1} moduli set

An Efficient FPGA Design of Residue-to-Binary Converter for the Moduli Set ${2n+1,2n,2n-1}$

FPGA realization of RNS to binary signed conversion architecture

Efficient residue comparison algorithm for general moduli sets

Application of new Chinese remainder theorems to RNS with two pairs of conjugate moduli

Modulo deflation in (2/sup n/+1, 2/sup n/, 2/sup n/-1) converters

RNS-to-binary conversion for efficient VLSI implementation

New efficient RNS-to-weighted decoders for conjugate-pair-moduli residue number systems

Efficient Method for Magnitude Comparison in RNS Based on Two Pairs of Conjugate Moduli