Journal of Advanced Navigation Technology (한국항행학회논문지)

The Korean Navigation Institute (한국항행학회)
권호 표지
DOI QR코드

DOI QR Code

Scalable FFT Processor Based on Twice Perfect Shuffle Network for Radar Applications

레이다 응용을 위한 이중 완전 셔플 네트워크 기반 Scalable FFT 프로세서

  • Kim, Geonho (School of Electronics and Information Engineering, Korea Aerospace University) ;
  • Heo, Jinmoo (School of Electronics and Information Engineering, Korea Aerospace University) ;
  • Jung, Yongchul (School of Electronics and Information Engineering, Korea Aerospace University) ;
  • Jung, Yunho (School of Electronics and Information Engineering, Korea Aerospace University)
  • 김건호 (한국항공대학교 항공전자정보공학부) ;
  • 허진무 (한국항공대학교 항공전자정보공학부) ;
  • 정용철 (한국항공대학교 항공전자정보공학부) ;
  • 정윤호 (한국항공대학교 항공전자정보공학부)
  • Received : 2018.10.08
  • Accepted : 2018.10.24
  • Published : 2018.10.31
Download PDF
⟨ Previous Next ⟩

Abstract

In radar systems, FFT (fast Fourier transform) operation is necessary to obtain the range and velocity of target, and the design of an FFT processor which operates at high speed is required for real-time implementation. The perfect shuffle network is suitable for high-speed FFT processor. In particular, twice perfect shuffle network based on radix-4 is preferred for very high-speed FFT processor. Moreover, radar systems that requires various velocity resolution should support scalable FFT points. In this paper, we propose a 8~1024-point scalable FFT processor based on twice perfect shuffle network algorithm and present hardware design and implementation results. The proposed FFT processor was designed using hardware description language (HDL) and synthesized to gate-level circuits using $0.65{\mu}m$ CMOS process. It is confirmed that the proposed processor includes logic gates of 3,293K.

레이다 시스템의 경우, 타겟의 거리와 속도를 추출하기 위해 FFT (fast Fourier transform) 연산이 필수적으로 요구되며, 실시간 구현을 위해 고속으로 동작하는 FFT 프로세서의 설계가 필요하다. 고속 FFT 프로세서를 위한 하드웨어 구조로 완전 셔플 네트워크 (perfect shuffle network) 구조가 적합하며, 특히 초고속 연산을 위해 radix-4 기반의 이중 완전 셔플 네트워크 (twice perfect shuffle network) 구조가 가장 적절하고 볼 수 있다. 더불어, 다양한 속도 해상도를 요구하는 레이다 응용을 고려할 때, FFT 프로세서는 가변길이 FFT 연산을 지원할 필요가 있다. 이에 본 논문에서는 8~1024 포인트의 가변 길이 연산을 지원하는 이중 완전 셔플 네트워크 기반의 FFT 알고리즘을 제안하였으며, 이의 하드웨어 구조 설계 및 구현 결과를 제시한다. 제안된 FFT 프로세서는 HDL (hardware description language)을 활용하여 RTL (register transfer level) 설계가 수행되었으며, $0.65{\mu}m$ CMOS 공정을 활용하여 논리 합성한 결과, 총 3,293K개의 논리 게이트로 구현 가능함을 확인 할 수 있었다.

Keywords

References

  1. M. Abe, "Trends of Intelligent Vehicle Dynamics Controls and Their Future," New Technology Network Technical Review, No. 81, pp. 2-11, 2013.
  2. T. Hanke, N. Hirsenkorn, B. Dehlink, A. Rauch, R. Rasshofer, and E. Biebl, "Generic architecture for simulation of ADAS sensors," in Proceeding of the 16th International Radar Symposium (IRS), Dresden: Germany, pp. 125-130, Aug. 2015.
  3. E. Richter, R. Schubert, and G. Wanielik, "Radar and vision based data fusion-Advanced filtering techniques for a multi object vehicle tracking system," in Proceedings of the IEEE Intelligent Vehicles Symposium, Eindhoven: Netherlands, pp. 120-125, Jun. 2008.
  4. U. Kadow, G. Schneider, and A. Vukotich, "Radar-vision based vehicle recognition with evolutionary optimized and boosted features," in Proceedings of the IEEE Intelligent Vehicles Symposium, Istanbul: Turkey, pp. 749-754, Jun. 2007.
  5. S. Jardak, S. Ahmed, and M.S. Alouini, “Low complexity moving target parameter estimation for MIMO radar using 2D-FFT,” IEEE Transaction on Signal Processing, Vol. 65, No. 18, pp. 4745-4755, Sep. 2017. https://doi.org/10.1109/TSP.2017.2716910
  6. A. Boughambouz, A. Bellabas, B. Magaz, T. Menni, and M. Abdelaziz, "Improvement of radar signal phase extraction using All Phase FFT spectrum analysis," in Detection Systems Architectures and Technologies Seminar, Algiers: Algeria, Feb. 2017.
  7. S. Saponara and B. Neri, “Radar sensor signal acquisition and multidimensional FFT processing for surveillance applications in transport systems,” IEEE Transactions on Instrumentation and Measurement, Vol. 66, No. 4, pp. 604-615, April 2017. https://doi.org/10.1109/TIM.2016.2640518
  8. H. Stone, "Parallel processing with the perfect shuffle," IEEE Transaction on Computers, Vol. C-20, No.2, pp. 156-161, Feb. 1971.
  9. V. Boriakoff, “FFT computation with Systolic arrays, a new architecture,” IEEE Transaction on Circuit and Systems, Analog and Digital Signal Processing, Vol. 41, No. 4, pp. 278-284, April. 1994.
  10. A. Suleiman, A. Hussein, K. Bataineh, and D. Akopian, "Scalable FFT architecture vs. multiple pipeline FFT architectures-hardware implementation and cost," in Proceeding of the IEEE International Conference on Systems, Man and Cybernetics, San Antonio: TX, pp. 3792-3796, Oct. 2009.
  11. M. H. Hwang and H, J. Hwang, "Design of radix-4 FFT processor using twice perfect shuffle," Journal of the Institute of Electronics and Information Engineers, Vol. 27, No.2, pp. 307-313, Feb. 1990.