Title :
Efficient Approximate Wordlength Optimization
Author_Institution :
MIT Lincoln Lab., Lexington, MA
Abstract :
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.
Keywords :
Pareto optimisation; flow graphs; signal processing; approximate optimization problem; attainable cost-quality combination; efficient approximate wordlength optimization; estimated Pareto-optimal curve; fixed-point digital signal processing flowgraphs; Application software; Constraint optimization; Cost function; Digital signal processing; Field programmable gate arrays; Filtering algorithms; Hardware; Logic devices; Pareto optimization; Signal processing algorithms; Constrained optimization; Multiple precision arithmetic; Reconfigurable hardware; Signal processing systems; Tradeoffs between Complexity Measures;
Journal_Title :
Computers, IEEE Transactions on
