• DocumentCode
    838891
  • Title

    VLSI methodology for the design of RNS and QRNS full adder based converters

  • Author

    Soudris, D.J. ; Dasygenis, M.M. ; Thanailakis, A.T.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Democritus Univ. of Thrace, Xanthi, Greece
  • Volume
    149
  • Issue
    4
  • fYear
    2002
  • fDate
    8/1/2002 12:00:00 AM
  • Firstpage
    241
  • Lastpage
    250
  • Abstract
    A unified graph-based methodology for designing VLSI residue number system (RNS) converters from binary system to RNS to quadratic RNS (QRNS) and conversely, using full adders (FAs) as the basic building block, is introduced. The design procedure produces array architectures starting from the algorithm bit level description of each converter and ending up with the hardware implementation, through a number of steps. These steps specify in a systematic way the minimum number of FAs for performing a conversion, as well as the interconnections among the FAs. They are implemented into a two-dimensional regular array processor and characterised by small hardware and area-time complexity, and high throughput rate, compared with existing implementations. The derived architectures are generalised, covering a wide range of moduli and input bits
  • Keywords
    VLSI; adders; convertors; graph theory; integrated circuit design; residue number systems; VLSI design; area-time complexity; binary system; bit-level algorithm; converter circuit; digital arithmetic; full-adder architecture; graph methodology; hardware complexity; quadratic residue number system; residue number system; throughput rate; two-dimensional regular array processor;
  • fLanguage
    English
  • Journal_Title
    Circuits, Devices and Systems, IEE Proceedings -
  • Publisher
    iet
  • ISSN
    1350-2409
  • Type

    jour

  • DOI
    10.1049/ip-cds:20020456
  • Filename
    1040125