Enhancing FPGA Performance for Arithmetic Circuits

FPGAs offer flexibility and cost-effectiveness that ASICs cannot match; however, their performance is quite poor in comparison, especially for arithmetic dominated circuits. To address this issue, this paper introduces a novel reconfigurable lattice built from counters rather than look-up tables that can effectively accelerate the arithmetic portions of a circuit. We intend to integrate this novel lattice onto the same die as an FPGA.

[1]  Ajay Luthra,et al.  Overview of the H.264/AVC video coding standard , 2003, IEEE Trans. Circuits Syst. Video Technol..

[2]  Paolo Ienne,et al.  Automatic Synthesis of Compressor Trees: Reevaluating Large Counters , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[3]  Vaughn Betz,et al.  The Stratix II logic and routing architecture , 2005, FPGA '05.

[4]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[5]  Vaughn Betz,et al.  Architecture and CAD for Deep-Submicron FPGAS , 1999, The Springer International Series in Engineering and Computer Science.

[6]  Paolo Ienne,et al.  Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands , 2007, 2007 Asia and South Pacific Design Automation Conference.

[7]  R. Ravi,et al.  Optimal Circuits for Parallel Multipliers , 1998, IEEE Trans. Computers.

[8]  Ryan Kastner,et al.  FPGA Implementation of High Speed FIR Filters Using Add and Shift Method , 2006, 2006 International Conference on Computer Design.

[9]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[10]  Paolo Ienne,et al.  Improved use of the carry-save representation for the synthesis of complex arithmetic circuits , 2004, IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004..