Low-complexity bit-parallel systolic multipliers over GF(2m)
Integration, the VLSI Journal
Multiplexer-based bit-parallel systolic multipliers over GF(2m)
Computers and Electrical Engineering
Area and time efficient AB2 multipliers based on cellular automata
Computer Standards & Interfaces
Fragile watermarking using finite field trigonometrical transforms
Image Communication
Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm
Computers and Electrical Engineering
Systolic Galois field exponentiation in a multiple-valued logic technique
Integration, the VLSI Journal
The fractional Fourier transform over finite fields
Signal Processing
| Hi-index | 754.84 |
A transform is defined in the Galois field ofq^2elementsGF(q^2), a finite field analogous to the field of complex numbers, whenqis a prime such that (--1) is not a quadratic residue. It is shown that the action of this transform overGF(q^2)is equivalent to the discrete Fourier transform of a sequence of complex integers of finite dynamic range. Ifqis a Mersenne prime, one can utilize the fast Fourier transform (FFT) algorithm to yield a fast convolution without the usual roundoff problem of complex numbers.