Abstract
Discrete Fourier Transformation (DFT)/Fast Fourier Transformation (FFT) are the widely used techniques in numerous modern signal processing applications. In general, because of their inherent multiplication-intensive characteristics, the hardware implementations of DFT/FFT usually require a large amount of hardware resource, which limits their applications in area-constraint scenarios. To overcome this challenge, this paper, for the first time, proposes area-efficient error-resilient DFT designs using stochastic computing. By leveraging low-complexity stochastic multipliers, two types of stochastic DFT design are presented with significant reduction in overall area. Analysis results show that compared with the conventional design, the proposed two 256-point stochastic DFT designs achieve 76% and 62% reduction in area, respectively. More importantly, these stochastic DFT designs also show much stronger error-resilience, which is very attractive in nanoscale CMOS era.
Original language | English (US) |
---|---|
Title of host publication | GLSVLSI 2016 - Proceedings of the 2016 ACM Great Lakes Symposium on VLSI |
Publisher | Association for Computing Machinery |
Pages | 33-38 |
Number of pages | 6 |
Volume | 18-20-May-2016 |
ISBN (Electronic) | 9781450342742 |
DOIs | |
State | Published - May 18 2016 |
Event | 26th ACM Great Lakes Symposium on VLSI, GLSVLSI 2016 - Boston, United States Duration: May 18 2016 → May 20 2016 |
Other
Other | 26th ACM Great Lakes Symposium on VLSI, GLSVLSI 2016 |
---|---|
Country/Territory | United States |
City | Boston |
Period | 5/18/16 → 5/20/16 |
Keywords
- DFT
- Error resilience
- FFT
- Stochastic computing
- VLSI
ASJC Scopus subject areas
- Engineering(all)