An Optimum Design of FFT Multi-Digit Multiplier and Its VLSI Implementation
Syunji Yazaki, Kôki Abe · Institutional Repositories DataBase (IRDB) · 2006
We designed a VLSI chip of FFT multiplier based on simple Cooly-Tukey FFT using a floating-point representation with optimal data length based on an experimental error analysis. The VLSI implementation using HITACHI CMOS 0.18μm technology can perform multiplication of 25 to 213 digit hexadecimal numbers 19.7 to 34.3 times (25.7 times in average) faster than software FFT multiplier at an area cost of 9.05mm2 . The hardware FFT multiplier is 35.7 times faster than the software FFT multiplier for multiplication of 221 digit hexadecimal numbers. Advantage of hardware FFT multiplier over software will increase when more sophisticated FFT architectures are applied to the multiplier.