Accuracy sensitive word-length selection for algorithm optimization

Wadekar, S.A.; Parker, Alice C.

doi:10.1109/iccd.1998.727023

Cited by 46 publications

(73 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…There is little analytical work on supporting dataflow graphs containing cycles, although in [9], finite loop bounds are supported. Some published approaches use worst-case instantaneous error as a measure of signal quality [5], [7], [8] whereas some use signal-to-noise ratio (SNR) [1], [6]. The proposals in this paper use fully analytic error models, use SNR as a quality metric, and can be applied to dataflow graphs containing cycles without the pessimism exhibited by other analytic work.…”

Section: Introductionmentioning

confidence: 99%

“…Some published approaches to the wordlength optimization problem use an analytic approach to scaling and/or error estimation [5], [7], [9], some use simulation [6], [8], and some use a hybrid of the two [10]. The advantage of analytic techniques is that they do not require representative simulation stimulus, and can be faster, however, they tend to be more pessimistic.…”

Section: Introductionmentioning

confidence: 99%

“…Wadekar and Parker [5] have also proposed a methodology for wordlength optimization. Like [7], this technique also allows controlled worst-case error at system outputs, however, each intermediate variable is allowed to take a wordlength appropriate to the sensitivity of the output errors to quantization errors on that particular variable.…”

Section: Introductionmentioning

confidence: 99%

“…There are, however, several published approaches to wordlength optimization. Those offering an area/signal quality tradeoff are of a heuristic nature [1], [5], [6] do not support different fractional precision for different internal variables [7], or assume that arithmetic error falls monotonically in each signal wordlength [6], [8]. In contrast, this paper proposes techniques which capture the full complexity of the error constraint surface, allow multiple fractional precisions, and provide the choice of a heuristic or an optimum solution (with respect to the area and error models).…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Wordlength optimization for linear digital signal processing

Constantinides

Cheung

Luk

2003

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

121

149

View full text Add to dashboard Cite

Abstract-This paper presents an approach to the wordlength allocation and optimization problem for linear digital signal processing systems implemented as custom parallel processing units. Two techniques are proposed, one which guarantees an optimum set of wordlengths for each internal variable, and one which is a heuristic approach. Both techniques allow the user to tradeoff implementation area for arithmetic error at system outputs. Optimality (with respect to the area and error estimates) is guaranteed through modeling as a mixed integer linear program. It is demonstrated that the proposed heuristic leads to area improvements of 6% to 45% combined with speed increases compared to the optimum uniform wordlength design. In addition, the heuristic reaches within 0.7% of the optimum multiple wordlength area over a range of benchmark problems.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Wordlength optimization for linear digital signal processing

Constantinides

Cheung

Luk

2003

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

121

149

View full text Add to dashboard Cite

show abstract

“…Alternatively, Yasuura et al [8] and Wadekar [9] perform numerical analysis on the DFG of the DSP algorithm.…”

Section: Related Workmentioning

confidence: 99%

An automatic word length determination method

Cantin

Savaria

Prodanos

et al.

ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196)

View full text Add to dashboard Cite

-Automatic word length determination of hardware data paths may require considering several error models, user specifications and hardware costs. A new automatic method for determining the word length of hardware data paths that consider these requirements is proposed and analyzed. The search-based method uses a C/C++ fixed-point simulation tool to model the impact of finite word lengths on overall accuracy. By computing dissimilarities between fixed-point and floating-point simulation results, a procedure searches for a combination of word lengths that meets accuracy criteria specified by the designer. This method is presented with four novel maximization procedures. These four automatic procedures are compared with other procedures given in the literature and adapted into the method. The comparison helps to select a procedure that finds a combination of word lengths that meet user specifications, in a small number of iterations. The procedures are characterized and compared using a dozen DSP algorithms.

show abstract

Wordlength Optimization of Fixed-Point Algorithms

Caffarena

2022

Approximate Computing Techniques

View full text Add to dashboard Cite

Accuracy sensitive word-length selection for algorithm optimization

Cited by 46 publications

References 55 publications

Wordlength optimization for linear digital signal processing

Wordlength optimization for linear digital signal processing

An automatic word length determination method

Wordlength Optimization of Fixed-Point Algorithms

Contact Info

Product

Resources

About