• DocumentCode
    112852
  • Title

    Radix-2r Arithmetic for Multiplication by a Constant: Further Results and Improvements

  • Author

    Oudjida, Abdelkrim K. ; Chaillet, Nicolas ; Berrandjia, Mohamed L.

  • Author_Institution
    Centre de Dev. des Technol. Av. (CDTA), Algiers, Algeria
  • Volume
    62
  • Issue
    4
  • fYear
    2015
  • fDate
    Apr-15
  • Firstpage
    372
  • Lastpage
    376
  • Abstract
    In a previous brief, we proposed a new sublinear-runtime recoding heuristic for the multiplication by a constant, accompanied by its upper bound complexity. In this brief, further results are provided, namely, the analytic expressions of the average number of additions and the maximum adder depth. Improvements to the proposed heuristic are considered as well, using a redundant recoding followed by a common-digit-elimination step.
  • Keywords
    adders; circuit complexity; multiplying circuits; redundant number systems; additions; analytic expressions; common-digit-elimination step; maximum adder depth; multiplication; radix-2r arithmetic; redundant recoding; sublinear-runtime recoding heuristic; upper bound complexity; Adders; Complexity theory; Equations; Materials; Runtime; Safety; High-Speed and Low-Power Design; High-speed and low-power design; Linear- Time-Invariant (LTI) Systems; Multiplierless Single/Mutiple Constant Multiplication (SCM/MCM); Radix-2r Arithmetic; linear time-invariant (LTI) systems; multiplierless single/multiple constant multiplication (SCM/MCM); radix-2r arithmetic;
  • fLanguage
    English
  • Journal_Title
    Circuits and Systems II: Express Briefs, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1549-7747
  • Type

    jour

  • DOI
    10.1109/TCSII.2014.2387620
  • Filename
    7001201
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=112852