Browse > Article

Low-power Radix-4 FFT Structure for OFDM using Distributed Arithmetic  

Jang Young-Beom (College of Engineering, Sangmyung University)
Lee Won-Sang (Graduate School, Sangmyung University)
Kim Do-Han (Graduate School, Sangmyung University)
Kim Bee-Chul (Graduate School, Sangmyung University)
Hur Eun-Sung (Graduate School, Sangmyung University)
Publication Information
Abstract
In this paper, an efficient butterfly structure for Radix-4 FFT algorithm using DA(Distributed Arithmetic) is proposed. It is shown that DA can be efficiently used in twiddle factor calculation of the Radix-4 FFT algorithm. The Verilog-HDL coding results for the proposed DA butterfly structure show $61.02\%$ cell area reduction comparison with those of the conventional multiplier butterfly structure. furthermore, the 64-point Radix-4 pipeline structure using the proposed butterfly and delay commutators is compared with other conventional structures. Implementation coding results show $46.1\%$ cell area reduction. Due to its efficient processing scheme, the proposed FFT structure can be widely used in large size of FFT like OFDM Modem.
Keywords
Fast Fourier Transform; Radix-4; Distributed Arithmetic; Twiddle factor;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 Stanley A. White, 'Applications of Distributed Arithmetic to Digital Signal Processing: A tutorial Review', IEEE ASSP MAGAZINE July 1989   DOI   ScienceOn
2 정윤호, 김재석, '고속 멀티미디어 통신시스템을 위한 효율적인 FFT 알고리즘 및 하드웨어 구현', 전자공학회논문지 제41권 SD편 제3호, pp. 55-64, 2004년 3월   과학기술학회마을
3 Beven M. Baas, 'A 9.5mW 330us 1024-point FFT Processor', IEEE Custom Integrated Circuits Conference, pp. 127-130, 1998   DOI
4 E. H. Wold and A. M. Despain, 'Pipeline and Parallel FFT Processors for VLSI Implementation', IEEE Trans. on Comput., C-33(5), pp. 414-426, May 1984   DOI   ScienceOn
5 R. Van Nee and R. Prasad, OFDM for Wireless Multimedia Communication, Artech House, pp. 33-50, 2000
6 H. Stones, 'Parallel Processing with the Perfect Shuffle', IEEE Trans. on Comput., pp. 156-161, Feb. 1971   DOI   ScienceOn