Repositorio Dspace

Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data

Two Families of Radix-2 FFT Algorithms With Ordered Input and Output Data
 
Martí i Puig, Pere
2009

Texto completo de este documento

Icon
Nombre: artconlli_a2009_marti_pere_two_families.pdf
Tamaño: 154.5Kb
Formato: PDF
Descripción: Només accés administradors
Enllaç permanent: http://hdl.handle.net/10854/3063
 
Versió de l'editor: https://doi.org/10.1109/LSP.2008.2003993
 

Resumen

Two radix-2 families of fast Fourier transform (FFT) algorithms that have the property that both inputs and outputs are addressed in natural order are derived in this letter. The algorithms obtained have the same complexity that Cooley–Tukey radix-2 algorithms but avoid the bit-reversal ordering applied to the input. These ...»»»»
Two radix-2 families of fast Fourier transform (FFT) algorithms that have the property that both inputs and outputs are addressed in natural order are derived in this letter. The algorithms obtained have the same complexity that Cooley–Tukey radix-2 algorithms but avoid the bit-reversal ordering applied to the input. These algorithms can be thought as a variation of the radix-2 Cooley–Tukey ones.^^^^

Tipo de documento:

Conferencia

Derechos:

 
(c) IEEE
 
Tots els drets reservats
 

Citación Bibliográfica:

Martí-Puig, P. (2009). Two families of radix-2 FFT algorithms with ordered input and output data. IEEE Signal Processing Letters, 16(1-3), 65-68. doi:10.1109/LSP.2008.2003993