DocumentCode
3549266
Title
Long number bit-serial squarers
Author
Chaniotakis, E. ; Kalivas, P. ; Pekmestzi, K.Z.
Author_Institution
Nat. Tech. Univ. of Athens, Greece
fYear
2005
fDate
27-29 June 2005
Firstpage
29
Lastpage
36
Abstract
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.
Keywords
adders; cryptography; digital arithmetic; shift registers; LSB first form; bit serial squarers; hardware complexity; nonsystolic form; Arithmetic; Bibliographies; Broadcasting; Circuits; Cryptography; Delay; Equations; Hardware; Shift registers; Wiring;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic, 2005. ARITH-17 2005. 17th IEEE Symposium on
ISSN
1063-6889
Print_ISBN
0-7695-2366-8
Type
conf
DOI
10.1109/ARITH.2005.28
Filename
1467619
Link To Document