Evaluation of the square root function on microprocessors
暂无分享,去创建一个
[1] B. Liu,et al. Effect of finite word length on the accuracy of digital filters--a review , 1971 .
[2] P. W. Baker. More Efficient Radix-2 Algorithms for Some Elementary Functions , 1975, IEEE Transactions on Computers.
[3] David L. Phillips,et al. The logarithmic error and Newton's method for the square root , 1969, CACM.
[4] W. R. Bennett,et al. Spectra of quantized signals , 1948, Bell Syst. Tech. J..
[5] A. Oppenheim,et al. Effects of finite register length in digital filtering and the fast Fourier transform , 1972 .
[6] C. T. Fike,et al. Optimal Starting Approximations for Newton's Method , 1969 .
[7] Franklin F. Kuo,et al. System analysis by digital computer , 1966 .
[8] J. Brule,et al. Fast convolution with finite field fast transforms , 1975 .
[9] Shalhav Zohar,et al. New Hardware Realizations of Nonrecursive Digital Filters , 1972, IEEE Transactions on Computers.
[10] J. Eve. Starting Approximations for the Iterative Calculation of Square Roots , 1963, Comput. J..
[11] David G. Moursund. Optimal starting values for Newton-Raphson calculation of x 1 2 , 1967 .
[12] William J. Cody. Double-precision square root for the CDC-3600 , 1964, CACM.
[13] C. T. Fike. Starting approximations for square root calculation on IBM system /360 , 1966, CACM.
[14] Ichizo Ninomiya,et al. Best rational starting approximations and improved Newton iteration for the square root , 1970 .