Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs
2011 (English)In: IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, ISSN 0916-8508, E-ISSN 1745-1337, Vol. E94A, no 11, 2361-2368 p.Article in journal (Refereed) Published
In this work we consider optimized twiddle factor multipliers based on shift-and-add-multiplication. We propose a low-complexity structure for twiddle factors with a resolution of 32 points. Furthermore, we propose a slightly modified version of a previously reported multiplier for a resolution of 16 points with lower round-off noise. For completeness we also include results on optimal coefficients for eight-points resolution. We perform finite word length analysis for both coefficients and round-off errors and derive optimized coefficients with minimum complexity for varying requirements.
Place, publisher, year, edition, pages
Institute of Electronics, Information and Communication Engineers , 2011. Vol. E94A, no 11, 2361-2368 p.
complex multiplier, FFT, constant multiplication, shift-and-add multiplication
IdentifiersURN: urn:nbn:se:liu:diva-72819DOI: 10.1587/transfun.E94.A.2361ISI: 000296673300038OAI: oai:DiVA.org:liu-72819DiVA: diva2:462835
Funding Agencies|Higher Education Commission, Pakistan||Linkoping University, Sweden||2011-12-082011-12-082016-05-30