DocumentCode :
1563212
Title :
A systolic multiplier with LSB first algorithm over GF(2m) which is as efficient as the one with MSB first algorithm
Author :
Kwon, Soonhak ; Kim, Chang Hoon ; Hong, Chun Pyo
Author_Institution :
Dept. of Math., Sungkyunkwan Univ., Suwon, South Korea
Volume :
5
fYear :
2003
Abstract :
By using a polynomial basis with LSB (Least Significant Bit) first scheme, we present new bit serial and bit parallel systolic multipliers over GF(2m). Our bit serial systolic multiplier has only one control signal with 10 latches in each basic cell. Also, our bit parallel multiplier has unidirectional data flow with 7 latches in each basic cell. Thus, whether it is bit serial or bit parallel, our multiplier has a better or comparable hardware complexity and critical path delay and has the same unidirectional data flow to the multipliers with MSB (Most Significant Bit) first scheme.
Keywords :
Galois fields; digital arithmetic; multiplying circuits; systolic arrays; GF(2m) finite field arithmetic; LSB first algorithm; bit parallel architecture; bit-serial architecture; control signal; critical path delay; hardware complexity; polynomial basis; systolic multiplier; unidirectional data flow; Arithmetic; Circuit synthesis; Codes; Concurrent computing; Cryptography; Delay; Galois fields; Hardware; Latches; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2003. ISCAS '03. Proceedings of the 2003 International Symposium on
Print_ISBN :
0-7803-7761-3
Type :
conf
DOI :
10.1109/ISCAS.2003.1206392
Filename :
1206392
Link To Document :
بازگشت