access icon free Low-complexity twiddle factor generation for FFT processor

A low-complexity twiddle factor generation structure for fast Fourier transform (FFT) is proposed. In FFT, twiddle faction generation and multiplication occupies more area than the other mathematical operations. The proposed structure reduces the twiddle factor generation part by removing the redundancies in the conventional structure and compressing the twiddle factor ROM contents. With the proposed structure, the twiddle factor generation part is reduced by 32–45% compared with that of the conventional structure.

Inspec keywords: fast Fourier transforms; read-only storage

Other keywords: ROM contents; for fast Fourier transform; FFT processor; low-complexity twiddle factor generation structure; twiddle faction multiplication

Subjects: Semiconductor storage; Integral transforms; Memory circuits; Integral transforms

References

    1. 1)
      • 4. Hasan, M., Arslan, T.: ‘Scheme for reducing size of coefficient memory in FFT processor’, Electron. Lett., 2002, 38, (4), pp. 163164 (doi: 10.1049/el:20020117).
    2. 2)
      • 5. He, S., Torkelson, M.: ‘Design and implementation of a 1024-point pipeline FFT processor’. Proc. IEEE Custom Integrated Circuits Conf., Santa Clara, CA, USA, May 1998, pp. 131134.
    3. 3)
      • 7. Turrillas, M., Cortes, A., Sevillano, J.F., Velez, I., Oria, C., Irizar, A., Baena, V.: ‘Comparison of area-efficient FFT algorithms for DVB-T2 receivers’, Electron. Lett., 2010, 46, (15), pp. 10881089 (doi: 10.1049/el.2010.0676).
    4. 4)
      • 6. He, S., Torkelson, M.: ‘Designing pipeline FFT processor for OFDM (de)modulation’. Proc. Int. Symp. Signals, Systems, and Electronics, Pisa, Italy, September 1998, pp. 257262.
    5. 5)
      • 3. Chang, Y.-N., Parhi, K.K.: ‘Efficient FFT implementation using digit-serial arithmetic’. Proc. IEEE Workshop on Signal Processing Systems, Taipei, Taiwan, October 1999, pp. 645653.
    6. 6)
      • 2. Lee, H.-Y., Park, I.-C.: ‘Balanced binary-tree decomposition for area-efficient pipelined FFT processing’, IEEE Trans. Circuits Syst I, Reg. Pprs., 2007, 54, (4), pp. 889900 (doi: 10.1109/TCSI.2006.888764).
    7. 7)
      • 1. Cooley, J.W., Tukey, J.W.: ‘An algorithm for machine computation of complex Fourier series’, Math. Comput., 1965, 19, pp. 297301 (doi: 10.1090/S0025-5718-1965-0178586-1).
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2013.2461
Loading

Related content

content/journals/10.1049/el.2013.2461
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading