RNS architectures for the implementation of the `diagonal function'

DOI10.1016/S0020-0190(00)00003-XzbMath1338.68010OpenAlexW1985654253MaRDI QIDQ294738

S. Impedovo, G. Dimauro, A. Salzo, G. Pirlo

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S002001900000003X?np=y

zbMATH Keywords

parallel processingresidue number systemcomputer architecture

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Related Items (5)

Reverse conversion using core function, CRT and mixed radix conversion ⋮ Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system ⋮ A note on RNS architectures for the implementation of the diagonal function ⋮ An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code ⋮ Quadruples for Residue Number Systems with Sum of Quotients a Power of a Prime

Cites Work

• Unnamed Item
• Division and sign detection algorithms for residue number systems
• The application of core functions to residue number systems
• Sign Detection and Implicit-Explicit Conversion of Numbers in Residue Arithmetic
• Efficient Implementations of the Chinese Remainder Theorem for Sign Detection and Residue Decoding
• Fast and flexible architectures for RNS arithmetic decoding
• RNS-based enhancements for direct digital frequency synthesis
• Fast combinatorial RNS processors for DSP applications
• A new technique for fast number comparison in the residue number system

This page was built for publication: RNS architectures for the implementation of the `diagonal function'