Cellular Array for Extraction of Squares and Square Roots of Binary Numbers
- 1 September 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (9) , 1023-1024
- https://doi.org/10.1109/TC.1972.5009084
Abstract
A cellular array is described that is capable of extracting either the square or the square root of a binary number. The mode of operation is controlled by a single-mode input line. The array is iterative in its connection pattern and is therefore suitable for large-scale integrated (LSI) implementation. Approximate time-delay expressions are derived, which show that the delays for square or square-root extraction are comparable to the, delay of published array networks.Keywords
This publication has 5 references indexed in Scilit:
- A Cellular Array for the Nonrestoring Extraction of Square RootsIEEE Transactions on Computers, 1971
- Multiplier–divider cellular arrayElectronics Letters, 1971
- An Iterative Array for Multiplication of Signed Binary NumbersIEEE Transactions on Computers, 1971
- Cellular logical array for nonrestoring square-root extractionElectronics Letters, 1970
- Cellular logical array for extracting square rootsElectronics Letters, 1968