
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

LowLatency LowCost Architecture for Square and Cube Roots
Jihyuck JO InCheol PARK
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E100A
No.9
pp.19511955 Publication Date: 2017/09/01
Online ISSN: 17451337 Type of Manuscript: PAPER Category: Digital Signal Processing Keyword: computer arithmetic, cube roots, square roots, noniterative root calculation,
Full Text: PDF(729.4KB) >>Buy this Article
Summary:
This paper presents a lowlatency, lowcost architecture for computing square and cube roots in the fixedpoint format. The proposed architecture is designed based on a noniterative root calculation scheme to achieve fast computations. While previous noniterative root calculators are restricted to a squareroot operation due to the limitation of their mathematical property, the root computation is generalized in this paper to apply an approximation method to the noniterative scheme. On top of that, a recurrent method is proposed to select parameters, which enables us to reduce the table size while keeping the maximum relative error value low. Consequently, the proposed root calculator can support both square and cube roots at the expense of small delay and low area overheads. This extension can be generalized to compute the n^{th} roots, where n is a positive integer.

