A basis-independent algorithm to design fast parallel multipliers over GF(2m)

被引：1

作者：

Elia, M ^{[1
]}

Leone, M ^{[1
]}

机构：

[1] Politecn Torino, I-10129 Turin, Italy

来源：

ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS | 2004年

关键词：

D O I：

10.1109/ITCC.2004.1286712

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This paper presents a general algorithm to design fast parallel multipliers in any basis over GF(2(m)), avoiding any basis-dependent procedure or "ad hoc" optimization, as usually proposed in literature. Although the total number of gates is not guaranteed to be the absolute minimum, the algorithm is aimed at minimizing the number of XOR gates, reaching the minimum for the AND gate number For the sake of comparison, lower and upper bounds to space and time complexities have been explicitly evaluated. As a significant example, for several m of practical interest, the algorithm has been applied to Gaussian Normal Basis parallel multipliers.

引用

页码：553 / 559

页数：7

共 50 条

[1] On the inherent space complexity of fast parallel multipliers for GF(2m)
Elia, M
Leone, M
IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (03) : 346 - 351
[2] Design of multipliers for GF(2m)
Mao, Z.
Shou, G.
Hu, Y.
Guo, Z.
ELECTRONICS LETTERS, 2010, 46 (06) : 419 - U58
[3] Low complexity sequential normal basis multipliers over GF(2m)
Reyhani-Masoleh, A
Hasan, MA
16TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2003, : 188 - 195
[4] Transition fault testability in bit parallel multipliers over GF(2m)
Rahaman, H.
Mathew, J.
Sikdar, B. K.
Pradhan, D. K.
25TH IEEE VLSI TEST SYMPOSIUM, PROCEEDINGS, 2007, : 422 - +
[5] Transition faults detection in bit parallel multipliers over GF(2m)
Bengal Engineering and Science University, Shibpur Howrah-711103, India
不详
不详
WSEAS Trans. Circuits Syst., 2008, 12 (1049-1059): : 1049 - 1059
[6] Single error correctable bit parallel multipliers over GF(2m)
Mathew, J.
Jabir, A. M.
Rahaman, H.
Pradhan, D. K.
IET COMPUTERS AND DIGITAL TECHNIQUES, 2009, 3 (03): : 281 - 288
[7] Systematic design approach of Mastrovito multipliers over GF(2m)
Zhang, TG
Parhi, KK
2000 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS: DESIGN AND IMPLEMENTATION, 2000, : 507 - 516
[8] C-testable bit parallel multipliers over GF(2m)
Rahaman, H.
Mathew, J.
Pradhan, D. K.
Jabir, A. M.
ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2008, 13 (01)
[9] Efficient digit-serial normal basis multipliers over GF(2M)
Reyhani-Masoleh, A
Hasan, MA
2002 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL V, PROCEEDINGS, 2002, : 781 - 784
[10] Efficient bit-parallel multipliers over finite fields GF(2m)
Lee, Chiou-Yng
Meher, Pramod Kumar
COMPUTERS & ELECTRICAL ENGINEERING, 2010, 36 (05) : 955 - 968

← 1 2 3 4 5 →