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
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
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
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00034-014-9798-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W9875335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new efficient memoryless residue to binary converter / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient reverse converter for the 4-moduli set [2/sup n/ - 1, 2/sup n, 2/sup n + 1, 2/sup 2n/ + 1] based on the new chinese remainder theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Residue-to-Binary Converter for a New Five-Moduli Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adder based residue to binary number converters for (2/sup n/-1, 2/sup n/, 2/sup n/+1) / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNS-to-Binary Converters for Two Four-Moduli Sets <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}-1\}$</tex></formula> and <formula formulatype="inline"><tex>$\{2^{n}-1,2^{n},2^{n}+1,2^{{n}+1}+1\}$</tex></formula> / rank
 
Normal rank
Property / cites work
 
Property / cites work: High speed residue to binary converter for the new four-moduli set \(\{2^{2n},2^n+1,2^{n/2}+1,2^{n/2}-1\}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5424092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Modulo 2^{n} - (2^{n - 2} + 1) Addition: A New Class of Adder for RNS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residue-to-binary converters based on new Chinese remainder theorems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:36, 12 July 2024

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