Low‐Latency SRT Division and Square Root Based on Remainder and Quotient Prediction. Issue 1 (1st January 2017)

• Record Type: Journal Article
• Authors: Peng, Yuanxi; Chen, Jiyang; Lei, Yuanwu; He, Tingting; Deng, Ziye
• Is Part Of: Chinese journal of electronics. Volume 26:Issue 1(2017)
• Page Start: 58
• Page End: 64
• Publication Date: 2017-01-01
• Subjects: SRT -- Predicting remainder and quotient -- Minimum redundancy factor -- Redundant representation -- Division and square root; dividing circuits -- prediction theory -- redundancy; low‐latency SRT division -- square root based on remainder -- quotient prediction -- Sweeney‐Robertson‐Tocher algorithm -- reminder prediction -- redundant representation -- minimum redundancy factor -- size 40 nm -- power 81.19 mW -- time 656 ps; Electronics -- Periodicals; Electronics -- China -- Periodicals; Electronics; China; Periodicals; 621.38105
• DOI: 10.1049/cje.2016.10.024
• Languages: English
• ISSNs: 1022-4653

Abstract

Abstract : Sweeney, Robertson and Tocher (SRT) algorithm is a common and efficient way for division and square root (div/sqrt). We present to overlap two iterations into one cycle by predicting remainder and quotient. To reduce latency, redundant representation is used superiorly, as well as the use of a minimum redundancy factor. Division and square root can be integrated into one unit which causes a reduction in hardware cost. With 40nm technology library, the area of our architecture after layout design, is 37795µm 2, the power is 81.19mW and the delay is only 656ps. The cycles for double‐precision division and square root are 17 and 16, respectively. Experiments show our architecture achieves small latency and high frequency, together with modest area and power.