A comb spectrum evaluation problem arises in the (de)modulation for orthogonal frequency division multiplexing-based (OFDM-based) multichannel communication system. Efficient algorithms for this special type of partial discrete Fourier transform (DFT) computation are studied. For an M-component comb spectrum evaluation with transform length N, it is shown that only O(N+MlogM) multiplications are needed, compared with O(NlogM) multiplications necessary for a narrowband spectrum evaluation. Pruning radix-2 decimation-in-time fast Fourier transform (FFT) requires only (N/4+M/2log/sub 2/M-M) nontrivial complex multiplications. The frequency shift technique has also been applied to allow a modularized mixed-radix structure for the computation of comb spectrum with an initial component not starting from zero frequency point.
[1]
D. Skinner.
Pruning the decimation in-time FFT algorithm
,
1976
.
[2]
Leonard J. Cimini,et al.
Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multiplexing
,
1985,
IEEE Trans. Commun..
[3]
Keinosuke Nagai,et al.
Pruning the decimation-in-time FFT algorithm with frequency shift
,
1986,
IEEE Trans. Acoust. Speech Signal Process..
[4]
M. Alard,et al.
Principles of Modulation and Channel Coding for Digital Broadcasting for Mobile Receivers
,
1987
.
[5]
C. Sidney Burrus,et al.
Efficient computation of the DFT with only a subset of input or output points
,
1993,
IEEE Trans. Signal Process..