Pruning the vector-radix 2-D FFT

• L. Capodiferro ^[1] ; R. Cusani ^[2]
  1. [1] Fondazione Ugo Bordoni
  2. [2] University of Rome "Tor Vergata"
• Localización: Mini and Microcomputers and their applications / Emilio Luque Fadón (ed. lit.), 1988, págs. 461-464
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Two dimensional "pruned" Fast Fourier Transform algortims are proposed and compared on the basis of their arithmetic complxity for the case when the input image exhibits large zero regions. The superiority of pruned vector-radix 4 technique over pruned vector- radix 2and radix -2 algorithms is verified, while pruned radix-2 row-column can be of interest for very small nonzero subimages.