A range analysis in automatic word length optimization for multiplication
CSTR:
Author:
Affiliation:

(Key Laboratory of Network Oriented Intelligent Computation, Shenzhen Graduate School, Harbin Institute of Technology, 518055 Shenzhen, Guangdong, China)

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    To achieve more accurate result and lower computational complexity of range analysis for multiplication in automatic word length optimization, this paper presents a novel refined affine approximation method of multiplication for range analysis in automatic word length optimization, which is named novel affine arithmetic approximation (NAA). In NAA, a new noise term represents the error which is caused by approximation. This error is estimated more accurately without increasing the computational complexity. The computational complexity of NAA is O(M1), where M1 denotes the total of the nonzero noise of the two multipliers. In experiments, the accuracy of the range using NAA is 1.47 times of that using trivial range estimation, and the same as that using Chebyshev approximation.

    Reference
    Related
    Cited by
Get Citation
Related Videos

Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:February 27,2013
  • Revised:
  • Adopted:
  • Online: April 04,2014
  • Published:
Article QR Code