|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| E.V. Krishnamurthy, "On Optimal Ierative Schemes for High-Speed Division," IEEE Transactions on Computers, vol. 19, no. 3, pp. 227-231, March, 1970. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1970.222901, author = {E.V. Krishnamurthy}, title = {On Optimal Ierative Schemes for High-Speed Division}, journal ={IEEE Transactions on Computers}, volume = {19}, number = {3}, issn = {0018-9340}, year = {1970}, pages = {227-231}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1970.222901}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On Optimal Ierative Schemes for High-Speed Division IS - 3 SN - 0018-9340 SP227 EP231 EPD - 227-231 A1 - E.V. Krishnamurthy, PY - 1970 KW - Lehman's implementation KW - measure for efficiency KW - multipliers KW - optimal number of multipliers KW - oscillatory and monotonic convergence KW - recursions KW - speed of convergence KW - table-lookup KW - truncation effects and precision KW - Wilkes-Harvard iterative scheme. VL - 19 JA - IEEE Transactions on Computers ER - | |||
This paper describes division schemes which are derived from the classical functional iterative schemes. These schemes are compared with t he schemes currently used in the high- speed digital computers.
Index Terms:
Lehman's implementation, measure for efficiency, multipliers, optimal number of multipliers, oscillatory and monotonic convergence, recursions, speed of convergence, table-lookup, truncation effects and precision, Wilkes-Harvard iterative scheme.
Citation:
E.V. Krishnamurthy, "On Optimal Ierative Schemes for High-Speed Division," IEEE Transactions on Computers, vol. 19, no. 3, pp. 227-231, March 1970, doi:10.1109/T-C.1970.222901
Usage of this product signifies your acceptance of the Terms of Use.

