We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Low complexity twiddle factor multiplication with ROM partitioning in FFT processor.
- Authors
Kang, Hyeong‐Ju; Yang, Byung‐Do; Lee, Jong‐Yeol
- Abstract
Proposed is a low‐complexity twiddle factor multiplication structure for fast Fourier transform (FFT). In an FFT implementation, the twiddle factor multiplication requires a large ROM to store the twiddle factors. In the proposed structure, the ROM is partitioned into two small ROMs, whose sum of areas is much smaller than that of the original ROM. The proposed structure requires an additional multiplier, but the multiplier is shown to be small in the experimental results. The results show that the proposed structure reduces the area of the twiddle factor multiplication by around 30% with a marginal degradation in SQNR performance.
- Publication
Electronics Letters (Wiley-Blackwell), 2013, Vol 49, Issue 8, p589
- ISSN
0013-5194
- Publication type
Article
- DOI
10.1049/el.2013.0689