An approximate sign detection method for residue numbers and its application to RNS division
From MaRDI portal
Publication:1324323
DOI10.1016/0898-1221(94)90052-3zbMath0805.68059OpenAlexW2164556899MaRDI QIDQ1324323
Ching-Yu Hung, Behrooz Parhami
Publication date: 24 May 1994
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(94)90052-3
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Congruences; primitive roots; residue systems (11A07)
Related Items (5)
Fast RNS division algorithms for fixed divisors with application to RSA encryption ⋮ Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem ⋮ Application of the residue number system to reduce hardware costs of the convolutional neural network implementation ⋮ Sign determination in residue number systems ⋮ Arithmetic division in RNS using Galois field \(GF(p)\)
Cites Work
This page was built for publication: An approximate sign detection method for residue numbers and its application to RNS division