http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Kannan Muniandi (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
Hardware Implementation of FFT/IFFT Algorithms Incorporating Effi cient Computational Elements
Konguvel Elango,Kannan Muniandi 대한전기학회 2019 Journal of Electrical Engineering & Technology Vol.14 No.4
Fast Fourier Transform (FFT) and Inverse Fast Fourier Transform (IFFT) computations involve quite a large number of complex multiplications and complex additions. Optimizing the FFT processing elements in terms of complex multiplication reduces area and power consumption. In this paper, complex multipliers in the FFT processors are replaced by area and power effi cient approximate multipliers. Approximate arithmetic computation appears to be eff ective solution for the systems that exhibit an intrinsic error tolerance. The computational errors arising because of approximation can be considered as trade-off for the signifi cant gains in power and area. Approximate 8- and 16-bit multipliers are used in radix-2 butterfl y unit which is the crucial computational component in FFT/IFFT processing. The designed FFT/IFFT processing units are analyzed, synthesized and simulated in Altera Cyclone II EP2C35F672C6 Field Programmable Gate Array (FPGA) device. Experimental results show that the proposed 16-point FFT architecture incorporating approximate complex multiplier achieves an area and power effi ciency of 33.47% and 1.8% respectively compared to accurate 16-point FFT processor. The 8-point and 16-point Decimation In Time (DIT)—FFT incorporating approximate computational elements operate at a speed of 26.69 Gbps and 46.20 Gbps, respectively.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
