A redundant binary Euclidean GCD algorithm
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- RBCD: redundant binary coded decimal adderIEE Proceedings E Computers and Digital Techniques, 1989
- Design of high speed MOS multiplier and divider using redundant binary representationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- A systolic algorithm for integer GCD computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A higher-radix division with simple selection of quotient digitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- Finite Precision Rational Arithmetic: An Arithmetic UnitIEEE Transactions on Computers, 1983
- The Design of Special-Purpose VLSI ChipsComputer, 1980
- A Class of Binary Divisions Yielding Minimally Represented QuotientsIRE Transactions on Electronic Computers, 1962
- Statistical Analysis of Certain Binary Division AlgorithmsProceedings of the IRE, 1961
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961
- A New Class of Digital Division MethodsIRE Transactions on Electronic Computers, 1958