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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
