• DocumentCode
    2201643
  • Title

    On decreasing the computing time for modular arithmetic

  • Author

    Heindel, Lee E. ; Horowitz, Ellis

  • fYear
    1971
  • fDate
    13-15 Oct. 1971
  • Firstpage
    126
  • Lastpage
    128
  • Abstract
    In this paper it is shown that by suitably modifying Garner´s algorithm for applying the Chinese Remainder Theorem to optimally employ the fast multiplication techniques of Schönhage and Strassen, one can often decrease the computing time of algebraic algorithms employing modular (congruence, residue) arithmetic.
  • Keywords
    Algorithm design and analysis; Computer science; Digital arithmetic; Fast Fourier transforms; Hardware; Laboratories; Telephony;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Switching and Automata Theory, 1971., 12th Annual Symposium on
  • Conference_Location
    East Lansing, MI, USA
  • ISSN
    0272-4847
  • Type

    conf

  • DOI
    10.1109/SWAT.1971.20
  • Filename
    4569671
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2201643