Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Pipeline array for square-root extraction

Pipeline array for square-root extraction

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Pipelining an arithmetic process is a well known technique for improving the computation speed of the arithmetic algorithm. In the letter is proposed a pipeline version of the array for the extraction of square roots of binary numbers. It is shown that a significant speed improvement (on a throughout basis) can result by this modification of the conventional logic arrays.

References

    1. 1)
      • J.C. Majithia . Cellular array for extraction of squares and square roots of binary numbers. IEEE Trans. , 1023 - 1024
    2. 2)
      • S.F. Anderson , J.G. Earle , R.E. Goldschmidt , D.M. Powers . Floating point execution unit. IBM J. Res. & Developm. , 34 - 53
    3. 3)
      • H.H. Guild . Fast versatile binary comparator array. Electron. Lett. , 255 - 256
    4. 4)
      • K.J. Dean , J. Deverell . Generalised iterative array. Electron. Lett. , 100 - 101
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19730003
Loading

Related content

content/journals/10.1049/el_19730003
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address