An efficient prime-length DFT algorithm over finite fields GF(2m)

被引：3

作者：

Gappmair, W ^{[1
]}

机构：

[1] Graz Univ Technol, Dept Commun & Wave Propagat, A-8010 Graz, Austria

来源：

EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS | 2003年 / 14卷 / 02期

关键词：

D O I：

10.1002/ett.909

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

This letter describes a discrete Fourier transform (DFT) for prime transform lengths N greater than or equal to 3, where the sample values are elements of finite (Galois) fields GF(2(m)). A regular and uniform system of additions and multiplications is presented which reduces the multiplicative complexity by at least one-quarter, compared with a brute-force implementation. The benefits of the algorithm are shown with respect to BCH decoding; in particular, the efficient computation of syndromes will be discussed. Copyright (C) 2003 AEI.

引用

下载

页码：171 / 176

页数：6

共 50 条

[31] An Efficient Exponentiation Algorithm in GF(2m) Using Euclidean Inversion
He, Wei
Zhang, Yu
Li, Yin
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2022, E105A (09) : 1381 - 1384
[32] SYSTOLIC ARRAY IMPLEMENTATION OF MULTIPLIERS FOR FINITE-FIELDS GF(2M)
WANG, CL
LIN, JL
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, 1991, 38 (07): : 796 - 800
[33] Instruction set extension for fast elliptic curve cryptography over binary finite fields GF(2m)
Grosschädl, J
Kamendje, GA
IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2003, : 455 - 468
[34] Reconfigurable implementation of bit-parallel multipliers over GF(2m) for two classes of finite fields
Imaña, JL
2004 IEEE INTERNATIONAL CONFERENCE ON FIELD-PROGRAMMABLE TECHNOLOGY, PROCEEDINGS, 2004, : 287 - 290
[35] Low complexity bit serial systolic multipliers over GF(2m) for three classes of finite fields
Kwon, S
INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2002, 2513 : 209 - 216
[36] Partition algorithm for parallel processing of array multiplication in GF(2m) fields
Chiou, CW
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (07) : 805 - 809
[37] SYSTOLIC ARCHITECTURES FOR MULTIPLICATION OVER FINITE-FIELD GF(2M)
DIAB, M
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 508 : 327 - 340
[38] A systolic multiplier with LSB first algorithm over GF(2m) which is as efficient as the one with MSB first algorithm
Kwon, S
Kim, CH
Hong, CP
PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL V: BIO-MEDICAL CIRCUITS & SYSTEMS, VLSI SYSTEMS & APPLICATIONS, NEURAL NETWORKS & SYSTEMS, 2003, : 633 - 636
[39] Elliptic curve cryptography over binary finite field GF(2m)
Department of Physics, Eastern Mediterranean University, via Mersin 10, Gazimagusa, North Cyprus, Turkey
Inf. Technol. J., 2006, 1 (204-229):
[40] Single error correcting finite field multipliers over GF(2m)
Mathew, J.
Costas, A.
Jabir, A. M.
Rahaman, H.
Pradhan, D. K.
21ST INTERNATIONAL CONFERENCE ON VLSI DESIGN: HELD JOINTLY WITH THE 7TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS, PROCEEDINGS, 2008, : 33 - +

← 1 2 3 4 5 →