AT²-Optimal Galois Field Multiplier for VLSI
Lists
Only you see this
Abstract
VLSI designs for Galois field multipliers, which are central in many encoding and decoding procedures for error-detecting and error-correcting codes, are presented. An AT/sup 2/-optimal Galois-field multiplier based on AT/sup 2/-optimal integer multipliers for a synchronous VLSI model is exhibited. Galois field multiplication is done in two steps. First two polynomials (of degree n-1) over Z/sub p/ are multiplied, and then the resulting polynomial is reduced modulo a fixed irreducible polynomial (of degree n). Multiplication of polynomials is done by discrete Fourier transform (DFT). For p=2, the procedure is more involved for Z/sub p/(x) than for Z(x). An extension to the case of variable p is included and some open problems are stated.<
BibTeX
@article{furer1989at,
author = {Martin Fürer and Kurt Mehlhorn},
title = {{AT²-Optimal Galois Field Multiplier for VLSI}},
journal = {IEEE Trans. Computers},
year = {1989},
doi = {10.1109/12.29475},
}Loading related content...