.png){kind=icon}
.png){kind=icon}
Return
An efficient approach based on the Chinese Remainder Theorem to scaling in minimally redundant Residue Number System
.png){kind=icon}
OA
AI
M
B
DOI：10.1016/j.compeleceng.2026.111326.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Rank-based formulation of rational scaling in minimally redundant residue number systems. • Minimal one-bit redundancy enables low-complexity rank computation. • CRT-based scaling using only modular additions and lookup tables. • Analytical evaluation of complexity, memory requirements, and latency. • Improved scalability and efficiency compared to conventional non-redundant RNS methods.
Keywords:
Residue number system
Modular arithmetic
Rank of a number
Chinese Remainder Theorem (CRT)
Scaling operation
Hardware-oriented algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
No organization information available
Cited Papers