IEICE TRANSACTIONS on Fundamentals
Low-Latency Low-Cost Architecture for Square and Cube Roots
Summary :
This paper presents a low-latency, low-cost architecture for computing square and cube roots in the fixed-point format. The proposed architecture is designed based on a non-iterative root calculation scheme to achieve fast computations. While previous non-iterative root calculators are restricted to a square-root operation due to the limitation of their mathematical property, the root computation is generalized in this paper to apply an approximation method to the non-iterative 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 nth roots, where n is a positive integer.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E100-A No.9 pp.1951-1955
- Publication Date
- 2017/09/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E100.A.1951
- Type of Manuscript
- PAPER
- Category
- Digital Signal Processing
Authors
Jihyuck JO
Korea Advanced Institute of Science and Technology (KAIST)
In-Cheol PARK
Korea Advanced Institute of Science and Technology (KAIST)
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Jihyuck JO, In-Cheol PARK, "Low-Latency Low-Cost Architecture for Square and Cube Roots" in IEICE TRANSACTIONS on Fundamentals,
vol. E100-A, no. 9, pp. 1951-1955, September 2017, doi: 10.1587/transfun.E100.A.1951.
Abstract: This paper presents a low-latency, low-cost architecture for computing square and cube roots in the fixed-point format. The proposed architecture is designed based on a non-iterative root calculation scheme to achieve fast computations. While previous non-iterative root calculators are restricted to a square-root operation due to the limitation of their mathematical property, the root computation is generalized in this paper to apply an approximation method to the non-iterative 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 nth roots, where n is a positive integer.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E100.A.1951/_p
Copy
@ARTICLE{e100-a_9_1951,
author={Jihyuck JO, In-Cheol PARK, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Low-Latency Low-Cost Architecture for Square and Cube Roots},
year={2017},
volume={E100-A},
number={9},
pages={1951-1955},
abstract={This paper presents a low-latency, low-cost architecture for computing square and cube roots in the fixed-point format. The proposed architecture is designed based on a non-iterative root calculation scheme to achieve fast computations. While previous non-iterative root calculators are restricted to a square-root operation due to the limitation of their mathematical property, the root computation is generalized in this paper to apply an approximation method to the non-iterative 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 nth roots, where n is a positive integer.},
keywords={},
doi={10.1587/transfun.E100.A.1951},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Low-Latency Low-Cost Architecture for Square and Cube Roots
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1951
EP - 1955
AU - Jihyuck JO
AU - In-Cheol PARK
PY - 2017
DO - 10.1587/transfun.E100.A.1951
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E100-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2017
AB - This paper presents a low-latency, low-cost architecture for computing square and cube roots in the fixed-point format. The proposed architecture is designed based on a non-iterative root calculation scheme to achieve fast computations. While previous non-iterative root calculators are restricted to a square-root operation due to the limitation of their mathematical property, the root computation is generalized in this paper to apply an approximation method to the non-iterative 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 nth roots, where n is a positive integer.
ER -
English
