FFT implementation using floating point fused multiplier with four term adder


Hardware realization of fast Fourier transform (FFT) function consists of multiple complex arithmetic operations. Floating point implementation of FFT provides wider dynamic range than their fixed point counterparts and fusing the floating point arithmetic operations inside the Butterfly unit of FFT improves the speed of operation. This paper presents an… (More)

7 Figures and Tables


  • Presentations referencing similar topics