By Topic

An FPGA Implementation of a Fully Verified Double Precision IEEE Floating-Point Adder

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kikkeri, N. ; Southern Methodist Univ., Dallas ; Seidel, P.-M.

We report on the full gate-level verification and FPGA implementation of a highly optimized double precision IEEE floating-point adder. The proposed adder design incorporates many optimizations like a nonstandard separation into two paths, a simple rounding algorithm, unification of rounding cases for addition and subtraction, sign-magnitude computation of a difference based on one's complement subtraction, compound adders, and fast circuits for approximate counting of leading zeros from borrow-save representation. We formally verify a gate-level specification of the algorithm using theorem proving techniques in PVS. The PVS specification was then used to automatically generate a gate-level implementation that was synthesized using Altera Quartus II. The resulting implementation has a total latency of 13.6 ns on an Altera Stratix II device.We have partitioned the design into a 2 stage pipeline running at a frequency of 147 Mhz.

Published in:

Application-specific Systems, Architectures and Processors, 2007. ASAP. IEEE International Conf. on

Date of Conference:

9-11 July 2007