Area-efficient scaling-free DFT/FFT design using stochastic computing.
IEEE Transactions on Circuits and Systems II: Express Briefs(2016)
摘要
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...
更多查看译文
关键词
Discrete Fourier transforms,Hardware,Stochastic systems,Fast Fourier transforms,Random number generation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络