Article ID Journal Published Year Pages File Type
461960 Microprocessors and Microsystems 2006 5 Pages PDF
Abstract

In this paper, we have applied the transform decomposition (TD) technique of pruning the fast Fourier transform (FFT) flow graph to the fast Hartley transform (FHT) flow graph. We have shown that efficient pruning is possible when the number of output points is limited. Any arbitrary band of spectra can also be computed using the method proposed.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computer Networks and Communications
Preview
Transform decomposition method of pruning the FHT algorithms
Authors
, ,