Area-efficient error-resilient discrete fourier transformation design using stochastic computing

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.

[1]  Keshab K. Parhi,et al.  Successive cancellation decoding of polar codes using stochastic computing , 2015, 2015 IEEE International Symposium on Circuits and Systems (ISCAS).

[2]  John P. Hayes,et al.  Fast and accurate computation using stochastic circuits , 2014, 2014 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[3]  Keshab K. Parhi,et al.  VLSI digital signal processing systems , 1999 .

[4]  Keshab K. Parhi,et al.  Architectures for digital filters using stochastic computing , 2013, 2013 IEEE International Conference on Acoustics, Speech and Signal Processing.

[5]  Keshab K. Parhi,et al.  FFT Architectures for Real-Valued Signals Based on Radix-$2^{3}$ and Radix-$2^{4}$ Algorithms , 2013, IEEE Transactions on Circuits and Systems I: Regular Papers.

[6]  Brian R. Gaines,et al.  Stochastic Computing Systems , 1969 .

[7]  Zhongfeng Wang,et al.  Design space exploration for hardware-efficient stochastic computing: A case study on discrete cosine transformation , 2016, 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[8]  Xin Li,et al.  An Architecture for Fault-Tolerant Computation with Stochastic Logic , 2011, IEEE Transactions on Computers.

[9]  Mohamad Sawan,et al.  Delayed Stochastic Decoding of LDPC Codes , 2011, IEEE Transactions on Signal Processing.

[10]  Howard C. Card,et al.  Stochastic Neural Computation I: Computational Elements , 2001, IEEE Trans. Computers.

[11]  Keshab K. Parhi,et al.  Hardware Efficient Fast Computation of the Discrete Fourier Transform , 2006, J. VLSI Signal Process..

[12]  Alan V. Oppenheim,et al.  Discrete-time Signal Processing. Vol.2 , 2001 .

[13]  Shie Mannor,et al.  Stochastic decoding of LDPC codes , 2006, IEEE Communications Letters.

[14]  Shie Mannor,et al.  Fully Parallel Stochastic LDPC Decoders , 2008, IEEE Transactions on Signal Processing.

[15]  Keshab K. Parhi,et al.  Pipelined Parallel FFT Architectures via Folding Transformation , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[16]  John P. Hayes,et al.  Design of stochastic Viterbi decoders for convolutional codes , 2013, 2013 IEEE 16th International Symposium on Design and Diagnostics of Electronic Circuits & Systems (DDECS).

[17]  Hsie-Chia Chang,et al.  Stochastic decoding for LDPC convolutional codes , 2012, 2012 IEEE International Symposium on Circuits and Systems.

[18]  John P. Hayes,et al.  Stochastic circuits for real-time image-processing applications , 2013, 2013 50th ACM/EDAC/IEEE Design Automation Conference (DAC).

[19]  Kia Bazargan,et al.  Computation on Stochastic Bit Streams Digital Image Processing Case Studies , 2014, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[20]  Hsie-Chia Chang,et al.  A 7.92 Gb/s 437.2 mW Stochastic LDPC Decoder Chip for IEEE 802.15.3c Applications , 2015, IEEE Transactions on Circuits and Systems I: Regular Papers.