Addition Aware Quantization for Low Complexity and High Precision Constant Multiplication
2010 (English)In: IEEE Signal Processing Letters, ISSN 1070-9908, E-ISSN 1558-2361, Vol. 17, no 2, 173-176 p.Article in journal (Refereed) Published
Multiplication by constants can be efficiently realized using shifts, additions, and subtractions. In this work we consider how to select a fixed-point value for a real valued, rational, or floating-point coefficient to obtain a low-complexity realization. It is shown that the process, denoted addition aware quantization, often can determine coefficients that has as low complexity as the rounded value, but with a smaller approximation error by searching among coefficients with a longer wordlength.
Place, publisher, year, edition, pages
IEEE , 2010. Vol. 17, no 2, 173-176 p.
Addition; constant multiplication; quantization; subtraction
Engineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-52893DOI: 10.1109/LSP.2009.2036384ISI: 000272844400001OAI: oai:DiVA.org:liu-52893DiVA: diva2:285764
©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Oscar Gustafsson and Fahad Qureshi, Addition Aware Quantization for Low Complexity and High Precision Constant Multiplication, 2010, IEEE Signal Processing Letters, (17), 2, 173-176. http://dx.doi.org/10.1109/LSP.2009.20363842010-01-132010-01-122016-05-30Bibliographically approved