In this paper, an automated design method for the synthesis of a high-throughput fast Fourier transform (FFT) ASIC is presented, applicable to any power-of-two FFT sizes. The method is based on a C++ program named FAST which has been developed. as a friendly dialogue-window interface to help the designer, first to obtain a bit-true FFT architecture to attain the desired precision performance and then to derive validated gate-level netlists for the selected silicon technology. As a result, a substantial reduction of the design time is achieved. The FFT processor implements a mixed 2/4 radix algorithm with a Cascade Bi and Jones architecture. The relevant VLSI design is based on a parametric, highly flexible VHDL description created using a design-reuse approach. According to the FAST methodology, two prototypes (64- and 1024-point FFT processors) have been developed resulting very interesting in terms of hardware complexity and precision performance when compared with state of the art; in particular, the 64-point FFT processor exhibits an area-time product nearly 30% lower than previous works following automatic-design methodologies. (C) 2002 Elsevier Science B.V. All rights reserved.

FAST: FFT ASIC Automated Synthesis

FANUCCI, LUCA;TERRENI, PIERANGELO
2002-01-01

Abstract

In this paper, an automated design method for the synthesis of a high-throughput fast Fourier transform (FFT) ASIC is presented, applicable to any power-of-two FFT sizes. The method is based on a C++ program named FAST which has been developed. as a friendly dialogue-window interface to help the designer, first to obtain a bit-true FFT architecture to attain the desired precision performance and then to derive validated gate-level netlists for the selected silicon technology. As a result, a substantial reduction of the design time is achieved. The FFT processor implements a mixed 2/4 radix algorithm with a Cascade Bi and Jones architecture. The relevant VLSI design is based on a parametric, highly flexible VHDL description created using a design-reuse approach. According to the FAST methodology, two prototypes (64- and 1024-point FFT processors) have been developed resulting very interesting in terms of hardware complexity and precision performance when compared with state of the art; in particular, the 64-point FFT processor exhibits an area-time product nearly 30% lower than previous works following automatic-design methodologies. (C) 2002 Elsevier Science B.V. All rights reserved.
2002
Fanucci, Luca; Forliti, M; Terreni, Pierangelo
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11568/182903
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 9
  • ???jsp.display-item.citation.isi??? 8
social impact