The Journal of Korea Institute of Information, Electronics, and Communication Technology (한국정보전자통신기술학회논문지)

Korea Information Electronic Communication Technology (한국정보전자통신기술학회)
권호 표지
DOI QR코드

DOI QR Code

Novel Radix-26 DF IFFT Processor with Low Computational Complexity

연산복잡도가 적은 radix-26 FFT 프로세서

  • Cho, Kyung-Ju (Department of Electronic Engineering Wonkwang University)
  • Received : 2020.02.04
  • Accepted : 2020.02.18
  • Published : 2020.02.28
Download PDF
⟨ Previous Next ⟩

Abstract

Fast Fourier transform (FFT) processors have been widely used in various application such as communications, image, and biomedical signal processing. Especially, high-performance and low-power FFT processing is indispensable in OFDM-based communication systems. This paper presents a novel radix-26 FFT algorithm with low computational complexity and high hardware efficiency. Applying a 7-dimensional index mapping, the twiddle factor is decomposed and then radix-26 FFT algorithm is derived. The proposed algorithm has a simple twiddle factor sequence and a small number of complex multiplications, which can reduce the memory size for storing the twiddle factor. When the coefficient of twiddle factor is small, complex constant multipliers can be used efficiently instead of complex multipliers. Complex constant multipliers can be designed more efficiently using canonic signed digit (CSD) and common subexpression elimination (CSE) algorithm. An efficient complex constant multiplier design method for the twiddle factor multiplication used in the proposed radix-26 algorithm is proposed applying CSD and CSE algorithm. To evaluate performance of the previous and the proposed methods, 256-point single-path delay feedback (SDF) FFT is designed and synthesized into FPGA. The proposed algorithm uses about 10% less hardware than the previous algorithm.

FFT(fast Fourier transform) 프로세서는 통신, 영상, 생체 신호처리와 같은 다양한 응용에 폭 넓게 사용된다. 특히, 고성능 저전력 FFT 연산은 OFDM 전송방식을 사용하는 통신시스템에서는 필수적이다. 본 논문에서는 연산복잡도가 적고 하드웨어 효율이 우수한 새로운 radix-26 FFT 알고리즘을 제안한다. 7차원 인덱스 매핑을 사용하여 회전인자를 분해하고 radix-26 FFT 알고리즘을 유도한다. 제안한 알고리즘은 기존 알고리즘과 비교하여 회전인자가 간단하고 복소 곱셈 수가 적어 회전인자를 저장하는 메모리 크기를 줄일 수 있다. 한 스테이지에서 회전인자의 계수가 적을 때 복소 곱셈기 대신 복소 상수곱셈기를 사용하면 복소곱셈을 효율적으로 처리할 수 있다. 복소 상수곱셈기는 CSD(canonic signed digit)과 CSE(common subexpression elimination) 알고리즘을 사용하여 보다 효율적으로 설계할 수 있다. 제안한 radix-26 알고리즘에서 필요한 복소 상수곱셈기를 CSD와 CSE를 이용하여 효율적으로 설계하는 방법을 제안한다. 제안한 방법의 성능을 평가하기 위해 SDF(single-path delay feedback) 구조를 사용하여 256 포인트 FFT를 설계하고 FPGA로 합성한 결과, 제안한 알고리즘은 기존 알고리즘 보다 약 10% 정도 하드웨어를 적게 사용하였다.

Keywords

References

  1. J. Yu and K. J. Cho, "A low-area and low-power 512-point pipelined FFT design using raidx-24-23 for OFDM applications", JKIIECT, vol. 11. no. 5, pp. 475-480, 2018.
  2. C. Yu and M. H. Yen, "Area-efficient 128- to 2048/1536-point pipeline FFT processor for LTE and mobile WiMAX systems", IEEE VLSI Syst., vol. 23, pp. 1793-1800, 2015. https://doi.org/10.1109/TVLSI.2014.2350017
  3. S. He and M. Torkelson, "A new approach to pipelined FFT processor", IPPS'96, pp. 766-770, 1996.
  4. J. Y. Oh and M. S. Lim, "New radix-2 to the 4th power pipeline FFT processor", IEICE trans. Electron., vol. E88-C, no. 8, pp.1740-1746, 2005. https://doi.org/10.1093/ietele/e88-c.8.1740
  5. T. S. Cho and H. H. Lee, "A high-speed low-complexity modified radix-2^5 FFT processor for high rate WPAN applications", IEEE Trans. Very Large Scale Integr. (VLSI) Syst, vol. 21, no. 1, pp. 187-191, Feb, 2013. https://doi.org/10.1109/TVLSI.2011.2182068
  6. C. Yang, C. Wei, Y. Xie, H. Chen and C. Ma, "Area-efficient mixed-radix variable-length FFT processor", IEICE Electron. Expr. , vol. 14, no. 10, pp. 1-10, 2017.
  7. S. J. Huang, S. G. Chen, "A high-throughput radix-16 FFT processor with parallel and normal input/output ordering for IEEE 802.15. 3c systems", IEEE Tran. Circuits Sys. I: Reg. Papers, vol. 59, no. 8, pp.1752-1765, 2012. https://doi.org/10.1109/TCSI.2011.2180430
  8. G. K. Ganjikunta and S. K. Sahoo, "An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications", Integration, the VLSI Journal, vol. 57, pp. 125-131, 2017. https://doi.org/10.1016/j.vlsi.2016.12.002