Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.11 pp.2361-2368
- Publication Date
- 2011/11/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E94.A.2361
- Type of Manuscript
- PAPER
- Category
- Digital Signal Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Fahad QURESHI, Oscar GUSTAFSSON, "Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs" in IEICE TRANSACTIONS on Fundamentals,
vol. E94-A, no. 11, pp. 2361-2368, November 2011, doi: 10.1587/transfun.E94.A.2361.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.2361/_p
Copy
@ARTICLE{e94-a_11_2361,
author={Fahad QURESHI, Oscar GUSTAFSSON, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs},
year={2011},
volume={E94-A},
number={11},
pages={2361-2368},
abstract={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.},
keywords={},
doi={10.1587/transfun.E94.A.2361},
ISSN={1745-1337},
month={November},}
Copy
TY - JOUR
TI - Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2361
EP - 2368
AU - Fahad QURESHI
AU - Oscar GUSTAFSSON
PY - 2011
DO - 10.1587/transfun.E94.A.2361
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2011
AB - 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.
ER -
English
