Paper
3 September 2009 High-speed floating-point divider with reduced area
Author Affiliations +
Abstract
This paper presents a new implementation of a floating-point divider unit with a competitive performance and reduced area based on proposed modifications to the recursive equations of Goldschmidt algorithm. The Goldschmidt algorithm takes advantage of parallelism in the Newton-Raphson method with the same quadratic convergence. However, recursive equations in the Goldschmidt algorithm consist of a series of multiplications with full-precision operands, and it suffers from large area consumption. In this paper, the recursive equations in the algorithm are modified to replace full-precision multipliers with smaller multipliers and squarers. Implementations of floating-point reciprocal and divider using the modification are presented. Synthesis result shows around 20% to 40% area reduction when it is compared to the implementation based on the conventional Goldschmidt algorithm.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Kyung-Nam Han, Alexandre F. Tenca, and David Tran "High-speed floating-point divider with reduced area", Proc. SPIE 7444, Mathematics for Signal and Information Processing, 74440O (3 September 2009); https://doi.org/10.1117/12.827850
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Radon

Logic

Algorithm development

Algorithms

Signal processing

Current controlled current source

Data processing

RELATED CONTENT

Research on image enhancement based on fuzzy theory
Proceedings of SPIE (March 18 2022)
New assignment algorithms for data association
Proceedings of SPIE (August 25 1992)
Conditioning properties of the LLL algorithm
Proceedings of SPIE (September 02 2009)
Alternative To The SVD: Rank Revealing QR-Factorizations
Proceedings of SPIE (April 04 1986)

Back to Top