Low-Power Split-Radix FFT Processors Using Dual Edge Triggered Flip Flop

Abstract

Well-known Fast Fourier Transform (FFT) is the most common signal processing algorithm for observing the frequency contents of incoming signals in telecommunication transceivers. It is notably used in cognitive or software defined radio which usually demands for monitoring the spectrum in a wide frequency band. This may imply heavy computation burde non processors when the ordinary FFT algorithm is implemented, and hence yield considerable power consumption. Split-radix fast Fourier transform (SRFFT) is an ideal candidate for the implementation of a low-power FFT processor, because it has the lowest number of arithmetic operations among all the FFT algorithms. In the design of such processors, an efficient addressing scheme for FFT data as well as twiddle factors is required. The signal flow graph of SRFFT and the radix-2 FFT is same. Therefore, the generation of conventional address of FFT could also be applied to Split-radix fast Fourier transform (SRFFT). Dual edge triggered flip flop (DETFF) instead of using single edge triggered flip flop traditionally in the architecture improves speed level and decreases power consumption by using DETFF, it propagate  and captures the data at both clock edges hence it is suitable for high speed of FFT module can be increased the high data rate applications.

Country : India

1 M.Anitha2 R.Preyadharan3 P.Manikandan

  1. PG Scholar, Department of VLSI, AVS Engineering College, Salem, Tamilnadu, India
  2. Assistant Professor, Department of ECE, AVS Engineering College, Salem, Tamilnadu, India
  3. Assistant Professor, Department of ECE, AVS College of Technology, Salem, Tamilnadu, India

IRJIET, Volume 2, Issue 2, April 2018 pp. 9-12

References

  1. J. Chen, J. Hu, S. Lee, and G. E. Sobelman, “Hardwar efficient mixed radix-25/16/9 FFT for LTE systems,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 23, no. 2, pp. 221–229, Feb. 2015.
  2. Z. Qian, N. Nasiri, O. Segal, and M. Margala, “FPGA implementation of low-power split-radix FFT processors,” in Proc. 24th Int. Conf. Field Program. Logic Appl., Munich, Germany, Sep. 2014, pp.1–2.
  3. X. Xiao, E. Oruklu, and J. Saniie, “An efficient FFT engine with reduced addressing logic,” IEEE Trans. Circuits Syst. II, Exp. Briefs,vol55,no. 11, pp. 1149–1153,Nov.2008.
  4. N. Skodras and A. G. Constantinides, “Efficient computation of the split-radix FFT,” IEE Proc. F-Radar Signal Process., vol.139no1,pp. 56–60, Feb. 1992.
  5. L. G. Johnson, “Conflict free memory addressing for dedicated FFT hardware,” IEEE Trans. Circuits Syst. II, Analog Digit. Signal Process. vol. 39, no. 5, pp. 312–316, May 1992.
  6. M. A. Richards, “On hardware implementation of the split-radix FFT,” IEEE Trans. Acoust., Speech Signal Process., vol 36, no.10.
  7. P. Duhamel and H. Hollmann, “‘Split radix’ FFT algorithm, ”Electron. Lett., vol. 20, no. 1, pp. 14–16, Jan. 1984.
  8. D. Cohen, “Simplified control of FFT hardware,” IEEE Trans. Acoust., Speech, Signal Process., vol. 24, no. 6, pp. 577–579, Dec. 1976.