IEEE 802.11n WLAN을 위한 FFT 프로세서의 하드웨어 복잡도 최적화에 대한 연구

A Study on Optimization of Hardware Complexity of a FFT Processor for IEEE 802.11n WLAN
  • 최락훈
  • 박정준
  • 임태민
  • 이진용
  • 김영록

초록

A FFT/IFFT processor is the key component for orthogonal frequency division multiplexing (OFDM) systems based IEEE 802.11n wireless local area network (WLAN). There exists many radix algorithms according to the structure of butterfly as FFT sub-module, each has the pros and cons on hardware complexity. Here, mixed radix algorithms for 64 and 128 FFT/IFFT processors are proposed, which reduce hardware complexity by using mixture of radix-23 and radix-4 algorithms. The proposed algorithm finish calculation within 3.2㎲ in order to meet IEEE 802.11n standard requirements and it has less hardware complexity compared with conventional algorithms.

키워드

FFTMixed radixOFDMIEEE 802.11nWLANFFTMixed radixOFDMIEEE 802.11nWLAN
제목
IEEE 802.11n WLAN을 위한 FFT 프로세서의 하드웨어 복잡도 최적화에 대한 연구
제목 (타언어)
A Study on Optimization of Hardware Complexity of a FFT Processor for IEEE 802.11n WLAN
저자
최락훈박정준임태민이진용김영록
발행일
2011-08
저널명
대한임베디드공학회논문지
6
4
페이지
243 ~ 248