Paper
21 October 1996 Signed-digit online floating-point arithmetic for FPGAs
Atakorn Tangtrakul, Benjamin Yeung, Todd A. Cook
Author Affiliations +
Abstract
Many potential applications for reconfigurable computing need the dynamic range provided by floating-point arithmetic. However, doing floating-point on FPGAs is difficult because of the large amount of hardware required, particularly for multipliers. Some limited success has been obtained through digit-serial implementation of IEEE floating-point multipliers, but the IEEE representation is not easily or efficiently implemented in serial form. Therefore, we have been exploring alternate number representations. Signed-digit representations have shown some promise, since their form lends them to serial computation, which consumes much less hardware than fully parallel approaches. We show how the signed-digit representation can be used to implement floating-point arithmetic, and we present prototype implementations using Altera FPGAs.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Atakorn Tangtrakul, Benjamin Yeung, and Todd A. Cook "Signed-digit online floating-point arithmetic for FPGAs", Proc. SPIE 2914, High-Speed Computing, Digital Signal Processing, and Filtering Using Reconfigurable Logic, (21 October 1996); https://doi.org/10.1117/12.255805
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Field programmable gate arrays

Binary data

Information operations

Computing systems

Logic devices

Prototyping

Information technology

RELATED CONTENT

Faster and smaller hardware implementation of XTR
Proceedings of SPIE (August 25 2006)
Optical Fredkin Gate
Proceedings of SPIE (June 09 1986)
Tools for mapping applications to CCMs
Proceedings of SPIE (October 08 1998)

Back to Top