• DocumentCode
    2039822
  • Title

    Fast modulo 2n−1 and 2n;1 adder using carry-chain on FPGA

  • Author

    Didier, Laurent-Stephane ; Jaulmes, Luc

  • Author_Institution
    Lab. IMATH, Univ. de Toulon, La Garde, France
  • fYear
    2013
  • fDate
    3-6 Nov. 2013
  • Firstpage
    1155
  • Lastpage
    1159
  • Abstract
    Modular addition is a widely used operation in Residue Number System applications. Specific sets of moduli allow fast RNS operations such as binary conversions and multiplications. Most of them use modulo 2n - 1 and 2n + 1 additions. This paper presents four fast and small architectures for these specific moduli targeting modern FPGAs with fast carry chains. The use of this arithmetic dedicated feature allows fast and small modular adders. Our modulo 2n - 1 adders have a single zero representation. Our modulo 2n+1 adders are designed for binary and diminished-one representation with and without zero value management.
  • Keywords
    adders; carry logic; field programmable gate arrays; residue number systems; FPGA; fast carry chains; fast modulo 2n+1 adder; fast modulo 2n-1 adder; modular addition; residue number system applications; small modular adders; zero value management; Adders; Delays; Equations; Field programmable gate arrays; Routing; Table lookup; 2n-1 and 2n ; 1 moduli; FPGA; Modular adder; RNS; carry-chain;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signals, Systems and Computers, 2013 Asilomar Conference on
  • Conference_Location
    Pacific Grove, CA
  • Print_ISBN
    978-1-4799-2388-5
  • Type

    conf

  • DOI
    10.1109/ACSSC.2013.6810475
  • Filename
    6810475
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2039822