Title :
A combined 16-bit binary and dual Galois field multiplier
Author :
Garcia, Jesus ; Schulte, Michael J.
Author_Institution :
Dept. of Comput. Sci. & Eng., Lehigh Univ., Bethlehem, PA, USA
Abstract :
Galois field arithmetic is commonly used in Reed-Solomon encoding and decoding. This paper presents the design of a combined 16-bit binary and dual Galois field (GF) multiplier. This multiplier is capable of performing either a 16-bit two´s complement or unsigned multiplication, or two independent 8-bit GF(28) multiplications in SIMD fashion. The combined multiplier is designed by modifying a conventional binary tree multiplier. It uses a novel wiring methodology to provide two simultaneous GF(28) multiplies with a minor impact on area and delay. Two alternatives for the multiplier design are presented. Area and delay estimates indicate that compared to a conventional binary tree multiplier, the combined multiplier has roughly 6% more delay and 23% more area.
Keywords :
Galois fields; Reed-Solomon codes; delay estimation; digital arithmetic; multiplying circuits; parallel architectures; 16 bit; Reed-Solomon encoding; SIMD; area; binary tree multiplier; delay; delay estimates; dual Galois field multiplier; two´s complement; unsigned multiplication; wiring methodology; Binary trees; Computer science; Delay estimation; Digital arithmetic; Digital signal processing; Encoding; Galois fields; Hardware; Polynomials; Reed-Solomon codes;
Conference_Titel :
Signal Processing Systems, 2002. (SIPS '02). IEEE Workshop on
Print_ISBN :
0-7803-7587-4
DOI :
10.1109/SIPS.2002.1049686