access icon free High-Performance FP Divider with Sharing Multipliers Based on Goldschmidt Algorithm

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.

Inspec keywords: pipeline processing; floating point arithmetic; digital signal processing chips

Other keywords: goldschmidt algorithm; high-performance FP divider; digital signal process chip; pipeline execution; parallel multipliers; state machine; bipartite reciprocal tables; DSP; area-saving; multipliers; high-performance floating-point divider

Subjects: Digital arithmetic methods; Digital signal processing chips; Multiprocessing systems; Digital signal processing chips

http://iet.metastore.ingenta.com/content/journals/10.1049/cje.2016.10.004
Loading

Related content

content/journals/10.1049/cje.2016.10.004
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading