[email protected] +91 9840521421 Scholarly Open Access, Peer-reviewed, Refereed Journal e-ISSN 2582-8746 Since 2020
  1. Home
  2. Archives
  3. 2023
  4. Vol. 4 Issue 2
  5. Article
Research Article

High-Throughput Low-Latency Pipelined Divider for Single Precision Floating-Point Numbers

Open Access Peer Reviewed

Authors

  • Nidish kumar P1
  • Abishek M2
  • Dineshkumar v3

123Electronics and communication engineering , Bannari Amman Institute of Technology, Tamil Nadu, India.

Article Information

DOI
No DOI
Published Online
March-April 2023
Pages
218-223
Article Type
Research Article
Check for updates
No DOI available for cross-reference

Abstract

View PDF

Abstract: IEEE Standard 754 floating point is the most prevalent format today for real numbers on computers. An overview of IEEE floating point and its representation is provided in this publication. In order to improve time and area performance, this study describes a single precision floating point divider. The main goal of this work is to create a specific method for splitting two floating point integers in order to decrease power consumption and boost execution speed. In comparison to earlier Dividers, this one is faster and more accurate because to the pipelining process. This Verilog-described pipelined design is built on a Xilinx Spartan 3 FPGA. Xilinx Timing Analyzer is used to assess timing performance. To reduce the critical path, a compressor and an adder also compute the total of the partial products and other data. The combined findings demonstrate that our design's highest attainable frequency is superior to that of the current approaches. Moreover, when compared to existing techniques, our concept clearly outperforms them in terms of latency and throughput.. This Design is implemented using Verilog HDL and simulated by Modelsim 6.4 c.

APC from ₹1200 + 18% GST

Peer-reviewed open access₹1200 Indian (₹1400 with DOI)$80 USD internationalpaid after acceptance Peer-reviewed open access₹1200 Indian$80 USD international ₹1200 Indian · $80 intl

  • CrossRef DOI
  • ISSN 2582-8746
  • Open Access
  • Peer Reviewed
  • Plagiarism Checked
  • Google Scholar
Submit Paper