loading...
Long Number Bit-Serial Squarers
Cape Cod, Massachusetts, USA June 27-June 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.2005.2817th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
E. Chaniotakis, National Technical University of Athens
P. Kalivas, National Technical University of Athens
K. Z. Pekmestzi, National Technical University of Athens
New bit serial squarers for long numbers in LSB first form, are presented in this paper. The first presented scheme is a 50% operational efficient squarer than has the half number of cells compared to the traditional squarers. The second scheme is a 100% operational efficient squarer. In this scheme, the number of the cells remain unchanged compared to other proposed schemes but the number of the required registers is reduced significantly. Both schemes are presented in non-systolic and systolic form and are compared against other squarers presented in the bibliography from the aspect of hardware complexity.
Citation:
E. Chaniotakis, P. Kalivas, K. Z. Pekmestzi, "Long Number Bit-Serial Squarers," arith, pp.29-36, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.