An RNS to binary converter in a three moduli set with common factors

This paper describes a residue number to binary converter that converts numbers in the moduli set 2n+2, 2n+1, 2n with 2 as a common factor. An algorithm and a hardware implementation for the converter are proposed. The hardware implementation uses Chinese Remainder Theorem (CRT) and this has been ma...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. 2, Analog and digital signal processing Analog and digital signal processing, 1995-04, Vol.42 (4), p.298-301
Main Author: Premkumar, A.B.
Format: Article
Language:English
Subjects:
Applied sciences
Cathode ray tubes
Design. Technologies. Operation analysis. Testing
Digital arithmetic
Digital signal processing
Dynamic range
Electronics
Exact sciences and technology
Fault tolerance
Hardware
Integrated circuits
Logic circuits
Parallel processing
Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices
Signal processing algorithms
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper describes a residue number to binary converter that converts numbers in the moduli set 2n+2, 2n+1, 2n with 2 as a common factor. An algorithm and a hardware implementation for the converter are proposed. The hardware implementation uses Chinese Remainder Theorem (CRT) and this has been made possible by mapping the moduli set into a pairwise relatively prime integers to satisfy CRT requirements. Properties of modular arithmetic are used to reduce the complexity of the multipliers in the proposed hardware. The converter does not use any explicit module operation in the evaluation as is normally done in implementations that use CRT.< >
ISSN:1057-7130
1558-125X
DOI:10.1109/82.378047