CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$

DOI10.1007/978-3-030-97020-8_4zbMath1522.68044MaRDI QIDQ6106664

Dmitry I. Kaplun, Unnamed Author, Unnamed Author, Unnamed Author, Unnamed Author

Publication date: 3 July 2023

Published in: Mathematics and its Applications in New Computer Systems (Search for Journal in Brave)

zbMATH Keywords

Chinese remainder theoremresidue number systemhardware designreverse conversionChinese remainder theorem with fractionsRNS balance

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07)

Cites Work

• Application of the residue number system to reduce hardware costs of the convolutional neural network implementation
• Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem
• Area-Power Efficient Modulo $2^{n}-1$ and Modulo $2^{n}+1$ Multipliers for $\{2^{n}-1, 2^{n}, 2^{n}+1\}$ Based RNS
• Efficient RNS Scalers for the Extended Three-Moduli Set $(2^{n}-1, 2^{n+p}, 2^{n}+1)$