An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications (Q954477)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient RNS parity checker for moduli set \2ⁿ - 1, 2ⁿ + 1, 2²ⁿ + 1\ and its applications |
scientific article; zbMATH DE number 5363746
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications |
scientific article; zbMATH DE number 5363746 |
Statements
An efficient RNS parity checker for moduli set \(\{2^n - 1, 2^n + 1, 2^{2n} + 1\}\) and its applications (English)
0 references
10 November 2008
0 references
VLSI
0 references
RNS
0 references
parity check
0 references
number comparison
0 references
sign determination
0 references
overflow detection
0 references
0.8444725871086121
0 references
0.8439059853553772
0 references
0.8097965121269226
0 references
