Header menu link for other important links
X
Generalized pruning at the input of radix-2 DIF FHT algorithm
K. M.Muraleedhara Prabhu, Nagesh Anupindi, Ravi Shanmuga Sundaram
Published in Elsevier
1996
Volume: 51
   
Issue: 3
Pages: 215 - 221
Abstract
In this paper, a generalized pruning procedure on the input of radix-2 DIF FHT algorithm is presented. For situations in which relative number of zero-valued samples is quite large, a systematic pruning procedure can be introduced on the input of the FHT algorithms, thereby reducing the amount of computational complexity. The novelty of this procedure is that the exact number of non-zero samples is taken into consideration, instead of approximating them to the nearest higher 2-power integer.
About the journal
JournalData powered by TypesetSignal Processing
PublisherData powered by TypesetElsevier
ISSN01651684
Open AccessNo
Concepts (12)
  •  related image
    Computational complexity
  •  related image
    Computational methods
  •  related image
    Digital arithmetic
  •  related image
    Mathematical transformations
  •  related image
    Poles and zeros
  •  related image
    Signal theory
  •  related image
    DECIMATION IN FREQUENCY
  •  related image
    FAST TRANSFORM ALGORITHM
  •  related image
    GENERALIZED PRUNING
  •  related image
    NON ZERO SAMPLES
  •  related image
    ZERO VALUED SAMPLES
  •  related image
    Algorithms