IEEE Symposium on FPGA's for Custom Computing Machines (FCCM '95)
Quantitative analysis of floating point arithmetic on FPGA based custom computing machines
Napa Valley, California
April 19-April 21
ISBN: 0-8186-7086-X
N. Shirazi, Dept. of Electr. Eng., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA
A. Walters, Dept. of Electr. Eng., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA
P. Athanas, Dept. of Electr. Eng., Virginia Polytech. Inst. & State Univ., Blacksburg, VA, USA
Abstract: Many algorithms rely on floating point arithmetic for the dynamic range of representations and require millions of calculations per second. Such computationally intensive algorithms are candidates for acceleration using custom computing machines (CCMs) being tailored for the application. Unfortunately, floating point operators require excessive area (or time) for conventional implementations. Instead, custom formats, derived for individual applications, are feasible on CCMs, and can be implemented on a fraction of a single FPGA. Using higher-level languages, like VHDL, facilitates the development of custom operators without significantly impacting operator performance or area. Properties, including area consumption and speed of working arithmetic operator units used in real-time applications, are discussed.
Index Terms:
floating point arithmetic; field programmable gate arrays; programmable logic arrays; performance evaluation; floating point arithmetic; FPGA; custom computing machines; quantitative analysis; CCMs; area consumption; speed
Citation:
N. Shirazi, A. Walters, P. Athanas, "Quantitative analysis of floating point arithmetic on FPGA based custom computing machines," fccm, pp.0155, IEEE Symposium on FPGA's for Custom Computing Machines (FCCM '95), 1995