Area-Efficient Scaling-Free DFT/FFT Design Using Stochastic Computing

@article{Yuan2016AreaEfficientSD,
  title={Area-Efficient Scaling-Free DFT/FFT Design Using Stochastic Computing},
  author={Bo Yuan and Yanzhi Wang and Zhongfeng Wang},
  journal={2016 IEEE International Symposium on Circuits and Systems (ISCAS)},
  year={2016},
  pages={2904-2904}
}
Discrete Fourier transform (DFT) is an important transformation technique in signal processing tasks. Due to its ultrahigh computing complexity as O(N2), N-point DFT is usually implemented in the format of fast Fourier transformation (FFT) with the complexity of O(N log N). Despite this significant reduction in complexity, the hardware cost of the multiplication-intensive N-point FFT is still very prohibitive, particularly for many large-scale applications that require large N. This brief, for… CONTINUE READING