• DocumentCode
    1117165
  • Title

    A Note on Fast Base Extension for Residue Number Systems with Three Moduli

  • Author

    O´Keefe, Kenneth H.

  • Author_Institution
    TRW Systems Group
  • Issue
    11
  • fYear
    1975
  • Firstpage
    1132
  • Lastpage
    1133
  • Abstract
    An algorithm is given for the base-extension (BE) computation in residue number systems that requires the standard four steps (for systems with three moduli) but which saves hardware. Furthermore, for the particular moduli m-1, m, and m+1 it is shown that fast-BE in only two steps is possible, for all combinations of the moduli.
  • Keywords
    Base extension, modular arithmetic, residue number systems.; Arithmetic; Hardware; Base extension, modular arithmetic, residue number systems.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1975.224147
  • Filename
    1672740
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1117165