On the inherent space complexity of fast parallel multipliers for GF(2m)

被引：12
|
作者：
Elia, M
Leone, M
机构：
[1] Politecn Torino, Dipartimento Elettron, I-10129 Turin, Italy
[2] TILAB Telecom Italia Lab, I-10148 Turin, Italy
来源：
IEEE TRANSACTIONS ON COMPUTERS | 2002年 / 51卷 / 03期
关键词：
finite fields; parallel multiplier; optimal normal basis;
D O I：
10.1109/12.990131
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
A lower bound to the number of AND gates used in parallel multipliers for GF((2M)) under the condition that time complexity be minimum, is determined, In particular, the exact minimum number of AND gates for Primitive Normal Bases and Optimal Normal Bases of Type 11 multipliers is evaluated, This result indirectly suggests that space complexity is essentially a quadratic function of m when time complexity is kept minimum.
引用
收藏
页码：346 / 351
页数：6
相关论文
共 50 条
  • [1] Low complexity architecture of bit parallel multipliers for GF(2m)
    Shou, G.
    Mao, Z.
    Hu, Y.
    Guo, Z.
    Qian, Z.
    ELECTRONICS LETTERS, 2010, 46 (19) : 1326 - 1327
  • [2] Parallel programmable finite field GF(2m) multipliers
    Iliev, N
    Stine, JE
    Jachimiec, N
    VLSI 2004: IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI, PROCEEDINGS, 2004, : 299 - 302
  • [3] Low-complexity bit-parallel systolic multipliers over GF(2m)
    Chiou-Yng Lee
    Chin-Chin Chen
    Yuan-Ho Chen
    Erl-Huei Lu
    2006 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS, VOLS 1-6, PROCEEDINGS, 2006, : 1160 - 1165
  • [4] STRUCTURE OF PARALLEL MULTIPLIERS FOR A CLASS OF FIELDS GF(2M)
    ITOH, T
    TSUJII, S
    INFORMATION AND COMPUTATION, 1989, 83 (01) : 21 - 40
  • [5] Low-complexity bit-parallel systolic multipliers over GF(2m)
    Lee, Chiou-Yng
    INTEGRATION-THE VLSI JOURNAL, 2008, 41 (01) : 106 - 112
  • [6] A basis-independent algorithm to design fast parallel multipliers over GF(2m)
    Elia, M
    Leone, M
    ITCC 2004: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: CODING AND COMPUTING, VOL 2, PROCEEDINGS, 2004, : 553 - 559
  • [7] Design of multipliers for GF(2m)
    Mao, Z.
    Shou, G.
    Hu, Y.
    Guo, Z.
    ELECTRONICS LETTERS, 2010, 46 (06) : 419 - U58
  • [8] Easily testable implementation for bit parallel multipliers in GF (2m)
    Rahaman, H.
    Mathew, J.
    Jabir, A. M.
    Pradhan, D. K.
    HLDVT'06: ELEVENTH ANNUAL IEEE INTERNATIONAL HIGH-LEVEL DESIGN VALIDATION AND TEST WORKSHOP, PROCEEDINGS, 2006, : 48 - +
  • [9] Reconfigurable implementation of GF(2m) bit-parallel multipliers
    Imana, Jose L.
    PROCEEDINGS OF THE 2018 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2018, : 893 - 896
  • [10] Low complexity sequential normal basis multipliers over GF(2m)
    Reyhani-Masoleh, A
    Hasan, MA
    16TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2003, : 188 - 195
12345