• DocumentCode
    624345
  • Title

    A compact and scalable RNS architecture

  • Author

    Miguens Matutino, Pedro ; Chaves, Rafael ; Sousa, Leonel

  • Author_Institution
    IST, Tech. Univ. of Lisbon Lisbon, Lisbon, Portugal
  • fYear
    2013
  • fDate
    5-7 June 2013
  • Firstpage
    125
  • Lastpage
    132
  • Abstract
    This paper proposes a unified architecture for designing Residue Number System (RNS) based processors for moduli sets with an arbitrary number of channels. Recently, new RNS moduli sets have been proposed in order to increase the dynamic range and reduce the width of the channels. The proposed architecture allows designing forward and reverse RNS converters, as well as the arithmetic operators of each modulo channel. The forward and reverse conversions are implemented using channel arithmetic units, resulting in a very compact architecture. Moreover, the arithmetic operations supported at the channel level include addition, subtraction, and multiplication with accumulation capability. The presented results suggest that the proposed RNS architecture leads to compact and scalable implementations, with competitive, or even better, performance when compared with the related state of the art, considering fixed moduli sets. Experimental results suggest gains of 17% in the delay of arithmetic operations, with an area reduction of 23% regarding the state of the art.
  • Keywords
    computer architecture; residue number systems; RNS converters; arbitrary number; arithmetic operators; channel arithmetic units; compact RNS architecture; fixed moduli sets; modulo channel; residue number system; scalable RNS architecture; scalable implementations; unified architecture; Adders; Computer architecture; Delays; Dynamic range; Estimation; Hardware; Periodic structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Application-Specific Systems, Architectures and Processors (ASAP), 2013 IEEE 24th International Conference on
  • Conference_Location
    Washington, DC
  • ISSN
    2160-0511
  • Print_ISBN
    978-1-4799-0494-5
  • Type

    conf

  • DOI
    10.1109/ASAP.2013.6567565
  • Filename
    6567565