Systolic multiplier for finite fields gf(2/sup m/)
Conference
·
OSTI ID:5170219
A systolic architecture is developed for performing the product-sum computation, ab+c, in the finite field gf(2/sup m/) of 2/sup m/ elements, where a, b and c are arbitrary elements of gf(2/sup m/). The multiplier is a serial-in, serial-out, one-dimensional systolic array. This multiplier for gf(2/sup m/) requires m basic cells. The average time per computation of the multiplier is m time units if a number of computations are computed consecutively. To perform an isolated computation the multiplier requires 3m time units. The architecture is simple and regular and possesses the desirable properties of concurrency and modularity and is well suited for use. 10 references.
- OSTI ID:
- 5170219
- Country of Publication:
- United States
- Language:
- English
Similar Records
A new bit-serial systolic multiplier over GF(2/sup m/)
A fast 1-D serial-parallel systolic multiplier
Systolic architectures based on barrel shifters for real-time digital signal processing
Journal Article
·
Wed Jun 01 00:00:00 EDT 1988
· IEEE Trans. Comput.; (United States)
·
OSTI ID:7245087
A fast 1-D serial-parallel systolic multiplier
Journal Article
·
Thu Oct 01 00:00:00 EDT 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5756724
Systolic architectures based on barrel shifters for real-time digital signal processing
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5569009