z-logo
open-access-imgOpen Access
High‐Performance FP Divider with Sharing Multipliers Based on Goldschmidt Algorithm
Author(s) -
He Tingting,
Chen Jiyang,
Lei Yuanwu,
Peng Yuanxi,
Zhu Baozhou
Publication year - 2017
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2016.10.004
Subject(s) - computer science , latency (audio) , reciprocal , pipeline (software) , algorithm , digital signal processing , parallel computing , computer hardware , telecommunications , operating system , philosophy , linguistics
Focused on the issue that division is complex and needs a long latency to compute, a method to design the unit of high‐performance Floating‐point (FP) divider based on Goldschmidt algorithm was proposed. Bipartite reciprocal tables were adopted to obtain initial value of iteration with area‐saving, and parallel multipliers were employed in the iteration unit to reduce latency. FP divider to support pipeline execution with the control of state machine is presented to increase the throughput. The design was implemented in Digital signal process (DSP) chip by sharing the existed multipliers.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here