The matrix recursive expression for the computation of the Discrete Fourier Transform of a complex sequence is constructed. The properties of the matrices involved in the recursive expression are exposed. The report contains also a software for the computation of the FFT.

On the matrix forms to compute the FFT

Notarnicola Filippo
1985

Abstract

The matrix recursive expression for the computation of the Discrete Fourier Transform of a complex sequence is constructed. The properties of the matrices involved in the recursive expression are exposed. The report contains also a software for the computation of the FFT.
1985
Istituto Applicazioni del Calcolo ''Mauro Picone''
Fast Fourier Transform
matrix formulation
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/20.500.14243/421436
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact