| Name: | Description: | Size: | Format: | |
|---|---|---|---|---|
| 244.83 KB | Adobe PDF |
Advisor(s)
Abstract(s)
This paper presents a single precision floating point arithmetic unit with support for multiplication, addition, fused multiply-add, reciprocal, square-root and inverse squareroot with high-performance and low resource usage. The design uses a piecewise 2nd order polynomial approximation to implement reciprocal, square-root and inverse square-root. The unit can be configured with any number of operations and is capable to calculate any function with a throughput of one operation per cycle. The floatingpoint multiplier of the unit is also used to implement the polynomial approximation and the fused multiply-add operation. We have compared our implementation with other state-of-the-art proposals, including the Xilinx Core-Gen operators, and conclude that the approach has a high relative performance/area efficiency. © 2014 Technical University of Munich (TUM).
Description
Keywords
Digital Arithmetic Field Programmable Gate Arrays (FPGA) Program Processors Efficient Implementation Floating-Point Arithmetic Floatingpoint Fused Multiply-Add Relative Performance Resource Usage Single Precision Square-Root
Citation
JOSÉ, Wilson; [et al] – Efficient implementation of a single-precision floating-point arithmetic unit on FPGA. In FPL 2014 Conference Digest - 24th International Conference on Field Programmable Logic and Applications. New York : IEEE - Institute of Electrical and Electronics Engineers Inc., 2014. ISBN: 978-300044645-0. Art. nr. 6927391.
Publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.