Pruning the decimation-in-time FFT algorithm with frequency shift

Fourier transformed components within desired narrow-band can be efficiently calculated by the pruned version of the decimation-in-time FFT algorithm. A new pruning method is proposed here which invloves frequency shift. The shifting simplifies the pruning algorithm because its flowgraph has a repetitive pattern of butterflies between adjacent stages.