A polynomial time algorithm for solving the word-length optimization problem

Authors:
Karthick N. Parashar;Daniel Menard;Olivier Sentieys
Affiliations:
INRIA, University of Rennes, London;INRIA, University of Rennes, London;INRIA, University of Rennes
Venue:
Proceedings of the International Conference on Computer-Aided Design
Year:
2013

Citing 5
Cited 0

Convex Optimization

Convex Optimization
Efficient Approximate Wordlength Optimization

IEEE Transactions on Computers
50 years of CORDIC: algorithms, architectures, and applications

IEEE Transactions on Circuits and Systems Part I: Regular Papers
A Hierarchical Methodology for Word-Length Optimization of Signal Processing Systems

VLSID '10 Proceedings of the 2010 23rd International Conference on VLSI Design
Optimization of finite word length coefficient IIR digital filters through genetic algorithms: a comparative study

ICNC'06 Proceedings of the Second international conference on Advances in Natural Computation - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

Trading off accuracy to the system costs is popularly addressed as the word-length optimization (WLO) problem. Owing to its NP-hard nature, this problem is solved using combinatorial heuristics. In this paper, a novel approach is taken by relaxing the integer constraints on the optimization variables and obtain an alternate noise-budgeting problem. This approach uses the quantization noise power introduced into the system due to fixed-point word-lengths as optimization variables instead of using the actual integer valued fixed-point word-lengths. The noise-budgeting problem is proved to be convex in the rounding mode quantization case and can therefore be solved using analytical convex optimization solvers. An algorithm with linear time complexity is provided in order to realize the actual fixed-point word-lengths from the noise budgets obtained by solving the convex noise-budgeting problem.