RNS representations with redundant residues

Conference Record of the Asilomar Conference on Signals, Systems and Computers

Volumn 2, Issue , 2001, Pages 1651-1655

  Parhami, Behrooz ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Carry free addition; Computer arithmetic; Modular reduction; Number system; Parallel processing; Redundant representation; Residue number system; VLSI

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); ERROR CORRECTION; NUMBER THEORY; PARALLEL PROCESSING SYSTEMS; REDUNDANCY; VLSI CIRCUITS;

CARRY FREE ADDITION; MODULAR REDUCTION; REDUNDANT REPRESENTATION; RESIDUE NUMBER SYSTEM;

DIGITAL ARITHMETIC;

EID: 0035574907     PISSN: 10586393     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acssc.2001.987765     Document Type: Conference Paper

References (19)

1. An introduction to the role of redundancy in computer arithmetic
2. The renaissance - a residue number system based vector co-processor for DSP dominated embedded ASICs
3. Efficient RNS to binary conversion using high-radix SRT division
4. Redundant residue number systems for error detection and correction in digital filters
5. Low-power FIR digital filters using residue arithmetic
6. The residue number system
7. An approximate sign detection method for residue numbers and its application to RNS division
8. Novel digital filter implementations using hybrid RNS-binary arithmetic
9. Finite arithmetic concepts
10. Fast algorithms for modular reduction
11. A low-complexity combinatorial RNS multiplier
12. Optimal table lookup schemes for VLSI implementation of input/output conversions and other residue number operations
13. A note on digital filter implementation using hybrid RNS-binary arithmetic
14. Modular reduction by multi-level table lookup
15. Design of residue generators and multioperand modular adders using carry-save adders
16. A signed-digit architecture for residue to binary conversion
17. The numerical system of residual classes in mathematical machines