Citation: | HE Tingting, CHEN Jiyang, LEI Yuanwu, et al., “High-Performance FP Divider with Sharing Multipliers Based on Goldschmidt Algorithm,” Chinese Journal of Electronics, vol. 26, no. 2, pp. 292-298, 2017, doi: 10.1049/cje.2016.10.004 |
S.F. Oberman and M.J. Flynn, "Division algorithms and implementations", IEEE Transactions on Computers, Vol.46, No.8, pp.833-854, 1997.
|
P. Kornerup, "Digit selection for SRT division and square root", IEEE Transactions on Computers, Vol.54, No.3, pp.727-739, 2005.
|
D. Wang and M.D. Ercegovac, "A radix-16 combined complex division/square root unit with operand prescaling", IEEE Transactions on Computers, Vol.61, No.9, pp.1243-1255, 2012.
|
R.E. Goldschmidt, "Applications of division by convergence", M.S. Thesis, Massachusetts Institute of Technology, 1964.
|
P.W. Markstein, "Computation of elementary function on the IBM RISC system/6000 processor", IBM J. Research and Development, Vol.34, No.1, pp.111-119, 1990.
|
S.F. Anderson, J.G. Earle, R.E. Goldschmidt, et al., "The IBM system/360 model 91:Floating-point execution unit", IBM J. Research and Development, Vol.11, No.1, pp.34-53, 1967.
|
S.F. Oberman, "Floating-point division and square root algorithms and implementation in the AMD-K7 microprocessor", Proc. of 14th IEEE Symposium on Computer Arithmetic, Adelaide, SA, pp.106-115, 1999.
|
M.D. Ercegovac, Laurent Imbert and Jean-Michel Muller, "Improving Goldschmidt division, square root", and square root reciprocal, IEEE Transactions on Computers, Vol.49, No.7, pp.759-763, 2000.
|
I. Kong and E.E. Swartzlander, "A Goldschmidt division method with faster than quadratic convergence", IEEE Transactions on Very Large Scale Integration Systems, Vol.19, No.4, pp.759-763, 2011.
|
E.V. Krishnamurthy, "On optimal iterative schemes for high speed division",IEEE Transactions on Computers, Vol.19, No.3, pp.227-231, 1970.
|
Guy Evena, P.M. Seidelb and W.E. Fergusonc, "A parametric error analysis of Goldschmidt's division algorithm", Journal of Computer and System Sciences, Vol.70, No.1, pp.118-139, 2005.
|
Daniel Piso and J.D. Bruguera, "ariable latency Goldschmidt algorithm based on a new rounding method and a remainder estimate", IEEE Transactions on Computers, Vol.60, No.11, pp.1535-1546, 2011.
|
W. Yan, X.J. Qu, H. Chen, et al., "Improved Goldschmidt division method using mapping of divisors", Science China, Vol.56, No.6, pp.1535-1546, 2013.
|
David Stevenson, "An American national standard IEEE standard for binary floating-point arithmetic", ACM SIGPLAN Notices, Vol.22, No.2, pp.53-57, 1987.
|
D.D. Sarma and D. Matula, "Measuring the accuracy of ROM reciprocal tables", IEEE Transactions on Computers, Vol.43, No.8, pp.932-940, 1994.
|
D.D. Sarma and D. Matula, "Faithful bipartite Rom reciprocal tables", Proc. of 12th IEEE Symposium on Computer Arithmetic, Bath, England, pp.17-28, 1995.
|
D.D. Sarma and D. Matula, "Faithful interpolation in reciprocal tables", Proc. of 13th IEEE Symposium on Computer Arithmetic, California, USA, pp.82-91, 1997.
|
E. Schwarz and M.J. Flyn, "Hardware starting approximation for the square root operation", Proc. of 11th IEEE Symposium on Computer Arithmetic, Windsor, Canada, pp.103-111, 1993.
|
S.F. Oberman and M.J. Flynn, "Design issues in division and other floating-point operations", IEEE Transaction on Computers, Vol.46, No.2, pp.154-161, 1997.
|
S.M. Chen, Y.H. Wang and J.H. Wan, "FT-Matrix:A coordination-aware-architecture for signal processing", IEEE MICRO., Vol.34, No.6, pp.64-73, 2014.
|
L. Wei and Alberto Nannarelli, "Power efficient division and square root unit", IEEE Transaction on Computers, Vol.61, No.8, pp.1059-1070, 2012.
|
Taek-Jun Kwon and Jeffrey Draper, "Floating-point division and square root using a Taylor-series expansion algorithm", IEEE Transaction on Computers, Vol.46, No.2, pp.1601-1605, 2009.
|