한국정보통신학회논문지 (Journal of the Korea Institute of Information and Communication Engineering)

  • 제17권9호
  • /
  • Pages.2121-2126
  • /
  • 2013
  • /
  • 2234-4772(pISSN)
  • /
  • 2288-4165(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지
DOI QR코드

DOI QR Code

Ultra-long FFT를 위한 Radix-2 기반 구조

Radix-2 Based Structure for Ultra-long FFT

  • Kang, Hyeong-Ju (School of Computer Science and Engineering, Korea University of Technology and Education)
  • 투고 : 2013.05.15
  • 심사 : 2013.06.27
  • 발행 : 2013.09.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 32768-point FFT에서 radix-2에 기반한 구조들을 비교한다. Radix-2에 기반한 radix-$2^k$ 구조들은 버터플라이가 단순하면서 곱셈기의 수를 줄일 수 있어서 많이 이용되고 있다. 본 논문에서는 근래에 많이 연구되고 있는 ultra-long FFT 중 대표적인 32768-point FFT에 대해 다양한 radix-$2^k$ 구조를 적용하였다. 합성했을 때의 복잡도와 SQNR 성능을 비교한 결과 radix-$2^4$ 구조가 가장 적합함을 보였다.

This paper compares radix-2 based structures for 32768-point FFT. Radix-$2^k$ structures have been widely used because the butterfly is simple and the number of multipliers can be reduced in those structures. This paper applied various radix-$2^k$ structures to 32768-point FFT that is representing ultra-long FFT. The ultra-long FFT has been studied much recently. This paper shows that the radix-$2^4$ structure is the most adequate because it shows the smallest complexity in the synthesis and the best SQNR performance. should be placed here.

키워드

참고문헌

  1. H. Chen, Q. Wu, Z. Ciao, and H. Wan, "A pipelined memory-efficient architecture for ultra-long variable size FFT processors," in Proceedings of International Conference on Computer Science and Informmation, pp. 357-316, 2008.
  2. S.-Y. Lin, C.-L. Wey, and M.-D. Shieh, "Low-cost FFT Processor for DVB-T2 Applications," IEEE Transactions on. Consumer Electronics, vol. 56, no. 4, pp. 2072-2079, 2010. https://doi.org/10.1109/TCE.2010.5681074
  3. M. Turrillas, A. Cortes, I. Velez, J. F. Sevillano, and A. Irizar, "An FFT core for DVB-T2 receivers," in Proceedings of International Conference on Electronics, Circuits and Systems, pp. 120-123, 2008.
  4. S. He and M. Torkelson, "A new approach to pipeline {FFT} processor," in Proceedings of International Parallel Processing Symposium, pp. 766-770, 1996.
  5. S. He and M. Torkelson, "Design and implementation of a 1024-point pipeline FFT processor," in Proceedings of IEEE Custom Integrated Circuits Conference, pp. 131-134, 1998.
  6. S. He and M. Torkelson, "Designing Pipeline FFT Processor for OFDM (de)Modulation," in Proceedings of IEEE International Symposium on Signals, Systems, and Electronics, pp. 257-262, 1998.
  7. A. Cortes, I. Velez, and J. F. Sevillano, "Radix $r^{k}$ FFTs: matricial representation and SDC/SDF pipeline implementation," IEEE Transactions on Signal Processing, vol. 57, no. 7, pp. 2824-2839, 2009. https://doi.org/10.1109/TSP.2009.2016276
  8. J. W. Cooley and J. W. Tukey, "An algorithm for machine computation of complex Fourier series," Math. Comp., vol. 19, pp. 297-301, 1965. https://doi.org/10.1090/S0025-5718-1965-0178586-1
  9. M. Hasan and T. Arslan, "Scheme for reducing size of coefficient memory in FFT processor," Electronics Letters, vol. 38, no. 4, pp. 163-164, 2002. https://doi.org/10.1049/el:20020117