Optimizing energy to minimize errors in dataflow graphs using approximate adders

Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among adders in a dataflow graph so as to minimize expected errors. The method is based on new formal mathematical models and algorithms, which quantitatively characterize the relative importance of the adders in a circuit. We demonstrate this method on a finite impulse response filter and a Fast Fourier Transform. The optimized energy distribution yields 2.05X

• Type: Journal
• Year: 2010
• Where: CASES
• Authors: Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna Muntimadugu, Krishna V. Palem, Avani Devarasetty, Phani Deepak Parasuramuni
• Keywords: CASES 2010, Fast Fourier Transform, Finite Impulse Response Filter, Formal Mathematical Models, System Software