CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$ (Q6106664): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient RNS Scalers for the Extended Three-Moduli Set $(2^{n}-1, 2^{n+p}, 2^{n}+1)$ / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Area-Power Efficient Modulo $2^{n}-1$ and Modulo $2^{n}+1$ Multipliers for $\{2^{n}-1, 2^{n}, 2^{n}+1\}$ Based RNS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Application of the residue number system to reduce hardware costs of the convolutional neural network implementation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Residue-to-binary conversion for general moduli sets based on approximate Chinese remainder theorem / rank | |||
Normal rank | |||
Latest revision as of 14:26, 1 August 2024
scientific article; zbMATH DE number 7705544
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$ |
scientific article; zbMATH DE number 7705544 |
Statements
CRTf-Based Reverse Converter for RNS with Low-Cost Modules $$\{{2}^{n},{2}^{n}-1,{2}^{n+1}-1\}$$ (English)
0 references
3 July 2023
0 references
residue number system
0 references
Chinese remainder theorem
0 references
reverse conversion
0 references
Chinese remainder theorem with fractions
0 references
RNS balance
0 references
hardware design
0 references
0 references
0 references
