IEEE Transactions on Computers · 2000 · 61 citations · 17 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureFault-tolerant ComputingMicroelectronicsField-programmable Gate Array ArchitecturePower OptimizationArithmetic Of Finite FieldsFast Arithmetic CircuitsFault-tolerant DesignFinite-precision Arithmetic CircuitsSystolic Array DesignSystolic ArraysThroughputVlsi Implementation
In this paper, we present a new parallel-in parallel-out systolic array with unidirectional data flow for performing the power-sum operation C+AB/sup 2/ in finite fields GF(2/sup m/). The architecture employs the standard basis representation and can provide the maximum throughput in the sense of producing new results at a rate of one per clock cycle. It is highly regular, modular, and, thus, well-suited to VLSI implementation. As compared to a previous systolic power-sum circuit with bidirectional data flow and the same throughput performance, the proposed one has smaller latency, consumes less chip area, and can more easily incorporate fault-tolerant design. Based on the new power-sum circuit, we also propose a parallel-in parallel-out systolic array with the maximum throughput for computing inverses/divisions in GF(2/sup m/). The proposed systolic divider gains advantages over an existing system with the same throughput performance in terms of chip area, latency, and fault tolerance.
17
R. G. Gallager, W. W. Peterson · Mathematics of Computation · 1962 · 2.1K citations
J. J. Stiffler · 1971 · 1.4K citations
VLSI Architectures for Computing Multiplications and Inverses in GF(2<sup>m</sup>)
Wang, Troung, Shao et al. · IEEE Transactions on Computers · 1985 · 320 citations
Systolic Multipliers for Finite Fields GF(2<sup>m</sup>)
Yeh, R Reed, Truong · IEEE Transactions on Computers · 1984 · 191 citations