Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 2011-11-01

著者

• Gustafsson Oscar

  Department Of Electrical Engineering Linkoping University

• Qureshi Fahad

  Department Of Electrical Engineering Linkoping University

• GUSTAFSSON Oscar

  Department of Electrical Engineering, Linkoping University

• QURESHI Fahad

  Department of Electrical Engineering, Linkoping University

関連論文

• Comments on 'A 70MHz Multiplierless FIR Hilbert Transformer in 0.35μm Standard CMOS Library'
• On the efficient computation of single-bit input word length pipelined FFTs
• Low-Complexity Constant Multiplication Based on Trigonometric Identities with Applications to FFTs

スポンサーリンク