Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm (Q531242): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68M07 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65Y04 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6608858 / rank
 
Normal rank
Property / zbMATH Keywords
 
residue number system (RNS)
Property / zbMATH Keywords: residue number system (RNS) / rank
 
Normal rank
Property / zbMATH Keywords
 
reverse converter
Property / zbMATH Keywords: reverse converter / rank
 
Normal rank
Property / zbMATH Keywords
 
Chinese remainder theorem (CRT)
Property / zbMATH Keywords: Chinese remainder theorem (CRT) / rank
 
Normal rank
Property / zbMATH Keywords
 
computer arithmetic
Property / zbMATH Keywords: computer arithmetic / rank
 
Normal rank

Revision as of 07:53, 1 July 2023

scientific article
Language Label Description Also known as
English
Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm
scientific article

    Statements

    Efficient reverse converters for 4-moduli sets \(\{2^{2n-1}-1, 2^n,2^n+1,2^n-1\}\) and \(\{2^{2n-1},2^{2n-1}-1, 2^n+1,2^n-1\}\) based on CRTs algorithm (English)
    0 references
    0 references
    0 references
    3 August 2016
    0 references
    residue number system (RNS)
    0 references
    reverse converter
    0 references
    Chinese remainder theorem (CRT)
    0 references
    computer arithmetic
    0 references

    Identifiers