Issue No. 11 - November (2008 vol. 57)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.87
Paul D. Fiore , MIT Lincoln Laboratory, Lexington
In this paper, the problem of bounding the performance of good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate optimization problem, a lower bounding curve on attainable cost/quality combinations is rapidly calculated. This curve and the associated wordlength combinations are useful in several situations, and can serve as starting points for real design searches. A detailed design example that utilizes these concepts is given.
Signal processing systems, Reconfigurable hardware, Tradeoffs between Complexity Measures, Multiple precision arithmetic, Constrained optimization
Paul D. Fiore, "Efficient Approximate Wordlength Optimization", IEEE Transactions on Computers, vol. 57, no. , pp. 1561-1570, November 2008, doi:10.1109/TC.2008.87