An Efficient FFT For OFDM Based Cognitive Radio On A Reconfigurable Architecture

Cognitive radio is a promising technology to utilize non-used parts of the spectrum that actually are assigned to licensed services. An adaptive OFDM based cognitive radio system has the capacity to nullify individual carriers to avoid interference to the licensed user. Therefore, there could be a considerably large number of zero-valued inputs/outputs for the IFFT/FFT in the OFDM transceiver. Due to the wasted operations on zero values, the standard FFT is no longer efficient. Based on this observation, we propose to use a computationally efficient IFFT/FFT as an option for OFDM based cognitive radio. Mapping this algorithm onto a reconfigurable architecture is discussed.

[1]  Joseph Mitola,et al.  Cognitive Radio An Integrated Agent Architecture for Software Defined Radio , 2000 .

[2]  Friedrich Jondral,et al.  Spectrum pooling: an innovative strategy for the enhancement of spectrum efficiency , 2004, IEEE Communications Magazine.

[3]  G.J.M. Smit,et al.  A Reconfigurable Radio Architecture for Cognitive Radio in Emergency Networks , 2006, 2006 European Conference on Wireless Technology.

[4]  Qiwei Zhang,et al.  Implementing Non Power-of-Two FFTs on Coarse-Grain Reconfigurable Architectures , 2005, 2005 International Symposium on System-on-Chip.

[5]  Gerard J. M. Smit,et al.  Mapping of DSP algorithms on the MONTIUM architecture , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[6]  Andre B. J. Kokkeler,et al.  Towards Cognitive Radio for emergency networks , 2006 .

[7]  Simon Haykin,et al.  Cognitive radio: brain-empowered wireless communications , 2005, IEEE Journal on Selected Areas in Communications.

[8]  P. M. Heysters.  Coarse-Grained Reconfigurable Processors - Flexibility meets Efficiency , 2004 .

[9]  C. Sidney Burrus,et al.  Efficient computation of the DFT with only a subset of input or output points , 1993, IEEE Trans. Signal Process..

[10]  D. Skinner.  Pruning the decimation in-time FFT algorithm , 1976 .

[11]  Shousheng He,et al.  Computing partial DFT for comb spectrum evaluation , 1996, IEEE Signal Processing Letters.

[12]  T. V. Sreenivas,et al.  FFT algorithm for both input and output pruning , 1979 .