RNS architectures for the implementation of the `diagonal function'

DOI10.1016/S0020-0190(00)00003-XzbMATH Open1338.68010OpenAlexW1985654253MaRDI QIDQ294738FDOQ294738

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

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

Recommendations

• A note on RNS architectures for the implementation of the diagonal function
• Implementation of RNS-based distributed arithmetic discrete wavelet transform architectures using field-programmable logic
• Fast combinatorial RNS processors for DSP applications
• Fast and highly compact RNS multipliers
• Diagonalisation schemes and applications
• Novel approaches to the design of VLSI RNS multipliers
• New efficient structure for a modular multiplier for RNS
• Efficient implementation of Jacobi's diagonalization method on the DAP
• Novel digital filter implementations using hybrid RNS-binary arithmetic

zbMATH Keywords

parallel processingcomputer architectureresidue number system

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• 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
• Title not available (Why is that?)

Cited In (6)

• Computationally efficient approach to implementation of the Chinese remainder theorem algorithm in minimally redundant residue number system
• An Efficient Implementation of the CRT Algorithm Based on an Interval-Index Characteristic and Minimum-Redundancy Residue Code
• A method for operational diagnosis of data represented in a residue number system
• Quadruples for residue number systems with sum of quotients a power of a prime
• Reverse conversion using core function, CRT and mixed radix conversion
• A note on RNS architectures for the implementation of the diagonal function

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294738)